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

• Published in: Computer networks (Amsterdam, Netherlands : 1999) Vol. 149; pp. 173 - 186
• Main Authors: Wang, Tong, Tang, MengBo, Song, Houbing, Cao, Y., Khan, Zaheer
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 11.02.2019; Elsevier Sequoia S.A
• Subjects: Algorithms; Computer simulation; Delay tolerant networks; Encounter probability; Intelligent and connected transportation systems; Messages; Nodes; Protocol (computers); Resources efficiency; Social similarity; Traffic safety; Traffic speed; Transportation systems; Social similarity; Intelligent and connected transportation systems; Delay tolerant networks; Encounter probability; Resources efficiency
• ISSN: 1389-1286; 1872-7069
• DOI: 10.1016/j.comnet.2018.11.034

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.