Jessica Staddon
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.
- Omer Berkman, Michal Parnas, and Jiri Sgall. Efficient dynamic traitor tracing. In Proc. 2000 Symp. on Discrete Algorithms, pages 586--595, 2000. Google Scholar
Digital Library
- 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.Google Scholar
- 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.Google ScholarCross Ref
- D. Du and F. Hwang. Combinatorial Group Testing and its Applications. World Scientific Publishing, Singapore, 1993.Google ScholarCross Ref
- Amos Fiat and Tamir Tassa. Dynamic traitor tracing. Journal of Cryptology, 14(3):211--223, 2001.Google ScholarDigital Library
- Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan. Energy-efficient communication protocol for wireless microsensor networks. In HICSS, 2000.Google ScholarDigital Library
- Jason Hill, Robert Szewczyk, Alec Woo, Seth Hollar, David Culler, and Kristofer Pister. System architecture directions for network sensors. In Proceedings of ASPLOS, 2000. Google ScholarDigital Library
- 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.Google Scholar
- Chalermek Intanagonwiwat, Ramesh Govindan, and Deborah Estrin. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MOBICOM-00), pages 56--67, N. Y., August~6--11 2000. ACM Press. Google ScholarDigital Library
- H. Krawczyk, M. Bellare, and R. Canetti. RFC 2104: HMAC: Keyed-hashing for message authentication, February 1997. Status: INFORMATIONAL. Google ScholarDigital Library
- 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.Google Scholar
- A. Manjeshwar and D. P. Agrawal. Teen: A routing protocol for enhanced efficiency in wireless sensor networks. In 1st International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing (IPDPS), April 2001. Google ScholarDigital Library
- Sergio Marti, T. J. Giuli, Kevin Lai, and Mary Baker. Mitigating routing misbehavior in mobile ad hoc networks. In Proceedings of the Sixth Annual International Conference on Mobile Computing and Networking (Mobicom '2000), pages 255--265, Boston, MA, August 2000. Google ScholarDigital Library
- A. J. (Alfred~J.) Menezes, Paul~C. Van Oorschot, and Scott~A. Vanstone. Handbook of applied cryptography. The CRC Press series on discrete mathematics and its applications. CRC Press, 2000 N.W. Corporate Blvd., Boca Raton, FL 33431-9868, USA, 1997. Google ScholarDigital Library
- A. Perrig, R. Szewczyk, V. Wen, D. Cullar, and J. Tygar. Spins: Security protocols for sensor networks. In Proceedings of the Seventh Annual International Conference on Mobile Computing and Networking (Mobicom '2001), 2001. Google ScholarDigital Library
Index Terms
- Efficient tracing of failed nodes in sensor networks
Recommendations
Secure Multi-copy Routing in Compromised Delay Tolerant Networks
Routing in delay tolerant networks (DTNs) is challenging due to their unique characteristics of intermittent node connectivity. Different protocols (single-, multi-copy, erasure-coding-based etc.) utilizing store-carry-and-forward paradigm have been ...
Energy efficient approach with integrated key management scheme for wireless sensor networks: c.2.2 [network protocols]
ANC '13: Proceedings of the second ACM MobiHoc workshop on Airborne networks and communicationsTwo-tier topology makes good candidate for making clusters in wireless sensor networks. So we have considered a heterogeneous 2-tier topology to route the data securely among nodes in the sensor network. Initially, after deploying two types of nodes low-...
Ad-Hoc Buffering in Neighbor Nodes for Burst Data Transmissions in Wireless Sensor Networks
ICCSA '12: Proceedings of the 2012 12th International Conference on Computational Science and Its ApplicationsIn sensor networks, burst sensor messages are required to be transmitted along a wireless multihop routes to a sink node with no lost sensor messages and with shorter transmission delay. However, due to congestions, buffers in intermediate sensor nodes ...
Comments