The range assignment problem in non-homogeneous static ad-hoc networks

Summary form only given. We introduce the weighted version of the range assignment problem in which the cost a station s pays to transmit to another station depends on the distance between the stations and on the energy cost of station s. Most of the algorithm results for the unweighted range assignment problem can not be applied to the weighted version. We thus provide a set of algorithmic results for this version and discuss some interesting related open questions.

[1]  Gruia Calinescu,et al.  Network Lifetime and Power Assignment in ad hoc Wireless Networks , 2003, ESA.

[2]  Mauro Leoncini,et al.  On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks , 2002, IFIP TCS.

[3]  Xiang-Yang Li,et al.  Minimum-energy broadcast routing in static ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[5]  Anthony Ephremides,et al.  On the construction of energy-efficient broadcast and multicast trees in wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[6]  Afonso Ferreira,et al.  The Minimum Range Assignment Problem on Linear Radio Networks , 2002, Algorithmica.

[7]  Andrzej Pelc,et al.  Power consumption in packet radio networks , 2000, Theor. Comput. Sci..

[8]  Ioannis Caragiannis,et al.  New Results for Energy-Efficient Broadcasting in Wireless Networks , 2002, ISAAC.

[9]  Andrea E. F. Clementi,et al.  Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks , 1999, RANDOM-APPROX.

[10]  Andrea E. F. Clementi,et al.  On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs , 2001, STACS.

[11]  Kaveh Pahlavan,et al.  Wireless Information Networks , 1995 .

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

[13]  Andrea E. F. Clementi,et al.  Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks , 2001 .

[14]  E. H. Clarke.  Multipart pricing of public goods , 1971 .

[15]  Ion I. Mandoiu,et al.  Symmetric Connectivity with Minimum Power Consumption in Radio Networks , 2002, IFIP TCS.

[16]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[17]  Ioannis Caragiannis,et al.  Energy-Efficient Wireless Network Design , 2005, Theory of Computing Systems.

[18]  Andrea E. F. Clementi,et al.  The minimum broadcast range assignment problem on linear multi-hop wireless networks , 2003, Theor. Comput. Sci..

[19]  Noam Nisan,et al.  Algorithmic Mechanism Design , 2001, Games Econ. Behav..

[20]  Andrea E. F. Clementi,et al.  Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms , 2003, SIROCCO.