• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.6
• /
• pp.558-564
• /
• 2013

Wireless sensor networks (WSNs) contain limited energy resources and are left in open environments. Since these sensor nodes are self-operated, attacks such as sinkhole attacks are possible as they can be compromised by an adversary. The sinkhole attack may cause to change initially constructed routing paths, and capture of significant information at the compromised node. A localized encryption and authentication protocol (LEAP) has been proposed to authenticate packets and node states by using four types of keys against the sinkhole attack. Even though this novel approach can securely transmits the packets to a base station, the packets are forwarded along the constructed paths without checking the next hop node states. In this paper, we propose the next hop node selection method to cater this problem. Our proposed method evaluates the next hop node considering three factors (i.e., remaining energy level, number of shared keys, and number of filtered false packets). When the suitability criterion for next hop node selection is satisfied against a fix threshold value, the packet is forwarded to the next hop node. We aim to enhance energy efficiency and a detour of attacked areas to be effectively selected Experimental results demonstrate validity of the proposed method with up to 6% energy saving against the sinkhole attack as compared to the LEAP.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.5
• /
• pp.66-71
• /
• 2012

The capacity criteria have been proposed in order to select a cooperative relay node in WSNs, under the environment where direct path has a poor link gain. This process may ensure the efficiency improvement of signal transfer between source and destination and reduction of energy consumption as well. Two criteria are incorporated to select a cooperative relay node. Firstly, calculate the energy gain ratio between the relay path and the direct path. These are defined as the ratio between the energy factors of 1/g and 1/B. Each stands for an inverse of direct path gain and relay path gain. Secondly, investigate the effects of relay node's usage in WSNs through the simulation in terms of energy consumption. In conclusion, using a selected cooperative relay node based on the selected criteria is effective in terms of both energy efficiency and capacity of WSNs especially when direct path gain is relatively low.

• The KIPS Transactions:PartC
• /
• v.17C no.5
• /
• pp.433-440
• /
• 2010

Energy efficiency, low latency and scalability for wireless sensor networks are important requirements, especially, the wireless sensor network consist of a large number of sensor nodes should be minimized energy consumption of each node to extend network lifetime with limited battery power. An efficient algorithm and energy management technology for minimizing the energy consumption at each sensor node is also required to improve transfer rate. Thus, this paper propose no-overlap multi-pass protocol provides for sensor data transmission in the wireless sensor network environment. The proposed scheme should minimize network overhead through reduced a sensor data translation use to searched multi-path and added the multi-path in routing table. Proposed routing protocol may minimize the energy consumption at each node, thus prolong the lifetime of the sensor network regardless of where the sink node is located outside or inside the received signal strength range. To verify propriety proposed scheme constructs sensor networks adapt to current model using the real data and evaluate consumption of total energy.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.23-29
• /
• 2011

In some applications of wireless sensor networks, requirements such as energy efficiency, real-time, and reliable delivery need to be considered. In this paper, we propose a novel routing algorithm for wireless sensor networks. It provides real-time, reliable delivery of a packet, while considering energy awareness. In the proposed algorithm, a node estimates the energy cost, delay and reliability of a path to the sink node, based only on information from neighboring nodes. Then, it calculates the probability of selecting a path, using the estimates. When packet forwarding is required, it randomly selects the next node. A path with lower energy cost is likely to be selected, because the probability is inversely proportional to the energy cost to the sink node. To achieve real-time delivery, only paths that may deliver a packet in time are selected. To achieve reliability, it may send a redundant packet via an alternate path, but only if it is a source of a packet. Experimental results show that the proposed algorithm is suitable for providing energy efficient, real-time, reliable communications.

• Journal of Internet Computing and Services
• /
• v.9 no.5
• /
• pp.165-173
• /
• 2008

Hybrid ad hoc networks are integrated networks referred to Home Networks, Telematics and Sensor networks can offer various services. Specially, in ad hoc network where each node is responsible for forwarding neighbor nodes' data packets, it should net only reduce the overall energy consumption but also balance individual battery power. Unbalanced energy usage will result in earlier node failure in overloaded nodes. it leads to network partitioning and reduces network lifetime. Therefore, this paper studied the routing protocol considering efficiency of energy. The suggested algorithm can predict the status of energy in each node using the energy prediction model. This can reduce the overload of establishing route path and balance individual battery power. The suggested algorithm can reduce power consumption as well as increase network lifetime.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.401-405
• /
• 2007

In sensor network, cluster based routing protocol about efficient energy usage method has researched variously. But existing cluster based routing protocol have problems. one of the problem is sensor nodes's imbalance energy consumption problem at cluster reconstruction. anther is non- connection problem between header node and spc node when they are far from each other, not properly connected. We propose cluster re-division and header node of multihop transmission method in this paper. The cluster re-division method is the method that re-divides existing routing protocol with the small-scale cluster and multihop transmission method is the method regarding the relay transmission between the header nodes. Through the simulation, the proposed routing mechanism shows more excellent than exiting routing protocol in balance energy consumption and energy efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.529-546
• /
• 2010

Greedy forwarding is the key mechanism of geographic routing and is one of the protocols used most commonly in wireless sensor networks. Greedy forwarding uses 1-hop local information to forward packets to the destination and does not have to maintain the routing table, and thus it takes small overhead and has excellent scalability. However, the signal intensity reduces exponentially with the distance in realistic wireless sensor network, and greedy forwarding consumes a lot of energy, since it forwards the packets to the neighbor node closest to the destination. Previous proposed greedy forwarding protocols are the sender-based greedy forwarding that a sender selects a neighbor node to forward packets as the forwarding node and hence they cannot guarantee energy efficient forwarding in unpredictable wireless environment. In this paper, we propose the receiver-based greedy forwarding called RGF where one of the neighbor nodes that received the packet forwards it by itself. In RGF, sender selects several energy efficient nodes as candidate forwarding nodes and decides forwarding priority of them in order to prevent unnecessary transmissions. The simulation results show that RGF improves delivery rate up to maximum 66.8% and energy efficiency, 60.9% compared with existing sender-based greedy forwarding.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2257-2264
• /
• 2011

Sensor nodes in Wireless sensor network have limited resources and consume almost all energy to the communication. For its traffic feature as a burst traffic type toward a sink node, it has high probability to network congestion. Network congestion causes packet drops and retransmission of dropped packets draws energy consumption. In particular, the loss of packet that is from the sensor node far away from a sink node requires additional energy consumption by frequent retransmission. This paper presents a traffic control mechanism that determines packet transfer by considering priority of packet and congestion level as well as hop count. Analysis of proposed mechanism by simulation demonstrated that it improved energy efficiency.

• ETRI Journal
• /
• v.34 no.6
• /
• pp.922-931
• /
• 2012

With the increasing demands for mobile wireless sensor networks in recent years, designing an energy-efficient clustering and routing protocol has become very important. This paper provides an analytical model to evaluate the power consumption of a mobile sensor node. Based on this, a clustering algorithm is designed to optimize the energy efficiency during cluster head formation. A genetic algorithm technique is employed to find the near-optimal threshold for residual energy below which a node has to give up its role of being the cluster head. This clustering algorithm along with a hybrid routing concept is applied as the near-optimal energy-efficient routing technique to increase the overall efficiency of the network. Compared to the mobile low energy adaptive clustering hierarchy protocol, the simulation studies reveal that the energy-efficient routing technique produces a longer network lifetime and achieves better energy efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1475-1482
• /
• 2009

In ZigBee network, using energy efficiently is necessary because ZigBee node works by battery. To use energy efficiently, it is one of the way to reduce unnecessary network traffic. In this paper, it presents efficient shortcut routing algorithm using depth of destination node in ZigBee network. In traditional tree routing, each node transfers data only to its own parent or child node, which is inefficient way. Efficient shortcut routing algorithm is also based on tree routing. However, we suggests the algorithm with using neighbor table and depth of destination that is able to transfer data to other neighbor node, not only to parent or child node. It minimizes coordinator bottleneck state and unnecessary intermediate routing path which happens in traditional tree routing.