Efficient geographic routing in multihop wireless networks
Open accessThe DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Abstract
We propose a new link metric called normalized advance (NADV) for geographic routing in multihop wireless networks. NADV selects neighbors with the optimal trade-off between proximity and link cost. Coupled with the local next hop decision in geographic routing, NADV enables an adaptive and efficient cost-aware routing strategy. Depending on the objective or message priority, applications can use the NADV framework to minimize various types of link cost.We present efficient methods for link cost estimation and perform detailed simulations in diverse scenarios. Our results show that NADV outperforms current schemes in many aspects: for example, in high noise environments with frequent packet losses, the use of NADV leads to 81% higher delivery ratio. When compared to centralized routing under certain settings, geographic routing using NADV finds paths whose cost is close to the optimum.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Wireless Communications: Principles and Practice
Rappaport, T. S. (1996) · Cited by 17,370
Ad hoc On-Demand Distance Vector (AODV) Routing
Perkins, C., Belding-Royer, E., & Das, S. (2003) · doi:10.17487/rfc3561 · Cited by 10,686
Ad-hoc on-demand distance vector routing
Perkins, C. E., & Royer, E. M. (1999) · Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications · doi:10.1109/mcsa.1999.749281 · Cited by 10,313
Dynamic Source Routing in Ad Hoc Wireless Networks
Johnson, D. B., & Maltz, D. A. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_5 · Cited by 8,518
GPSR: greedy perimeter stateless routing for wireless networks
Karp, B., & Kung, H. T. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345953 · Cited by 7,050
A high-throughput path metric for multi-hop wireless routing
De Couto, D. S. J., Aguayo, D., Bicket, J., & Morris, R. (2003) · Proceedings of the 9th annual international conference on Mobile computing and networking · doi:10.1145/938985.939000 · Cited by 3,356
Wireless LAN medium access control (MAC) and physical layer (PHY) specifications
Piscataway, N. (1996) · Medical Entomology and Zoology · Cited by 2,999
Location systems for ubiquitous computing
Hightower, J., & Borriello, G. (2001) · Computer · doi:10.1109/2.940014 · Cited by 2,987
Routing in multi-radio, multi-hop wireless mesh networks
Draves, R., Padhye, J., & Zill, B. (2004) · Proceedings of the 10th annual international conference on Mobile computing and networking · doi:10.1145/1023720.1023732 · Cited by 2,456
Minimum energy mobile wireless networks
Rodoplu, V., & Meng, T. H. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.779917 · Cited by 1,685
Energy conserving routing in wireless ad-hoc networks
Chang, J.-H., & Tassiulas, L. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832170 · Cited by 1,669
WaveLAN®-II: a high-performance wireless LAN for the unlicensed band
Kamerman, A., & Monteban, L. (2002) · Bell Labs Technical Journal · doi:10.1002/bltj.2069 · Cited by 1,217
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks
Bose, P., Morin, P., Stojmenović, I., & Urrutia, J. (2001) · Wireless Networks · doi:10.1023/a:1012319418150 · Cited by 1,199
Chen, B., Jamieson, K., Balakrishnan, H., & Morris, R. (2002) · Wireless Networks · doi:10.1023/a:1016542229220 · Cited by 1,071
Link-level measurements from an 802.11b mesh network
Aguayo, D., Bicket, J., Biswas, S., Judd, G., & Morris, R. (2004) · Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1015467.1015482 · Cited by 997
Analyzing the transitional region in low power wireless links
Zuniga, M., & Krishnamachari, B. (2005) · 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004. · doi:10.1109/sahcn.2004.1381954 · Cited by 883
Routing with guaranteed delivery in ad hoc wireless networks
Bose, P., Morin, P., Stojmenović, I., & Urrutia, J. (1999) · Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications · doi:10.1145/313239.313282 · Cited by 668
Geometric ad-hoc routing: of theory and practice
Kuhn, F., Wattenhofer, R., Zhang, Y., & Zollinger, A. (2003) · Proceedings of the twenty-second annual symposium on Principles of distributed computing · doi:10.1145/872035.872044 · Cited by 659
Position-based routing in ad hoc networks
Stojmenovic, I. (2002) · IEEE Communications Magazine · doi:10.1109/mcom.2002.1018018 · Cited by 649
Complex Behavior at Scale: An Experimental Study of Low-Power Wireless Sensor Networks
Ganesan, D., Estrin, D. L., Woo, A., Culler, D., Krishnamachari, B., & Wicker, S. B. (2002) · Cited by 481
Trajectory based forwarding and its applications
Niculescu, D., & Nath, B. (2003) · Proceedings of the 9th annual international conference on Mobile computing and networking · doi:10.1145/938985.939012 · Cited by 358
Chaotic maps as parsimonious bit error models of wireless channels
Köpke, A., Willig, A., & Karl, H. (2004) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2003.1208702 · Cited by 100
Gnawali, O. D., Yarvis, M. D., Heidemann, J., & Govindan, R. (2005) · IEEE International Conference on Sensing, Communication, and Networking (SECON) · doi:10.1109/sahcn.2004.1381900 · Cited by 84
Cited by
VBF: Vector-Based Forwarding Protocol for Underwater Sensor Networks
Xie, P., Cui, J.-H., & Lao, L. (2006) · Lecture Notes in Computer Science · doi:10.1007/11753810_111 · Cited by 788
Hu, T., & Fei, Y. (2010) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2010.28 · Cited by 405
“Although there exist many mature protocols for terrestrial sensor networks, they cannot be applied directly to UWSNs because of the fundamental differences in both the communication medium and network features.”
Background
Metadata
- Authors
- Lee, S., Bhattacharjee, B., & Banerjee, S.
- Venue
- Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
- Publisher
- ACM
- Published
- 2005-05-25
- Pages
- 230-241
- OpenAlex
- W2102291323
- Cited by
- 288
- References
- 23
- FWCI
- 16.74
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.