A Survey on Mobility Driven Clustering Techniques for Wireless Sensor Networks
07 Aug 2018-pp 1521-1528
TL;DR: This paper is a study about constraints of WSN and clustering techniques used for forming the network are presented and the proposed protocols to make the efficient use of available energy in the nodes and to acquire complete operability are presented.
Abstract: In recent years Mobile Wireless Sensor Networks have observed a substantial increase in the use of specific applications like surveillance, military applications, disaster management, wildlife monitoring, etc. The wireless nodes are small electronic devices embedded with various sensors to perform the given tasks. These sensor nodes are provided with a limited battery power which is a big constraint for the performance of the network in unattended environments. Also, mobility affects the battery life of the nodes to a great extent. Thus, it is necessary to design protocols to make the efficient use of available energy in the nodes and to acquire complete operability. This problem can be solved to some extent by clustering of the sensor nodes. This paper is a study about constraints of WSN and clustering techniques used for forming the network are presented.
References
More filters
TL;DR: A taxonomy and general classification of published clustering schemes for WSNs is presented, highlighting their objectives, features, complexity, etc and comparing of these clustering algorithms based on metrics such as convergence rate, cluster stability, cluster overlapping, location-awareness and support for node mobility.
2,283 citations
TL;DR: A comprehensive and fine grained survey on clustering routing protocols proposed in the literature for WSNs, and a novel taxonomy of WSN clustering routed methods based on complete and detailed clustering attributes are presented.
Abstract: The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in a wide range of applications and it has become a hot research area. Based on network structure, routing protocols in WSNs can be divided into two categories: flat routing and hierarchical or clustering routing. Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs. In this paper, we present a comprehensive and fine grained survey on clustering routing protocols proposed in the literature for WSNs. We outline the advantages and objectives of clustering for WSNs, and develop a novel taxonomy of WSN clustering routing methods based on complete and detailed clustering attributes. In particular, we systematically analyze a few prominent WSN clustering routing protocols and compare these different approaches according to our taxonomy and several significant metrics. Finally, we summarize and conclude the paper with some future directions.
635 citations
20 Apr 2006
TL;DR: This paper proposed an improved protocol called "LEACH-Mobile" for mobile nodes to declare the membership of a cluster as they move, and to confirm whether a mobile sensor node is able to communicate with a specific cluster head within a time slot allocated in TDMA schedule.
Abstract: In mobility-centric environments, wireless sensor networks are designed to accommodate energy efficiency, dynamic self-organization and mobility. In typical applications of wireless sensor networks, fixed sensor nodes are mixed with mobile sensor nodes in 'hot areas'. Also, as they move, network topology needs to be reconstructed by reacting upon the mobility of sensor nodes quickly. In this paper we proposed an improved protocol called "LEACH-Mobile" for mobile nodes to declare the membership of a cluster as they move, and to confirm whether a mobile sensor node is able to communicate with a specific cluster head within a time slot allocated in TDMA schedule. The LEACH-Mobile protocol achieved definite improvement in data transfer success rate as mobile nodes increased compared to the non-mobility centric LEACH protocol.
246 citations
18 May 2009
TL;DR: The performance of proposed CBR Mobile-WSN protocol is evaluated using MATLAB and it has been observed that the proposed protocol reduces the packet loss by 25% compared to LEACH-Mobile protocol.
Abstract: Mobility of sensor nodes posed new challenges particularly in energy consumption and demands researchers' attention. Some real applications impose combined environments of fixed and mobile sensor nodes in the same network, while others demand a complete mobile sensors environment. Packet loss that occurs due to mobility of the sensor nodes is one of main challenges in Wireless Sensor Network (WSN) and it comes in parallel with energy consumption. In this paper, we propose adaptive Time Division Multiple Access (TDMA) scheduling and round free cluster head protocol called Cluster Based Routing (CBR) protocol for Mobile Nodes in Wireless Sensor Network (CBR Mobile-WSN). In this protocol the cluster head receive data from not only its member during the TDMA allocated time slot but also other sensor nodes that just enter the cluster when it has free time slots, each cluster head takes turn to be the free cluster head in the network. CBR Mobile-WSN change TDMA scheduling adaptively according to traffic and mobility characteristics. The proposed protocol sends data to cluster heads in an efficient manner based on received signal strength. The performance of proposed CBR Mobile-WSN protocol is evaluated using MATLAB and it has been observed that the proposed protocol reduces the packet loss by 25% compared to LEACH-Mobile protocol.
119 citations
26 Dec 2007
TL;DR: In the context of mobile ad hoc networks (MANETs) routing, a clustering algorithm called Connectivity, Energy and Mobility driven Clustering Algorithm (CEMCA) is proposed, which consists in appropriately choosing the cluster head to reduce routing overhead.
Abstract: In the context of mobile ad hoc networks (MANETs) routing, we propose a clustering algorithm called Connectivity, Energy and Mobility driven Clustering Algorithm (CEMCA). The aim of CEMCA consists in appropriately choosing the cluster head to reduce routing overhead. In order to reduce traffic and energy consumption, the control messages are sent only when needed, according to the speed of the node. Each node has a quality that indicates its suitability as a cluster head. This quality takes into account the node connectivity, battery energy and mobility. These parameters are very important for the stability of the cluster. Simulation experiments are carried out to validate our algorithm in terms of stability of the clusters and their members and the quality of the connectivity. The results are compared to a previous approach called Weight Clustering Algorithm (WCA) and they show that CEMCA is performing better.
51 citations