Asynchronous clustering of multihop Wireless Sensor Networks

Abstract

Abstract-Node clustering has been widely studied in recent years for Wireless Sensor Networks (WSN) as a technique to form a hierarchical structure and prolong network lifetime by reducing the number of packet transmissions. Cluster Heads (CH) are elected in a distributed way among sensors, but are often highly overloaded, and therefore re-clustering operations should be performed to share the resource intensive CH-role. Existing protocols involve periodic network-wide re-clustering operations that are simultaneously performed, which requires global time synchronisation. To address this issue, some recent studies have proposed asynchronous node clustering for networks with direct links from CHs to the data sink. However, for large-scale WSNs, multihop packet delivery to the sink is required since longrange transmissions are costly for sensor nodes. In this paper, we present an asynchronous node clustering protocol designed for multihop WSNs, considering dynamic conditions such as residual node energy levels and unbalanced data traffic loads caused by packet forwarding. Simulation results demonstrate that it is possible to achieve similar levels of lifetime extension by reclustering a multihop WSN via independently made decisions at CHs, without a need for time synchronisation required by existing synchronous protocols.

Energy efficient m- level LEACH protocol

“…The energy load among the nodes is evenly distributed in the network by randomization. An improved LEACH variation, multi-hop LEACH (M-LEACH) is proposed in [9]. In this a CH delivers the data using multiple hops to the BS.…”

“…Some of the CHs may not be able to reach the BS directly due to limited transmit range. To circumvent such a situation, using multi-hop LEACH (M-LEACH) [9], a CH can make use of one of its neighboring CH nodes towards the BS as a relay node to forward its aggregated data. In the similar manner, a multi-hop communication path could be established so as to forward the data of a distant CH.…”

Energy efficient routing in multi-level LEACH for WSNs

“…The setup phase is similar to that of LEACH protocol, where level -1 CHs are formed and in 2L-LEACH protocol, where level -1 and level -2 CHs are formed [10]. During the steady state phase, the collection of data starts and when the data reaches the top most level where it needs to be sent to the BS.…”

Secure Multipurpose Wireless Sensor Networks

“…The graph of such a clustered WSN is a tree. Examples for these algorithms are LEACH [46], TEEN [78], energy aware routing for cluster-based WSNs [148], or [134,146] as further advances in energy-efficient clustering. Here different approaches are taken to reduce energy consumption or distribute the energy consumption more evenly over the WSN.…”