An algorithm for boundary discovery in wireless sensor networks

Authors:
Jitender S. Deogun;Saket Das;Haitham S. Hamza;Steve Goddard
Affiliations:
Department of Computer Science & Engineering, University of Nebraska-Lincoln, Lincoln, NE;Department of Computer Science & Engineering, University of Nebraska-Lincoln, Lincoln, NE;Department of Computer Science & Engineering, University of Nebraska-Lincoln, Lincoln, NE;Department of Computer Science & Engineering, University of Nebraska-Lincoln, Lincoln, NE
Venue:
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Year:
2005

Citing 5
Cited 3

Wireless sensor networks for habitat monitoring

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
The coverage problem in a wireless sensor network

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Fault Tolerance in Collaborative Sensor Networks for Target Detection

IEEE Transactions on Computers
Distributed Bayesian Algorithms for Fault-Tolerant Event Region Detection in Wireless Sensor Networks

IEEE Transactions on Computers
Boundary estimation in sensor networks: theory and methods

IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks

Heuristic algorithm for finding boundary cycles in location-free low density wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient algorithms for distributed detection of holes and boundaries in wireless networks

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Perimeter detection in wireless sensor networks

Robotics and Autonomous Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless Sensor Networks (WSNs) consist of a large number of nodes networked via wireless links. In many WSN settings, sensor nodes are deployed in an ad hoc manner. One important issue in this context is to detect the boundary of the deployed network to ensure that the sensor nodes cover the target area. In this paper, we propose a new algorithm that can be used to discover the boundary of a randomly deployed WSN. The algorithm does not require the sensor nodes to be equipped with positioning devices and is scalable for large number of nodes. Simulation experiments are developed to evaluate the performance of the proposed algorithms for different network topologies. The simulation results show that the algorithm detects the boundary nodes of the network with high accuracy.