Power Consumption in Packet Radio Networks (Extended Abstract)

In this paper we study the problem of assigning transmission ranges to the nodes of a multi-hop packet radio network so as to minimize the total power consumed under the constraint that adequate power is provided to the nodes to ensure that the network is strongly connected (i.e., each node can communicate along some path in the network to every other node). Such assignment of transmission ranges is called complete. We also consider the problem of achieving strongly connected bounded diameter networks.

[1]  Keshab K. Parhi,et al.  Distributed scheduling of broadcasts in a radio network , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[3]  Arunabha Sen,et al.  A new model for scheduling packet radio networks , 1997, Wirel. Networks.

[4]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[5]  P. Tran-Gia,et al.  Analysis of a Finite Storage System with Batch Input Arising out of Message Packetization , 1982, IEEE Trans. Commun..

[6]  Leslie G. Valiant,et al.  Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Subramanian Ramanathan,et al.  Scheduling algorithms for multihop radio networks , 1993, TNET.

[9]  S.A. Gronemeyer,et al.  Advances in packet radio technology , 1978, Proceedings of the IEEE.

[10]  Erdal Arikan,et al.  Some complexity results about packet radio networks , 1983, IEEE Trans. Inf. Theory.

[11]  Anthony Ephremides,et al.  Scheduling broadcasts in multihop radio networks , 1990, IEEE Trans. Commun..