SIGN IN
SIGN UP
Analysis of shortest path routing for large multi-hop wireless networks
Full Text:
Pdf
Buy this Article
Authors:
Sungoh Kwon
Samsung Electronics Company, Suwon-si, Gyeonggi-do, Korea
Ness B. Shroff
Department of Electrical and Computer Engineering, Department of Computer Science and Engineering, The Ohio State University, Columbus, OH
Published in:
· Journal
IEEE/ACM Transactions on Networking (TON)
archive
Volume 17 Issue 3, June 2009
IEEE Press
Piscataway, NJ
, USA
table of contents
doi>
10.1109/TNET.2008.2002222
2009 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 47
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
analysis
design
geometric probability
geometrical problems and computations
multi-hop wireless network
path and circuit problems
performance
performance attributes
probabilistic algorithms
routing
routing protocols
simulations
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder