Exchange power management for mobile ad hoc networks

We present an incentive compatible mechanism for negotiated power management in mobile ad hoc networks. Using power measurements of real wireless interfaces, we show that a cost model for this environment must account for energy complementarity between overlapping traffic flows. We introduce the combinatorial exchange, a generalization of the route selection method already implemented in source routing networks, as a model which accounts for overlap. No previous mechanism for networks is incentive compatible in the power managing environment. We have developed a distributed procedure for exchange-based route selection, which we evaluate using realistic simulation. Our results show significant improvements in energy consumption variability, route setup latency, and application message delivery latency.

[1]  Nitin H. Vaidya,et al.  An energy efficient MAC protocol for wireless LANs , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[2]  Vikram Srinivasan,et al.  Cooperation in wireless ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[4]  Noam Nisan,et al.  Computationally feasible VCG mechanisms , 2000, EC '00.

[5]  Lifei Huang,et al.  On the scalability of IEEE 802.11 ad hoc networks , 2002, MobiHoc '02.

[6]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Leo Monteban,et al.  WaveLAN®-II: A high-performance wireless LAN for the unlicensed band , 1997, Bell Labs Technical Journal.

[8]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[9]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2001, MobiCom '01.

[10]  Rene L. Cruz,et al.  Optimal routing, link scheduling and power control in multihop wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[11]  Subhash Suri,et al.  BOB: Improved winner determination in combinatorial auctions and generalizations , 2003, Artif. Intell..

[12]  David A. Maltz,et al.  The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[13]  David Levine,et al.  Winner determination in combinatorial auction generalizations , 2002, AAMAS '02.

[14]  Levente Buttyán,et al.  Enforcing service availability in mobile ad-hoc WANs , 2000, MobiHoc.

[15]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[16]  Adam Wolisz,et al.  A trace-based approach for determining the energy consumption of a WLAN network interface , 2002 .

[17]  Daniel P. Siewiorek,et al.  Online power monitoring for wearable systems , 2002, Proceedings. Sixth International Symposium on Wearable Computers,.

[18]  J. Shneidman,et al.  Overcoming Rational Manipulation in Mechanism Implementations , 2003 .

[19]  Rong Zheng,et al.  On-demand power management for ad hoc networks , 2005, Ad Hoc Networks.

[20]  Joan Feigenbaum,et al.  A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.

[21]  Vikas Kawadia,et al.  Power control and clustering in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[22]  Archan Misra,et al.  Minimum energy paths for reliable communication in multi-hop wireless networks , 2002, MobiHoc '02.

[23]  Joan Feigenbaum,et al.  Distributed algorithmic mechanism design: recent results and future directions , 2002, DIALM '02.

[24]  Martin Nilsson,et al.  Investigating the energy consumption of a wireless network interface in an ad hoc networking environment , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[25]  Daniel P. Siewiorek,et al.  Mobility on a Large Scale Wireless Network , 2004, International Conference on Wireless Networks.

[26]  Stephan Eidenbenz,et al.  Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents , 2003, MobiCom '03.

[27]  Joan Feigenbaum,et al.  A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.

[28]  David C. Parkes,et al.  Achieving Budget-Balance with Vickrey-Based Payment Schemes in Combinatorial Exchanges , 2001 .

[29]  Tuomas Sandholm,et al.  Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..

[30]  J.-P. Hubaux,et al.  Enforcing service availability in mobile ad-hoc WANs , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[31]  Reinhard German,et al.  Performance modeling of IEEE 802.11 wireless LANs with stochastic Petri nets , 2001, Perform. Evaluation.

[32]  Rong Zheng,et al.  On-demand power management for ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[33]  Deborah Estrin,et al.  Adaptive Energy-Conserving Routing for Multihop Ad Hoc Networks , 2000 .

[34]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[35]  R. Myerson.  Mechanism Design by an Informed Principal , 1983 .