Analysis of a crowd-computing search algorithm in mesh networks

This paper presents the principles and performance analysis of a general search algorithm to locate the best matched resources from the candidate nodes in a wireless mesh network. This algorithm uses a cross-layer network protocol and the concept of crowd-computing which lets all the wireless nodes...

Full description

Saved in:
Bibliographic Details
Published inIEEE Consumer Communications and Networking Conference pp. 1 - 6
Main Authors Dong, Peiliang, Zhang, Zhizhong, Yao, Jun
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.01.2019
Subjects
Find-the-Best-Match algorithm
IEEE 802.15.4
Internet of Things
IoT
Mesh network
Mesh networks
Protocols
Relays
Reliability
Routing
Unicast
ZigBee
Online AccessGet full text
ISSN2331-9860
DOI10.1109/CCNC.2019.8651740

Cover

More Information
Summary:This paper presents the principles and performance analysis of a general search algorithm to locate the best matched resources from the candidate nodes in a wireless mesh network. This algorithm uses a cross-layer network protocol and the concept of crowd-computing which lets all the wireless nodes in a mesh network to perform the searching and comparing. It shows much higher efficiency than the conventional methods. Our lab test has validated the algorithm in a small-scale network. Event-based simulation results are given to prove its efficiency and scalability in mesh networks with more than 1000 nodes.
ISSN:2331-9860
DOI:10.1109/CCNC.2019.8651740