Time Competition Flooding in High-Density Wireless Sensor Network

Flooding is a simple technique in wireless sensor networks where a source or node sends packets through every outgoing link, which is similar to broadcasting. A pure flooding is quite reliable, however, it is clearly too expensive. Data packets are being transmitted via all nodes that are all requir...

Full description

Saved in:
Bibliographic Details
Published in2016 Third International Conference on Computing Measurement Control and Sensor Network (CMCSN) pp. 170 - 173
Main Authors Shuai Liu, Jeng-Shyang Pan, Lingpin Kong, Chien-Ming Chen
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2016
Subjects
energy efficiency
flooding
Floods
Network topology
Protocols
Reliability
Spread spectrum communication
Voting
wireless sensor network
Wireless sensor networks
Online AccessGet full text
DOI10.1109/CMCSN.2016.34

Cover

More Information
Summary:Flooding is a simple technique in wireless sensor networks where a source or node sends packets through every outgoing link, which is similar to broadcasting. A pure flooding is quite reliable, however, it is clearly too expensive. Data packets are being transmitted via all nodes that are all required to forward the packets exactly once. In this paper, we introduce a new flooding protocol based on pure flooding, which is time competition flooding (TCF) for multi-hops high density networks. In the elections process, we tradeoff the node's residual energy and location information to decide which nodes is suitable for transferring. The one who is chosen as the relay is an active node, and all the other nodes will not re transfer. This method is free of further information exchange and complex topology computing. As showed in the experiment, our method is advantage in reducing total number of active nodes and transmissions compared with last method.
DOI:10.1109/CMCSN.2016.34