File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

ORGMA: Reliable opportunistic routing with gradient forwarding for MANETs

Author(s)
Kang, DaehoKim, Hyung-SinJoo, ChangheeBahk, Saewoong
Issued Date
2018-02
DOI
10.1016/j.comnet.2017.12.001
URI
https://scholarworks.unist.ac.kr/handle/201301/23269
Fulltext
https://www.sciencedirect.com/science/article/pii/S138912861730419X
Citation
COMPUTER NETWORKS, v.131, pp.52 - 64
Abstract
For decades, numerous routing protocols have been designed to serve unicast traffic in wireless ad hoc networks. However, these routing protocols still provide limited performance in dynamic environments of mobile ad hoc networks (MANETs). In this paper, we review representative routing protocols and evaluate their performance through NS-3 simulations to identify their main weaknesses. Based on our observations, we develop a reliable and practical opportunistic routing protocol for MANETs, named as ORGMA. We adopt the gradient forwarding approach, where the sender simply broadcasts a packet and the receivers make the routing decision. Our contributions include the use of instantaneous signal-to-noise ratio (SNR) for the routing cost and the development of light-weight cost management based on flooding. They enable ORGMA to achieve high packet delivery ratio under dynamic MANET environments. Through NS-3 simulations, we evaluate ORGMA in comparison with other routing schemes, and the results show that ORGMA not only greatly outperforms the state-of-the-art routing schemes, but also achieves the performance close to an ideal routing scheme with global information.
Publisher
ELSEVIER SCIENCE BV
ISSN
1389-1286
Keyword (Author)
Gradient forwardingMANETOpportunistic routingReliabilityRouting metricRouting protocol
Keyword
AD-HOC NETWORKSPERFORMANCEALGORITHMPROTOCOLSMOBILITY

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.