A reliable virtual backbone scheme in mobile ad-hoc networks

2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems

Volumn , Issue , 2004, Pages 60-69

  Min, Manki ^a   Wang, Feng ^a   Du, Ding Zhu ^a   Pardalos, Panos M ^b  

^a University of Minnesota   (United States)

^b University of Florida   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ASYNCHRONOUS GENERATORS; GRAPHIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; PROXIMITY SENSORS; SENSORS; TIME DIVISION MULTIPLE ACCESS;

AD-HOC NETWORKS; BACKBONE STRUCTURES; COMMUNICATION COSTS; NODE MOBILITY;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 20344362914     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. K. Alzoubi, X.-Y. Li, Y. Wang, P.-J. Wan and O. Frieder, Geometric Spanners for Wireless Ad Hoc Networks, IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 5, 2003, pp. 408-421.
2. C. Bettstetter, Smooth is Better than Sharp: A Random Mobility Model for Simulation of Wireless Networks, Proc. of 4th ACM International Workshop on Modeling, Analysis, and Simulation of Wireless and Mobile Systems, 2001, vol. 5, no. 3.
3. C. Bettstetter, G. Resta and P. Santi, The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks, IEEE Transactions on Mobile Computing, vol. 2, no. 3, 2003, pp. 257-269.
4. M. Cardei, X. Cheng, X. Cheng and D.-Z. Du, Connected Domination in Multihop Ad Hoc Wireless Networks, 6th International Conference on Computer Science and Informatics, March 2002, North Carolina, USA
5. X. Cheng, X. Huang, D. Li and D.-Z.- Du, Polynomial-Time Approximation Scheme for Minimum Connected Dominating Set in Ad Hoc Wireless Networks, Technical Report TR02-003, Computer Science and Engineering Department, Univ. of Minnesota, 2002
6. I. Cidon and O. Mokryn, Propagation and Leader Election in a Multihop Broadcast Environment, Proc. of 12th International Symposium on Distributed Computing, 1998, 104-119.
7. B. N. Clark, C. J. Colbourn and D. S. Johnson, Unit Disk Graphs, Discrete Mathematics, 86 (1990), pp. 165-177.
8. T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, pp. 974-978, the MIT press, 1990.
9. B. Das and V. Bharghavan, Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets, Proc. of International Conference on Communication, 1997, pp. 376-380.
10. R. G. Gallager, P. A. Humblet and P. N. Spiram, A Distributed Algorithm for Minimum-Weight Spanning Trees, ACM Transactions on Programming Languages and Systems, 5 (1983), pp. 66-77.
11. S. Guha and S. Khuller, Approximation Algorithms for Connected Dominating Sets, Proc. of European Symposium on Algorithms, 1996, pp. 179-193.
12. D.B. Johnson and D.A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks, Mobile Computing, 1996, pp. 153-181.
13. S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen and J.-P. Sheu, The broadcast storm problem in a mobile ad hoc network, Proc. of MOBICOM, Seattle, Aug. 1999, pp. 151-162.
14. P. Sinha, R. Sivakumar and V. Bharghavan, Enhancing Ad hoc Routing with Dynamic Virtual Infrastructures, Proc. of Infocom, 3 (2001), pp. 1763-1772.
15. I. Stojmenovic, M. Seddigh and J. Zunic, Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks, Proc. of IEEE Hawaii International Conference on System Sciences, January 2001.
16. P.-J. Wan, K. M. Alzoubi and O. Frieder, Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks, Proc. of Infocom, 3 (2002), pp. 1597-1604.
17. '[17] J. Wu and H. L. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proc. of the 3rd ACM international workshop on Discrete algorithms and methods for mobile computing and communications, 1999, pp. 7-14.
18. J. Yoon, M. Liu and B. Noble, Random Waypoint Considered Harmful, Proc. of Infocom, 2003, pp. 1312-1321.