Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A probabilistic analysis for the range assignment problem in ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
DDR: distributed dynamic routing algorithm for mobile ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
A minimum-energy path-preserving topology-control algorithm
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Kinetic mobility management applied to vehicular ad hoc network protocols
Computer Communications
KEPPAN: Knowledge exploitation for proactively-planned ad-hoc networks
Journal of Network and Computer Applications
An adaptive MST-based topology connectivity control algorithm for wireless ad-hoc networks
International Journal of Communication Networks and Distributed Systems
AINTEC'05 Proceedings of the First Asian Internet Engineering conference on Technologies for Advanced Heterogeneous Networks
Hi-index | 0.00 |
While most topology control protocols only address limited network mobility, we propose in this paper a quasi-localized topology control algorithm that considers mobility predictions in order to construct and maintain a power efficient topology without relying on periodic beacons. Indeed, a node is capable of extracting linear trajectories of its neighboring nodes based on their positions and velocities. Based on such information, a node obtains a local prediction of neighborhood evolution and can thereafter proactively adapt the topology without relying on periodic beacons. Maintenance is driven on a per-event basis. It is therefore only when a node changes course that messages are exchanged in order to adapt the structure. Our approach is able to create and keep a stable kinetic backbone at a linear message and time complexity. It also improves concurrent communications by providing a significant reduction on local power assignments, therefore reducing interferences, increasing battery life and improving the overall network lifespan.