On perimeter coverage in wireless sensor networks with minimum cost

Hung, Ka-Shun; Lui, King-Shan

doi:10.1504/ijsnet.2011.038761

Cited by 13 publications

(3 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our proposed RTSP concentrates on achieving robustness to packet loss resulting from link failure, and it achieves reliable synchronization among neighbors as opposed to using a single time source. There are some other related work in synchronization and other problems .…”

Section: Related Workmentioning

confidence: 99%

Random time source protocol in wireless sensor networks and synchronization in industrial environments

Wang¹,

Zeng

Huang

et al. 2011

Wireless Communications

View full text Add to dashboard Cite

Reliability is a crucial aspect of time synchronization for industrial wireless applications in wireless sensor networks. Existing time synchronization algorithms often provide good synchronization in laboratory environments; however, outdoor environments with associated radio interference influence the performance of time synchronization. In this paper, we propose a random time source protocol for industrial wireless applications in wireless sensor network synchronization. Each synchronized node randomly selects its time source for each period in order to prevent reliance on a fixed time source because this may lead to resynchronization once the source fails. We have implemented the algorithm on the SIA2420 platform using TINYOS, and the results show the reliability of our protocol.

show abstract

Section: Related Workmentioning

confidence: 99%

Random time source protocol in wireless sensor networks and synchronization in industrial environments

Wang¹,

Zeng

Huang

et al. 2011

Wireless Communications

View full text Add to dashboard Cite

show abstract

“…Another fundamental issue in WSNs is the coverage problem which is considered to be a measure of the quality of service (QoS). To save the energy and guarantee the quality of coverage (QoC), the main approach is using node's redundancy to set the state of each node with heuristic algorithm [2,3]. Nodes are turned off in turn to reduce the energy cost while satisfying QoC requirement.…”

Section: Introductionmentioning

confidence: 99%

Collaborative Scheduling Using Cooperative Sensing Model for Wsns

Meng

Liu

Zhang

et al. 2014

AMM

View full text Add to dashboard Cite

One of the major challenges in constructing wireless sensor networks (WSNs) is to ensure the quality of coverage (QoC) as well as save energy. Considering the cooperative sensing model and the random deployment policy, the judgment model of redundant node without location information is presented. Furthermore, the distributed collaborative scheduling algorithm (DCSA) is designed to guarantee the QoC of networks with the least number of nodes. It chooses the uniformly-located working nodes and makes sure that the energy consumption of each node consumes homogeneously. Simulation results show that the DCSA policy not only provides the desired QoC of networks, but also reduces the number of working nodes significantly, saves the energy of the networks, and extends the network lifetime.

show abstract

“…In [1][2][3][4], we studied how to identify a set of sensors to cover the perimeter of a large object with the minimum size and minimum cost. Since sensors are battery-powered and the battery is unlikely to be rechargeable, every sensor network has a functional network lifetime.…”

Section: Introductionmentioning

confidence: 99%

Perimeter Coverage Scheduling in Wireless Sensor Networks Using Sensors with a Single Continuous Cover Range

Hung

Lui

2010

J Wireless Com Network

View full text Add to dashboard Cite

In target monitoring problem, it is generally assumed that the whole target object can be monitored by a single sensor if the target falls within its sensing range. Unfortunately, this assumption becomes invalid when the target object is very large that a sensor can only monitor part of it. In this paper, we study the perimeter coverage problem where the perimeter of a big object needs to be monitored, but each sensor can only cover a single continuous portion of the perimeter. We describe how to schedule the sensors so as to maximize the network lifetime in this problem. We formally prove that the perimeter coverage scheduling problem is NPhard in general. However, polynomial time solution exists in some special cases. We further identify the sufficient conditions for a scheduling algorithm to be a 2-approximation solution to the general problem, and propose a simple distributed 2-approximation solution with a small message overhead.

show abstract

On perimeter coverage in wireless sensor networks with minimum cost

Cited by 13 publications

References 33 publications

Random time source protocol in wireless sensor networks and synchronization in industrial environments

Random time source protocol in wireless sensor networks and synchronization in industrial environments

Collaborative Scheduling Using Cooperative Sensing Model for Wsns

Perimeter Coverage Scheduling in Wireless Sensor Networks Using Sensors with a Single Continuous Cover Range

Contact Info

Product

Resources

About