Fault tolerant mobility planning for rapidly deployable wireless networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1388, Issue , 1998, Pages 770-789

  Shields, Charles ^a   Jain, Vikas ^a   Ntafos, Simeon ^a   Prakash, Ravi ^a   Venkatesan, S ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BASE STATIONS; MOBILE TELECOMMUNICATION SYSTEMS;

DEADLOCK AVOIDANCE; FAULT-TOLERANT; INDUCED MOBILITY; MOBILE BASE STATION; MOBILITY SCHEMES; UPPER BOUND; WIRELESS CONNECTIVITIES; WIRELESS LINK;

WIRELESS NETWORKS;

EID: 84947484125     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64359-1_741     Document Type: Conference Paper

References (9)

1. D. Crass, I. Suzuki, and M. Yamashita. Searching for a mobile intruder in a corridorthe open edge variant of the polygon search problem. International Journal of Computational Geometry and Applications, 5(4):397-412, 1995.
2. J. Deogun and T. Saxasamma. On the Minimum Co-operative Guard Problem. Journal of Combinatorial Mathematics and Combinatorial Computing, 22:149-170, 1996.
3. G. H. Forman and J. Zahorjan. The Challenges of Mobile Computing. IEEE Computer, 27(4):38-47, April 1994.
4. P.J. Heffernan. An optimal algorithm for the two-guard problem. International Journal of Computational Geometry and Applications, 6(1):15-44, 1996.
5. C. Icking and R. Klein. The Two Guards Problem. International Journal of Computational Geometry and Applications, 2(3):257-285, 1992.
6. B.-C. Liaw, N.F. Huang, and R.C.T. Lee. The Minimum Cooperative Guards Problem on k-Spiral Polygons. Proceedings of the Fifth Canadian Conference on Computational Geometry, pages 97-102, Aug 1993.
7. S. Ntafos. Watchman Routes under Limited Visibility. Computational Geometry: Theory and Applications, 3:149-170, 1991.
8. S. Ntafos and C. Wei-Pang. Optimum Watchman Routes. Information Processing Letters, 28(1):39-44, 1988.
9. J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, 1987.