Data networks
Data Transfers in Broadcast Networks
IEEE Transactions on Computers
Mobile power management for wireless communication networks
Wireless Networks
Multicluster, mobile, multimedia radio network
Wireless Networks
Randomized Initialization Protocols for Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Permutation Routing in Radio Networks
IEEE Transactions on Parallel and Distributed Systems
An Optimal Channel Access Protocol with Multiple Reception Capacity
IEEE Transactions on Computers
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
A radio network (RN) is a distributed system where each node is a small hand-held commodity device called a station, running on batteries. Each station spends energy while transmitting or receiving a message i.e., when the station is awake. A station conserves power by going into a sleep mode. Since it is not possible to recharge batteries when the stations are on a mission, it is extremely important that the stations spend energy only when it is necessary. In this paper, we design an energy-efficient protocol for permutation routing on a single-hop radio network, where each station is within the transmission range of all other stations. An instance of the permutation routing problem involves p stations of an RN, each storing n/p packets. Each packet has a unique destination address which is the identity of the destination station to which the packet should be sent. Our goal is to route all the packets to their destinations while spending as little energy as possible. From simulation results, it is clear that our protocol performs better than an existing protocol by Nakano et al. [12], when each station routes packets with random destination addresses. We also assume that k « p « n, where, n, p and k are respectively the number of packets, number of stations and number of channels in the network.