Book chapter
An Algorithm for Boundary Discovery in Wireless Sensor Networks
High Performance Computing – HiPC 2005, pp.343-352
Lecture Notes in Computer Science, Springer Berlin Heidelberg
2005
DOI: 10.1007/11602569_37
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.
Details
- Title: Subtitle
- An Algorithm for Boundary Discovery in Wireless Sensor Networks
- Creators
- Jitender S. Deogun - University of Nebraska–LincolnSaket Das - University of Nebraska–LincolnHaitham S. Hamza - University of Nebraska–LincolnSteve Goddard - University of Nebraska–Lincoln
- Resource Type
- Book chapter
- Publication Details
- High Performance Computing – HiPC 2005, pp.343-352
- Publisher
- Springer Berlin Heidelberg; Berlin, Heidelberg
- Series
- Lecture Notes in Computer Science
- DOI
- 10.1007/11602569_37
- eISSN
- 1611-3349
- ISSN
- 0302-9743
- Language
- English
- Date published
- 2005
- Academic Unit
- Computer Science
- Record Identifier
- 9984259435402771
Metrics
17 Record Views