An adaptive routing protocol for supporting reliable communication in wireless ad-hoc network environments
- Authors
- Kim M.J.[Kim M.J.]; Eom Y.I.[Eom Y.I.]
- Issue Date
- 2001
- Citation
- Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC, v.2001-January, pp.206 - 213
- Journal Title
- Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC
- Volume
- 2001-January
- Start Page
- 206
- End Page
- 213
- URI
- https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/89313
- DOI
- 10.1109/PRDC.2001.992699
- Abstract
- A multi-hop wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized administration. Each mobile host participating in the multi-hop wireless ad-hoc network should also be willing to forward packets for other mobile hosts in the ad-hoc network. The proposed protocol, called DSMR protocol, supports seamless communication services between the mobile hosts within a multi-hop wireless ad-hoc network and provides fixed network services to the mobile hosts in multi-hop wireless ad-hoc network environments, if necessary. With DSMR protocol, each mobile host need not broadcast routing messages periodically, and mobile hosts that want to send data packets initiate route request and establishment procedure. In particular, the DSMR protocol makes faster route re-establishment possible by maintaining multiple paths in each mobile host, and also, the protocol provides reliable communication environments. © 2001 IEEE.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Information and Communication Engineering > Department of Computer Engineering > 1. Journal Articles
- Computing and Informatics > Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/89313)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.