Abstract
Network partitioning and node disconnectivity results in high latency and frequent link disruption in DTNs. Therefore, routing a message toward a destined node is a challenge in such environment. Several DTN routing schemes have been introduced in this regard. Some, recently proposed DTN routing protocols either use a single or combination of multiple social metrics to identify the suitable forwarder node(s). However, these DTN routing protocols produced results at the expense of community formation cost and over utilization of network resources. To address these issues, we propose Socially-Aware Adaptive DTN (SAAD) routing scheme which exploits a social attribute known as Degree Centrality (DC). In this scheme, each node calculates and shares its DC with other nodes at regular intervals. A forwarder node disseminates message to the most influential node possessing highest DC. The proposed routing scheme works great in situations where someone want to improve the energy efficiency and want to involve only relevant nodes. The simulation results show that SAAD has improved to select the best node and has reduced the hop-count, overhead on the expense of delay as compared to Epidemic, PRoPHET and PRoPHETv2.
Highlights
Wireless networks are subject to high propagation delays, frequent disruptions and high error rate due to dynamic topology and high mobility
We propose Socially-Aware Adaptive Delay Tolerant Networks (DTNs) (SAAD) routing scheme which exploits a social attribute known as Degree Centrality (DC)
Considering the importance of social aspects connected with DTN in future, we are interested to contribute in DTN routing domain to further improve the performance of DTN
Summary
Wireless networks are subject to high propagation delays, frequent disruptions and high error rate due to dynamic topology and high mobility These limitations affect the performance of routing protocols, and it is further deteriorated in sparse and intermittent wireless environment which is known as Intermittent Connected Networks (ICNs) [1]. If a node fails to locate an appropriate intermediate influential node, this node has to buffer that message and carry it until it finds the desired node This leads to another paradigm called Delay Tolerant Networks (DTNs) [2, 3]. In this context, we would like to exploit DC to disseminate a message in an entire network.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
