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.


Format of data back packet.
© Copyright Policy
Related In: Results  -  Collection

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

f15-sensors-12-10163: Format of data back packet.

Mentions: When the target receives a query packet, it sends its emergency data to the sink node quickly. This process is a little like the process introduced in Section 4.5. Emergency data packets get to sink node in a random walk within level hops. Every time the node that transmits packets chooses a node from its neighbors with a lower level as next hop of packets. The data packet gets closer to the sink node at each hop. When the hop num equals to TTL, the data packet also gets to the sink node. As packets get to sink node in a random walk, every packet may choose a different path so it can ensure the network's load is balanced and avoid using one path too much. If the back path is static, nodes in the path use up energy quickly. The lifetime of network should be reduced greatly. The format of a query packet is shown in Figure 15.


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

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

Format of data back packet.
© Copyright Policy
Related In: Results  -  Collection

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

f15-sensors-12-10163: Format of data back packet.
Mentions: When the target receives a query packet, it sends its emergency data to the sink node quickly. This process is a little like the process introduced in Section 4.5. Emergency data packets get to sink node in a random walk within level hops. Every time the node that transmits packets chooses a node from its neighbors with a lower level as next hop of packets. The data packet gets closer to the sink node at each hop. When the hop num equals to TTL, the data packet also gets to the sink node. As packets get to sink node in a random walk, every packet may choose a different path so it can ensure the network's load is balanced and avoid using one path too much. If the back path is static, nodes in the path use up energy quickly. The lifetime of network should be reduced greatly. The format of a query packet is shown in Figure 15.

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.