• Journal of KIISE
• /
• v.42 no.6
• /
• pp.791-800
• /
• 2015

In this paper, we propose the contribution-level-based opportunistic flooding in a wireless multihop network which achieves outstanding transmission efficiency and reliability. While the potential of the the predetermined relay node to fail in its receipt of broadcast packets is due to the inherent instability in wireless networks, our proposed flooding actually increases network reliability by applying the concept of opportunistic routing, whereby relay-node selection is dependent on the transmission result. Additionally, depending on the contribution level for the entire network, the proposed technique enhances transmission efficiency through priority adjustment and the removal of needless relay nodes. We use the NS-3 simulator to compare the proposed scheme with dominant pruning. The analysis results show the improved performance in both cases: by 35% compared with blind flooding from the perspective of the transmission efficiency, and by 20~70% compared to dominant pruning from the perspective of the reliability.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.2
• /
• pp.39-47
• /
• 2010

In Wireless Sensor Network, transmission errors are frequently occurred due to the node failure, battery discharge, and interference by objects. Although Directed Diffusion has been considered as a prominent Data-centric routing algorithm, it revealed some weaknesses at this kind of unexpected network errors. In order to address the problem, we proposed a radio-aware routing algorithm for improving reliability of Directed Diffusion in Wireless Sensor Networks. The proposed algorithm is aware of the network status based on the radio information of MAC and PHY layers using a cross-layer approach. The link quality and the node failure information from the acquired network status were used to decide an alternative path to provide a reliable data transmission in error-prone sensor networks. The proposed algorithm showed its effectiveness of the data delivery rate and data ratio with several simulations consisting of various error rates and the number of nodes.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.5
• /
• pp.83-91
• /
• 2008

IISO/IEC 9594-8 defines the public key framework and attribute certificate framework. Attribute certificate framework deals with privilege management infrastructure(PMI). In PMI, for privilege management using attribute certificates, role assignment certificates and role specification certificates are used to assign and specify privileges independently. Role specification certificates includes privilege specifications and the details far privilege management of network environments. Privilege management of unreliable network environment tries to enhance the reliability and efficiency of privilege information transmission forwarding over unreliable routes in the presence of potentially faulty nodes and edges. Each node forms a role specification tree based on role specification relationship data collected from the network. In this paper privilege management cost with the role specification certificates tree structure is evaluated trying to reduce the overhead incurred by role creation and modification of privileges. The multicasting of packets are used for scalability. We establish management cost model taking into account the packet loss and node reliability which continuously join and leave for network. We present quantitative results which demonstrate the effectiveness of the proposed privilege management scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.240-249
• /
• 2004

For the effective IP-based service implementation in the wireless network environment, involvement of IP-related technologies in wireless networks is inevitable and globally unique IPv6 address allocation to the mobile node has become an important issue. In the 3GPP's address allocation mechanism, IPv6 address allocation procedure is performed by the GGSN, which is normally located far from the mobile nodes. This causes IPv6 address allocation time delay and traffics to be longer and increased in the core network, respectively. In this paper, we propose a new IPv6 address allocation mechanism that is performed by Node B located in RAN. The proposed IPv6 address allocation mechanism can provide IPv6 addresses to mobile nodes within a more reduced time than existing 3GPP's IPv6 address allocation mechanism, and co-operates with existing mechanism as an overlay model to improve reliability of wireless networks. And, for implementation of the proposed address allocation mechanism, it needs not to change the structure of current wireless networks except for the some functional addendum of Node B.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.518-521
• /
• 2007

The functional wireless sensor node for u-healthcare application was developed. The developed sensor node can check the abnormality of ECG in some simple software in ROM of microprocess in the sensor node. The ECG signal is one of very important health signal form human body, and wavelike signal which is sampled as a sampling frequency between 100 and 400 Hz for digitalization, so the wireless data dor ECG signal is some heavy in Zigbee communication. Thus the sensor send the ECG signal to other sensor nodes or base station when it find abnormality in ECG signal is key technology to reduce the traffic between sensor nodes in wireless sensor network for u-healthcare, The sensor node does not need to transmit ECG data all time in wireless sensor network and to server. Using these sensor nodes, the healthcare system can dramatically reduce wireless data packet overload, the power consumption of battery in the sensor nodes and thus increase the reliability of the wireless system.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.11
• /
• pp.3176-3182
• /
• 2009

The PBNM on MANET is being researched to ensure the reliability and efficiency between mobile nodes. Therefore, it is essential to determine the cluster effectively which will perceive the movements of nodes and distribute the policies. In PBNM mechanism, to determine the node cluster for PDP and manage PEP nodes, Active PDP Discovery Protocol is proposed as a mechanism which is more efficient than preexistent techniques. While k-hop cluster selects the PEP nodes which PDP node manages, Active PDP Discovery actively selects the PDP node among the moving PEP node. This method prevents orphan nodes that are not connected to PDP and reduces continual broadcasting messages. This paper implements Active PDP Discovery which determines cluster in the real networks and analyzes its capability, expanding COPS-PR to detect the movement of nodes and adding MNL to PDP node.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.6
• /
• pp.65-72
• /
• 2010

In ad-hoc network, the technique to efficiently consume the limited amounts of energy is an important issue since the wireless terminal node is operated on batteries as their energy resource. In order to extend the system lifetime, through a balanced energy consumption, we must delay the situation in which a particular terminal node's energy is depleted and results in system disconnection. Also, the link, which has low reliability due to the mobility of the node, should be avoided considering the key element when setting up the route. The proposed CMLR method in this paper enables to increase the efficiency of energy consumption with a new cost function considering the residue energy of node, error rate of link, and transmission energy consumption. This method is extending the network lifetime and increasing the energy efficiency by compromising the value between the minimization of the transmission energy consumption and maximization of the node's lifetime. Through the simulations the proposed CMLR algorithm was verified by showing better performance over the conventional methods in terms of network lifetime and path efficiency.

• The KIPS Transactions:PartA
• /
• v.13A no.4 s.101
• /
• pp.351-362
• /
• 2006

This paper proposes an adaptive inter-agent communication protocol to considerably reduce the amount of agent location information maintained by each service node and the message delivery time while avoiding the dependency of the home node of a mobile agent. To satisfy this goal, the protocol enables each mobile agent to autonomously leave its location information only on some few of its visiting nodes. Also, it may significantly reduce the agent cache updating frequency of each service node by keeping the identifier of the location manager of each agent in the smart agent location cache of the node. Simulation results show that the proposed protocol reduces about $76%{\sim}80%$ of message delivery overhead and about $76%{\sim}79%$ of the amount of agent location information each service node should maintain compared with the traditional one.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.8
• /
• pp.1004-1010
• /
• 2019

In the EH-WSN (Energy harvesting wireless sensor network), a MAC (medium access control) protocol is required to select a relay node considering the power status of a node. Existing EH-WSN studies emphasize the power aspect, so it does not consider the QoS like the urgency of the sensed data. The required power and transmission delay must be changed according to the urgency so that the medium access control according to the data QoS can be performed. In case of relay node, relaying data without consideration of data urgency and node power may cause delay due to power shortage in case of urgent data. In this paper, we designed a MAC protocol that minimizes the power shortage that can occur during emergency data generation. For this, relay node requirements are set differently according to the urgency of data. The performance was analyzed through simulation. Simulation results show the reduced latency and improved reliability of urgent data transmission.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.1
• /
• pp.83-90
• /
• 2010

DTNs (Delay Tolerant Networks) refer to the networks that can support data transmission in the extreme networking situations such as continuous delay and no connectivity between ends. DTMNs (Delay Tolerant Networks) are a specific range of DTNs, and its chief considerations in the process of message delivery in the routing protocol are the transmission delay, improvement of reliability, and reduction of network loading. This article proposes a new LCN (Largest Common Neighbor) routing algorism to improve Spray and Wait routing protocol that prevents the generation of unnecessary packets in a network by letting mobile nodes limit the number of copies of their messages to all nodes to L. Since higher L is distributed to nodes with directivity to the destination node and the maximum number of common neighbor nodes among the mobile nodes based on the directivity information of each node and the maximum number of common neighbor nodes, more efficient node transmission can be realized. In order to verify this proposed algorism, DTN simulator was designed by using ONE simulator. According to the result of this simulation, the suggested algorism can reduce average delay and unnecessary message generation.