Please use this identifier to cite or link to this item:
|Title:||SSR : Segment-by-Segment Routing in large-scale mobile ad hoc networks|
|Authors:||Cao, J |
|Source:||2006 IEEE International Conference on Mobile Ad-hoc and Sensor Systems : Vancouver, B.C., Canada, 9-12 October 2006, p. 216-225 How to cite?|
|Abstract:||Location-based routing in Mobile Ad hoc NETworks (MANETs) does not need to use pre-computed routes for forwarding packets thus scales very well. However, location-based routing suffers from two major problems: hole-induced local optimum and mobility-induced location errors. To solve these problems, in this paper, we propose a Segment-by-Segment Routing (SSR), which is a combination of location-based routing and topology-based routing. It maintains a k-hop vicinity routing table for each Cluster Head (CH), and uses location-based routing between neighboring k-hop vicinities while applies topology-based routing in the k-hop vicinity. The k-hop vicinity routing table provides useful reachability information used by an avoidance-based strategy to deal with holes, and helps to achieve the degree of tolerance of location inaccuracy with k-hop long radio transmissions. Comparative analysis shows that the proposed protocol outperforms the well-known GPSR routing protocol in terms of reliability, tolerance of location inaccuracy, and communication complexity, with a little larger cost in control messages.|
|Rights:||© 2006 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 redistribution 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.
|Appears in Collections:||Conference Paper|
Show full item record
Files in This Item:
|segment-by-segment_07.pdf||157.36 kB||Adobe PDF||View/Open|
Checked on Jan 22, 2017
Checked on Jan 22, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.