A moving algorithm for non-uniform deployment in mobile sensor networks

Abstract

Previous research indicated that uniform deployment was not the most efficient way for saving energy in wireless sensor networks. The location nearer to a sink should have more sensors deployed. This paper describes a moving algorithm for achieving the non-uniform deployment (MAND). With MAND, mobile sensors can move to appropriate locations to prolong the system lifetime. With two refinements on MAND (called EMAND), not only the coverage of the network is maintained, but the lifetime can be improved enormously. Simulation results show that EMAND performs well in the environment with more sensing events.

Mobility based network lifetime in wireless sensor networks: A review

“…every single point in an interested area is observed by at least one sensor node [42], (ii) target coverage, e.g. a fixed number of targets are constantly tracked [29], [43] and (iii) barrier coverage, e.g. probability of moving targets randomly passing through a sensing field, captured by sensor nodes [44], [45].…”

“…Monitoring every single point in a sensing field is too stringent in some applications where it is not necessary to observe the whole area. Target coverage (a network monitors a fixed number of targets) [29], [43].…”

“…The coverage and connectivity coupling problems have been thoroughly studied in the literature [56], [57]. For instance, some works [29], [58] focused on mobilizing the initial deployment of the network in order to change the topology of the network for better connectivity and coverage. In [58] Yang et al proposed a sensor deployment strategy for the MWSN, where in order to reduce the energy holes near the sink and prolong the network lifetime, the desired non-uniform sensor density in the monitored area is formed.…”

“…Nonetheless, the centralized technique is limited in a large distributed wireless sensor network [51] and inefficient when energy of all the sensor nodes in the network is at different levels. In a similar fashion, the authors in [29] proposed another algorithm, called Moving Algorithm for Achieving the Non-uniform Deployment (MAND) for a non-uniform distributed network. By employing Voronoi diagram technique [59], the proposed method rearranges the mobile sensors at an appropriate distance with their neighbor peers so that their desired density is guaranteed and the coverage holes [60] are eliminated, which, on the other hand, significantly reduces the energy consumption in the network.…”

Energy efficient gathering of delay tolerant sensing data in wireless sensor networks

“…Mobility of sensor nodes has been first considered to maintain the sensing coverage by repairing the coverage holes caused by the failures of sensor nodes. For example, in [1], Liu et al propose an algorithm for adjusting the sensor node density in case of sensor node failures. Mobile sensor nodes are used for energy efficiency of WSNs as well.…”