Agent-based broadcast protocols for wireless heterogeneous node networks

被引:10
作者
Lakhlef, Hicham [1 ]
Bouabdallah, Abdelmadjid [1 ]
Raynal, Michel [2 ]
Bourgeois, Julien [3 ]
机构
[1] Univ Technol Compiegne, Sorbonne Univ, Compiegne, France
[2] Univ Rennes, IRISA, Rennes, France
[3] UFC, FEMTO ST, UMR CNRS 6174, 1 Cours Leprince Ringue, F-25201 Montbeliard, France
关键词
Internet of things; Parallel broadcasting; Communication protocols; Permutation routing; Collision-free; Energy-efficiency; AD-HOC NETWORKS; RADIO NETWORKS; INTERNET; THINGS; IOT;
D O I
10.1016/j.comcom.2017.10.020
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:51 / 63
页数:13
相关论文
共 39 条
[11]   Using multiparent routing in RPL to increase the stability and the lifetime of the network [J].
Iova, Oana ;
Theoleyre, Fabrice ;
Noel, Thomas .
AD HOC NETWORKS, 2015, 29 :45-62
[12]  
Karimou D, 2005, LECT NOTES COMPUT SC, V3421, P107
[13]   An application of an initialization protocol to permutation routing in a single-hop mobile ad hoc networks [J].
Karimou, D ;
Myoupo, JF .
JOURNAL OF SUPERCOMPUTING, 2005, 31 (03) :215-226
[14]  
Karimou D, 2006, INT FED INFO PROC, V212, P47
[15]  
Klein B.A, 2011, RPL IPV6 ROUTING PRO, P59
[16]  
Lakhlef Hicham, 2011, Int. J. Adv. Comput. Technol., V3, P207
[17]   Efficient allocation of resources in multiple heterogeneous Wireless Sensor Networks [J].
Li, Wei ;
Delicato, Flavia C. ;
Pires, Paulo F. ;
Lee, Young Choon ;
Zomaya, Albert Y. ;
Miceli, Claudio ;
Pirmez, Luci .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2014, 74 (01) :1775-1788
[18]   Smart Community: An Internet of Things Application [J].
Li, Xu ;
Lu, Rongxing ;
Liang, Xiaohui ;
Shen, Xuemin ;
Chen, Jiming ;
Lin, Xiaodong .
IEEE COMMUNICATIONS MAGAZINE, 2011, 49 (11) :68-75
[19]  
Möller DPF, 2014, INT CONF ELECTRO INF, P602, DOI 10.1109/EIT.2014.6871833
[20]   Concurrent broadcasts-based permutation routing algorithms in radio networks [J].
Myoupo, JF .
EIGHTH IEEE INTERNATIONAL SYMPOSIUM ON COMPUTERS AND COMMUNICATION, VOLS I AND II, PROCEEDINGS, 2003, :1272-1276