On-line coloring of sparse random graphs and random trees
Journal of Algorithms
A mobility-transparent deterministic broadcast mechanism for ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Randomized Initialization Protocols for Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Uniform Leader Election Protocols for Radio Networks
IEEE Transactions on Parallel and Distributed Systems
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Broadcast and gossiping algorithms for mobile ad hoc networks based on breadth-first traversal
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
| Hi-index | 0.00 |
We present a new approach to find a collision-free transmission schedule for mobile ad hoc networks (MANETs) in a TDM environment. A hexagonal cellular structure is overlaid on the MANET and then the actual demand for the number of slots in each cell is found out. We assume a 2-cell buffering in which the interference among different mobile nodes do not extend beyond cells more than distance 2 apart. Based on the instantaneous cell demands, we propose optimal slot assignment schemes for both homogeneous (all cells have the same demand) and non-homogeneous cell demands by a clever reuse of the time slots, without causing any interference. The proposed algorithms exploit the hexagonal symmetry of the cells requiring O(log logm+mD+n) time, where m is the number of mobile nodes in the ad hoc network, n and D being the number of cells and diameter of the cellular graph.