Title:
Dynamic NIx-Vector Routing for Mobile Ad Hoc Networks
Dynamic NIx-Vector Routing for Mobile Ad Hoc Networks
| dc.contributor.author | Lee, Young J. | |
| dc.contributor.author | Riley, George F. | |
| dc.contributor.corporatename | Georgia Institute of Technology. School of Electrical and Computer Engineering | |
| dc.date.accessioned | 2006-10-26T18:47:50Z | |
| dc.date.available | 2006-10-26T18:47:50Z | |
| dc.date.issued | 2005-03 | |
| dc.description | ©2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. | en |
| dc.description | Presented at the IEEE Wireless Communications and Networking Conference (WCNC), March 2005 | |
| dc.description.abstract | We present a new protocol for multi–hop routing in mobile ad hoc networks called Dynamic NIx–Vector Routing (DNVR). Our scheme is based on the NIx–Vector concept for efficient routing originally designed for wired networks. DNVR acquires a loop–free route and maintains it on a need basis as do other on–demand protocols. However, DNVR has several new features as compared to other existing reactive routing protocols which lead to more stable routes and better scalability. DNVR effectively validates the stored routes as well as efficiently senses the up-to-date network topology during a route discovery phase by sending a unicast probe packet. To accommodate networks with a high degree of mobility, the routing states are invalidated in a timely manner. DNVR adopts a conservative route discovery strategy by suppressing route requests in some cases, and thus only a few routes are maintained per destination. Moreover, it attains bandwidth efficiency by using a Neighbor Index and Medium Access Control (MAC) addresses for routing purposes, which obviates the need for address resolution. We show via simulation that DNVR scales well to a large network with varying traffic load under diverse mobility scenarios. We compare DNVR to the well known Dynamic Source Routing (DSR) protocol, which is believed to be one of the most efficient on-demand routing protocols. Simulation results reveal that DNVR is as efficient as DSR while at the same time providing higher packet delivery ratios (up to 46 % higher) and smaller delays (up to 23 % smaller) than DSR in most cases. | en |
| dc.format.extent | 1831835 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1853/12289 | |
| dc.language.iso | en_US | en |
| dc.publisher | Georgia Institute of Technology | en |
| dc.publisher.original | Institute of Electrical and Electronics Engineers, Inc., New York | |
| dc.subject | Access protocols | en |
| dc.subject | Ad hoc networks | en |
| dc.subject | Mobile radio | en |
| dc.subject | Routing protocols | en |
| dc.subject | Telecommunication | en |
| dc.subject | Network topology | en |
| dc.subject | Telecommunication traffic | en |
| dc.title | Dynamic NIx-Vector Routing for Mobile Ad Hoc Networks | en |
| dc.type | Text | |
| dc.type.genre | Proceedings | |
| dspace.entity.type | Publication | |
| local.contributor.corporatename | School of Electrical and Computer Engineering | |
| local.contributor.corporatename | College of Engineering | |
| relation.isOrgUnitOfPublication | 5b7adef2-447c-4270-b9fc-846bd76f80f2 | |
| relation.isOrgUnitOfPublication | 7c022d60-21d5-497c-b552-95e489a06569 |