DocumentCode
3340802
Title
A social transitivity-based data dissemination scheme for opportunistic networks
Author
Ku, Jaesung ; Ko, Yangwoo ; An, Jisun ; Lee, Dongman
Author_Institution
Dept. of Comput. Sci., KAIST, Daejeon, South Korea
fYear
2010
fDate
14-17 June 2010
Firstpage
1
Lastpage
9
Abstract
A social-based routing protocol for opportunistic networks considers the direct delivery as forwarding metrics. By ignoring the indirect delivery through intermediate nodes, it misses chances to find paths that are better in terms of delivery ratio and time. To overcome this limitation, we propose to incorporate transitivity, which considers the indirect delivery through intermediate nodes, as one of the forwarding metrics. We also found that some message forwards do not improve the delivery performance. To reduce the number of these useless forwards, the proposed scheme forwards messages to an encountered node when the increase of total utility value is greater than a threshold. Using a simulator with real world trace data sets, we compare the proposed scheme with the existing protocols, epidemic routing and SimBetTS. Compared with SimBetTS, the proposed scheme increases delivery ratio by 1.5 percent and decreases delay time by 2 percent while reducing overhead by 30 percent.
Keywords
Artificial neural networks; Communities; Delay; Probability; Routing; Social network services; Data Dissemination; Delay-Tolerant Networks; Opportunistic Networks; Opportunistic Routing; Social-based Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
World of Wireless Mobile and Multimedia Networks (WoWMoM), 2010 IEEE International Symposium on a
Conference_Location
Montreal, QC, Canada
Print_ISBN
978-1-4244-7264-2
Electronic_ISBN
978-1-4244-7263-5
Type
conf
DOI
10.1109/WOWMOM.2010.5534912
Filename
5534912
Link To Document