Adaptive Greedy Geographic Routing for Constructing Tight Routes in Wireless Ad Hoc Networks
碩士 === 國立東華大學 === 電機工程學系 === 100 === Given a connected network graph, single-path geographic routing algorithms, such as GPSR-like algorithms, have been proven successful in definitely constructing a path connecting the source and the destination. Most of these approaches utilize Greedy forwarding t...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/erem89 |