Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
IEEE Transactions on Parallel and Distributed Systems
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
SAINT '05 Proceedings of the The 2005 Symposium on Applications and the Internet
Weighted waypoint mobility model and its impact on ad hoc networks
ACM SIGMOBILE Mobile Computing and Communications Review
On greedy construction of connected dominating sets in wireless networks: Research Articles
Wireless Communications & Mobile Computing - RRM for Next-Generation Wireless and Mobile Communication Systems
International Journal of Interdisciplinary Telecommunications and Networking
| Hi-index | 0.00 |
The connected dominating set (CDS) has been generally used for routing and broadcasting in mobile ad hoc networks (MANETs). To reduce the cost of routing table maintenance, it is preferred that the size of CDS to be as small as possible. A number of protocols have been proposed to construct CDS with competitive size, however only few are capable of maintaining CDS under topology changes. In this research, we propose a novel extended mobility handling algorithm which will not only shorten the recovery time of CDS mobility handling but also keep a competitive size of CDS. Our simulation results validate that the algorithm successfully achieves its design goals. In addition, we will introduce an analytical model for the convergence time and the number of messages required by the CDS construction.