Coverage in wireless ad-hoc sensor networks
By Xiangyang Li, Pengjun Wan, Ophir Frieder. 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333), 2002
446 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/9ef782323aa21c8870acff56882e710e0c401df7
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Electrical and Electronic Engineering
- Yunhao Liu
- Zheng Yang
- Amitava Ghosh
- Mihaela Cardei
- Jennifer C. Hou
- Benyuan Liu
- Honghai Zhang
- Lirong Jian
Citations in the corpus
- Maintaining Sensing Coverage and Connectivity in Large Sensor Networks (2005, background): “[15] give localized algorithms for both problems.”
- Coverage in Wireless Sensor Networks (2004, methodology): “The best coverage problem is further explored and formalized in [14], where Li et al proposed a distributed algorithm for MSP computation using the relative neighborhood graph.”
- Energy-efficient target coverage in wireless sensor networks (2005, methodology): “For node synchronization, one method is to have the BS periodically sending short beacons.”
- Location, Localization, and Localizability (2010, background): “In contrast, the geometric approaches([22]) are able to obtain accurate and reliable results, in which locations are essential.”
- Coverage and connectivity issues in wireless sensor networks: A survey (2008, methodology): “The two well-known approaches to the worst-case coverage problem are the Minimal Exposure Path [43] and the Maximal Breach Path [44,39], described below in Sections 4.”
- Strong barrier coverage of wireless sensor networks (2008, background): “These path coverage problems are further studied in [7, 12], where efficient distributed algorithms are proposed.”