|
Volumn 9, Issue 11, 2005, Pages 1000-1002
|
On hop count and Euclidean distance in greedy forwarding in wireless ad hoc networks
|
Author keywords
Ad hoc networks; Greedy routing; Probabilistic bounds; Sensor networks
|
Indexed keywords
APPROXIMATION THEORY;
COMPUTER SIMULATION;
NETWORK PROTOCOLS;
PROBABILITY;
PROBABILITY DENSITY FUNCTION;
RANDOM PROCESSES;
SENSOR DATA FUSION;
AD HOC NETWORKS;
EUCLIDEAN DISTANCE;
GREEDY ROUTING;
PROBABILISTIC BOUNDS;
SENSOR NETWORKS;
WIRELESS TELECOMMUNICATION SYSTEMS;
|
EID: 28244449780
PISSN: 10897798
EISSN: None
Source Type: Journal
DOI: 10.1109/LCOMM.2005.11019 Document Type: Article |
Times cited : (41)
|
References (9)
|