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.
Introduction
In the expanding ecosystem of the Internet of Things (IoT), efficiently locating a specific sensor node within an unstructured network remains a significant challenge. Traditional search methods typically fall into two categories: Basic Flooding and Random Walk. While flooding is fast, it often triggers a "broadcast storm," where redundant packets overwhelm the network and deplete the limited battery life of IoT devices. Conversely, random walks are energy-efficient but suffer from high latency. This paper introduces Level-Based Flooding (LBF), a hybrid strategy designed to provide the speed of flooding with the efficiency of a targeted search by organizing the network into concentric levels.
The Level-Based Flooding (LBF) Mechanism
The LBF algorithm operates through four distinct phases to optimize the search and retrieval process:
- Level Building Process (LBP): Upon deployment, the sink node initiates a one-time broadcast. Each node calculates its "level" based on the minimum number of hops required to reach the sink.
- Level Information Back (LIB): Nodes transmit their level data back to the sink, allowing the central controller to build a logical map of the network's depth.
- Searching Target Process (STP): When a query is initiated, the sink sets the packet's Time-to-Live (TTL) to match the target node's known level. This prevents the query from propagating into unnecessary regions of the network. Furthermore, nodes utilize a Smart Rebroadcast threshold ($P$). A node will only forward a packet if the percentage of its neighbors that have already processed the packet is below this threshold, significantly reducing redundancy.
- Sending Data Back (SDB): Once the target is located, it returns the requested data to the sink using a restricted random walk. By limiting the walk to nodes at lower levels (closer to the sink), the algorithm ensures a shortest-path return while distributing the energy load across different nodes.
Experimental Evaluation
The researchers evaluated LBF using the NS-2 discrete event network simulator across five synthetic scenarios ranging from 50 to 4,000 nodes. These scenarios tested the algorithm's performance in both high-density and low-density environments.
Key Results
- Efficiency: LBF reduced the average number of transmitted packets and total energy consumption by approximately 54.5% compared to basic flooding.
- Latency and Success: The strategy consistently achieved lower latency by eliminating disordered paths and maintained a success rate of nearly 100%.
- Scalability: The performance advantages of LBF became more pronounced as the network size increased, demonstrating its suitability for large-scale IoT deployments.
Conclusion
Level-Based Flooding offers a robust solution to the query problem in IoT by leveraging hop-distance levels to constrain search broadcasts. By integrating a neighbor-aware rebroadcast threshold and a level-restricted random walk for data return, LBF achieves significant energy savings without compromising on speed or reliability. Future work will focus on adapting the model for dynamic networks where node mobility may require periodic re-leveling.
Summary updated