Please use this identifier to cite or link to this item:
Title: Efficient broadcast protocol for the internet of things
Authors: Lakhlef, H
Raynal, M 
Bourgeois, J
Keywords: Collision-free
Internet of things
Parallel broadcasting
Permutation Routing
Issue Date: 2016
Publisher: Institute of Electrical and Electronics Engineers
Source: 30th IEEE International Conference on Advanced Information Networking and Applications, AINA 2016, Le Regent Congress Centre, Crans-Montana, Switzerland, 23 - 25 March 2016, 7474198, p. 998-1005 How to cite?
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.
ISBN: 9781509018574
ISSN: 1550-445X
DOI: 10.1109/AINA.2016.50
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Citations as of Dec 7, 2018


Last Week
Last month
Citations as of Dec 17, 2018

Page view(s)

Citations as of Dec 17, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.