Algorithmic, geometric and graphs issues in wireless networks

Wireless Communications and Mobile Computing

Volumn 3, Issue 2, 2003, Pages 119-140

  Li, Xiang Yang ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

Computational geometry; Network optimization; Power consumption; Routing; Spanner; Topology control; Wireless networks

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BROADCASTING; COMPUTATIONAL GEOMETRY; GLOBAL POSITIONING SYSTEM; MULTICASTING; OPTIMIZATION; SIGNAL RECEIVERS; TOPOLOGY; WIRELESS TELECOMMUNICATION SYSTEMS;

NETWORK OPTIMIZATION; POWER CONSUMPTION; ROUTING; SPANNER; TOPOLOGY CONTROL; WIRELESS NETWORKS;

COMPUTER NETWORKS;

EID: 1942475721     PISSN: 15308669     EISSN: None     Source Type: Journal    
DOI: 10.1002/wcm.107     Document Type: Review

References (101)

1. Capkun S, Hamdi M, Hubaux JP. Ops-free positioning in mobile ad-hoc networks. In Proc. Hawaii International Conference on System Sciences, 2001.
2. Preparata FP, lan Shamos M. Computational Geometry: An Introduction. Springer-Verlag: 1985.
3. Edelsbrunner H. Algorithms in Combinatorial Geometry. Springer-Verlag, 1987.
4. George P-L, Borouchaki H. Delaunay Triangulations and Meshing. HERMES, 1998.
5. Sinha P, Sivakumar R, Bharghavan V. Cedar: core extraction distributed ad hoc routing. In Proc. of IEEE INFOCOMM '99, 1999.
6. Das B, Bharghavan V. Routing in ad-hoc networks using minimum connected dominating sets. In 1997 IEEE International Conference on Communications (ICC '97), Vol. 1, 1997; pp. 376-380.
7. Wu J, Li H. A dominating-set-based routing scheme in ad hoc wireless networks. The Special Issue on Wireless Networks in the Telecommunication Systems Journal 2001; 3: 63-84.
8. Stojmenovic I, Seddigh M, Zunic J. Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems 2002; 13(1): 14-25.
9. Alzoubi KM, Wan P-J, Frieder O. New distributed algorithm for connected dominating set in wireless ad hoc networks. In HICSS, Hawaii, 2002.
10. Wan P-J, Alzoubi KM, Frieder O. Distributed construction of connected dominating set in wireless ad hoc networks. In INFOCOM, 2002.
11. Wang Yu, Li X-Y. Geometric spanners for wireless ad hoc networks. In Proc. of 22nd IEEE International Conference on Distributed Computing Systems (ICDCS), 2002; to appear.
12. Royer E, Toh C. A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Personal Communications 1999; 6(2): 46-55.
13. Perkins CE, Bhagwat P. Highly dynamic destination-sequenced distance-vector routing (dsdv) for mobile computers. Computer Communications Review 1994; October: 234-244.
14. Joa-Ng M, Lu I-T. A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks. IEEE Journal on Selected Areas in Communication 1999; 17(8): 1415-1425.
15. Haas ZJ, Pearlman MR. The zone routing protocol(zrp) for ad hoc networks. Internet Draft - Mobile Ad Hoc NETworking (MANET). Working Group of the Internet Engineering Task Force (IETF), November 1997.
16. Perkins CE, EM 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.
17. Broch J, Johnson D, Maltz D. The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks. 1998.
18. Park VD, Corson MS. A highly adaptive distributed routing algorithm for mobile wireless networks. In Proceedings of IEEE INFOCOM, 1997.
19. Toh C-K. A novel distributed routing protocol to support ad-hoc mobile networks. In Proc. 1996 IEEE 15th Annual International Phoenix Conference on Computers and Communications, March 1996; pp. 480-486.
20. Chiang CC. Routing in clustered multihop, mobile wireless networks with fading channel. In Proceedings of IEEE SICON '97, April 1997; pp. 197-211.
21. Pei G, Gerla M, Chen T-W. Fisheye state routing: a routing scheme for ad hoc wireless networks. In Proceedings of ICC 2000, New Orleans, LA, 2000.
22. Pei G, Gerla M, Chen T-W. Fisheye state routing in mobile ad hoc networks. In Proceedings of Workshop on Wireless Networks and Mobile Computing, Taipei, Taiwan, April 2000.
23. Iwata A, Chiang C-C, Pei G, Gerla M, Chen T-W. Scalable routing strategies for ad hoc wireless networks. JSAC99, IEEE Journal on Selected Areas in Communications 1999; 17(8): 1369-1379.
24. Lin J-C, Yang S-N, Chern M-S. An efficient distributed algorithm for minimal connected dominating set problem. In Proc. of the 10th Annual International Phoenix Conference on Computers and Communications 1991, 1991; pp. 204-210.
25. Wu J, Dai F, Gao M, Stojmenovic I. On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. IEEE/KICS Journal of Communication and Networks 2002; 4(1): 59-70.
26. Mauve M, Widmer J, Harenstein H. A survey on position-based routing in mobile ad hoc networks. IEEE Network Magazine 2001; 15(6): 30-39.
27. Toussaint GT. The relative neighborhood graph of a finite planar set. Pattern Recognition 1980; 12(4): 261-268.
28. Gabriel KR, Sokal RR. A new statistical approach to geographic variation analysis. Systematic Zoology 1969; 18: 259-278.
29. Lukovszki T. New Results on Geometric Spanners and their Applications. Ph.D. Thesis, University of Paderborn, Paderborn, 1999.
30. Gabow HN, Bently JL, Tarjan RE. Scaling and related techniques for geometry problems. In ACM Symposium on Theory of Computing, 1984; pp. 135-143.
31. Katajainen J. The region approach for computing relative neighborhood graphs in the Ip metric. Computing 1988; 40: 147-161.
32. Yao ACC. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal of Computing 1982; 11: 721-736.
33. Bose P, Morin P, Stojmenovic I, Urrutia J. Routing with guaranteed delivery in ad hoc wireless networks. ACM/ Kluwer Wireless Networks 2001; 7(6): 609-616.
34. Stojmenovic I, Lin X. Power-aware localized routing in wireless networks. In IEEE International Parallel and Distributed Processing Symposium, 2000.
35. Datta S, Stojmenovic I, Wu J. Internal node and shortcut based routing with guaranteed delivery in wireless networks. Cluster Computing 2002; 5(2): 169-178.
36. Stojmenovic I, Datta S. Power and cost aware localized routing with guaranteed delivery in wireless networks. In Proc. Seventh IEEE Symposium on Computers and Communications ISCC, 2002.
37. Karp B, Kung HT, Gpsr: greedy perimeter stateless routing for wireless networks. In ACM/IEEE International Conference on Mobile Computing and Networking, 2000.
38. Seddigh M, Gonzalez JS, Stojmenovic I. Rng and internal node based broadcasting algorithms for wireless one-to-one networks. ACM Mobile Computing and Communications Review 2002; 5(2): 37-44.
39. Arya S, Das G, Mount DM, Salowe JS, Smid M. Euclidean spanners. In Proceedings of the Twenty-Seventh Annual ACM symposium on Theory of computing, 1995.
40. Arya S, Das G, Mount D, Salowe J, Smid M. Euclidean spanners: short, thin, and lanky. In Proc. 27th ACM STOC, 1995; pp. 489-498.
41. Arya S, Smid M. Efficient construction of a bounded degree spanner with low weight. In Proc. 2nd Annual European Symposium Algorithms (ESA), Volume 855 of Lecture Notes in Computer Science, 1994; pp. 48-59.
42. Bose P, Devroye L, Evans W, Kirkpatrick D. On the spanning ratio of gabriel graphs and beta-skeletons. In Proceedings of the Latin American Theoretical Infocomatics (LATIN), 2002.
43. Chandra B, Das G, Narasimhan G, Scares J. New sparseness results on graph spanners. In Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992.
44. Das G, Narasimhan G. A fast algorithm for constructing sparse euclidean spanners. In Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994.
45. Karavelas MI, Guibas LJ. Static and kinetic geometric spanners with applications. In Proceeding of the Twelfth Annual Symposium on Discrete Algorithms, 2001; pp. 168-176.
46. Levcopoulos C, Narasimhan G, Smid M. Efficient algorithms for constructing fault-tolerant geometric spanners. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998.
47. Li X-Y, Wan P-J, Wang Yu. Power efficient and sparse spanner for wireless ad hoc networks. In IEEE International Conference on Computer Communications and Networks (ICCCN '01), 2001; pp. 564-567.
48. Li X-Y, Wan P-J, Wang Yu, Frieder O. Sparse power efficient topology for wireless networks. In IEEE Hawaii International Conference on System Sciences (HICSS), 2002.
49. Wattenhofer R, Li Li, Bahl P, Wang Y-M. Distributed topology control for wireless multihop ad-hoc networks. In IEEE INFOCOM '01, 2001.
50. U Li, Halpern JY, Bahl P, Wang Y-M, Wattenhofer R. Analysis of a cone-based distributed topology control algorithms for wireless multi-hop networks. In ACM Symposium on Principle of Distributed Computing (PODC), 2001.
51. Wang Yu, Li X-Y. 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.
52. Hunt III HB, Marathe MV, Radhakrishnan V, Ravi SS, Rosenkrantz DJ, Steams RE. NC-approximation schemes for NP- and PSPACE -hard problems for geometric graphs. Journal of Algorithms 1999; 26(2): 238-274.
53. Grünewald M, Lukovszki T, Schindelhauer C, Volbert K. Distributed Maintenance of Resource Efficient Wireless Network Topologies, 2002; Submitted for publication.
54. Li X-Y, Calinescu G, Wan P-J. Distributed construction of planar spanner and routing for ad hoc wireless networks. In 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), Vol. 3, 2002.
55. Keil JM, Gutwin CA. Classes of graphs which approximate the complete euclidean graph. Discreet Computational Geometry 1992; 7: 13-28.
56. Li X-Y, Stojmenovic I, Partial Delaunay Triangulation and Degree Limited Localized Bluetooth Scatternet Formation, 2002; AdHocNow.
57. Gao J, Guibas LJ, Hershburger J, Zhang L, Zhu A. Geometric spanner for routing in mobile networks. In Proceedings of the 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc '01), 2001.
58. Monks J, Bharghavan V, Hwu W-M. Transmission power control for multiple access wireless packet networks. In IEEE Conference on Local Computer Networks (LCN), 2000.
59. Ramanathan R, Rosales-Hain R. Topology control of multihop wireless networks using transmit power adjustment. In IEEE INFOCOM, 2000.
60. Sanchez M, Manzoni P, Haas Z. Determination of critical transmission range in ad-hoc networks. In Multiaccess, Mobility and Teletraffic for Wireless Communications (MMT '99), 1999.
61. Li X-Y. Efficient Power Control in Wireless Ad Hoc Networks, 2002; Manuscript.
62. Faloutsos M, Molle M. Creating Optimal Distributed Algorithms for Minimum Spanning Trees. Technical Report CSRI-327 (also submitted in WDAG '95), 1995.
63. Gallager R, Humblet P, Spira P. A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems 1983; 5(1): 66-77.
64. Garay JA, Kutten S, Peleg D. A sub-linear time distributed algorithms for minimum-weight spanning trees. In Symposium on Theory of Computing, 1993; pp. 659-668.
65. Kirousis L, Kranakis E, Krizanc D, Pelc A. Power consumption in packet radio networks. In Symposium on Theoretical Aspects of Computer Science (STACS) '97, 1997.
66. Clementi AEF, Penna P, Silvestri R. On the Power Assignment Problem in Radio Networks, 2000.
67. Clementi A, Penna P, Silvestri R. The power range assignment problem in radio networks on the plane. In XVII Symposium on Theoretical Aspects of Computer Science (STACS '00), LNCS(1770), 2000; pp. 651-660.
68. Clementi A, Penna P, Silvestri R. Hardness results for the power range assignment problem in packet radio networks. In II International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM/APPROX '99), LNCS(1671), 1999; pp. 197-208.
69. Cǎlinescu G, Mandoiu I, Zelikovsky A. Symmetric connectivity with minimum power consumption in radio networks. In IFIP-TCS, 2002; to appear.
70. Guha S, Khuller S. Approximation algorithms for connected dominating sets. In European Symposium on Algorithms, 1996; pp. 179-193.
71. Robins G, Zelikovsky A. Improved steiner tree approximation in graphs. In Proceedings of ACM/S1AM Symposium on Discrete Algorithms, 2000; pp. 770-779.
72. Hunt HB, Marathe MV, Radhakrishnan V, Ravi S, Rosenkrantz DJ, Stearns RE. Ne-approximation schemes for np and pspace hard problems for geometric graphs. Journal of Algorithms 1998; 26: 238-274.
73. Marathe MV, Breu H, Hunt III HB, Ravi SS, Rosenkrantz DJ. Simple heuristics for unit disk graphs. Networks 1995; 25: 59-68.
74. Hochbaum DS, Maass W. Approximation schemes for covering and packing problems in image processing and vlsi. Journal of ACM 1985; 32: 130-136.
75. Herman P, Purer M, Zelikovsky A. Applications of Matroid Parity Problem to Approximating Steiner Trees, Tech. Rep. 980021, Computer Science, UCLA, 1998.
76. Alzoubi KM. Virtual Backbone in Wireless Ad Hoc Networks. Ph.D. Thesis, Illinois Institute of Technology, IL, 2002.
77. Cheng X. A Polynomial Time Approximation Algorithm for Connected Dominating Set Problem in Wireless Ad Hoc Networks. 2002.
78. Lin CR, Gerla M. Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications 1997; 15(7): 1265-1275.
79. Chlamtac I, Farago A. A new approach to design and analysis of peer to peer mobile networks. Wireless Networks 1999; 5: 149-156.
80. Amis AD, Prakash R, Huynh D, Vuong T. Max-min d-cluster formation in wireless ad hoc networks. In Proc. of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM, Vol. 1, 2000; pp. 32-41.
81. Amis AD, Prakash R, Load-balancing clusters in wireless ad hoc networks. In Proc. of the 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology, 2000.
82. Jia L, Rajaraman R, Suel T. An efficient distributed algorithm for constructing small dominating sets. In ACM PODC, 2000.
83. Sivakumar R, Das B, Bharghavan V. An improved spinebased infrastructure for routing in ad hoc networks. In IEEE Symposium on Computers and Communications, Athens, Greece, June 1998.
84. Chvatal V. A greedy heuristic for the set-covering problem. Mathematics of Operation Research 1979; 4(3): 233-235.
85. Wu J, Li H. 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.
86. Chen G, Garcia F, Solano J, Stojmenovic I. Connectivity based k-hop clustering in wireless networks. In CD Proc. IEEE Hawaii International Conference on System Science, 2002.
87. Basagni S. 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.
88. Basagni S, Chlamtac I, Farago A. A generalized clustering algorithm for peer-to-peer networks. In Workshop on Algorithmic Aspects of Communication, 1997.
89. Clementi A, Crescenzi P, Penna P, Rossi G, Vocca P. 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.
90. Clementi A, Penna P, Silvestri R. On the power assignment problem in radio networks. In Electronic Colloquium on Computational Complexity, 2001; to approach, preliminary results in APPROX '99 and STACS 2000.
91. Clementi A, Penna P, Silvestri R. On the power assignment problem in radio networks. In Electronic Colloquium on Computational Complexity, 2001; to approach, preliminary results in APPROX '99 and STACS 2000.
92. Kirousis LM, Kranakis E, Krizanc D, Pelc A. Power consumption in packet radio networks. Theoretical Computer Science 2000; 243: 289-305.
93. Wieselthier J, Nguyen G, Ephremides A. On the construction of energy-efficient broadcast and multicast trees in wireless networks. In Proc. IEEE INFOCOM 2000, 2000; pp. 586-594.
94. Wan P-J, Calinescu G, Li X-Y, Frieder O. Minimum-energy broadcast routing in staue ad hoc wireless networks. In IEEE Infocom, 2001.
95. Chvátal V, A greedy heuristic for the set-covering problem. Mathematics of Operations Research 1979; 4(3): 233-235.
96. Wan P-J, Calinescu G, Li X-Y, Frieder O. Minimum-energy broadcast routing in static ad hoc wireless networks. ACM Wireless Networks 2002; 8(6): 607-617. Preliminary version appeared in IEEE INFOCOM 2000.
97. Wan P-J, Calinescu G, Li X-Y, Frieder O. Minimum-energy broadcast routing in static ad hoc wireless networks. ACM Wireless Networks 2002; 8(6): 607-617. Preliminary version appeared in IEEE INFOCOM 2000.
98. Cormen TJ, Leiserson CE, Rivest RL. Introduction to Algorithms. MIT Press, McGraw-Hill: New York, 1990.
99. Garey MR, Johnson DS. Computers and Intractability. W. H. Freeman: New York, 1979.
100. Cǎlinescu G, Mǎndoiu I, Wan P-J, Zelikovsky A. Selecting forwarding neighbors in wireless ad hoc networks. In ACM DialM, 2001.
101. Calinescu G. Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks. 2002; submitted for publication.