Fault tolerant deployment and topology control in wireless ad hoc networks

Wireless Communications and Mobile Computing

Volumn 4, Issue 1, 2004, Pages 109-125

  Li, Xiang Yang ^a   Wan, Peng Jun ^a   Wang, Yu ^a   Yi, Chih Wei ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

Connectivity; Fault tolerance; Topology control; Wireless ad hoc networks

Indexed keywords

COMPUTER SIMULATION; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS; MOBILE TELECOMMUNICATION SYSTEMS; NETWORK PROTOCOLS; POISSON DISTRIBUTION; PROBABILITY; RANDOM PROCESSES; RESOURCE ALLOCATION; SIGNAL PROCESSING; TELECOMMUNICATION LINKS; TOPOLOGY; TREES (MATHEMATICS);

CONNECTIVITY; SPANNING TREE; TOPOLOGY CONTROL; WIRELESS AD HOC NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 13244259360     PISSN: 15308669     EISSN: None     Source Type: Journal    
DOI: 10.1002/wcm.161     Document Type: Article

References (39)

1. 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, 3rd int. Workshop on Discrete Algorithms and methods for mobile computing and communications, 1999; 48-55.
2. 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, 3rd int. Workshop on Discrete Algorithms and methods for mobile computing and communications, 1999; 48-55.
3. Chlamtac I, Farago A. A new approach to design and analysis of peer to peer mobile networks. Wireless Networks 1999; 5: 149-156.
4. Das S, Perkins C, Royer E. Performance comparison of two on-demand routing protocols for ad hoc networks. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM) March 2000.
5. Li X-Y, Calinescu G, Wan P-J. Distributed construction of planar spanner and routing for ad hoc wireless networks. 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), Vol. 3, 2002.
6. Stojmenovic I, Lin X. Loop-free hybrid single-pathflooding routing algorithms with guaranteed delivery for wireless networks. IEEE Transactions on Parallel and Distributed Systems 2001; 12(10): 1023-1032.
7. Ko Y-B, Vaidya NH. Using location information to improve routing in ad hoc networks. Technical Report, Department of Computer Science, Texas A&M University, 1997.
8. Maltz D, Broch J, Jetcheva J, Johnson D. The effects of ondemand behavior in routing protocols for multi-hop wireless ad hoc networks. IEEE JSAC, 1999.
9. Johnson DB, Maltz DA. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, Vol. 353, Tomasz Imielinski, Henry F. Korth (eds). Kluwer Academic Publishers: Boston, 1996.
10. Perkins C. Ad-hoc on-demand distance vector routing. In MILCOM'97, November 1997; 6(2): 46-55.
11. Royer E, Toh C. A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Personal Communications 1999; 1(2).
12. Ramanathan S, Steenstrup M. A survey of routing techniques for mobile communication networks. ACM/Baltzer Mobile Networks and Applications 1996; 89-104.
13. Wang Y, Li X-Y. Geometric spanners for wireless ad hoc networks. In Proceedings of 22nd IEEE International Conference on Distributed Computing Systems (ICDCS) 2002.
14. Zaruba GV, Basagni S, Chlamtac I. Bluetrees-scatternet formation to enable bluetooth based ad hoc networks. In Proceedings of IEEE ICC 2001.
15. Ramanathan R, Rosales-Hain R. Topology control of multihop wireless networks using transmit power adjustment. In IEEE INFOCOM 2000.
16. 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.
17. Gupta P, Kumar PR. Critical power for asymptotic connectivity in wireless networks. In Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming, W. M. McEneaney, G. Yin, and Q. Zhang (eds.). 1998.
18. Penrose M. The longest edge of the random minimal spanning tree. Annals of Applied Probability 1997; 7: 340-361.
19. Bollobás B. Random Graphs. Cambridge University Press: Cambridge, UK, 2001.
20. Penrose M. On k-connectivity for a geometric random graph. Random Structures and Algorithms 1999; 15: 145-164.
21. Dette H, Henze N. Some peculiar boundary phenomena for extremes of rth nearest neighbor links. Statistics & Probability Letters 1990; 10: 381-390.
22. Penrose M. Extremes for the minimal spanning tree on normally distributed points. Advances in Applied Probability 1998; 30: 628-639.
23. Penrose M. A strong law for the longest edge of the minimal spanning tree. Annals of Probability 1999; 27: 246-260.
24. Bettstetter C. On the minimum node degree and connectivity of a wireless multihop network. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (Mobi-Hoc '02) June 2002.
25. Blough DM, Leoncini M, Resta G, Santi P. On the symmetric range assignment problem in wireless ad hoc networks. Proceedings of 2nd IFIP International Conference on Theoretical Computer Science 2002.
26. Grossglauser M, Tse D. Mobility increases the capacity of ad-hoc wireless networks. INFOCOM 2001; 3: 1360-1369.
27. Gupta P, Kumar P. Capacity of wireless networks. Technical Report, University of Illinois: Urbana-Champaign, 1999.
28. Patrick OD. Connectivity in ad-hoc and hybrid networks. IEEE INFOCOM 2002; 1268-1277.
29. Santi P, Blough DM. An evaluation of connectivity in mobile wireless ad hoc networks. Proceedings of IEEE DSN 2002; 89-98.
30. Xue F, Kumar PR. The number of neighbors needed for connectivity of wireless networks. 2002. Wireless Networks, to appear 2004.
31. Hall P. Introduction to the Theory of Coverage Processes. J. Wiley and Sons: New York, 1988.
32. Lukovszki T. New results of fault tolerant geometric spanners. In Workshop on Algorithms and Data Structures 1999; 193-204.
33. Yao AC-C. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Computing 1982; 11: 721-736.
34. Li X-Y, Wan P-J, Wang Y, Frieder O. Sparse power efficient topology for wireless networks. In IEEE Hawaii International Conference on System Sciences (HICSS) 2002.
35. Li X-Y, Wan P-J, Wang Y. Power efficient and sparse spanner for wireless ad hoc networks. In IEEE International Conference on Computer Communications and Networks (ICCCN01) 2001; 564-567.
36. Wang Y, Li X-Y, Frieder O. Distributed spanner with bounded degree for wireless networks. International Journal of Foundations of Computer Science, 2002; 14(2): 183-200.
37. Lukovszki T. New Results on Geometric Spanners and Their Applications, Ph.D. thesis, University of Paderborn, 1999.
38. Bahramgiri M, Hajiaghayi MT, Mirrokni VS. Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks. In Proceedings of the 11th Annual IEEE Intemation Conference on Computer Communications and Networks (ICCCN) 2002; 392-397.
39. Goldberg A, Rao S. Flows in undirected unit capacity networks. Technical Report 97-103, NEC Research Institute, Inc., 1997.