Towards Designing a Routing Protocol for Opportunistic Networks | Zendy

Thabotharan Kathiravelu | Zendy; Arnold Pears | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Towards Designing a Routing Protocol for Opportunistic Networks

Author(s) -

Thabotharan Kathiravelu,

Arnold Pears

Publication year - 2012

Publication title -

international journal on advances in ict for emerging regions (icter)

Language(s) - English

Resource type - Journals

eISSN - 2550-2794

pISSN - 1800-4156

DOI - 10.4038/icter.v4i3.4678

Subject(s) - computer science , computer network , routing protocol , social connectedness , predictability , wireless routing protocol , dynamic source routing , zone routing protocol , link state routing protocol , distributed computing , probabilistic logic , routing (electronic design automation) , artificial intelligence , psychology , physics , quantum mechanics , psychotherapist

Intermittently connected opportunistic networks experience frequent disconnections and shorter contact durations. Therefore routing of messages towards their destinations needs to be handled from various points of view. Predictability and connectedness are two information which can be determined by participating mobile nodes of an opportunistic content distribution network using their past contacts. Epidemic or probabilistic routing protocols do not fully utilize these information to route messages towards their destinations. In this paper we describe the routing algorithm, implementation details, experiment design and the performance validation of a new, adaptive routing protocol which utilizes the predictability and connectedness information to route messages efficiently. Simulation based comparative studies show that the proposed routing protocol outperforms existing Epidemic and probabilistic routing protocols in delivering messages.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research