Finding temporal periodicity with chi-squared test in mobile social networks
by Chuluuntulga Sosorburam; Mohd Yaseen Mir; Chih-Lin Hu
International Journal of Social and Humanistic Computing (IJSHC), Vol. 3, No. 3/4, 2020

Abstract: Mobile opportunistic networks (MONs) provide data dissemination services in challenged networks where end-to-end data paths are unstable and difficult to remain in a long-term. Opportunistic routing in MONs takes advantage of contact opportunities between mobile nodes to disseminate messages in unstructured networks. Recent studies intend to utilise mobility patterns and select the best relay nodes to improve message forwarding schemes in MONs. In this paper, we exploit the dynamic contact patterns among mobile nodes from the temporal perspective and propose a periodic contact-based routing (PCBR) scheme. To detect periodic communications between two nodes, we analyse the inter-contact time, adopt the chi-squared test to identify definite periodicity, and use such periodic information to enhance the message delivery rate cost-effectively. We conduct a synthetic simulation to examine the PCBR scheme with the SLAW mobility model. Performance results show its efficiency on the successful delivery rate with lower message overhead as compared with typical epidemic and PRoPHETv2 schemes.

Online publication date: Thu, 12-Nov-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Social and Humanistic Computing (IJSHC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com