Broadcast-Efficient Protocols for Mobile Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
An adaptive transmission technique for low power consumption in wireless sensor networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
| Hi-index | 0.00 |
A radio network (RN, for short) is a distributed system populated by small, bulk-produced, handheld radio transceivers, running on batteries. Since recharging batteries may not be possible while on mission, it is important to design protocols that are highly energy-efficient. In this work, we address the problem of energy-efficient routing in k-channel RNs. An important subproblem is that of permutation routing an instance of which involves p stations each storing \math items. Since in the worst case each item must be transmitted at least once, every permutation routing protocol must take \math time slots. Similarly, each station must be awake for at least \math time slots.Our main contribution is to present an almost optimal energy-efficient permutation routing protocol on the k-channel, p-station RN that routes n items in at most \math time slots, with no station being awake for more than \math time slots, where \math, \math, and \math.