Maximizing number of satisfiable routing requests in static ad hoc networks

We study an energy-efficient routing problem in static ad hoc networks. The problem, referred to as maxR, is to maximize the number of routing requests that can be satisfied in the network, under the constraint that each node has finite battery power. The online version of the problem, where the sequence of messages that has to be routed over the network is not known ahead of time, has been studied extensively. In this paper, we study the offline version of the problem where the sequence of requests is pre-known. As far as we know, the offline maxR problem, its hardness and approximability have not been well studied. We show that after appropriate transformation, offline maxR is equivalent to the well-known maximum disjoint path problem, which is NP-hard. We propose a greedy algorithm called GDP that has a constant approximation ratio to the optimal algorithm. GDP can be used as a benchmark to evaluate the performance of online algorithms as it is known that the best offline algorithm performs better than any online algorithm. We then put forward a new online algorithm called MECBE to solve the online maxR problem. Simulation results show that GDP outperforms MECBE, which outperforms the state-of-the-art online algorithm OML, in terms of the number of satisfiable requests, the average energy consumption per request, and the number of energy-depleted nodes.

[1]  S. Sitharama Iyengar,et al.  Game-theoretic models for reliable path-length and energy-constrained routing with data aggregation in wireless sensor networks , 2004, IEEE Journal on Selected Areas in Communications.

[2]  Gil Zussman,et al.  Energy efficient routing in ad hoc disaster recovery networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  Archan Misra,et al.  MRPC: maximizing network lifetime for reliable routing in wireless environments , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[4]  Christian Blum,et al.  Ant colony optimization for multicasting in static wireless ad-hoc networks , 2009, Swarm Intelligence.

[5]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[6]  Leandros Tassiulas,et al.  Routing for network capacity maximization in energy-constrained ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Xiang-Yang Li,et al.  Reliable and Energy-Efficient Routing for Static Wireless Ad Hoc Networks with Unreliable Links , 2009, IEEE Transactions on Parallel and Distributed Systems.

[8]  Sartaj Sahni,et al.  An online heuristic for maximum lifetime routing in wireless sensor networks , 2006, IEEE Transactions on Computers.

[9]  Éva Tardos,et al.  Algorithm design , 2005 .

[10]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[11]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[12]  Hanan Shpungin.  Energy efficient online routing in wireless ad hoc networks , 2011, 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[13]  Sridhar Radhakrishnan,et al.  On energy aware routing in wireless networks , 2007, 2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07).