Sciweavers

415 search results - page 42 / 83
» Reactive routing overhead in networks with unreliable nodes
Sort
View
MOBIHOC
2007
ACM
14 years 8 months ago
Scalable routing in delay tolerant networks
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
Cong Liu, Jie Wu
WOWMOM
2005
ACM
201views Multimedia» more  WOWMOM 2005»
14 years 2 months ago
Real-Time Intrusion Detection for Ad Hoc Networks
A mobile ad hoc network is a collection of nodes that is connected through a wireless medium forming rapidly changing topologies. The widely accepted existing routing protocols de...
Ioanna Stamouli, Patroklos G. Argyroudis, Hitesh T...
DAC
2011
ACM
12 years 8 months ago
DRAIN: distributed recovery architecture for inaccessible nodes in multi-core chips
As transistor dimensions continue to scale deep into the nanometer regime, silicon reliability is becoming a chief concern. At the same time, transistor counts are scaling up, ena...
Andrew DeOrio, Konstantinos Aisopos, Valeria Berta...
GLOBECOM
2007
IEEE
13 years 8 months ago
Connectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks
—In the context of mobile ad hoc networks (MANETs) routing, we propose a clustering algorithm called Connectivity, Energy and Mobility driven Clustering Algorithm (CEMCA). The ai...
Fatiha Djemili Tolba, Damien Magoni, Pascal Lorenz
MDM
2009
Springer
126views Communications» more  MDM 2009»
14 years 3 months ago
Outlier Detection in Ad Hoc Networks Using Dempster-Shafer Theory
Mobile Ad-hoc NETworks (MANETs) are known to be vulnerable to a variety of attacks due to lack of central authority or fixed network infrastructure. Many security schemes have bee...
Wenjia Li, Anupam Joshi