Towards designing a routing protocol for opportunistic networks
| dc.contributor.author | Thabotharan, Kathiravelu | |
| dc.contributor.author | Ranasinghe, N. | |
| dc.contributor.author | Perera, A. | |
| dc.date.accessioned | 2014-07-11T05:02:00Z | |
| dc.date.accessioned | 2022-06-28T04:51:41Z | |
| dc.date.available | 2014-07-11T05:02:00Z | |
| dc.date.available | 2022-06-28T04:51:41Z | |
| dc.date.issued | 2010 | |
| dc.description.abstract | 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. | en_US |
| dc.identifier.uri | http://repo.lib.jfn.ac.lk/ujrr/handle/123456789/518 | |
| dc.language.iso | en | en_US |
| dc.publisher | IEEE | en_US |
| dc.title | Towards designing a routing protocol for opportunistic networks | en_US |
| dc.type | Article | en_US |