Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/837
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorCao, J-
dc.creatorZhang, L-
dc.creatorWang, G-
dc.creatorCheng, H-
dc.date.accessioned2014-12-11T08:26:02Z-
dc.date.available2014-12-11T08:26:02Z-
dc.identifier.isbn1424405076-
dc.identifier.urihttp://hdl.handle.net/10397/837-
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.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.en_US
dc.rightsThis 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_US
dc.subjectMANETsen_US
dc.subjectRoutingen_US
dc.subjectAnchoren_US
dc.subjectSegmenten_US
dc.subjectHole avoidanceen_US
dc.titleSSR : Segment-by-Segment Routing in large-scale mobile ad hoc networksen_US
dc.typeConference Paperen_US
dcterms.abstractLocation-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.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitation2006 IEEE International Conference on Mobile Ad-hoc and Sensor Systems : Vancouver, B.C., Canada, 9-12 October 2006, p. 216-225-
dcterms.issued2006-
dc.identifier.scopus2-s2.0-39049110711-
dc.identifier.rosgroupidr33489-
dc.description.ros2006-2007 > Academic research: refereed > Refereed conference paper-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
segment-by-segment_07.pdf157.36 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

156
Last Week
1
Last month
Citations as of Mar 24, 2024

Downloads

269
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

15
Last Week
0
Last month
0
Citations as of Mar 22, 2024

Google ScholarTM

Check


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