Sciweavers

34 search results - page 7 / 7
» Practical Scheduling Algorithms for Concurrent Transmissions...
Sort
View
TMC
2008
127views more  TMC 2008»
13 years 5 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
INFOCOM
2007
IEEE
13 years 11 months ago
Iterative Scheduling Algorithms
— The input-queued switch architecture is widely used in Internet routers due to its ability to run at very high line speeds. A central problem in designing an input-queued switc...
Mohsen Bayati, Balaji Prabhakar, Devavrat Shah, Ma...
EUC
2006
Springer
13 years 9 months ago
DiCa: Distributed Tag Access with Collision-Avoidance Among Mobile RFID Readers
Abstract. Advances in wireless and mobile communication technologies have enabled the development of various RFID-based systems and applications in addition to the extension of the...
Kwang-il Hwang, Kyung Tae Kim, Doo Seop Eom
AHSWN
2010
130views more  AHSWN 2010»
13 years 5 months ago
How Good is Opportunistic Routing? - A Reality Check under Rayleigh Fading Channels
Considerations of realistic channel dynamics motivate the design of a new breed of opportunistic schemes, such as opportunistic transmission, scheduling and routing. Compared to t...
Rong Zheng, Chengzhi Li