Sciweavers

1716 search results - page 315 / 344
» Optimal Hopping in Ad Hoc Wireless Networks
Sort
View
MOBIHOC
2009
ACM
14 years 9 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
MSN
2007
Springer
162views Sensor Networks» more  MSN 2007»
14 years 2 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 8 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
OPODIS
2008
13 years 10 months ago
Fast Geometric Routing with Concurrent Face Traversal
We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate tha...
Thomas Clouser, Mark Miyashita, Mikhail Nesterenko
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
13 years 10 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt