Author :
Nakano, Koji ; Olariu, Stephan ; Schwing, James L.
Abstract :
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
Keywords :
land mobile radio; personal communication networks; transport protocols; DAMA; broadcast-efficient protocols; mobile radio networks; optimal off-line permutation routing protocol; permutation routing; proportionality constants; ranking; ranking protocol; single-hop networks; Computer networks; Land mobile radio; Mobile computing; Multiaccess communication; Radio broadcasting; Radio network; Robustness; Routing protocols; Sorting; Wireless networks;
