DMCA
Efficient and Guaranteed Service Coverage in Partitionable Mobile Ad-Hoc (2002)
Cached
Download Links
- [www.eecg.toronto.edu]
- [www.ieee-infocom.org]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of IEEE INFOCOM 2002 |
| Citations: | 64 - 1 self |
BibTeX
@INPROCEEDINGS{Wang02efficientand,
author = {Karen H. Wang and Baochun Li},
title = {Efficient and Guaranteed Service Coverage in Partitionable Mobile Ad-Hoc},
booktitle = {In Proceedings of IEEE INFOCOM 2002},
year = {2002},
pages = {1089--1098}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In wireless ad-hoc networks, the network topology changes dynamically and unpredictably due to node mobility. Such topological dynamics are further exacerbated by the natural grouping behavior in mobile user's movement, which leads to frequent network partitioning. Network partitioning poses significant challenges to the provisioning of centralized services in adhoc networks, since the partitioning disconnects many mobile users from the central server. In this paper, we propose a collection of novel run-time algorithms that adaptively ensure the centralized service is available to all mobile nodes during network partitioning, while minimizing the number of servers required. The network-wide service coverage is achieved by partition prediction and service replication on the servers, and assisted by distributed service selection on regular mobile nodes. Simulation results show that our algorithms efficiently achieve guaranteed service coverage to all nodes. To the best of our knowledge, there have been no similar approaches that use partition prediction to adaptively provision centralized service in partitionable mobile ad-hoc networks.
Keyphrases
partitionable mobile ad-hoc guaranteed service coverage partition prediction centralized service mobile user topological dynamic regular mobile node wireless ad-hoc network adhoc network network topology change provision centralized service network partitioning pose significant challenge mobile node service replication distributed service selection novel run-time algorithm service coverage natural grouping behavior simulation result partitionable mobile ad-hoc network central server similar approach network-wide service coverage disconnect many mobile user
