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

Full metadata record

DC Field Value Language
dc.citation.endPage 64 -
dc.citation.startPage 52 -
dc.citation.title COMPUTER NETWORKS -
dc.citation.volume 131 -
dc.contributor.author Kang, Daeho -
dc.contributor.author Kim, Hyung-Sin -
dc.contributor.author Joo, Changhee -
dc.contributor.author Bahk, Saewoong -
dc.date.accessioned 2023-12-21T21:10:47Z -
dc.date.available 2023-12-21T21:10:47Z -
dc.date.created 2018-01-29 -
dc.date.issued 2018-02 -
dc.description.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. -
dc.identifier.bibliographicCitation COMPUTER NETWORKS, v.131, pp.52 - 64 -
dc.identifier.doi 10.1016/j.comnet.2017.12.001 -
dc.identifier.issn 1389-1286 -
dc.identifier.scopusid 2-s2.0-85038944022 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/23269 -
dc.identifier.url https://www.sciencedirect.com/science/article/pii/S138912861730419X -
dc.identifier.wosid 000424727300004 -
dc.language 영어 -
dc.publisher ELSEVIER SCIENCE BV -
dc.title ORGMA: Reliable opportunistic routing with gradient forwarding for MANETs -
dc.type Article -
dc.description.isOpenAccess FALSE -
dc.relation.journalWebOfScienceCategory Computer Science, Hardware & Architecture; Computer Science, Information Systems; Engineering, Electrical & Electronic; Telecommunications -
dc.relation.journalResearchArea Computer Science; Engineering; Telecommunications -
dc.description.journalRegisteredClass scie -
dc.description.journalRegisteredClass scopus -
dc.subject.keywordAuthor Gradient forwarding -
dc.subject.keywordAuthor MANET -
dc.subject.keywordAuthor Opportunistic routing -
dc.subject.keywordAuthor Reliability -
dc.subject.keywordAuthor Routing metric -
dc.subject.keywordAuthor Routing protocol -
dc.subject.keywordPlus AD-HOC NETWORKS -
dc.subject.keywordPlus PERFORMANCE -
dc.subject.keywordPlus ALGORITHM -
dc.subject.keywordPlus PROTOCOLS -
dc.subject.keywordPlus MOBILITY -

qrcode

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