Referenced Items are not available for this document.
Greedy geographic routing has been considered as an attractive approach due to its simplicity and scalability. However, greedy routing is insufficient in terms of routing convergence because of the local maximum problem. In this letter, we propose a novel greedy routing scheme based on a potential field method that dynamically eliminates the local maximum condition
Published in:
Communications Letters, IEEE
(Volume:11
,
Issue:
3
)
Date of Publication: March 2007
- Page(s):
- 243 - 245
- ISSN :
- 1089-7798
- INSPEC Accession Number:
- 9368526
- Digital Object Identifier :
- 10.1109/LCOMM.2007.061612
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 19 March 2007
- Issue Date :
- March 2007
- Sponsored by :
- IEEE Communications Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
