A search strategy of level-based flooding for the internet of things

8Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.

Abstract

This paper deals with the query problem in the Internet of Things (IoT). Flooding is an important query strategy. However, original flooding is prone to cause heavy network loads. To address this problem, we propose a variant of flooding, called Level-Based Flooding (LBF). With LBF, the whole network is divided into several levels according to the distances (i.e., hops) between the sensor nodes and the sink node. The sink node knows the level information of each node. Query packets are broadcast in the network according to the levels of nodes. Upon receiving a query packet, sensor nodes decide how to process it according to the percentage of neighbors that have processed it. When the target node receives the query packet, it sends its data back to the sink node via random walk. We show by extensive simulations that the performance of LBF in terms of cost and latency is much better than that of original flooding, and LBF can be used in IoT of different scales. © 2012 by the authors; licensee MDPI, Basel, Switzerland.

Cite

CITATION STYLE

APA

Qiu, T., Ding, Y., Xia, F., & Ma, H. (2012). A search strategy of level-based flooding for the internet of things. Sensors (Switzerland), 12(8), 10163–10195. https://doi.org/10.3390/s120810163

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free