Data networks
Introduction to graph theory
Performance Models of Asynchronous Multitrunk HYPERchannel Networks
IEEE Transactions on Computers
Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
Parallel Graph Algorithms Based Upon Broadcast Communications
IEEE Transactions on Computers
Data Transfers in Broadcast Networks
IEEE Transactions on Computers
Journal of Computer and System Sciences
Wireless digital communications: modulation & spread spectrum applications
Wireless digital communications: modulation & spread spectrum applications
A routing protocol for packet radio networks
MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
Wireless and personal communications systems
Wireless and personal communications systems
Mobile and wireless networks
Multicluster, mobile, multimedia radio network
Wireless Networks
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Distributed Sorting on Local Area Networks
IEEE Transactions on Computers
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
Randomized Initialization Protocols for Packet Radio Networks
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Finding an extremum in a network
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
Energy-efficient randomized routing in radio networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection
IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Permutation Routing in Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Randomized initialization protocols for radio networks
Handbook of wireless networks and mobile computing
Broadcasting in radio networks
Handbook of wireless networks and mobile computing
Energy-Efficient Routing in the Broadcast Communication Model
IEEE Transactions on Parallel and Distributed Systems
Doubly-Logarithmic Energy-Efficient Initialization Protocols for Single-Hop Radio Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
New Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Energy-Optimal and Energy-Balanced Sorting in a Single-Hop Wireless Sensor Network
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Energy-Efficient Deterministic Routing Protocols in Radio Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
An Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks
IEEE Transactions on Parallel and Distributed Systems
The Journal of Supercomputing
A Fault-Tolerant Protocol for Energy-Efficient Permutation Routing in Wireless Networks
IEEE Transactions on Computers
Merging and merge-sort in a single hop radio network
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Sorting long sequences in a single hop radio network
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
A fault-tolerant permutation routing algorithm in mobile ad-hoc networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Communication and energy efficient routing protocols for single-hop radio networks
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
The main contribution of this work is to present elegant broadcast-efficient protocols for permutation routing, ranking, and sorting on single-hop Mobile Radio Networks with $p$ stations and $k$ radio channels, denoted by ${\rm MRN} (p,k)$. Clearly, any protocol performing these tasks on $n$ items must perform $n\over k$ broadcast rounds because each item must be broadcast at least once. We begin by presenting an optimal off-line permutation routing protocol using $n\over k$ broadcast rounds for arbitrary $k$, $p$, and $n$. Further, we show that optimal on-line routing can be performed in $n\over k$ broadcast rounds, provided that either $k=1$ or $p=n$. We then go on to develop an on-line routing protocol that takes $2{n\over k}+k-1$ broadcast rounds on the ${\rm MRN} (p,k)$, whenever $k\leq \sqrt{p\over 2}$. Using these routing protocols as basic building blocks, we develop a ranking protocol that takes $2{n \over k}+o({n\over k})$ broadcast rounds as well as a sorting protocol that takes $3{n \over k}+o({n\over k})$ broadcast rounds, provided that $k\in o(\sqrt{n})$ and $p=n$. Finally, we develop a ranking protocol that takes $3{n \over k}+o({n\over k})$ broadcast rounds, as well as a sorting protocol that takes $4{n \over k}+o({n\over k})$ broadcast rounds on the ${\rm MRN} (p,k)$, provided that $k \leq\sqrt{p\over 2}$ and $p\in o(n)$. Featuring very low proportionality constants, our protocols offer a vast improvement over the state of the art.