Adaptive concentric chains protocol for energy efficient routing in wireless sensor networks

• Published in: Wireless communications and mobile computing Vol. 12; no. 7; pp. 631 - 651
• Main Authors: Lin, Yih-Chuan, Jiang, Kai-Wei
• Format: Journal Article
• Language: English
• Published: Chichester, UK John Wiley & Sons, Ltd 01.05.2012
• Subjects: concentric chain clustering; energy conservation; PEGASIS; wireless sensor networks
• ISSN: 1530-8669; 1530-8677
• DOI: 10.1002/wcm.1001

This paper addresses the energy efficiency of data collection based on a concentric chain clustering topology for wireless sensor networks (WSNs). To conserve the energy dissipation of nodes spent in data routing, the paper attempts to take advantage of the two opportunities: (a) the impact of the relative positions of wireless nodes to the base station on the energy efficiency of the routing chain within each cluster; (b) the effect of the varying‐sized chains on the selection rule of cluster heads (CHs). To establish an energy‐efficient chain to connect all the nodes in a cluster, the paper proposes a principal vector projection approach, which takes into account both the position of each node and that of the base station, to determine the order to which a node can be linked into the chain in order to reduce the energy requirement of the chain. Since the CH selection rules in the concentric chains are mutually independent, solely based on their self‐cluster sizes, the multi‐hop path passing through all the CHs will consist of longer links and thus consume a significant fraction of the total energy. Thus, in order to suppress the effect of the unequal cluster sizes on decreasing the energy efficiency of the multi‐hop path of CHs, the paper offers an average‐cluster‐size‐based rule (ACSB) for each cluster in order to adapt the CH selection with both the number of active nodes in the current cluster and the average value of all cluster sizes. With these two proposed schemes, an adaptive concentric chain‐based routing algorithm is proposed which enables nodes to collaboratively reduce the energy dissipation incurred in gathering sensory data. By computer simulation, the results demonstrate that the proposed algorithm performs better than other similar protocols in terms of energy saved and lifetime increased capabilities for WSNs which deploy random sensor nodes. Copyright © 2010 John Wiley & Sons, Ltd. To conserve energy consumption in wireless sensor networks, instead of the nearest neighbor policy, Boundary First PEGASIS (BFP) protocol adopts a constrained networking approach that constructs multiple concentric chains under two chaining constraints. First, the orientation of the concentric chains should toward to the position of base station. Second, to select all the cluster heads (CHs) should consider the numbers of active nodes in all the chains.