Home  |   Login  |   Logout  |   Access Information  |   Alerts  |   Purchase History  |   Cart  |   Sitemap  |   Help   
 
Abstract
BROWSE SEARCH IEEE XPLORE GUIDE SUPPORT
arrow_leftView TOC
Email/Printer Friendly Format  
 

Adaptive algorithms to mitigate inefficiency in greedy geographical routing
Huang, H.  
New Mexico State Univ., Las Cruces, NM, USA;

This paper appears in: Communications Letters, IEEE
Publication Date: Mar 2006
Volume: 10,  Issue: 3
On page(s): 150- 152
ISSN: 1089-7798
INSPEC Accession Number: 8838760
Digital Object Identifier: 10.1109/LCOMM.2006.1603367
Current Version Published: 2006-06-19

Abstract
This letter presents theoretical basis and practical algorithms for mitigating inefficiency in greedy geographical routing, which has great application potential in large scale ad hoc networks, such as sensor nets. Simulation results demonstrate the proposed algorithms' effectiveness and the capability to provide different efficiency-overhead tradeoffs.

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
You are not logged in.
Guests may access Abstract records free of charge.
Login
Username
Password
» Forgot your password?
Please remember to log out when you have finished your session.
You must log in to access:
• Advanced or Author Search
• CrossRef Search
• AbstractPlus Records
• Full Text PDF
• Full Text HTML
Access this document
Full Text: PDF (186 KB)
» Buy this document now
»  Learn more about
»  Learn more about
    purchasing articles
    and standards

Rights and Permissions
» Learn More
Download this citation
Available to subscribers and IEEE members.
 
arrow_leftView TOC   |  Back to toparrow_up
Indexed by IEE Inspec
© Copyright 2009 IEEE – All Rights Reserved