Energy Efficient Routing in Ad Hoc Disaster Recovery Networks

—The terrorist attacks on September 11, 2001 have drawn attention to the use of wireless technology in order to locate survivors of structural collapse. We propose to construct an ad hoc network of wireless smart badges in order to acquire information from trapped survivors. We investigate the energy efficient routing problem that arises in such a network and show that since smart badges have very limited power sources and very low data rates, which may be inadequate in an emergency situation, the solution of the routing problem requires new protocols. The problem is formulated as an anycast routing problem in which the objective is to maximize the time until the first battery drains-out. We present iterative algorithms for obtaining the optimal solution of the problem. Then, we derive an upper bound on the network lifetime for specific topologies. Finally, a polynomial algorithm for obtaining the optimal solution in such topologies is described. Keywords—routing, energy efficient,...

• Type: Conference
• Year: 2003
• Where: INFOCOM
• Authors: Gil Zussman, Adrian Segall
• Keywords: Ad Hoc Networks, Communications, Efficient Routing Problem, INFOCOM 2003, Routing Problem