Opportunistic routing with data fusion for multi-source wireless sensor networks
- 7 Downloads
This paper proposes an opportunistic routing with data fusion (ORDF) protocol for the widely used multi-source wireless sensor networks in which the spatial-temporal correlation among sensory data is ubiquitous. In the ORDF protocol, a new routing metric, which considers the data fusion and expected any-path transmissions, is presented to select a next-hop forwarding node that could save the maximal amount of energy. A candidate set selection algorithm is proposed to find the optimal candidate set of each node. An ACK-based coordination method among candidates is also given for the design of the ORDF protocol. Simulation results show that the ORDF protocol can greatly improve the network lifetime and reduce the network delay compared to general opportunistic routing protocol, such as ExOR, EEOR and OAPF. With increase of the number of source nodes, the ORDF protocol has more significant advantages in prolonging the network lifetime and reducing the network delay.
KeywordsOpportunistic routing with data fusion (ORDF) Multi-source wireless sensor networks (MSWSNs) Data fusion Routing metric ACK-based coordination
This work was supported by National Natural Science Foundation of China under Grant U1334210 and China Academy of Railway Sciences Foundation under Grant 2016YJ109.
- 3.Azzedine, B., & Amir, D. (2014). Opportunistic routing in wireless networks: Models, algorithms, and classifications. ACM Computing Surveys, 47(2), 1–36.Google Scholar
- 5.Lu, M. & Wu, J. (2009). Opportunistic routing algebra and its applications. In Proceedings of the IEEE conference on computer communications (INFOCOM), pp. 2374C2382.Google Scholar
- 6.Zhong, Z. & Nelakuditi, S. (2007). On the efficacy of opportunistic routing, sensor, mesh and ad hoc communications and networks. In Proceeding of IEEE conference on communications society, pp. 441–450.Google Scholar
- 12.Barnett, J. A. (2008). Computational methods for a mathematical theory of evidence. In Proceeding of international joint conference on artificial intelligence, pp. 868–875.Google Scholar