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

Liu, Cheng-Hung; Ssu, Kuo‐Feng; Wang, Wei-Tong

doi:10.1504/ijaacs.2011.040987

Cited by 5 publications

(7 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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].…”

Section: Wireless Sensor Network Lifetime Definitionsmentioning

confidence: 99%

“…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].…”

Section: Coveragementioning

confidence: 99%

“…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.…”

Section: A Coverage Based Strategiesmentioning

confidence: 99%

“…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.…”

Section: A Coverage Based Strategiesmentioning

confidence: 99%

See 3 more Smart Citations

Mobility based network lifetime in wireless sensor networks: A review

Nguyen

2020

Computer Networks

View full text Add to dashboard Cite

Increasingly emerging technologies in microelectromechanical systems and wireless communications allows a mobile wireless sensor networks (MWSN) to be a more and more powerful mean in many applications such as habitat and environmental monitoring, traffic observing, battlefield surveillance, smart homes and smart cities. Nevertheless, due to sensor battery constraints, energy-efficiently operating a MWSN is paramount importance in those applications; and a plethora of approaches have been proposed to elongate the network longevity at most possible. Therefore, this paper provides a comprehensive review on the developed methods that exploit mobility of sensor nodes and/or sink(s) to effectively maximize the lifetime of a MWSN. The survey systematically classifies the algorithms into categories where the MWSN is equipped with mobile sensor nodes, one mobile sink or multiple mobile sinks. How to drive the mobile sink(s) for energy efficiency in the network is also fully reviewed and reported.

show abstract

Section: Wireless Sensor Network Lifetime Definitionsmentioning

confidence: 99%

Section: Coveragementioning

confidence: 99%

Section: A Coverage Based Strategiesmentioning

confidence: 99%

Section: A Coverage Based Strategiesmentioning

confidence: 99%

See 2 more Smart Citations

Mobility based network lifetime in wireless sensor networks: A review

Nguyen

2020

Computer Networks

View full text Add to dashboard Cite

show abstract

“…Some studies [1]- [2] tried to change the initial deployment of the network by mobile nodes; some other approaches [3]- [5] utilized MSs to collect data in order to enhance the sensing coverage, connectivity, and network lifetime as well. However, there has been little research work on WSN closed operating cycles to find an optimal solution for improving the network lifetime.…”

Section: Introductionmentioning

confidence: 99%

Efficient Approach for Maximizing Lifespan in Wireless Sensor Networks by Using Mobile Sinks

Nguyen¹,

Nguyen²,

Le³

2017

ETRI Journal

View full text Add to dashboard Cite

Recently, sink mobility has been shown to be highly beneficial in improving network lifetime in wireless sensor networks (WSNs). Numerous studies have exploited mobile sinks (MSs) to collect sensed data in order to improve energy efficiency and reduce WSN operational costs. However, there have been few studies on the effectiveness of MS operation on WSN closed operating cycles. Therefore, it is important to investigate how data is collected and how to plan the trajectory of the MS in order to gather data in time, reduce energy consumption, and improve WSN network lifetime. In this study, we combine two methods, the cluster-head election algorithm and the MS trajectory optimization algorithm, to propose the optimal MS movement strategy. This study aims to provide a closed operating cycle for WSNs, by which the energy consumption and running time of a WSN is minimized during the cluster election and data gathering periods. Furthermore, our flexible MS movement scenarios achieve both a long network lifetime and an optimal MS schedule. The simulation results demonstrate that our proposed algorithm achieves better performance than other well-known algorithms.

show abstract