Applications of Computational Geometry in Wireless Networks

  • Xiang-Yang Li
Part of the Network Theory and Applications book series (NETA, volume 14)

Abstract

Ad Hoc Wireless Networks Due to its potential applications in various situations such as battlefield, emergency relief, and so on, wireless networking has received significant attention over the last few years. There are no wired infrastructures or cellular networks in ad hoc wireless network. Each mobile node has a transmission range. Node v can receive the signal from node u if node v is within the transmission range of the sender u. Otherwise, two nodes communicate through multi-hop wireless links by using intermediate nodes to relay the message. Consequently, each node in the wireless network also acts as a router, forwarding data packets for other nodes. In this survey, we consider that each wireless node has an omnidirectional antenna. This is attractive because a single transmission of a node can be received by many nodes within its vicinity which, we assume, is a disk centered at the node. In addition, we assume that each node has a low-power Global Position System (GPS) receiver, which provides the position information of the node itself. If GPS is not available, the distance between neighboring nodes can be estimated on the basis of incoming signal strengths. Relative co-ordinates of neighboring nodes can be obtained by exchanging such information between neighbors [1].

Keywords

Hull Hunt Bors Dition Haas 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    S. Capkun, M. Hamdi, and J.P. Hubaux, “Gps-free positioning in mobile ad-hoc networks,” in Proc. Hawaii Int. Conf. on System Sciences, 2001Google Scholar
  2. [2]
    Franco P. Preparata and Michael Ian Shamos, Computational Geometry: an Introduction, Springer-Verlag, 1985.Google Scholar
  3. [3]
    H. Edelsbrunner, Algorithms in Combinatorial Geometry, Spinger-Verlag, 1987MATHGoogle Scholar
  4. [4]
    Paul-Louis George and Houman Borouchaki, Delaunay Triangulations and Meshing, HERMES, 1998.Google Scholar
  5. [5]
    P. Sinha, R. Sivakumar, and V. Bharghavan, “Cedar: Core extraction distributed ad hoc routing,” in Proc. of IEEE INFOCOMM ‘89, 1999.Google Scholar
  6. [6]
    B. Das and V. Bharghavan, “Routing in ad-hoc networks using minimum connected dominating sets,” in 1997 IEEE International Conference on on Communications (ICC’97), 1997, vol. 1, pp. 376–380.Google Scholar
  7. [7]
    Jie Wu and Hailan Li, “A dominating-set-based routing scheme in ad hoc wireless networks,” the special issue on Wireless Networks in the Telecommunication Systems Journal, vol. 3, pp. 63–84, 2001.Google Scholar
  8. [8]
    Ivan Stojmenovic, Mahtab Seddigh, and Jovisa Zunic, “Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 1, pp. 14–25, 2002.CrossRefGoogle Scholar
  9. [9]
    Khaled M. Alzoubi, Peng-Jun Wan, and Ophir Frieder, “New distributed algorithm for connected dominating set in wireless ad hoc networks,” in Hicss, Hawaii, 2002.Google Scholar
  10. [10]
    Peng-Jun Wan, Khaled M. Alzoubi, and Ophir Frieder, “Distributed construction of connected dominating set in wireless ad hoc networks,” in INFOCOM, 2002.Google Scholar
  11. [11]
    Yu Wang and Xiang-Yang Li, “Geometric spanners for wireless ad hoc networks,” in Proc. of 22nd IEEE International Conference on Distributed Computing Systems (ICDCS), 2002.Google Scholar
  12. [12]
    E. Royer and C. Toh, “A review of current routing protocols for ad-hoc mobile wireless networks,” IEEE Personal Communications, Apr. 1999.Google Scholar
  13. [13]
    C.E. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance-vector routing (dsdv) for mobile computers,” Computer Communications Review, pp. 234–244, October 1994.Google Scholar
  14. [14]
    Mario Joa-Ng and I-Tai Lu, “A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks,” IEEE Journal on Selected Areas in Communication, vol. 17, no. 8, pp. 1415–1425, August 1999.CrossRefGoogle Scholar
  15. [15]
    Haas Z.J. and Pearlman M.R., “The zone routing protocol(zrp) for ad hoc networks,” in Internet draft - Mobile Ad hoc NETworking (MANET), Working Group of the Internet Engineering Task Force (IETF), Novermber 1997.Google Scholar
  16. [16]
    C.E. Perkins and E.M.Royer, “Ad-hoc on demand distance vector routing,” in Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, February 1999, pp. 90–100.Google Scholar
  17. [17]
    J. Broch, D. Johnson, and D. Maltz, “The dynamic source routing protocol for mobile ad hoc networks,” 1998.Google Scholar
  18. [18]
    Vincent D. Park and M. Scott Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks,” in IEEE INFOCOM, 1997.Google Scholar
  19. [19]
    C-K. Toh, “A novel distributed routing protocol to support ad-hoc mobile networks,” in Proc 1996 IEEE 15th Annual Int’l. Phoenix Conf. Comp. and Commun., Mar 1996, pp. 480–86.Google Scholar
  20. [20]
    C.C. Chiang, “Routing in clustered multihop, mobile wireless networks with fading channel,” in Proceedings of IEEE SICON’97, Apr. 1997, pp. 197–211.Google Scholar
  21. [21]
    G. Pei, M. Gerla, and T.-W. Chen, “Fisheye state routing: A routing scheme for ad hoc wireless networks,” in Proceedings of ICC 2000, 2000.Google Scholar
  22. [22]
    G. Pei, M. Gerla, and T.-W. Chen, “Fisheye state routing in mobile ad hoc networks,” in Proceedings of Workshop on Wireless Networks and Mobile Computing, Taipei, Taiwan, Apr, 2000.Google Scholar
  23. [23]
    A. Iwata, C.-C. Chiang, G. Pei, M. Gerla, and T.-W. Chen, “Scalable routing strategies for ad hoc wireless networks,” JSAC99, IEEE Journal on Selected Areas in Communications, vol 17, no. 8, pp. 1369–1379, August 1999.CrossRefGoogle Scholar
  24. [24]
    Ji-Cherng Lin, Shi-Nine Yang, and Maw-Sheng Chern, “An efficient distributed algorithm for minimal connected dominating set problem,” in Proc. of the Tenth Annual International Phoenix Conference on Computers and Communications 1991, 1991, pp. 204–210.Google Scholar
  25. [25]
    Jie Wu, F. Dai, M. Gao, and I. Stojmenovic, “On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks,” IEEE/KICS Journal of Communication and Networks, vol. 4, no. 1, pp. 5970, 2002.Google Scholar
  26. [26]
    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. 609–616, 2001, 3rd int. Workshop on Discrete Algorithms and methods for mobile computing and communications, 1999, 48–55.Google Scholar
  27. [27]
    B. Karp and H. T. Kung, “Gpsr: Greedy perimeter stateless routing for wireless networks,” in ACM/IEEE International Conference on Mobile Computing and Networking, 2000.Google Scholar
  28. [28]
    Martin Mauve, Jorg Widmer, and Hannes Harenstein, “A survey on position-based routing in mobile ad hoc networks,” IEEE Network Magazine, vol. 15, no. 6, pp. 30–39, 2001.Google Scholar
  29. [29]
    Godfried T. Toussaint, “The relative neighborhood graph of a finite planar set,” Pattern Recognition, vol. 12, no. 4, pp. 261–268, 1980.MathSciNetCrossRefMATHGoogle Scholar
  30. [30]
    K.R. Gabriel and R.R. Sokol, “A new statistical approach to geographic variation analysis,” Systematic Zoology, vol 18 pp. 259–278, 1969.CrossRefGoogle Scholar
  31. [31]
    Tamas Lukovszki, New Results on Geometric Spanners and Their Applications, Ph.D. thesis, University of Paderborn, 1999.Google Scholar
  32. [32]
    H. N. Gabow, J. L. Gently, and R. E. Tarjan, “Scaling and related techniques for geometry problems,” in ACM Symposium on Theory of Computing, 1984, pp. 135–143.Google Scholar
  33. [33]
    J. Katajainen, “The region approach for computing relative neighborhood graphs in the 1p metric,” Computing, vol. 40, pp. 147–161, 1988.MathSciNetMATHGoogle Scholar
  34. [34]
    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.CrossRefGoogle Scholar
  35. [35]
    Xiang-Yang Li, G. Calinescu, and Peng-Jun Wan, “Distributed construction of planar spanner and routing for ad hoc wireless networks,” in 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOGOM), 2002, vol. 3.Google Scholar
  36. [36]
    S. Datta, I. Stojmenovic, and J. Wu, “Internal node and shortcut based routing with guaranteed delivery in wireless networks,” Cluster Computing, vol. 5, no. 2, pp. 169–178, 2002.CrossRefGoogle Scholar
  37. [37]
    I. Stojmenovic and S. Datta, “Power and cost aware localized routing with guaranteed delivery in wireless networks,” in Proc. Seventh IEEE Symposium on Computers and Communications ISCC, 2002.Google Scholar
  38. [38]
    Mahtab Seddigh, J. Solane Gonzalez, and I. Stojmenovic, “Rng and internal node based broadcasting algorithms for wireless one-to-one networks,” ACM Mobile Computing and Communications Review, vol. 5, no. 2, pp. 37–44, 2002.CrossRefGoogle Scholar
  39. [39]
    Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, and Michiel Smid, “Euclidean spanners,” in Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, 1995.Google Scholar
  40. [40]
    S. Arya, G. Das, D. Mount, J. Salowe, and M. Smid, “Euclidean spanners: short, thin, and lanky,” in Proc. 27th ACM STOC, 1995, pp. 489–498.Google Scholar
  41. [41]
    S. Arya and M. Smid, “Efficient construction of a bounded degree spanner with low weight,” in Proc. 2nd Annu. European Sympos. Algorithms (ESA), volume 855 of Lecture Notes in Computer Science, 1994, pp. 48–59.Google Scholar
  42. [42]
    P. Bose, L. Devroye, W. Evans, and D. Kirkpatrick, “On the spanning ratio of gabriel graphs and beta-skeletons,” in Proceedings of the Latin American Theoretical Infocomatics (LATIN), 2002.Google Scholar
  43. [43]
    Barun Chandra, Gautam Das, Giri Narasimhan, and Jos Soares, “New sparseness results on graph spanners,” in Proceedings of the eighth annual symposium on Computational geometry, 1992.Google Scholar
  44. [44]
    Gautam Das and Giri Narasimhan, “A fast algorithm for constructing sparse euclidean spanners,” in Proceedings of the tenth annual symposium on Computational geometry, 1994.Google Scholar
  45. [45]
    Menelaos I. Karavelas and Leonidas J. Guibas, “Static and kinetic geometric spanners with applications,” in Proceeding of the Twelfth Annual Symposium on Discrete algorithms, 2001, pp. 168–176.Google Scholar
  46. [46]
    Christos Levcopoulos, Giri Narasimhan, and Michiel Smid, “Efficient algorithms for constructing fault-tolerant geometric spanners,” in Proceedings of the thirtieth annual ACM symposium on Theory of computing, 1998.Google Scholar
  47. [47]
    P.L. Chew, “There is a planar graph as good as the complete graph,” in Proceedings of the 2nd Symposium on Computational Geometry, 1986, pp. 169–177.CrossRefGoogle Scholar
  48. [48]
    Xiang-Yang Li, Peng-Jun Wan, and Yu Wang, “Power efficient and sparse spanner for wireless ad hoc networks,” in IEEE Int. Conf. on Computer Communications and Networks (ICCCN01), 2001, pp. 564–567.Google Scholar
  49. [49]
    Xiang-Yang Li, Peng-Jun Wan, Yu Wang, and Ophir Frieder, “Sparse power efficient topology for wireless networks,” in IEEE Hawaii Int. Conf. on System Sciences (HICSS), 2002.Google Scholar
  50. [50]
    Roger Wattenhofer, Li Li, Paramvir Bahl, and Yi-Min Wang, “Distributed topology control for wireless multihop ad-hoc networks,” in IEEE INFOCO?’01, 2001.Google Scholar
  51. [51]
    Li Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, and Roger Wattenhofer, “Analysis of a cone-based distributed topology control algorithms for wireless multi-hop networks,” in ACM Symposium on Principle of Distributed Computing (PODC), 2001.Google Scholar
  52. [52]
    Yu Wang and Xiang-Yang Li, “Distributed spanner with bounded degree for wireless ad hoc networks,” in International Parallel and Distributed Processing Symposium: Parallel and Distributed Computing Issues in Wireless networks and Mobile Computing, April 2002.Google Scholar
  53. [53]
    Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, and Richard E. Stearns, “NC-approximation schemes for NP- and PSPACE -hard problems for geometric graphs,” J. Algorithms, vol. 26, no. 2, pp. 238–274, 1999.MathSciNetCrossRefGoogle Scholar
  54. [54]
    M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert, “Distributed maintenance of resource efficient wireless network topologies,” 2002, Submitted for publication.Google Scholar
  55. [55]
    J. M. Keil and C. A. Gutwin, “Classes of graphs which approximate the complete euclidean graph,” Discr. Corp. Geom., vol. 7, pp. 13–28, 1992.MathSciNetCrossRefMATHGoogle Scholar
  56. [56]
    Xiang-Yang Li, Ivan Stojmenovic, and Yu Wang, “Partial delaunay triangulation and degree limited localized bluetooth scatternet formation,” in AdHocNow, 2002.Google Scholar
  57. [57]
    J. Gao, L. J. Guibas, J. Hershburger, L. Zhang, and A. Zhu, “Geometric spanner for routing in mobile networks,” in Proceedings of the 2nd ACM Symposium on Mobile Ad Hoe Networking and Computing (MobiHoc 01), 2001.Google Scholar
  58. [58]
    Prosenjit Bose, Joachim Gudmundsson, and Michiel Smid, “Constructing plane spanners of bounded degree and low weight,” in Proceedings of European Symposium of Algorithms, 2002.Google Scholar
  59. [59]
    Joachim Gudmundsson, Christos Levcopoulos, and Giri Narasimhan, “Improved greedy algorithms for constructing sparse geometric spanners,” in Scandinavian Workshop on Algorithm Theory, 2000, pp. 314–327.Google Scholar
  60. [60]
    Xiang-Yang Li and Yu Wang, “Localized construction of bounded degree planar spanner for wireless networks,” 2003, Submitted for publication.Google Scholar
  61. [61]
    P. Bose and P. Morin, “Online routing in triangulations,” in Proc. of the 10 th Annual Int. Symp. on Algorithms and Computation ISAAC, 1999.Google Scholar
  62. [62]
    D.P. Dobkin, S.J. Friedman, and K.J. Supowit, “Delaunay graphs are almost as good as complete graphs,” Discr. Corp. Geom., pp. 399–407, 1990.Google Scholar
  63. [63]
    Yu Wang, Xiang-Yang Li, and Ophir Frieder, “Distributed spanner with bounded degree for wireless networks,” International Journal of Foundations of Computer Science, 2002, Accepted for publication.Google Scholar
  64. [64] Gruia Călinescu, “Computing 2-hop neighborhoods in ad hoc wireless networks,” 2002, Submitted for publication.Google Scholar
  65. [65]
    Khaled Alzoubi, Peng-Jun Wan, and Ophir Frieder, “Message-optimal connected-dominating-set construction for routing in mobile ad hoc net works,” in 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’02), 2002.Google Scholar
  66. [66] Xiang-Yang Li and Yu Wang, “Efficient construction of low weight bounded degree planar spanner,” 2002, Submitted for publication.Google Scholar
  67. [67]
    J. Monks, V. Bharghavan, and W.-M Hwu, “Transmission power control for multiple access wireless packet networks,” in IEEE Conference on Local Computer Networks (LCN), 2000.Google Scholar
  68. [68]
    R. Ramanathan and R. Rosales-Hain, “Topology control of multihop wireless networks using transmit power adjustment,” in IEEE INFOCOM, 2000.Google Scholar
  69. [69]
    M. Sanchez, P. Manzoni, and Z. Haas, “Determination of critical transmission range in ad-hoc networks,” in Multiaccess, Mobility and Teletra,c for Wireless Communications (MMТ’99), 1999.Google Scholar
  70. [70]
    M. Faloutsos and M. Molle, “Creating optimal distributed algorithms for minimum spanning trees,” Tech. Rep. Technical Report CSRI-327 (also submitted in WDAG ‘85), 1995.Google Scholar
  71. [71]
    R. Gallager, P. Humblet, and P. Spira, “A distributed algorithm for minimumweight spanning trees,” ACM Transactions on Programming Languages and Systems, vol. 5, no. 1, pp. 66–77, 1983.CrossRefMATHGoogle Scholar
  72. J. A. Garay, S. Kutten, and D. Peleg, “A sub-linear time distributed algorithms for minimum-weight spanning trees,” in Symp. on Theory of Computing, 1993, pp. 659–668.Google Scholar
  73. [73]
    L. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc, “Power consumption in packet radio networks,” in Symposium on Theoretical Aspects of Computer Science (STACS) ‘87., 1997.Google Scholar
  74. [74]
    Andrea E.F. Clementi, Paolo Penna, and Riccardo Silvestri, “On the power assignment problem in radio networks,” 2000.Google Scholar
  75. [75]
    A. Clementi, P. Penna, and R. Silvestri, “The power range assignment problem in radio networks on the plane,” in XVII Symposium on Theoretical Aspects of Computer Science (STACS’00), LNCS(1770):651–660„ 2000.Google Scholar
  76. [76]
    A. Clementi, P. Penna, and R. Silvestri, “Hardness results for the power range assignment problem in packet radio networks,” in II International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM/A PPROX ‘89), LNCS(1671):197–208„ 1999.Google Scholar
  77. Sudipto Guha and Samir Khuller, “Approximation algorithms for connected dominating sets,” in European Symposium on Algorithms, 1996, pp. 179–193.Google Scholar
  78. G. Robins and A. Zelikovsky, “Improved steiner tree approximation in graphs,” in Proceedings of A CM/SIAM Symposium on Discrete Algorithms, 2000, pp. 770–779.Google Scholar
  79. [79]
    H.B. Hunt, M. V. Marathe, V. Radhakrishnan, S. Ravi, D. J. Rosenkrantz, and R. E. Stearns, “Nc-approximation schemes for np and pspace hard problems for geometric graphs,” Journal of Algorithms, vol. 26, pp. 238–274, 1998.MathSciNetMATHGoogle Scholar
  80. [80]
    Madhav V. Marathe, Heinz Breu, Harry B. Hunt III, S. S. Ravi, and Daniel J. Rosenkrantz, “Simple heuristics for unit disk graphs,” Networks, vol. 25, pp. 59–68, 1995.MathSciNetMATHGoogle Scholar
  81. [81]
    Dorit S. Hochbaum and Wolfgang Maass, “Approximation schemes for covering and packing problems in image processing and vlsi,” Journal of ACM, vol. 32, pp. 130–136, 1985.CrossRefMATHGoogle Scholar
  82. [82]
    P. Berman, M. Furer, and A. Zelikovsky, “Applications of matroid parity problem to approximating steiner trees,” Tech. Rep. 980021, Computer Science, UCLA, 1998.Google Scholar
  83. [83]
    Khaled M. Alzoubi, Virtual Backbone in Wireless Ad Hoc Networks, Ph.D. thesis, Illinois Institute of Technology, 2002.Google Scholar
  84. [84]
    Xiuzhen Cheng, “A polynomial time approximation algorithm for connected dominating set problem in wireless ad hoc networks,” 2002.Google Scholar
  85. [85]
    Chunhung Richard Lin and Mario Gerla, “Adaptive clustering for mobile wireless networks,” IEEE Journal of Selected Areas in Communications, vol. 15, no. 7, pp. 1265–1275, 1997.CrossRefGoogle Scholar
  86. [86]
    I. Chlamtac and A. Farago, “A new approach to design and analysis of peer to peer mobile networks,” Wireless Networks, vol. 5, pp. 149–156, 1999.CrossRefGoogle Scholar
  87. [87]
    Alan D. Amis, Ravi Prakash, Dung Huynh, and Thai Vuong, “Max-min d-cluster formation in wireless ad hoc networks,” in Proc. of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM, 2000, vol. 1, pp. 32–41.CrossRefGoogle Scholar
  88. [88]
    Alan D Amis and Ravi Prakash, “Load-balancing clusters in wireless ad hoc networks,” in Proc. of the 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology, 2000.Google Scholar
  89. [89]
    Lujun Jia, Rajmohan Rajaraman, and Torsten Suel, “An efficient distributed algorithm for constructing small dominating sets,” in ACM PODC, 2000.Google Scholar
  90. [90]
    R. Sivakumar, B. Das, and V. Bharghavan, “An improved spine-based infrastructure for routing in ad hoc networks,” in IEEE Symposium on Computers and Communications, Athens, Greece, June 1998.Google Scholar
  91. [91]
    V. Chvatal, “A greedy heuristic for the set-covering problem,” Mathematics of Operation Research, vol. 4, no. 3, pp. 233–235, 1979.MathSciNetCrossRefMATHGoogle Scholar
  92. [92]
    Jie Wu and Hailan Li, “Domination and its applications in ad hoc wireless networks with unidirectional links,” in Proc. of the International Conference on Parallel Processing 2000, 2000, pp. 189–197.Google Scholar
  93. [93]
    G. Chen, F. Garcia, J. Solano, and I. Stojmenovic, “Connectivity based k-hop clustering in wireless networks,” in CD Proc. IEEE Hawaii Int. Conf. System Science, 2002.Google Scholar
  94. [94]
    S. Basagni, “Distributed clustering for ad hoc networks,” in Proceedings of the IEEE International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN), 1999, pp. 310–315.CrossRefGoogle Scholar
  95. [95]
    S. Basagni, I. Chlamtac, and A. Farago, “A generalized clustering algorithm for peer-to-peer networks,” in Workshop on Algorithmic Aspects of Communication, 1997.Google Scholar
  96. [96]
    P. Bose, A. Brodnik, S Carlsson, E. D. Demaine, R. Fleischer, A. Lopez-Ortiz, P. Morin, and J. I. Munro, “Online routing in convex subdivisions,” in International Symposium on Algorithms and Computation, 2000, pp. 47–59.Google Scholar
  97. [97]
    Ivan Stojmenovic and Xu Lin, “Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 10, 2001.Google Scholar
  98. [98]
    S. Basagni, I. Chlamtac, V.R. Syrotiuk, and B.A. Woodward, “A distance routing effect algorithm for mobility (dream),” in Proceedings of ACM/IEEE MoNCom’98, 1998.Google Scholar
  99. [99]
    Z. Haas and B. Liang, “Ad-hoc mobility management with uniform quorum systems,” IEEE/ACM Transactions on Networking, vol. 7, no. 2, pp. 228–240, 1999.CrossRefGoogle Scholar
  100. [100]
    I. Stojmenovic, “A routing strategy and quorum based location update scheme for ad hoc wireless networks,” Tech. Rep. TR-99–09, Computer Science, SITE, University of Ottawa, 1999.Google Scholar
  101. [101]
    J. Li, J. Jannotti, D. De Couto, D. Karger, and R. Morris, “A scalable location service for geographic ad-hoc routing,” in Proceedings of the 6th ACM International Conference on Mobile Computing and Networking (MobiCom ‘00), 2000, pp. 120–130.Google Scholar
  102. [102]
    E. Kranakis, H. Singh, and J. Urrutia, “Compass routing on geometric networks,” in Proc. 11 th Canadian Conference on Computational Geometry, 1999, pp. 51–54.Google Scholar
  103. [103]
    P. Morin, Online routing in Geometric Graphs, Ph.D. thesis, Carleton University School of Computer Science, 2001.Google Scholar
  104. [104]
    P. Bose and P. Morin, “Competitive online routing in geometric graphs,” in Proceedings of the VIII International Colloquium on structural Information and Communication Complexity (SIROCCO 2001), 2001, pp. 35–44.Google Scholar
  105. [105]
    A. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca, “On the complexity of computing minimum energy consumption broadcast subgraphs,” in 18th Annual Symposium on Theoretical Aspects of Computer Science,LNCS 2010, 2001, pp. 121–131.Google Scholar
  106. A. Clementi, P. Penna, arid R. Silvestri, “On the power assignment problem in radio networks,” Electronic Colloquium on Computational Complexity, 2001, To approach. Preliminary results in APPROX’99 and STACS’2000.Google Scholar
  107. [107]
    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.MathSciNetCrossRefMATHGoogle Scholar
  108. [108]
    J. Wieselthier, G. Nguyen, and A. Ephremides, “On the construction of energy-efficient broadcast and multicast trees in wireless networks,” in Proc. IEEE INFOCOM 2000, 2000, pp. 586 - 594.Google Scholar
  109. [109]
    Peng-Jun Wan, G. Calinescu, Xiang-Yang Li, and Ophir Frieder, “Minimum-energy broadcast routing in static ad hoc wireless networks,” in IEEE Info-corn, 2001.Google Scholar
  110. [110]
    V. Chvátal, “A greedy heuristic for the set-covering problem,” Mathematics of Operations Research, vol. 4, no. 3, pp. 233–235, 1979.MathSciNetCrossRefMATHGoogle Scholar
  111. [111]
    Peng-Jun Wan, G. Calinescu, Xiang-Yang Li, and Ophir Frieder, “Minimum-energy broadcast routing in static ad hoc wireless networks,” ACM Wireless Networks, 2002, Preliminary version appeared in IEEE INFOCOM 2000.Google Scholar
  112. [112]
    T. J. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press and McGraw-Hill, 1990.Google Scholar
  113. [113]
    M. R. Garey and D. S. Johnson, Computers and Intractability, W.H. Freeman and Co., NY, 1979.MATHGoogle Scholar
  114. [114]
    Xiang-Yang Li, “Efncient local construction of low weight topology and its applications in broadcast for wireless networks,” 2002, Submitted for publication.Google Scholar
  115. [115]
    Gautam Das, Giri Narasimhan, and Jeffrey Salowe, “A new way to weigh malnourished euclidean graphs,” in ACM Symposium of Discrete Algorithms, 1995, pp. 215–222.Google Scholar
  116. [116]
    Gruia Cálinescu, Ion Mandoiu, Peng-Jun Wan, and Alexander Zelikovsky, “Selecting forwarding neighbors in wireless ad hoc networks,” in ACM DialM, 2001.Google Scholar
  117. [117]
    P. Gupta and P. R. Kumar, “Critical power for asymptotic connectivity in wireless networks,” Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, W. M. McEneaney, G. Yin, and Q. Zhang (Eds.), 1998.Google Scholar
  118. [118]
    Mathew Penrose, “On k-connectivity for a geometric random graph,” Random Structures and Algorithms, vol. 15, pp. 145–164, 1999.MathSciNetCrossRefMATHGoogle Scholar
  119. [119]
    B. Bollobás, Random Graphs, Cambridge University Press, 2001.Google Scholar
  120. [120]
    Mathew Penrose, “The longest edge of the random minimal spanning tree,” Annals of Applied Probability, vol. 7, pp. 340–361, 1997.MathSciNetCrossRefMATHGoogle Scholar
  121. [121]
    Mathew Penrose, “Extremes for the minimal spanning tree on normally distributed points,” Advances in Applied Probability, vol. 30, pp. 628–639, 1998.MathSciNetCrossRefMATHGoogle Scholar
  122. [122]
    Mathew Penrose, “A strong law for the longest edge of the minimal spanning tree,” Annals of Probability, vol. 27, pp. 246–260, 1999.MathSciNetCrossRefMATHGoogle Scholar
  123. [123]
    Matthias Grossglauser and David Tse, “Mobility increases the capacity of ad-hoc wireless networks,” in INFOCOMM, 2001, vol. 3, pp. 1360–1369.Google Scholar
  124. [124]
    P. Gupta and P. Kumar, “Capacity of wireless networks,” Tech. Rep., University of Illinois, Urbana-Champaign, 1999.Google Scholar
  125. [125]
    Olivier Dousse Patrick, “Connectivity in ad-hoc and hybrid networks,” in IEEE INFOCOM, 2002.Google Scholar
  126. [126]
    P. Hall, Introduction to the Theory of Coverage Processes, J. Wiley and Sons, New York, 1988.MATHGoogle Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • Xiang-Yang Li
    • 1
  1. 1.Department of Computer ScienceIllinois Institute of TechnologyChicagoUSA

Personalised recommendations