<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>Due to node’s mobility, Delay Tolerant Networks (DTNs) feature the nonexistence of end-to- end path between source and destination, frequent topology partitions and extremely high delivery latency, thus posing great challenges to successful message transmission. To improve routing performance and provide high quality communication service, nodes' social characteristics are exploited to routing design recently. Hence, a social popularity based routing algorithm is proposed, named SPBR which takes the inter-contact time and multi-hop neighbor information into consideration. In this paper, we first introduce a method to detect the quality of relation between pair of nodes accurately. Used the reliable relationships, social popularity is proposed to evaluate the social power of node in the network. SPBR makes the routing decisions based on the popularity, leading message closer to destinations with low hops of routing and network resources. Extensive simulations are conducted and the results show that the proposed algorithm significantly improves routing performances compared to Epidemic, Prophet and First Contact (FC), especially SPBR is lower by about 55.1% in overhead ratio and higher by about 22.2% in delivery rate than Epidemic when there are 40 nodes in the networks.</p>
</abstract>

Due to node’s mobility, Delay Tolerant Networks (DTNs) feature the nonexistence of end-to- end path between source and destination, frequent topology partitions and extremely high delivery latency, thus posing great challenges to successful message transmission. To improve routing performance and provide high quality communication service, nodes' social characteristics are exploited to routing design recently. Hence, a social popularity based routing algorithm is proposed, named SPBR which takes the inter-contact time and multi-hop neighbor information into consideration. In this paper, we first introduce a method to detect the quality of relation between pair of nodes accurately. Used the reliable relationships, social popularity is proposed to evaluate the social power of node in the network. SPBR makes the routing decisions based on the popularity, leading message closer to destinations with low hops of routing and network resources. Extensive simulations are conducted and the results show that the proposed algorithm significantly improves routing performances compared to Epidemic, Prophet and First Contact (FC), especially SPBR is lower by about 55.1% in overhead ratio and higher by about 22.2% in delivery rate than Epidemic when there are 40 nodes in the networks.

Social Popularity Based Routing in Delay Tolerant Networks

International Journal on Smart Sensing and Intelligent Systems

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

{"article-title":"Social Popularity Based Routing in Delay Tolerant Networks"}

Due to node’s mobility, Delay Tolerant Networks (DTNs) feature the nonexistence of end-to- end path between source and destination, frequent topology...

Social Popularity Based Routing in Delay Tolerant Networks

Data publikacji: 01 gru 2016

Zakres stron: 1687 - 1709

Otrzymano: 18 wrz 2015

Przyjęty: 02 paź 2016

DOI: https://doi.org/10.21307/ijssis-2017-935

Słowa kluczowe
Delay Tolerant Networks, routing algorithm, social group, cohesion, popularity

© 2016 Youmei Song et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Social Popularity Based Routing in Delay Tolerant Networks

Data publikacji: 01 gru 2016

Zakres stron: 1687 - 1709

Otrzymano: 18 wrz 2015

Przyjęty: 02 paź 2016

DOI: https://doi.org/10.21307/ijssis-2017-935

Słowa kluczoweDelay Tolerant Networks, routing algorithm, social group, cohesion, popularity

© 2016 Youmei Song et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Słowa kluczowe
Delay Tolerant Networks, routing algorithm, social group, cohesion, popularity