Mobility Resistant Clustering in Multi-Hop Wireless Networks

Abstract

<p class="MsoNormal" style="text-align: left; margin: 0cm 0cm 0pt;" align="left"><span class="text"><span style="font-family: ";Arial";,";sans-serif";; font-size: 8.5pt;">This paper presents a Distributed Efficient Clustering Approach (DECA) for mobility-resistant and</span></span><span style="font-family: ";Arial";,";sans-serif";; font-size: 8.5pt;"> <span class="text">energy-efficient clustering in multi-hop wireless networks. The clusterheads cover the whole network and each node in the network can exclusively determine the single cluster it belongs. DECA is fully distributed, each node transmits only one message during clustering operation, and the algorithm terminates in deterministic time without iterations. Theoretical results show the correctness of DECA, and extensive simulation results demonstrate that DECA is energy-efficient and robust against node mobility.</span></span></p

Energy efficient VoIP communication using WSN clustering approach

“…DECA is an improved Distributed Efficient Clustering Approach [12], [13]. The basic difference between the HEED and DECA is the decision making process and the score computation.…”

Layered data aggregation in cell-phone based wireless sensor networks

“…• Due to poor connectivity, some nodes in layer l may not meet the condition (13) and have τ w = 0. These nodes transmit their data directly to the sink node with [data, layer number, node ID].…”

“…In order to develop DA-LW for the layered Cellular Network, we first propose a Cluster Head (CH) based aggregation algorithm for this architecture. Clustering mechanisms in sensor networks have been extensively researched in literature [2], [5], [13]. In [10], clustering of mobile nodes is done to guarantee a probability of path availability within a cluster, while the B − protocol is proposed in [2].…”

“…In [12] mobility indices are computed for nodes in a distributed manner to aid in routing and cluster head selection. [5] and [13] present cluster head selection methods based on a weighted combination of power, mobility and transmission range of nodes. The proposed CH based algorithm is also weight-based, but is fully distributed with no explicit weight knowledge of its neighbors.…”

A New Graph Theory based Routing Protocol for Wireless Sensor Networks

“…DECA is an acronym for Distributed Efficient Clustering Approach [9]. DECA differs from HEED in deciding and arriving at the score computation.…”