Abstract
Flooding is the simplest and most effective way to disseminate a packet to all nodes in a wireless sensor network (WSN). However, basic flooding makes all nodes transmit the packet at least once, resulting in the broadcast storm problem in a worst case, and in turn, network resources are severely wasted. Particularly, power is the most valuable resource of WSNs as nodes are powered by batteries, then the waste of energy by the basic flooding lessens the lifetime of WSNs. In order to solve the broadcast storm problem, this paper proposes a dynamic probabilistic flooding that utilizes the neighbor information like the numbers of child and sibling nodes. In general, the more sibling nodes there are, the higher is the probability that a broadcast packet may be sent by one of the sibling nodes. The packet is not retransmitted by itself, though. Meanwhile, if a node has many child nodes its retransmission probability should be high to achieve the high packet delivery ratio. Therefore, these two terms—the numbers of child and sibling nodes—are adopted in the proposed method in order to attain more reliable flooding. The proposed method also adopts the back-off delay scheme to avoid collisions between close neighbors. Simulation results prove that the proposed method outperforms previous flooding methods in respect of the number of duplicate packets and packet delivery ratio.
Highlights
A wireless sensor network (WSN) consists of spatially distributed sensor nodes that cooperatively monitor physical or environmental conditions
A WSN is composed of two types of nodes: sink nodes and sensor nodes
Sensor nodes are typically equipped with low-end components in consideration of cost, because generally hundreds of or thousands of sensor nodes are needed for a WSN to provide the secure monitoring function
Summary
A wireless sensor network (WSN) consists of spatially distributed sensor nodes that cooperatively monitor physical or environmental conditions. The broadcast storm causes severe contention and collisions between nodes, resulting in the very low performance of WSNs. by wasting resources like bandwidth and power, the contention and collision are large overheads to wireless network which uses battery as the main power. Many flooding mechanisms have been proposed to address the broadcast storm problem In common, they try to suppress the rebroadcast of duplicate packets based on some basic network information such as location, retransmission probability, or the number of duplicate packets received by each node [8]. The neighbor nodes are divided into three types: parent (upper level), sibling (same level), and child (lower level) nodes This level information can be acquired during several times of initial basic flooding from a sink node.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
