An Efficient Randomized Routing Protocol for Single-Hop Radio Networks

Rajasekaran, Sanguthevar; Sharma, Dolly; Ammar, Reda A.; Lownes, Nicholas

doi:10.1109/icpp.2010.25

Cited by 3 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [19], the authors present for single-hop radio networks a one phase algorithm that routes the packets directly to their destinations. Its expected run time is nearly n k and assumes that k ≤ √ p. In [32], the authors presented a randomized algorithm for the permutation routing that takes 3n…”

Section: Related Workmentioning

confidence: 99%

Agent-based broadcast protocols for wireless heterogeneous node networks

Lakhlef

Bouabdallah

Raynal

et al. 2018

Computer Communications

View full text Add to dashboard Cite

Internet of Things (IoT) is a wireless network composed of a variety of heterogeneous objects such as Connected Wearable Devices (sensors, smartwatches, smartphones, PDAs ...), Connected Cars, Connected Homes,...etc. These things use generally wireless communication to interact and cooperate with each other to reach common goals. IoT (T, n) is a network of things composed of T things with n items (packets) distributed randomly 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 propose two agent-based broadcast protocols for mobile IoT, using a limited number of communication channels. The main idea is to partition the things into groups where an agent in each group manages a group of things. This partitioning is based on the memory capacities for these heterogeneous nodes. The first protocol uses a few communication channels to perform a parallel broadcasting and requires O(n k) memory space, where k is the number of communication channels. The second protocol uses an optimal complexity of memory space for each thing to achieve the permutation routing with a parallel broadcasting using less number of channels. We give an estimation of the upper and lower bounds of the number of broadcast rounds in the worst case and we discuss experimental results.

show abstract

Section: Related Workmentioning

confidence: 99%

Agent-based broadcast protocols for wireless heterogeneous node networks

Lakhlef

Bouabdallah

Raynal

et al. 2018

Computer Communications

View full text Add to dashboard Cite

show abstract

“…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]. Subsequently, numerous studies have addressed to focus on the performance of the delay and throughput [13].…”

Section: Introductionmentioning

confidence: 99%

Distributed multichannel medium access control protocol without common control channel for single-hop cognitive radio networks

Tan

2011

J. Cent. South Univ. Technol.

View full text Add to dashboard Cite

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.

show abstract

Efficient Broadcast Protocol for the Internet of Things

Lakhlef¹,

Raynal²,

Bourgeois³

2016

2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)

View full text Add to dashboard Cite

International audience—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

show abstract

An Efficient Randomized Routing Protocol for Single-Hop Radio Networks

Cited by 3 publications

References 16 publications

Agent-based broadcast protocols for wireless heterogeneous node networks

Agent-based broadcast protocols for wireless heterogeneous node networks

Distributed multichannel medium access control protocol without common control channel for single-hop cognitive radio networks

Efficient Broadcast Protocol for the Internet of Things

Contact Info

Product

Resources

About