Sciweavers

374 search results - page 68 / 75
» On Communicating Automata with Bounded Channels
Sort
View
TWC
2010
13 years 2 months ago
On the Efficacy of Frequency Hopping in Coping with Jamming Attacks in 802.11 Networks
Abstract--Frequency hopping (FH) has been the most popularly considered approach for alleviating the effects of jamming attacks. We re-examine, the efficacy of FH based on both exp...
Konstantinos Pelechrinis, Christos Koufogiannakis,...
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 8 days ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
ICC
2007
IEEE
154views Communications» more  ICC 2007»
14 years 1 months ago
Distributed Adaptive Power Allocation for Wireless Relay Networks
— In this paper, we consider a 2-hop wireless diversity relay network. We explore transmit power allocation among the source and relays to maximize the received signal to noise r...
Yonghui Li, Branka Vucetic, Zhendong Zhou, Mischa ...
SECON
2008
IEEE
14 years 1 months ago
Enhancing the Data Collection Rate of Tree-Based Aggregation in Wireless Sensor Networks
— What is the fastest rate at which we can collect a stream of aggregated data from a set of wireless sensors organized as a tree? We explore a hierarchy of techniques using real...
Özlem Durmaz Incel, Bhaskar Krishnamachari
MOBIHOC
2006
ACM
14 years 7 months ago
Starvation mitigation through multi-channel coordination in CSMA multi-hop wireless networks
Existing multi-channel protocols have been demonstrated to significantly increase aggregate throughput compared to single-channel protocols. However, we show that despite such imp...
Jingpu Shi, Theodoros Salonidis, Edward W. Knightl...