Name
Abstract | ||
|---|---|---|
Rapidly deployable wireless networks consist of mobile base stations and less powerful mobile hosts. The mobile base stations have to maintain wireless connectivity while on the move along pre-defined paths. Physical obstructions and wireless range limitations may prevent a pair of mobile base stations from establishing a wireless link. We study situations of distance-constrained mobility, and fault situations like distance and topology induced mobility deadlocks. We also propose a deadlock avoidance mobility scheme using repeaters, and derive an upper bound on the number of repeaters. We propose two heuristics, using sleeper nodes, for providing coverage to areas that may lose coverage due to a mobile base station crash. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/3-540-64359-1_741 | LECTURE NOTES IN COMPUTER SCIENCE |
Keywords | Field | DocType |
fault tolerant,base station,wireless network | Base station,Wireless network,Telecommunications network,Wireless,Computer science,Deadlock,Mobility model,Fault tolerance,Repeater,Distributed computing | Conference |
Volume | ISSN | Citations |
1388 | 0302-9743 | 1 |
PageRank | References | Authors |
0.41 | 6 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Charles Shields Jr | 1 | 2 | 1.47 |
| Vikas Jain | 2 | 70 | 13.89 |
| Simeon C. Ntafos | 3 | 599 | 98.18 |
| Ravi Prakash | 4 | 1 | 0.41 |
| S. Venkatesan | 5 | 1 | 0.41 |