This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Localized Topology Control for Unicast and Broadcast in Wireless Ad Hoc Networks
April 2006 (vol. 17 no. 4)
pp. 321-334

Abstract—We propose a novel localized topology-control algorithm for each wireless node to locally select communication neighbors and adjust its transmission power accordingly such that all nodes together self-form a topology that is energy efficient simultaneously for both unicast and broadcast communications. We theoretically prove that the proposed topology is planar, which meets the requirement of certain localized routing methods to guarantee packet delivery; it is power-efficient for unicast—the energy needed to connect any pair of nodes is within a small constant factor of the minimum; it is also asymptotically optimum for broadcast—the energy consumption for broadcasting data on top of it is asymptotically the best among all structures constructed using only local information; it has a constant bounded logical degree, which will potentially save the cost of updating routing tables if used. We further prove that the expected average physical degree of all nodes is a small constant. To the best of our knowledge, this is the first localized topology-control strategy for all nodes to maintain a structure with all these desirable properties. Previously, only a centralized algorithm was reported in [CHECK END OF SENTENCE]. Moreover, by assuming that the node ID and its position can be represented in O(\log n) bits for a wireless network of n nodes, the total number of messages by our methods is in the range of [5n,13n], where each message is O(\log n) bits. Our theoretical results are corroborated in the simulations.

[1] I.F Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks,” IEEE Comm. Magazine, vol. 40, no. 8, pp. 102-114, Aug. 2002.
[2] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks, ACM/Kluwer Wireless Networks, vol. 7, no. 6, pp. 48-55, 1999.
[3] P. Bose, J. Gudmundsson, and M. Smid, “Constructing Plane Spanners of Bounded Degree and Low Weight,” Proc. European Symp. Algorithms, pp. 234-246, 2002.
[4] M. Burkhart, P. Von Rickenbach, R. Wattenhofer, and A. Zollinger, “Does Topology Control Reduce Interference,” Proc. ACM Int'l Symp. Mobile Ad-Hoc Networking and Computing (MobiHoc '04), pp. 9-19, 2004.
[5] G. Calinescu, “Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks,” Proc. Int'l Conf. Ad Hoc Networking and Wireless (ADHOC-NOW), 2003.
[6] J. Cartigny, D. Simplot, and I. Stojmenovic, “Localized Minimum-Energy Broadcasting in Ad-Hoc Networks,” Proc. 22nd Ann. Joint Conf. IEEE Computer and Comm. Soc. (Infocom), 2003.
[7] X. Cheng, A. Thaeler, G. Xue, and D. Chen, “TPS: A Time-Based Positioning Scheme for Outdoor Wireless Sensor Networks,” Proc. 23rd Ann. Joint Conf. IEEE Computer and Comm. Soc. (Infocom), pp. 2685-2696, 2004.
[8] A. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca, “On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs,” Proc. 18th Ann. Symp. Theoretical Aspects of Computer Science, pp. 121-131, 2001.
[9] G. Das, G. Narasimhan, and J. Salowe, “A New Way to Weigh Malnourished Euclidean Graphs,” Proc. ACM Symp. Discrete Algorithms, pp. 215-222, 1995.
[10] K.R. Gabriel and R.R. Sokal, “A New Statistical Approach to Geographic Variation Analysis,” Systematic Zoology, vol. 18, pp. 259-278, 1969.
[11] W.R. Heinzelman, J. Kulik, and H. Balakrishnan, “Adaptive Protocols for Information Dissemination in Wireless Sensor Networks,” Proc. Fifth Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (ACM/IEEE MobiCom '99), pp. 174-185, Aug. 1999.
[12] L. Hu and D. Evans, “Localization for Mobile Sensor Networks” Proc. 10th ACM Ann. Int'l Conf. Mobile Computing and Networking (MobiCom), pp. 45-57, 2004.
[13] C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, “Directed Diffusion for Wireless Sensor Networking,” IEEE/ACM Trans. Networking, vol. 11, no. 1, Feb. 2003.
[14] D.B. Johnson, D.A. Maltz, Y.-C. Hu, and J.G. Jetcheva, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,” IETF Internet draft, work in progress, Nov. 2001.
[15] B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MobiCom), pp. 243-254, 2000.
[16] L.M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc, “Power Consumption in Packet Radio Networks,” Theoretical Computer Science, vol. 243, pp. 289-305, 2000.
[17] L. Kleinrock and J. Silvester, “Optimum Transmission Radii for Packet Radio Networks or Why Six Is a Magic Number,” Proc. IEEE Nat'l Telecomm. Conf., pp. 431-435, 1978.
[18] F. Kuhn, R. Wattenhofer, and A. Zollinger, “Asymptotically Optimal Geometric Mobile Ad-Hoc Routing,” Proc. Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM), pp. 24-33, 2002.
[19] F. Kuhn, R. Wattenhofer, and A. Zollinger, “Worst-Case, Optimal, and Average-Case Efficient Geometric Ad-Hoc Routing,” Proc. ACM Int'l Symp. Mobile Ad-Hoc Networking and Computing (MobiHoc), pp. 267-278, 2003.
[20] L. Li, J.Y. Halpern, P. Bahl, Y.-M. Wang, and R. Wattenhofer, “Analysis of a Cone-Based Distributed Topology Control Algorithm for Wireless Multi-Hop Networks,” Proc. ACM Symp. Principles of Distributed Computing (PODC), pp. 264-273, 2001.
[21] X.-Y. Li, “Approximate MST for UDG Locally,” Proc. Computing and Combinatorics (COCOON), pp. 364-373, 2003.
[22] X.-Y. Li, P.-J. Wan, Y. Wang, and O. Frieder, “Sparse Power Efficient Topology for Wireless Networks,” Proc. IEEE Hawaii Int'l Conf. System Sciences (HICSS), 2002.
[23] X.-Y. Li, Y. Wang, W.-Z. Song, P.-J. Wan, and O. Frieder, “Localized Minimum Spanning Tree and Its Applications in Wireless Ad Hoc Networks,” Proc. 22nd Ann. Joint Conf. IEEE Computer and Comm. Soc. (Infocom), 2004.
[24] D. Niculescu and B. Nath, “Ad Hoc Positioning system (APS),” Proc. IEEE Global Comm. Conf. (GLOBECOM), pp. 2926-2931, 2001.
[25] V. Park and M.S. Corson, “Temporally-Ordered Routing Algorithm (TORA),” version 1 specification, IETF Internet draft, work in progress, Nov. 2000.
[26] M. Penrose, “The Longest Edge of the Random Minimal Spanning Tree,” Annals of Applied Probability, vol. 7, pp. 340-361, 1997.
[27] C.E. Perkins, E.M. Belding-Royer, and S. Das, “Ad Hoc On- Demand Distance Vector (AODV) Routing,” IETF Internet draft, work in progress, Mar. 2002.
[28] C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” IEEE Comm. Rev., pp. 234-244 Oct. 1994.
[29] M. Seddigh, J.S. Gonzalez, and I. Stojmenovic, “RNG and Internal Node Based Broadcasting Algorithms for Wireless One-to-One Networks,” ACM Mobile Computing and Comm. Review, vol. 5, no. 2, pp. 37-44, 2002.
[30] R.C. Shah and J.M. Rabaey, “Energy Aware Routing for Low Energy Ad Hoc Sensor Networks,” IEEE Wireless Comm. and Networking Conf. (WCNC), pp. 350-355, Mar. 2002.
[31] W.-Z. Song, Y. Wang, X.-Y. Li, and O. Frieder, “Localized Algorithms for Energy Efficient Topology in Wireless Ad Hoc Networks” Proc. ACM Int'l Symp. Mobile Ad-Hoc Networking and Computing (MobiHoc), 2004.
[32] G.T. Toussaint, “The Relative Neighborhood Graph of a Finite Planar Set,” Pattern Recognition, vol. 12, no. 4, pp. 261-268, 1980.
[33] P.-J. Wan, G. Calinescu, X.-Y. Li, and O. Frieder, “Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks,” ACM Wireless Networks, vol. 8, no. 6, pp. 607-617, Nov. 2002.
[34] Y. Wang and X.-Y. Li, “Efficient Construction of Bounded Degree and Planar Spanner for Wireless Networks,” Proc. ACM DIALM-POMC Joint Workshop Foundations of Mobile Computing, 2003.
[35] X.-Y. Li, G. Calinescu, P.-J. Wan, and Y. Wang, “Localized Delaunay Triangulation with Applications in Wireless Ad Hoc Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 10, pp. 1035-1047, Oct. 2003.
[36] J. Wieselthier, G. Nguyen, and A. Ephremides, “On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks,” Proc. IEEE Infocom 2000, pp. 586-594, 2000.
[37] J. Wu and F. Dai, “Broadcasting in Ad Hoc Networks Based on Self-Pruning,” Proc. IEEE Infocom, 2003.
[38] A.C.-C. Yao, “On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems,” SIAM J. Computing, vol. 11, pp. 721-736, 1982.
[39] F. Ye, H. Luo, J. Cheng, S. Lu, and L. Zhang, “A Two-Tier Data Dissemination Model for Large-Scale Wireless Sensor Networks,” Proc. Eighth Ann. Int'l Conf. Mobile Computing and Networking (ACM MobiCom '02), Sept. 2002.
[40] M. Naor and L. Stockmeyer, “What Can Be Computed Locally?” Proc. ACM Symp. Theory of Computing (STOC), pp. 184-193, 1993.

Index Terms:
Graph theory, localized communication, wireless ad hoc networks, topology control, power efficient, low weight, low interference, unicast, broadcast.
Citation:
Wen-Zhan Song, Xiang-Yang Li, Ophir Frieder, WeiZhao Wang, "Localized Topology Control for Unicast and Broadcast in Wireless Ad Hoc Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 4, pp. 321-334, April 2006, doi:10.1109/TPDS.2006.53
Usage of this product signifies your acceptance of the Terms of Use.