A social transitivity-based data dissemination scheme for opportunistic networks

• Main Authors: KU, Jaesung, KO, Yangwoo, AN, Jisun, LEE, Dongman
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2010
• Subjects: Opportunistic Routing; Social-based Routing; Data Dissemination; Delay-Tolerant Networks; Opportunistic Networks; Databases and Information Systems; OS and Networks
• Online Access: https://ink.library.smu.edu.sg/sis_research/6765; https://ink.library.smu.edu.sg/context/sis_research/article/7768/viewcontent/05534912.pdf
• Institution: Singapore Management University

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.