Abstract
A radio network (RN) is a distributed system where each node is a small hand-held commodity device called a station, running on batteries. In a single-hop RN, every station is within the transmission range of every other station. Each station spends power while transmitting or receiving a message, even when it receives a message that is not destined for it. Since it is not possible to recharge batteries when the stations are on a mission, it is extremely important that the stations spend power only when it is necessary. 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 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 spending as little energy as possible. We show that the permutation routing problem of n packets on an RN(p, k) can be solved in 2n/k + (p/k)2 + p + 2k 2 slots and each station needs to be awake for at most 6n/p + 2p/k + 8k slots. When k ≪ p ≪ 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 the protocol by Nakano et al. [8].
This author’s research is partially supported by Interactive Virtual Environments Centre (IVEC) and Australian Partnership in Advanced Computing (APAC).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Abramson, “Multiple access in wireless digital networks”, Proc. IEEE, Vol. 82, pp. 1360–1370, 1994.
D. Bertzekas and R. Gallager, Data Networks, 2nd Edition, Prentice Hall, 1992.
N. Bambos and J. M. Rulnick, “Mobile power management for wireless communication networks”, Wireless Networks, Vol. 3, pp. 3–14, 1997.
M. Fine and F. A. Tobagi, “Demand assignment multiple access schemes in broadcast bus local area networks”, IEEE Trans. Computers, Vol. 33, pp. 1130–1159, 1984.
M. Gerla and T. C. Tsai, “Multicaster, mobile, multimedia radio network”, Wireless Networks, Vol. 1, pp. 255–265, 1995.
K. Nakano and S. Olariu, “Randomized initialization protocols for radio networks”, IEEE Trans. Parallel and Distributed Systems, Vol. 11, pp. 749–759, 2000.
K. Nakano, S. Olariu and J. L. Schwing, “Broadcast-efficient protocols for mobile radio networks”, IEEE Trans. Parallel and Distributed Systems, Vol. 10, pp. 1276–1289, 1999.
K. Nakano, S. Olariu and A. Y. Zomaya, “Energy-efficient permutation routing in radio networks”, IEEE Trans. Parallel and Distributed Systems, vol. 12, No. 6, pp. 544–557, 2001.
S. Singh and C. S. Raghavendra, “PAMAS — Power aware multi-access protocol with signalling for ad-hoc networks”, ACM Computer Comm. Review, Vol. 28, pp. 5–26, 1998.
K. Sivalingam, M. B. Srivastava and P. Agarwal, “Low power link and access protocols for wireless multimedia networks”, Proc. IEEE Vehicular Technology Conference (VTC’ 97), 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Datta, A., Zomaya, A.Y. (2002). New Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks. In: Ibarra, O.H., Zhang, L. (eds) Computing and Combinatorics. COCOON 2002. Lecture Notes in Computer Science, vol 2387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45655-4_28
Download citation
DOI: https://doi.org/10.1007/3-540-45655-4_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43996-7
Online ISBN: 978-3-540-45655-1
eBook Packages: Springer Book Archive