Sciweavers

1783 search results - page 22 / 357
» Low-Complexity Distributed Scheduling Algorithms for Wireles...
Sort
View
MOBIHOC
2008
ACM
16 years 1 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang
TMC
2008
127views more  TMC 2008»
15 years 1 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
BIOWIRE
2007
Springer
15 years 5 months ago
Self-organizing Desynchronization and TDMA on Wireless Sensor Networks
Desynchronization is a novel primitive for sensor networks: it implies that nodes perfectly interleave periodic events to occur in a round-robin schedule. This primitive can be us...
Julius Degesys, Ian Rose, Ankit Patel, Radhika Nag...
INFOCOM
2005
IEEE
15 years 7 months ago
Random-access scheduling with service differentiation in wireless networks
— Recent years have seen tremendous growth in the deployment of Wireless Local Area Networks (WLANs). An important design issue in such networks is that of distributed scheduling...
Piyush Gupta, Yogesh Sankarasubramaniam, Alexander...
ICC
2007
IEEE
188views Communications» more  ICC 2007»
15 years 8 months ago
Asymptotic Coverage and Detection in Randomized Scheduling Algorithm in Wireless Sensor Networks
—In our previous work [11], we derived detection delay and detection probability for a randomized scheduling algorithm in wireless sensor networks. In this paper, we study asympt...
Yang Xiao, Ying Zhang, Xinyu Sun, Hui Chen