Sciweavers

364 search results - page 37 / 73
» Shortest-path network interdiction
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces
In this paper we show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. The hyperbolic geometry can be used to facilitate maximally efï¬...
Fragkiskos Papadopoulos, Dmitri V. Krioukov, Mari&...
ICC
2000
IEEE
188views Communications» more  ICC 2000»
14 years 10 hour ago
Route-Lifetime Assessment Based Routing (RABR) Protocol for Mobile Ad-Hoc Networks
—Owing to the absence of any static support structure, Ad-hoc networks are prone to link failures. The ‘shortest path seeking’ routing protocols may not lead to stable routes...
Sulabh Agarwal, Ashish Ahuja, Jatinder Pal Singh, ...
ADHOC
2007
159views more  ADHOC 2007»
13 years 7 months ago
Cross-layer adaptive control for wireless mesh networks
Abstract— This paper investigates optimal routing and adaptive scheduling in a wireless mesh network composed of mesh clients and mesh routers. The mesh clients are power constra...
Michael J. Neely, Rahul Urgaonkar
MOBIHOC
2001
ACM
14 years 7 months ago
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
Previously proposed sensor network data dissemination schemes require periodic low-rate flooding of data in order to allow recovery from failure. We consider constructing two kind...
Deepak Ganesan, Ramesh Govindan, Scott Shenker, De...
GLOBECOM
2006
IEEE
14 years 1 months ago
Wormhole Attack in Wireless Ad Hoc Networks: Analysis and Countermeasure
— The wormhole attack is one of the most severe security attacks in wireless ad hoc networks. In this paper, we analyze the effect of the wormhole attack in shortest path routing...
Majid Khabbazian, Hugues Mercier, Vijay K. Bhargav...