Sciweavers

415 search results - page 37 / 83
» Reactive routing overhead in networks with unreliable nodes
Sort
View
MOBICOM
2000
ACM
14 years 1 months ago
Caching strategies in on-demand routing protocols for wireless ad hoc networks
An on-demand routing protocol for wireless ad hoc networks is one that searches for and attempts to discover a route to some destination node only when a sending node originates a...
Yih-Chun Hu, David B. Johnson
ICC
2007
IEEE
174views Communications» more  ICC 2007»
14 years 3 months ago
Fairness Improvement and Efficient Rerouting in Mobile Ad Hoc Networks
— Mobile ad hoc networking allows nodes to form temporary networks and communicate with each other possibly via multiple hops. By using a special node called the gateway, an ad h...
Norihiro Ohata, Yongbing Zhang, Yusheng Ji, Xuemin...
ADHOCNOW
2003
Springer
14 years 1 months ago
A Uniform Continuum Model for Scaling of Ad Hoc Networks
This paper models an ad-hoc network as a continuum of nodes, ignoring edge effects, to find how the traffic scales with N, the number of nodes. We obtain expressions for the traffi...
Ernst W. Grundke, A. Nur Zincir-Heywood
ADHOCNOW
2008
Springer
14 years 3 months ago
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
Luminita Moraru, Pierre Leone, Sotiris E. Nikolets...
MASS
2010
162views Communications» more  MASS 2010»
13 years 6 months ago
A metric for routing in delay-sensitive wireless sensor networks
Abstract--We present a new scheme to reduce the end-toend routing delay in the mission-critical applications of the wireless sensor networks (WSNs) under the duty cycle model. Whil...
Zhen Jiang, Jie Wu, Risa Ito