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.


Upon receiving the query packet, nodes make decisions on how to process the packet based on p. The periphery of diffusion area is shown by full curve. The communication areas of nodes are shown by virtual curves.
© Copyright Policy
Related In: Results  -  Collection

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

f12-sensors-12-10163: Upon receiving the query packet, nodes make decisions on how to process the packet based on p. The periphery of diffusion area is shown by full curve. The communication areas of nodes are shown by virtual curves.

Mentions: As shown in Figure 12, Node j, Node k and Node l have received the query packet and are going to make decisions to process the query packet. Node l finds that all neighbors have processed the packet, it drops the packet directly. Node j computes the percentage of neighbors that have processed the packet and the value is 0.67 which is larger than the threshold, so it only transmits the packet to a neighbor (Node m) that hasn't processed the packet. Node k computes the percentage of neighbors that have processed the packet and the value is 0.36 whose value is less than the threshold, so it rebroadcasts the packet.


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

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

Upon receiving the query packet, nodes make decisions on how to process the packet based on p. The periphery of diffusion area is shown by full curve. The communication areas of nodes are shown by virtual curves.
© Copyright Policy
Related In: Results  -  Collection

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

f12-sensors-12-10163: Upon receiving the query packet, nodes make decisions on how to process the packet based on p. The periphery of diffusion area is shown by full curve. The communication areas of nodes are shown by virtual curves.
Mentions: As shown in Figure 12, Node j, Node k and Node l have received the query packet and are going to make decisions to process the query packet. Node l finds that all neighbors have processed the packet, it drops the packet directly. Node j computes the percentage of neighbors that have processed the packet and the value is 0.67 which is larger than the threshold, so it only transmits the packet to a neighbor (Node m) that hasn't processed the packet. Node k computes the percentage of neighbors that have processed the packet and the value is 0.36 whose value is less than the threshold, so it rebroadcasts the packet.

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.