Broadcasting in ad hoc networks based on self-pruning

By Jie Wu, Fei Dai. IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), 2003

317 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/f843b8141577fd4240f8cdb9b0aa63695e9ef16a

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

1. Samir R Das
2. Mihaela Cardei
3. Jie Wu
4. Quinyi Gu
5. Himanshu Gupta
6. Bang Wang
7. Sajal K. Das
8. Mahesh K. Marina

Citations in the corpus

• Connected K-coverage problem in sensor networks (2004, background): “In addition, it can be shown ([11]) that once the C1 condition is satisfied for a node , the deletion of will”
• Connected sensor cover: self-organization of sensor networks for efficient query execution (2003, methodology): “Similarly, it can be shown (as in [15]) that once the C1 condition is satisfied for a node I , the deletion of I will always preserve connectivity in the communication subgraph induced by the non-deleted active nodes, even if other nodes get marked as deleted.”
• Coverage in Wireless Sensor Networks (2004, background): “The node coverage problem can be related to the broadcasting problem, where a small set of forwarding nodes is selected [25].”