Sciweavers

555 search results - page 2 / 111
» Irrigating ad hoc networks in constant time
Sort
View
TWC
2008
109views more  TWC 2008»
13 years 7 months ago
Service Time Approximation in IEEE 802.11 Single-Hop Ad Hoc Networks
Abstract-- This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets success...
Atef Abdrabou, Weihua Zhuang
INFOCOM
2010
IEEE
13 years 5 months ago
Throughput, Delay, and Mobility in Wireless Ad Hoc Networks
—Throughput capacity in wireless ad hoc networks has been studied extensively under many different mobility models such as i.i.d. mobility model, Brownian mobility model, random ...
Pan Li, Yuguang Fang, Jie Li
INFOCOM
2010
IEEE
13 years 5 months ago
Distributed Opportunistic Scheduling for Ad-Hoc Communications Under Delay Constraints
—With the convergence of multimedia applications and wireless communications, there is an urgent need for developing new scheduling algorithms to support real-time traffic with ...
Sheu-Sheu Tan, Dong Zheng, Junshan Zhang, James R....
ASIACRYPT
2004
Springer
14 years 23 days ago
Constant-Round Authenticated Group Key Exchange for Dynamic Groups
Abstract. An authenticated group key exchange (AGKE) scheme allows a group of users in a public network to share a session key which may later be used to achieve desirable cryptogr...
Hyun-Jeong Kim, Su-Mi Lee, Dong Hoon Lee
ICC
2008
IEEE
142views Communications» more  ICC 2008»
14 years 1 months ago
Tuning Up the Performance of Constant-Time Distributed Scheduling Algorithms via Majorization
— Scheduling algorithms assign contention probability for each link in Wireless Ad Hoc Networks and plays a key role in deciding the system performance. Recently, many lowcost di...
Han Cai, Do Young Eun