Efficient coloring of Wireless Ad Hoc Networks with diminished transmitter power

In our work we present a new approach to the problem of channel assignment in Wireless Ad Hoc Network. We introduce a new algorithm which works in distributed model of computations on Unit Disc Graphs modeling the Wireless Ad Hoc Network. The algorithm first modifies the transmitting power of the devices constituting the network (radii of the vertices of the Unit Disc Graph) and then it assigns the frequencies in the network adjusted to our demands. We assume that initially all the devices have the same transmission range and we are able to reduce the transmission range of some of them in order to decrease the number of necessary frequencies. We are able to diminish the number of communication links without loosing connectivity of the network, i.e. reduce the number of possible interference threats without risk of loosing possibility to exchange information. In addition, the diminution of communication range reduce the power consumption of the transmitting devices.

[1]  Jie Wu,et al.  Topology control in ad hoc wireless networks using cooperative communication , 2006, IEEE Transactions on Mobile Computing.

[2]  Sung-Ju Lee,et al.  Transmission power control in wireless ad hoc networks: challenges, solutions and open issues , 2004, IEEE Network.

[3]  Roger Wattenhofer,et al.  Does topology control reduce interference? , 2004, MobiHoc '04.

[4]  R. Wattenhofer,et al.  Interference arises at the receiver , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[5]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

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

[7]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Xiang-Yang Li,et al.  Low-Interference Topology Control for Wireless Ad Hoc Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[9]  Teresa H. Meng,et al.  Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[10]  Prosenjit Bose,et al.  Location-Oblivious Distributed Unit Disk Graph Coloring , 2009, Algorithmica.

[11]  Thomas Erlebach,et al.  Independence and Coloring Problems on Intersection Graphs of Disks , 2006, Efficient Approximation and Online Algorithms.

[12]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[13]  Ting-Chao Hou,et al.  Transmission Range Control in Multihop Packet Radio Networks , 1986, IEEE Trans. Commun..

[14]  Sy-Yen Kuo,et al.  A Localized Topology Control Algorithm for Constructing Power Efficient Wireless Ad Hoc Networks , 2003, WWW.

[15]  Li Li,et al.  Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[16]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.

[17]  Joseph Y. Halpern,et al.  Minimum-energy mobile wireless networks revisited , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[18]  A. Gräf,et al.  On Coloring Unit Disk Graphs , 1998, Algorithmica.

[19]  Ioannis Caragiannis,et al.  A tight bound for online colouring of disk graphs , 2007, Theor. Comput. Sci..