Sciweavers

34 search results - page 3 / 7
» Complexity of scheduling with analog network coding
Sort
View
INFOCOM
2005
IEEE
14 years 3 hour ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
CODES
2007
IEEE
14 years 22 days ago
Improved response time analysis of tasks scheduled under preemptive Round-Robin
Round-Robin scheduling is the most popular time triggered scheduling policy, and has been widely used in communication networks for the last decades. It is an efficient schedulin...
Razvan Racu, Li Li, Rafik Henia, Arne Hamann, Rolf...
DAC
2002
ACM
14 years 7 months ago
Schedulability of event-driven code blocks in real-time embedded systems
Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Tasks in many such systems, like netwo...
Samarjit Chakraborty, Thomas Erlebach, Simon K&uum...
SUTC
2010
IEEE
13 years 10 months ago
Pushing the Throughput Limit of Low-Complexity Wireless Embedded Sensing Systems
—To maximize the communication throughput for wireless sensing systems, designers have attempted various combinations of protocol design and manual code optimization. Although th...
Vahid Salmani, Pai H. Chou
ICC
2007
IEEE
143views Communications» more  ICC 2007»
14 years 22 days ago
A Stochastic Framework for Scheduling in Wireless Packet Access Networks
— We put forth a unified framework for downlink and uplink scheduling of multiple connections with diverse qualityof-service requirements, where each connection transmits using ...
Xin Wang, Georgios B. Giannakis