Limits...
A search strategy of Level-Based Flooding for the Internet of Things.

Qiu T, Ding Y, Xia F, Ma H - Sensors (Basel) (2012)

Bottom Line: 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.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.

View Article: PubMed Central - PubMed

Affiliation: School of Software, Dalian University of Technology, Dalian 116620, China. qiutie@dlut.edu.cn

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.

No MeSH data available.


Nodes with different degree consume energy at different speed. The speed is proportional to nodes' degree. Node j's and Node k's communication areas are presented by the virtual coils.
© Copyright Policy
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC3472822&req=5

f4-sensors-12-10163: Nodes with different degree consume energy at different speed. The speed is proportional to nodes' degree. Node j's and Node k's communication areas are presented by the virtual coils.

Mentions: In the process of spreading query packets, each node receives packet duplicates from its all neighbors. The number of duplicates that every node receives depends on the node's degree. Figure 4 and Figure 5 prove this. As shown in Figure 4, Node j only has three neighbors, so it only receives three packet duplicates. Since Node k has eight neighbors, it may receive eight packet duplicates in each query process. Node k's energy is consumed much faster than Node j's.


A search strategy of Level-Based Flooding for the Internet of Things.

Qiu T, Ding Y, Xia F, Ma H - Sensors (Basel) (2012)

Nodes with different degree consume energy at different speed. The speed is proportional to nodes' degree. Node j's and Node k's communication areas are presented by the virtual coils.
© Copyright Policy
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC3472822&req=5

f4-sensors-12-10163: Nodes with different degree consume energy at different speed. The speed is proportional to nodes' degree. Node j's and Node k's communication areas are presented by the virtual coils.
Mentions: In the process of spreading query packets, each node receives packet duplicates from its all neighbors. The number of duplicates that every node receives depends on the node's degree. Figure 4 and Figure 5 prove this. As shown in Figure 4, Node j only has three neighbors, so it only receives three packet duplicates. Since Node k has eight neighbors, it may receive eight packet duplicates in each query process. Node k's energy is consumed much faster than Node j's.

Bottom Line: 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.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.

View Article: PubMed Central - PubMed

Affiliation: School of Software, Dalian University of Technology, Dalian 116620, China. qiutie@dlut.edu.cn

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.

No MeSH data available.