ACM Home Page
Please provide us with feedback. Feedback
Efficient tracing of failed nodes in sensor networks
Full text PdfPdf (339 KB)
Source International Workshop on Wireless Sensor Networks and Applications archive
Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications table of contents
Atlanta, Georgia, USA
SESSION: Location Discovery and Network Management table of contents
Pages: 122 - 130  
Year of Publication: 2002
ISBN:1-58113-589-0
Authors
Jessica Staddon  Palo Alto Research Center, Palo Alto, California
Dirk Balfanz  Palo Alto Research Center, Palo Alto, California
Glenn Durfee  Palo Alto Research Center, Palo Alto, California
Sponsors
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 89,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/570738.570756
What is a DOI?

ABSTRACT

In sensor networks, nodes commonly rely on each other to route messages to a base station. Although this practice conserves power it can obscure the cause of a measurement outage in a portion of the network. For example, when a base station ceases to receive measurements from a region of nodes it can't immediately determine whether this is because of the destruction of all the nodes in that region (due to an enemy attack, for example) or merely the result of the failure of a few nodes bearing much of the routing load. Previous solutions to this problem typically consist of re-running the route-discovery protocol, a process that can be quite expensive in terms of the number of messages that must be exchanged. We demonstrate that the topology of the network can be efficiently conveyed to the base station allowing for the quick tracing of the identities of the failed nodes with moderate communication overhead. Our algorithms work in conjunction with the existing functions of the network, requiring the nodes to send no additional messages.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
P. Buonadonna, J. Hill, and D. Culler. Active message communication for tiny networked sensors. In Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'01), April 2001.
 
3
A. Cerpa and D. Estrin. Ascent: Adaptive self-configuring sensor networks topologies. In Proceedings of the 21th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'02), New York, NY, June 2002.
 
4
D. Du and F. Hwang. Combinatorial Group Testing and its Applications. World Scientific Publishing, Singapore, 1993.
 
5
Amos Fiat and Tamir Tassa. Dynamic traitor tracing. Journal of Cryptology, 14(3):211--223, 2001.
 
6
Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan. Energy-efficient communication protocol for wireless microsensor networks. In HICSS, 2000.
7
 
8
Yih-Chun Hu, Adrian Perrig, and David~B. Johnson. Wormhole detection in wireless ad hoc networks. Technical Report TR01-384, Rice University Department of Computer Science, June 2002.
9
 
10
H. Krawczyk, M. Bellare, and R. Canetti. RFC 2104: HMAC: Keyed-hashing for message authentication, February 1997. Status: INFORMATIONAL.
 
11
Q. Li, J. Aslam, and D. Rus. Hierarchical power-aware routing in sensor networks. In Proceedings of the DIMACS Workshop on Pervasive Networking, May 2001.
 
12
13
 
14
15

CITED BY  11

Collaborative Colleagues:
Jessica Staddon: colleagues
Dirk Balfanz: colleagues
Glenn Durfee: colleagues