Selecting forwarding neighbors in wireless ad hoc networks

Mobile Networks and Applications

Volumn 9, Issue 2, 2004, Pages 101-111

  Cǎlinescu, Gruia ^a   Mǎndoiu, Ion I ^b   Wan, Peng Jun ^a   Zelikovsky, Alexander Z ^c  

^a Illinois Institute of Technology   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c GEORGIA STATE UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Broadcast; Disk cover; Unit disk graphs; Wireless ad hoc networks

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BROADCASTING; HEURISTIC METHODS; OPTIMIZATION; REDUNDANCY;

APPROXIMATION ALGORITHMS; FORWARDING NEIGHBORS; TIME ALGORITHMS; WIRELESS AD HOC NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 12144286935     PISSN: 1383469X     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:MONE.0000013622.63511.57     Document Type: Article

References (19)

1. J. Broch, D.B. Johnson and D.A. Maltz, The Dynamic Source Routing Protocol for mobile ad hoc networks, IETF Internet Draft, draft-ietfmanet-dsr-05.ts (March 2001).
2. H. Bronnimann and M.T. Goodrich, Almost optimal set covers in finite VC-dimension, in: Proc. of 10th ACM Symp. on Computational Geometry (SCG) (1994) pp. 293-302.
3. G. Calinescu, I. Mandoui, P.-J. Wan and A. Zelikovsky, Selecting forwarding neighbors in wireless ad hoc networks, in: Proc. of 5th International Workshop on Discrete Algorithms and Methods for Mobility (2001) pp. 34-43.
4. V. Chvátal, A greedy heuristic for the set-covering problem, Mathematics of Operation Research 4(3) (1979) 233-235.
5. B.N. Clark, C.J. Colbourn and D.S. Johnson, Unit disk graphs, Discrete Mathematics 86 (1990) 165-177.
6. W.J. Cook, W.H. Cunningham, W.R. Pulleyblank and A. Schrijver, Combinatorial Optimization (Wiley-Interscience, 1998).
7. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (McGraw Hill, 1990).
8. J.E. Goodman and J. O'Rourke (eds.), Handbook of Discrete and Computational Geometry (CRC Press, 1997).
9. Z.J. Haas, M.R. Pearlman and P. Samar, The Interzone Routing Protocol (IERP) for ad hoc networks, IETF Internet Draft, draft-ietf-manetzone-ierp-00.txt (January 2001).
10. D.S. Hochbaum and W. Maass, Approximation schemes for covering and packing problems in imageprocessing and VLSI, Journal of the ACM 32(1) (1985) 130-136.
11. H.B. Hunt III, M.V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz and R.E. Stearns, NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs, Journal of Algorithms 26(2) (1998) 238-274.
12. P. Jacquet, P. Muhlethaler, A. Qayyum, A. Laouiti, L. Viennot and T. Clausen, Optimized Link State Routing Protocol, IETF Internet Draft, draft-ietf-manet-olsr-04.txt (March 2001).
13. A. Qayyum, L. Viennot and A. Laouiti, Multipoint Relaying: An efficient technique for flooding in mobile wireless networks, in: Proc. of 35th Annual Hawaii International Conference on System Sciences (HICSS 2002) (2002).
14. M.V. Marathe, H. Breu, H.B. Hunt III, S.S. Ravi and D.J. Rosenkrantz, Simple heuristics for unit disk graphs, Networks 25 (1995) 59-68.
15. B.M.E. Moret and H.D. Shapiro, Algorithms from P to NP, Vol. I: Design and Efficiency (Benjamin/Cummings, 1991).
16. S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen and J.-P. Sheu, The Broadcast Storm problem in a mobile ad hoc network, in: Proc. of 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (1999) pp. 151-162.
17. C.E. Perkins, E.M. Royer and S. Das, Ad Hoc On Demand Distance Vector (AODV) routing, IETF Internet Draft, draft-ietf-manet-aodv-09.txt (March 2001).
18. G. Ramalingan and C. Pandi Rangan, A unified approach to domination problems in interval graphs, Information Processing Letters 27 (1988) 271-274.
19. P. Sinha, R. Sovakumar and B. Vaduvur, Enhancing ad hoc routing with dynamic virtual infrastructures, in: Proc. of IEEE INFOCOM (2001) pp. 1763-1772.