Performance Analysis of Routing Protocols in Resource-Constrained Opportunistic Networks
Recently, opportunistic networks are considered as one of the most attractive developments of ad hoc mobile networks (MANETs) that have emerged thanks to the development of intelligent devices. Due to the mobility-related instability of the paths between nodes and due to the limited buffer and ener...
Saved in:
Main Authors: | , , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Advances in Science, Technology and Engineering Systems Journal (ASTESJ)
2019
|
Subjects: | |
Online Access: | http://ir.unimas.my/id/eprint/46127/1/ASTESJ_040651.pdf http://ir.unimas.my/id/eprint/46127/ https://www.astesj.com/v04/i06/p51/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universiti Malaysia Sarawak |
Language: | English |
Summary: | Recently, opportunistic networks are considered as one of the most attractive developments of ad hoc mobile networks (MANETs) that have emerged thanks to the development of
intelligent devices. Due to the mobility-related instability of the paths between nodes and due to the limited buffer and energy resources, the ultimate objective of routing protocols in opportunistic networks is to enable the exchange of information between users. In such
harsh environments, it is difficult to exactly pin down the services provided by these networks. To this end, we present in this paper a study on the performance analysis of six
of the most popular routing protocols in opportunistic networks, namely, epidemic, PRoPHET, MaxProp, Spray and Wait, Spray and Focus, and Encounter-Based Routing
(EBR). We firstly described these protocols and presented their algorithms. Thereafter, we carried out a comparative study of these protocols using exhaustive performance testing experiments with different numbers of nodes, traffic loads, message lifetime, and buffer size.
The results of this investigation are with an important role in helping network designers to improve performance in such challenging networks. |
---|