Weighted community graph–based social routing in delay-tolerant networks
This work focuses on delay-tolerant networks in a social network environment. The nonexistence of end-to-end path between the source and the destination poses great challenges to the successful message transmission in delay-tolerant networks. In this article, we attempt to find a socially connected...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-12-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147717749729 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849738915563438080 |
|---|---|
| author | Fang Lu Jianbo Li Xiaolan Zhang Shan Jiang Fushu Wang |
| author_facet | Fang Lu Jianbo Li Xiaolan Zhang Shan Jiang Fushu Wang |
| author_sort | Fang Lu |
| collection | DOAJ |
| description | This work focuses on delay-tolerant networks in a social network environment. The nonexistence of end-to-end path between the source and the destination poses great challenges to the successful message transmission in delay-tolerant networks. In this article, we attempt to find a socially connected path above the intermittently connected physical topology. To this end, we study a weighted community graph model, which turns the original network into a network composed of communities and then describes the interaction delays between these communities. By performing a Dijkstra algorithm on this community graph, the expected minimum transmission delay to a destination community can be computed. To improve the performance on delivery delay, we propose a social routing called weighted community graph–based social routing that makes use of interaction delays between communities and social ties among nodes, which consists of two routing phases. In inter-community routing phase, messages are forwarded to its destination communities based on the computed minimum delays, and then in intra-community routing phase, each copy is forwarded within a destination community based on the social ties between nodes until meeting the final destination. Extensive simulations are conducted and the results show that weighted community graph–based social routing can improve routing performance, especially the performance on delivery delay and overhead ratio. |
| format | Article |
| id | doaj-art-fd26de335c124ff4b6e53338b0c8bb13 |
| institution | DOAJ |
| issn | 1550-1477 |
| language | English |
| publishDate | 2017-12-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-fd26de335c124ff4b6e53338b0c8bb132025-08-20T03:06:25ZengWileyInternational Journal of Distributed Sensor Networks1550-14772017-12-011310.1177/1550147717749729Weighted community graph–based social routing in delay-tolerant networksFang Lu0Jianbo Li1Xiaolan Zhang2Shan Jiang3Fushu Wang4School of Computer Science and Technology, Qingdao University, Qingdao, ChinaSchool of Computer Science and Technology, Qingdao University, Qingdao, ChinaDepartment of Computer and Information Science, Fordham University, New York, NY, USASchool of Computer Science and Technology, Qingdao University, Qingdao, ChinaSchool of Computer Science and Technology, Qingdao University, Qingdao, ChinaThis work focuses on delay-tolerant networks in a social network environment. The nonexistence of end-to-end path between the source and the destination poses great challenges to the successful message transmission in delay-tolerant networks. In this article, we attempt to find a socially connected path above the intermittently connected physical topology. To this end, we study a weighted community graph model, which turns the original network into a network composed of communities and then describes the interaction delays between these communities. By performing a Dijkstra algorithm on this community graph, the expected minimum transmission delay to a destination community can be computed. To improve the performance on delivery delay, we propose a social routing called weighted community graph–based social routing that makes use of interaction delays between communities and social ties among nodes, which consists of two routing phases. In inter-community routing phase, messages are forwarded to its destination communities based on the computed minimum delays, and then in intra-community routing phase, each copy is forwarded within a destination community based on the social ties between nodes until meeting the final destination. Extensive simulations are conducted and the results show that weighted community graph–based social routing can improve routing performance, especially the performance on delivery delay and overhead ratio.https://doi.org/10.1177/1550147717749729 |
| spellingShingle | Fang Lu Jianbo Li Xiaolan Zhang Shan Jiang Fushu Wang Weighted community graph–based social routing in delay-tolerant networks International Journal of Distributed Sensor Networks |
| title | Weighted community graph–based social routing in delay-tolerant networks |
| title_full | Weighted community graph–based social routing in delay-tolerant networks |
| title_fullStr | Weighted community graph–based social routing in delay-tolerant networks |
| title_full_unstemmed | Weighted community graph–based social routing in delay-tolerant networks |
| title_short | Weighted community graph–based social routing in delay-tolerant networks |
| title_sort | weighted community graph based social routing in delay tolerant networks |
| url | https://doi.org/10.1177/1550147717749729 |
| work_keys_str_mv | AT fanglu weightedcommunitygraphbasedsocialroutingindelaytolerantnetworks AT jianboli weightedcommunitygraphbasedsocialroutingindelaytolerantnetworks AT xiaolanzhang weightedcommunitygraphbasedsocialroutingindelaytolerantnetworks AT shanjiang weightedcommunitygraphbasedsocialroutingindelaytolerantnetworks AT fushuwang weightedcommunitygraphbasedsocialroutingindelaytolerantnetworks |