• The KIPS Transactions:PartC
• /
• v.13C no.1 s.104
• /
• pp.103-112
• /
• 2006

Since sensor node has a limited energy supply in a wireless sensor network, it is very important to maximize the network lifetime through energy-efficient routing. Thus, many routing protocols have been developed for wireless sensor networks and can be classified into flat and hierarchical routing protocols. Recent researches focus on hierarchical routing scheme and LEACH is a representative hierarchical routing protocol. In this paper, we investigated the problems of the LEACH and proposed a novel energy efficient routing scheme, called ENTER(ENergy efficient Two-tiEr Routing protocol), to resolve the problem. ENTER reduces an energy consumption and increases a network lifetime by organizing clusters by the same distributed algerian as in the LEACH and establishing paths among cluster-heads to transmit the aggregated data to the sink node. We compared the performance of the ENTER with the LEACH through simulation and showed that the ENTER could enhance the network lifetime by utilizing the resources more efficiently.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.777-780
• /
• 2014

The sensor network technology for core technology of ubiquitous computing is in the spotlight recently, the research on sensor network is proceeding actively which is composed many different sensor node. The major traffic patterns of plenty of sensor networks are composed of collecting types of single directional data, which is transmitting packets from several sensor nodes to sink node. One of the important condition for design of sensor node is to extend for network life which is to minimize power-consumption under the limited resources of sensor network. In this work, we analysis adapted routing protocols using the network simulation that was used exiting network and network provider needs will be able to solve the problem.

• International Journal of Computer Science & Network Security
• /
• v.23 no.10
• /
• pp.169-178
• /
• 2023

Wireless sensor network is wieldy use for IoT application. The sensor node consider as physical device in IoT architecture. This all sensor node are operated with battery so the power consumption is very high during the data communication and low during the sensing the environment. Without proper planning of data communication the network might be dead very early so primary objective of the cluster based routing protocol is to enhance the battery life and run the application for longer time. In this paper we have comprehensive of twenty research paper related with clustering based routing protocol. We have taken basic information, network simulation parameters and performance parameters for the comparison. In particular, we have taken clustering manner, node deployment, scalability, data aggregation, power consumption and implementation cost many more points for the comparison of all 20 protocol. Along with basic information we also consider the network simulation parameters like number of nodes, simulation time, simulator name, initial energy and communication range as well energy consumption, throughput, network lifetime, packet delivery ration, jitter and fault tolerance parameters about the performance parameters. Finally we have summarize the technical aspect and few common parameter must be fulfill or consider for the design energy efficient cluster based routing protocol.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.433-435
• /
• 2007

Geographic wireless sensor networks use position information for Greedy routing. Greedy routing works well in dense network where as in sparse network it may fail and require the use of recovery algorithms. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costlier for resource constrained position based wireless sensor type networks. In the present work, we propose a Void Avoidance Algorithm (VAA); a novel idea based on virtual distance upgrading that allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forward packet using greedy routing only without recovery algorithm. In VAA, the stuck node upgrades distance unless it finds next hop node which is closer to the destination than itself. VAA guarantees the packet delivery if there is a topologically valid path exists. NS-2 is used to evaluate the performance and correctness of VAA and compared the performance with GPSR. Simulation results show that our proposed algorithm achieves higher delivery ratio, lower energy consumption and efficient path.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1A
• /
• pp.23-29
• /
• 2006

In wireless sensor networks(WSNs), it is crucial to maintain network connectivity as long as possible since nodes are battery-powered and unchange-able. We propose a new routing protocol called Energy Aware Source Routing(EASR) which can be efficient in respect of network lifetime and long-term connectivity. Our protocol is multipath source routing, only one path will be selected at the same time and each path has probability to be selected like as Energy Aware Routing(EAR) protocol. The route discovery procedure of EASR protocol is reformed from the route discovery procedure of Split Multipath Routing(SMR) protocol. However, there is the difference between SMR and EASR. In EASR, we define an overhearing ratio in order to reduce energy waste due to overhearing effect among each selected path. Thus, we can establish energy efficient multiple paths by making use of overhearing ratio. The simulation results are also demonstrated that our scheme increases in network lifetimes, and achieves reasonable packet latency time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1721-1726
• /
• 2014

The sensor network technology for core technology of ubiquitous computing is in the spotlight recently, the research on sensor network is proceeding actively which is composed many different sensor node. The major traffic patterns of plenty of sensor networks are composed of collecting types of single directional data, which is transmitting packets from several sensor nodes to sink node. One of the important condition for design of sensor node is to extend for network life which is to minimize power-consumption under the limited resources of sensor network. In this paper analysis used routing protocols using the network simulation that was used second level cluster structure to reduce delay and power-consumption of sensor node.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.177-180
• /
• 2011

In practice, it is well known that geographical and/or location based routing is highly effective for wireless sensor network. Here, electing some landmarks on the network and forwarding data based on the landmark is one of the good approaches for a vast sensing field with holes. In the most previous works, landmarks are elected without considering the residual energy on each sensor. In this paper, we propose an Energy aware Landmark Election and Routing (ELER) protocol to establish a stable routing paths and reduce the total power consumption. The proposed protocol makes use of each sensor's energy level on electing the landmarks, which would be utilized to route a packet towards the target region using greedy forwarding method. Our simulation results illustrate that the proposed scheme can significantly reduce the power dissipation and effectively lengthen the lifetime of the network.

• Journal of information and communication convergence engineering
• /
• v.6 no.4
• /
• pp.466-469
• /
• 2008

The existing routing protocols in USN environment, PEGASIS is more efficient than LEACH, which is a hierarchical routing protocol, for network configuration based on power consumption. Despite its merit that it can reduce energy consumption per node, however, the PEGASIS protocol also has a weakness that it is less responsive to frequent changes that occur in the configuration of sensor network due to BS nodes that keep changing, which is a typical characteristic of the sensor network. To address this problem, this paper proposes to select sub-cluster heads and have them serve as intermediate nodes. This paper presents and analyses that this method can resolve the aforementioned problem of the PEGASIS algorithm.

• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.2
• /
• pp.51-60
• /
• 2016

This paper proposes a hierarchical routing algorithm for enhancing survivability of sensor nodes on WSAN. Proposed algorithm has two important parts. The first is a clustering algorithm that uses distance between sensor and actor, and remaining energy of sensor nodes for selecting cluster head. It will induce uniform energy consumption, and this has a beneficial effect on network lifetime. The second is an enhanced routing algorithm that uses the shortest path tree. The energy efficient routing is very important in WSAN which has energy limitation. As a result, proposed algorithm extends network and nodes lifetime through consuming energy efficiently. Simulation results show that the proposed clustering algorithm outperforms conventional routing algorithms such as VDSPT in terms of node and network life time, delay, fairness, and data transmission ratio to BS.