Opportunistic protocol based on social probability and resources efficiency for the intelligent and connected transportation system

In recent years, Intelligent and Connected Transportation Systems (ICTS) have become a practical and valuable alternative for wide variety of novel applications in road traffic safety. It can be utilized to guarantee road safety and create new forms of inter-vehicle communications. However, due to the high speed of vehicles, the topology of the network is highly dynamic and the network may be disconnected frequently, which will lead to a decline in communication performance. Delay Tolerant Networks (DTNs) follow the approach to store and forward the message. DTNs can adapt to the highly dynamic scenario, envisioned for communication in ICTS suffering from intermittent connection. In this paper, we propose the Social Probability And Resource Effective (SPARE) protocol to improve delivery ratio and minimize the consumption of network resources. In SPARE, we focus on considering four factors that include the nodal resources effective consumption, encounter probability, nodal historical encounter information and the number of messages carried by nodes. We use the nodes’ resources efficiency and encounter probability similarity to improve the delivery ratio of SPARE algorithm. In addition, SPARE applies the mechanism of dynamically managing messages to reduce network overhead. Finally, the simulation results show that SPARE achieves a higher delivery ratio and lower overhead ratio, compared to other protocols within resource constrained network situations.

[1]  Yun Won Chung,et al.  An Improved PRoPHET Routing Protocol in Delay Tolerant Network , 2015, TheScientificWorldJournal.

[2]  Honglong Chen,et al.  GAR: Group aware cooperative routing protocol for resource-constraint opportunistic networks , 2014, Comput. Commun..

[3]  Mashrur Chowdhury,et al.  Vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication in a heterogeneous wireless network – Performance evaluation , 2016 .

[4]  Igor Bisio,et al.  Contact graph routing in DTN space networks: overview, enhancements and performance , 2015, IEEE Communications Magazine.

[5]  Yue Cao,et al.  Simultaneous Positioning and Orientating for Visible Light Communications: Algorithm Design and Performance Analysis , 2018, IEEE Transactions on Vehicular Technology.

[6]  Houbing Song,et al.  Mining urban passengers' travel patterns from incomplete data with use cases , 2018, Comput. Networks.

[7]  Robin Kravets,et al.  Encounter: based routing in DTNs , 2009, MOCO.

[8]  Peng Wang,et al.  A novel cross-layer communication protocol for vehicular sensor networks , 2018, Int. J. Commun. Syst..

[9]  Dawu Gu,et al.  PBA: Prediction-Based Authentication for Vehicle-to-Vehicle Communications , 2016, IEEE Transactions on Dependable and Secure Computing.

[10]  Nicolas Privault Laplace transform identities for the volume of stopping sets based on Poisson point processes , 2015, Advances in Applied Probability.

[11]  Yue Cao,et al.  A Survey on Geographic Routing Protocols in Delay/Disruption Tolerant Networks , 2016, Int. J. Distributed Sens. Networks.

[12]  Zhili Sun,et al.  A Reliable and Efficient Encounter-Based Routing Framework for Delay/Disruption Tolerant Networks , 2015, IEEE Sensors Journal.

[13]  Yu Cheng,et al.  SEBAR: Social-Energy-Based Routing for Mobile Social Delay-Tolerant Networks , 2017, IEEE Transactions on Vehicular Technology.

[14]  Kezhi Wang,et al.  Toward Distributed Battery Switch Based Electro-Mobility Using Publish/Subscribe System , 2018, IEEE Transactions on Vehicular Technology.

[15]  Akio Koyama,et al.  An enhanced spray and wait DTN routing protocol based on node mobility and maximum number of replications , 2014 .

[16]  Abdul Hanan Abdullah,et al.  An EV Charging Management System Concerning Drivers’ Trip Duration and Mobility Uncertainty , 2018, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[17]  Shally PERFORMANCE EVALUATION OF RAPID AND SPRAY-AND-WAIT DTN ROUTING PROTOCOLS UNDER BLACK HOLE ATTACK , 2014 .

[18]  Xiaohong Jiang,et al.  Capacity and delay-throughput tradeoff in ICMNs with Poisson contact process , 2015, Wirel. Networks.

[19]  Marco Conti,et al.  Performance modelling of opportunistic forwarding under heterogenous mobility , 2014, Comput. Commun..

[20]  En Wang,et al.  The DTN Routing Algorithm Based on Markov Meeting Time Span Prediction Model , 2013, Int. J. Distributed Sens. Networks.

[21]  Abdul Hanan Abdullah,et al.  Reactive Weight Based Buffer Management Policy for DTN Routing Protocols , 2015, Wirel. Pers. Commun..

[22]  Abdul Hanan Abdullah,et al.  The optimization of Spray and Wait routing Protocol by prioritizing the message forwarding order , 2013 .

[23]  Christopher M. Danforth,et al.  An evolutionary algorithm approach to link prediction in dynamic social networks , 2013, J. Comput. Sci..