Sciweavers

1966 search results - page 366 / 394
» Robust Routing in Wireless Ad Hoc Networks
Sort
View
MOBIHOC
2009
ACM
14 years 8 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
CACM
2008
84views more  CACM 2008»
13 years 7 months ago
The emergence of a networking primitive in wireless sensor networks
The wireless sensor network community approached netabstractions as an open question, allowing answers to emerge with time and experience. The Trickle algorithm has become a basic...
Philip Levis, Eric A. Brewer, David E. Culler, Dav...
MSN
2007
Springer
162views Sensor Networks» more  MSN 2007»
14 years 1 months ago
Adaptive Topology Based Gossiping in VANETs Using Position Information
Abstract. Gossiping is a lightweight and simple technique for information dissemination in many application domains, be it in Wireless Sensor Networks (WSNs), Mobile Ad-hoc Network...
Boto Bako, Igor Rikanovic, Frank Kargl, Elmar Scho...
JCS
2007
84views more  JCS 2007»
13 years 7 months ago
On the security of group communication schemes
Many emerging applications in both wired and wireless networks need support of secure group communications. There have been many secure group communication schemes in the setting ...
Shouhuai Xu
P2P
2009
IEEE
122views Communications» more  P2P 2009»
14 years 2 months ago
Virtual Direction Routing for Overlay Networks
The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay netwo...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...