Sciweavers

1687 search results - page 62 / 338
» On the complexity of scheduling in wireless networks
Sort
View
SRDS
2010
IEEE
15 years 4 months ago
Crash-Tolerant Collision-Free Data Aggregation Scheduling for Wireless Sensor Networks
Data aggregation scheduling, or convergecast, is a fundamental pattern of communication in wireless sensor networks (WSNs), where sensor nodes aggregate and relay data to a sink no...
Arshad Jhumka
WOWMOM
2005
ACM
129views Multimedia» more  WOWMOM 2005»
15 years 11 months ago
The Wireless Hierarchical Token Bucket: A Channel Aware Scheduler for 802.11 Networks
The paper proposes an architecture for a scheduling algorithm, to be integrated in IEEE 802.11 Access Points (AP), able to take into account, besides the transport service class r...
Rosario Giuseppe Garroppo, Stefano Giordano, Stefa...
EUROSSC
2007
Springer
16 years 9 days ago
Escalation:  Complex Event Detection in Wireless Sensor Networks
We present a new approach for the detection of complex events in Wireless Sensor Networks. Complex events are sets of data points that correspond to interesting or unusual patterns...
Michael Zoumboulakis, George Roussos
TON
2010
168views more  TON 2010»
15 years 25 days ago
Engineering Wireless Mesh Networks: Joint Scheduling, Routing, Power Control, and Rate Adaptation
Abstract--We present a number of significant engineering insights on what makes a good configuration for medium- to largesize wireless mesh networks (WMNs) when the objective funct...
Jun Luo, Catherine Rosenberg, André Girard
WINET
2010
105views more  WINET 2010»
15 years 4 months ago
Flow rank based probabilistic fair scheduling for wireless ad hoc networks
Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows in a network. It is particularly challenging for ad hoc ...
Md. Mamun-Or-Rashid, Muhammad Mahbub Alam, Md. Abd...