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
PAMAS—power aware multi-access protocol with signalling for ad hoc networks
ACM SIGCOMM Computer Communication Review
Broadcast-Efficient Protocols for Mobile Radio Networks
IEEE Transactions on Parallel and Distributed Systems
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
A Fault-Tolerant Protocol for Energy-Efficient Permutation Routing in Wireless Networks
IEEE Transactions on Computers
Ranking and Sorting in Unreliable Single Hop Radio Network
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Multistage off-line permutation packet routing on a mesh: an approach with elementary mathematics
Journal of Computer Science and Technology
Counting-sort and routing in a single hop radio network
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Communication and energy efficient routing protocols for single-hop radio networks
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Abstract--A radio network (RN) is a distributed system where each station or node is a small hand-held commodity device called a station. Typically, each station has access to a few channels for transmitting and receiving messages. By RN(p,k), we denote a radio network with p stations, where each station has access to k channels. In a single-hop RN, every station is within the transmission range of every other station. Each station consumes power while transmitting or receiving a message, even when it receives a message that is not destined for it. It is extremely important that the stations consume power only when it is necessary since it is not possible to recharge batteries when the stations are on a mission. In this paper, we are interested in designing an energy-efficient protocol for permutation routing, which is one of the most fundamental problems in any distributed system. An instance of the permutation routing problem involves p stations of an RN, each storing \frac{n}{p} items. Each item has a unique destination address which is the identity of the destination station to which the item should be sent. The goal is to route all the items to their destinations while consuming as little energy as possible. We show that the permutation routing problem of n packets on an RN(p,k) can be solved in {\frac{2n}{k}}+{({\frac{p}{k}})}^{2}+p+2k^{2} slots and each station needs to be awake for at most {\frac{6n}{p}}+{\frac{2p}{k}}+8k slots. When k\ll p\ll n, our protocol is more efficient, both in terms of total number of slots and the number of slots each station is awake compared to a previously published protocol by Nakano et al. [14].