Poisson's probability‐based Q‐Routing techniques for message forwarding in opportunistic networks
- 8 May 2018
- journal article
- research article
- Published by Wiley in International Journal of Communication Systems
- Vol. 31 (11)
Abstract
Summary: Opportunistic Networks (OppNets) are intermittently connected infrastructure less wireless networks. There is no continuous end‐to‐end connection between the sender and the receiver, and hence nodes follow a store‐carry‐forward mechanism. The routing algorithm is required to be adaptive to the changing topology of the network. In this work, Q‐Routing technique has been used with forwarding probability and incorporated using Poisson's probability for decision making and controlling transmission energy. The algorithm refines the forwarding decision of finding the next suitable hop by exploiting the characteristics of nodes such as daily routines, mobility pattern, etc. In simulations, the performance of PBQ‐Routing is compared with Q‐Routing, Epidemic Routing, PRoPHET (Probabilistic Routing Protocol using History of Encounters and Transitivity), and HBPR (History Based Prediction Routing) for OppNets. The use of Poisson's distribution improves the effectiveness of the probabilistic forwarding decision. The findings show that the delivery probability of PBQ‐Routing almost gets doubled and overhead ratio reduces to half in comparison with that of Q‐Routing when used in OppNets. PBQ‐Routing outperforms other Q‐Routing based algorithms over Poisson's distribution. As there is less replication in case of PBQ‐Routing, it also saves the transmission energy.Keywords
This publication has 15 references indexed in Scilit:
- A survey on deep learning for big dataInformation Fusion, 2018
- Incomplete multi-view clustering via deep semantic mappingNeurocomputing, 2018
- Predicting Temporal Social Contact Patterns for Data Forwarding in Opportunistic Mobile NetworksIEEE Transactions on Vehicular Technology, 2017
- PPHOPCM: Privacy-Preserving High-Order Possibilistic c-Means Algorithm for Big Data Clustering with Cloud ComputingIEEE Transactions on Big Data, 2017
- EDR: An Encounter and Distance Based Routing Protocol for Opportunistic Networks2016
- Efficient and Privacy-Preserving Outsourced Calculation of Rational NumbersIEEE Transactions on Dependable and Secure Computing, 2016
- Efficient routing based on past information to predict the future location for message passing in infrastructure-less opportunistic networksThe Journal of Supercomputing, 2014
- GAER: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networksThe Journal of Supercomputing, 2014
- HBPR: History Based Prediction for Routing in Infrastructure-less Opportunistic Networks2013
- Probabilistic routing in intermittently connected networksACM SIGMOBILE Mobile Computing and Communications Review, 2003