An Efficient Randomized Routing Protocol for Single-Hop Radio Networks
13 Sep 2010-pp 160-167
TL;DR: A randomized selection algorithm that takes O(p/k) rounds on a RN(p; k) with high probability is presented, which will be highly relevant especially in emergencies and time critical situations.
Abstract: In this paper we study the important problems of message routing, sorting, and selection in a radio network. A radio network consists of stations where each station is a hand-held device. We consider a single-hop radio network. In a single-hop network it is assumed that each station is within the transmission range of every other station. Let RN(p; k) stand for a single-hop network that has p stations and k communication channels. The problems of sorting and selection have been studied on RN(p; k). For these problems it is assumed that there are n/p elements to start with at each station. At the end of sorting, the least n/p elements should be in the first station, the next smallest n/p elements should be in the second station, and so on. The best known prior algorithm for sorting takes 4n/k +o(n/k) broadcast rounds on a RN(p; k). In this paper we present a randomized algorithm that takes only 3n/k +o(n/k) broadcast rounds with high probability. For the selection problem, it is known that the maximum or minimum element can be found in O(log n) rounds on a RN(n; 1), provided broadcast conflicts can be resolved in O(1) time. The problem of general selection has not been addressed. In this paper we present a randomized selection algorithm that takes O(p/k) rounds on a RN(p; k) with high probability. An important message routing problem that is considered in the literature is one where there are n/p packets originating from each station and there are n/p packets destined for each station. The best known routing algorithms take nearly 2n/k times slots. An important open question has been if there exist algorithms that take only close to n/k time slots. Note that a trivial lower bound for routing is n/k. The existence of such algorithms will be highly relevant especially in emergencies and time critical situations. In this paper we answer this question by presenting a randomized algorithm that takes nearly n/k time slots with high probability.
Citations
More filters
TL;DR: This paper proposes two agent-based broadcast protocols for mobile IoT, using a limited number of communication channels, and gives an estimation of the upper and lower bounds of the number of broadcast rounds in the worst case.
8 citations
23 Mar 2016
TL;DR: This paper is the first to present efficient broadcast protocol for the internet of things that uses few communication channels and performs efficiently with respect to the number of broadcast rounds and runs without conflict and collision on the communication channels.
Abstract: Internet of Things (IoT) is a network composed of a variety of heterogeneous things and objects such as Connected Wearable Devices (sensors, MEMS, microrobots, PDA, ), Connected Cars, Connected Homes, Connected Cities, and the Industrial Internet. These things use generally wireless communication to interact and cooperate with each other to reach common services and goals. IoT (T, n) is a wireless network of things composed of T things with n items (information) distributed on it. The aim of the permutation routing is to route to each thing, its items, so it can accomplish its task. In this paper, we present an agent-based broadcast protocol for mobile Internet of Things that uses few communication channels. The main idea is to partition things into groups according to the number of channels. In each group, an agent manages a set of things. This new protocol performs efficiently with respect to the number of broadcast rounds and runs without conflict and collision on the communication channels. We give an estimation of the upper and the lower bounds of the number of broadcast rounds in the worst case. This paper is the first to present efficient broadcast protocol for the internet of things.
3 citations
Cites background from "An Efficient Randomized Routing Pro..."
...In [23], the authors present a randomized algorithm for the permutation routing that takes 3n k + O( n k ) broadcast rounds with high probability....
[...]
TL;DR: A novel distributed cognitive radio multichannel medium access protocol without common control channel and a three-dimensional multi channel Markov chain model to describe the sate of the cognitive users in dynamic spectrum access was presented.
Abstract: A novel distributed cognitive radio multichannel medium access protocol without common control channel was proposed. The protocol divided a transmission interval into two parts for exchanging control information and data, respectively. In addition to evaluating system saturation throughput of the proposed protocol, a three-dimensional multi channel Markov chain model to describe the sate of the cognitive users (CUs) in dynamic spectrum access was presented. The proposed analysis was applied to the packet transmission schemes employed by the basic, RTS/CTS access mechanism adopted in the normal IEEE 802.11. Analyzing the advantage of the two methods, a hybrid access mechanism was proposed to improve the system throughput. The simulation results show that the experiment results are close to the value computed by the model (less than 5%), and the proposed protocol significantly improves the performance of the system throughput by borrowing the licensed spectrum. By analyzing the dependence of throughput on system parameters, hybrid mechanism dynamically selecting access mechanism can maintain high throughput.
1 citations
Cites background from "An Efficient Randomized Routing Pro..."
...Much of the theoretical foundation is proposed to describe the single-hop network with single channel for cognitive radio network [11], where a cognitive radio communication network routing policy with single channel was proposed [12]....
[...]
References
More filters
Book•
[...]
TL;DR: Undergraduate and graduate classes in computer networks and wireless communications; undergraduate classes in discrete mathematics, data structures, operating systems and programming languages.
Abstract: Undergraduate and graduate classes in computer networks and wireless communications; undergraduate classes in discrete mathematics, data structures, operating systems and programming languages. Also give lectures to both undergraduate-and graduate-level network classes and mentor undergraduate and graduate students for class projects.
6,991 citations
TL;DR: In this paper, it was shown that the likelihood ratio test for fixed sample size can be reduced to this form, and that for large samples, a sample of size $n$ with the first test will give about the same probabilities of error as a sample with the second test.
Abstract: In many cases an optimum or computationally convenient test of a simple hypothesis $H_0$ against a simple alternative $H_1$ may be given in the following form. Reject $H_0$ if $S_n = \sum^n_{j=1} X_j \leqq k,$ where $X_1, X_2, \cdots, X_n$ are $n$ independent observations of a chance variable $X$ whose distribution depends on the true hypothesis and where $k$ is some appropriate number. In particular the likelihood ratio test for fixed sample size can be reduced to this form. It is shown that with each test of the above form there is associated an index $\rho$. If $\rho_1$ and $\rho_2$ are the indices corresponding to two alternative tests $e = \log \rho_1/\log \rho_2$ measures the relative efficiency of these tests in the following sense. For large samples, a sample of size $n$ with the first test will give about the same probabilities of error as a sample of size $en$ with the second test. To obtain the above result, use is made of the fact that $P(S_n \leqq na)$ behaves roughly like $m^n$ where $m$ is the minimum value assumed by the moment generating function of $X - a$. It is shown that if $H_0$ and $H_1$ specify probability distributions of $X$ which are very close to each other, one may approximate $\rho$ by assuming that $X$ is normally distributed.
3,760 citations
"An Efficient Randomized Routing Pro..." refers methods in this paper
...An application of Chernoff bounds shows that s = m 2 + õ(m)....
[...]
...The following three facts (known as Chernoff bounds) will be used in the paper (and were discovered by Chernoff [3] and Angluin & Valiant [1]): Prob [X ≥ m] ≤ (np m )m em−np,...
[...]
...One of the most frequently used facts in analyzing randomized algorithms is Chernoff bounds....
[...]
...The following three facts (known as Chernoff bounds) will be used in the paper (and were discovered by Chernoff [3] and Angluin & Valiant [1]): Prob [X ≥ m] ≤ (np m )m em−np, Prob [X ≥ (1 + )np] ≤ exp(− 2np/3), and Prob [X ≤ (1− )np] ≤ exp(− 2np/2), for any 0 < < 1, and m > np....
[...]
TL;DR: This paper describes a self-organizing, multihop, mobile radio network which relies on a code-division access scheme for multimedia support that provides an efficient, stable infrastructure for the integration of different types of traffic in a dynamic radio network.
Abstract: This paper describes a self-organizing, multihop, mobile radio network which relies on a code-division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled, and are dynamically reconfigured as the nodes move. This network architecture has three main advantages. First, it provides spatial reuse of the bandwidth due to node clustering. Second, bandwidth can be shared or reserved in a controlled fashion in each cluster. Finally, the cluster algorithm is robust in the face of topological changes caused by node motion, node failure, and node insertion/removal. Simulation shows that this architecture provides an efficient, stable infrastructure for the integration of different types of traffic in a dynamic radio network.
1,695 citations
TL;DR: A multi-cluster, multi-hop packet radio network architecture for wireless adaptive mobile information systems is presented that supports multimedia traffic and relies on both time division and code division access schemes.
Abstract: A multi-cluster, multi-hop packet radio network architecture for wireless adaptive mobile information systems is presented. The proposed network supports multimedia traffic and relies on both time division and code division access schemes. This radio network is not supported by a wired infrastructure as conventional cellular systems are. Thus, it can be instantly deployed in areas with no infrastructure at all. By using a distributed clustering algorithm, nodes are organized into clusters. The clusterheads act as local coordinators to resolve channel scheduling, perform power measurement/control, maintain time division frame synchronization, and enhance the spatial reuse of time slots and codes. Moreover, to guarantee bandwidth for real time traffic, the architecture supports virtual circuits and allocates bandwidth to circuits at call setup time. The network is scalable to large numbers of nodes, and can handle mobility. Simulation experiments evaluate the performance of the proposed scheme in static and mobile environments.
1,610 citations
"An Efficient Randomized Routing Pro..." refers background in this paper
...For the selection problem, it is known that the maximum or minimum element can be found in O(log n) rounds on a RN(n, 1), provided broadcast conflicts can be resolved in O(1) time....
[...]
11 May 1981
TL;DR: This paper shows that there exists an N-processor computer that can simulate arbitrary N- processor parallel computations with only a factor of O(log N) loss of runtime efficiency, and isolates a combinatorial problem that lies at the heart of this question.
Abstract: In this paper we isolate a combinatorial problem that, we believe, lies at the heart of this question and provide some encouragingly positive solutions to it. We show that there exists an N-processor realistic computer that can simulate arbitrary idealistic N-processor parallel computations with only a factor of O(log N) loss of runtime efficiency. The main innovation is an O(log N) time randomized routing algorithm. Previous approaches were based on sorting or permutation networks, and implied loss factors of order at least (log N)2.
694 citations
"An Efficient Randomized Routing Pro..." refers background in this paper
...Likewise if one wants to use the two-phase randomized routing scheme of Valiant [19] at least 2 k broadcast rounds will be needed....
[...]
...Likewise if one wants to use the two-phase randomized routing scheme of Valiant [19] at least 2n k broadcast rounds will be needed....
[...]
...The following three facts (known as Chernoff bounds) will be used in the paper (and were discovered by Chernoff [3] and Angluin & Valiant [1]): Prob [X ≥ m] ≤ (np m )m em−np, Prob [X ≥ (1 + )np] ≤ exp(− 2np/3), and Prob [X ≤ (1− )np] ≤ exp(− 2np/2), for any 0 < < 1, and m > np....
[...]