This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks
September 2006 (vol. 5 no. 9)
pp. 1267-1282
Topology control, wherein nodes adjust their transmission ranges to conserve energy and reduce interference, is an important feature in wireless ad hoc networks. Contrary to most of the literature on topology control which focuses on reducing energy consumption, in this paper we tackle the topology control problem with the goal of limiting interference as much as possible, while keeping the communication graph connected with high probability. Our approach is based on the principle of maintaining the number of physical neighbors of every node equal to or slightly below a specific value k. As we will discuss in this paper, having a nontrivially bounded physical node degree allows a network topology with bounded interference to be generated. The proposed approach enforces symmetry on the resulting communication graph, thereby easing the operation of higher layer protocols. To evaluate the performance of our approach, we estimate the value of k that guarantees connectivity of the communication graph with high probability both theoretically and through simulation. We then define k-Neigh, a fully distributed, asynchronous, and localized protocol that uses distance estimation. k-Neigh guarantees logarithmically bounded physical degree at every node, is the most efficient known protocol (requiring 2n messages in total, where n is the number of nodes in the network), and relies on simpler assumptions than existing protocols. Furthermore, we verify through simulation that the network topologies produced by k-Neigh show good performance in terms of node energy consumption and expected interference.

[1] M. Bahramgiri, M. Hajiaghayi, and V.S. Mirrokni, “Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-Hop Networks,” Proc. IEEE Conf. Computer Comm. and Networks, pp. 392-397, 2002.
[2] L. Bao and J.J. Garcia-Luna-Aceves, “Channel Access Scheduling in Ad Hoc Networks with Unidirectional Links,” Proc. Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM '01), pp. 9-18, 2001.
[3] C. Bettstetter, G. Resta, and P. Santi, “The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 2, no. 3, pp. 257-269, July/Sept. 2003.
[4] D.M. Blough, M. Leoncini, G. Resta, and P. Santi, “On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks,” Proc. IFIP Conf. Theoretical Computer Science, pp. 71-82, 2002.
[5] D.M. Blough, M. Leoncini, G. Resta, and P. Santi, “The $k{\hbox{-}}\rm Neigh$ Protocol for Symmetric Topology Control in Ad Hoc Networks,” Proc. ACM MobiHoc Conf., pp. 141-152, 2003.
[6] D.M. Blough, M. Leoncini, G. Resta, and P. Santi, “K-NeighLev: A Practical Realization of Neighborhood-Based Topology Control in Ad Hoc Networks,” Technical Report IIT-TR-09/2003, Istituto di Informatica e Telematica, Pisa— Italy, Sept. 2003.
[7] D.M. Blough, M. Leoncini, G. Resta, and P. Santi, “Comparison of Cell-Based and Topology Control-Based Energy Conservation in Wireless Ad Hoc and Sensor Networks,” Proc. ACM Int'l Symp. Modeling and Simulation of Wireless and Mobile Systems (MSWiM), 2004.
[8] S.A. Borbash and E.H. Jennings, “Distributed Topology Control Algorithm for Multihop Wireless Networks,” Proc. IEEE Int'l Joint Conf. Neural Networks, pp. 355-360, 2002.
[9] J. Bruck, M. Franceschetti, and L. Schulman, “Microcellular Systems, Random Walks, and Wave Propagation,” Proc. IEEE Symp. Antennas and Propagation, pp. 220-223, 2002.
[10] M. Burkhart, P. Von Rickenbach, R. Wattenhofer, and A. Zollinger, “Does Topology Control Reduce Interference?” Proc. ACM MobiHoc Conf., pp. 9-19, 2004.
[11] L.M. Feeney and M. Nilson, “Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment,” Proc. IEEE INFOCOM Conf., pp. 1548-1557, 2001.
[12] P. Gupta and P.R. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” Stochastic Analysis, Control, Optimization and Applications, pp. 547-566, 1998.
[13] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, 2000.
[14] Z. Huang, C. Shen, C. Srisathapornphat, and C. Jaikaeo, “Topology Control for Ad Hoc Networks with Directional Antennas,” Proc. IEEE Int'l Conf. Computer Comm. and Networks, pp. 16-21, 2002.
[15] L. Li, J.H. Halpern, P. Bahl, Y. Wang, and R. Wattenhofer, “Analysis of a Cone-Based Distributed Topology Control Algorithm for Wireless Multi-Hop Networks,” Proc. 20th Ann. ACM Symp. Principles of Distributed Computing (PODC 2001), pp. 264-273, 2001.
[16] N. Li, J. Hou, and L. Sha, “Design and Analysis of an MST-Based Topology Control Algorithm,” Proc. IEEE Infocom Conf., 2003.
[17] J. Liu and B. Li, “MobileGrid: Capacity-Aware Topology Control in Mobile Ad Hoc Networks,” Proc. IEEE Int'l Conf. Computer Comm. and Networks, pp. 570-574, 2002.
[18] M.K. Marina and S.R. Das, “Routing Performance in the Presence of Unidirectional Links in Multihop Wireless Networks,” Proc. ACM MobiHoc Conf., pp. 12-23, 2002.
[19] K. Pahlavan and A. Levesque, Wireless Information Networks. John Wiley and Sons, 1995.
[20] M.R. Pearlman, Z.J. Haas, and B.P. Manvell, “Using Multi-Hop Acknowledgements to Discover and Reliably Communicate over Unidirectional Links in Ad Hoc Networks,” Proc. Wireless Comm. and Networking Conf. (WCNC), pp. 532-537, 2000.
[21] R. Prakash, “A Routing Algorithm for Wireless Ad Hoc Networks with Unidirectional Links,” ACM/Kluwer Wireless Networks, vol. 7, no. 6, pp. 617-625, 2001.
[22] R. Ramanathan and R. Rosales-Hain, “Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment,” Proc. IEEE Infocom Conf., pp. 404-413, 2000.
[23] V. Ramasubramanian, R. Chandra, and D. Mosse, “Providing a Bidirectional Abstraction for Unidirectional Ad Hoc Networks,” Proc. IEEE Infocom Conf., pp. 1258-1267, 2002.
[24] V. Rodoplu and T.H. Meng, “Minimum Energy Mobile Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, pp. 1333-1344, 1999.
[25] P. Santi and D.M. Blough, “The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 2, no. 1, pp. 1-15, Jan.-Mar. 2003.
[26] W.Z. Song, Y. Wang, X.Y. Li, and O. Frieder, “Localized Algorithms for Energy Efficient Topology in Wireless Ad Hoc Networks,” Proc. ACM MobiHoc Conf., pp. 98-108, 2004.
[27] P.J. Wan and C.W. Yi, “Asymptotical Critical Transmission Radius and Critical Neighbor Number for k-Connectivity in Wireless Ad Hoc Networks,” Proc. ACM MobiHoc Conf., pp. 1-8, 2004.
[28] R. Wattenhofer, L. Li, P. Bahl, and Y. Wang, “Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks,” Proc. IEEE Infocom Conf., pp. 1388-1397, 2001.
[29] F. Xue and P.R. Kumar, “The Number of Neighbors Needed for Connectivity of Wireless Networks,” Wireless Networks, vol 10, no. 2, pp. 169-181, 2004.

Index Terms:
wireless ad hoc networks, topology control, spatial reuse, energy consumption, connectivity.
Citation:
Douglas M. Blough, Mauro Leoncini, Giovanni Resta, Paolo Santi, "The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 5, no. 9, pp. 1267-1282, Sept. 2006, doi:10.1109/TMC.2006.139
Usage of this product signifies your acceptance of the Terms of Use.