By Topic

Broadcast-efficient protocols for mobile radio networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Nakano, K. ; Dept. of Electr. & Comput. Eng., Nagoya Inst. of Technol., Japan ; Olariu, S. ; Schwing, J.L.

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 MRN(p,k). Clearly, any protocol performing these tasks on n items must perform n/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 /k broadcast rounds for arbitrary k, p, and n. Further, we show that optimal on-line routing can be performed in n/ k broadcast rounds, provided that either k=1 or p=n. We then go on to develop an online routing protocol that takes 2n/ k+k-1 broadcast rounds on the MRN(p,k), whenever k⩽√p/2. Using these routing protocols as basic building blocks, we develop a ranking protocol that takes 2n /k+o(n/k) broadcast rounds as well as a sorting protocol that takes 3n/k+o(n/k) broadcast rounds, provided that k ε o(√n) and p=n. Finally, we develop a ranking protocol that takes 3n/k+o(n/ k) broadcast rounds, as well as a sorting protocol that takes 4n/k+o(n/k) broadcast rounds on the MRN(p,k), provided that k⩽√p/2 and p ε o(n). Featuring very low proportionality constants, our protocols offer a vast improvement over the state of the art

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:10 ,  Issue: 12 )