Sciweavers

668 search results - page 55 / 134
» On Providing Non-uniform Scheduling Guarantees in a Wireless...
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Complexity of scheduling with analog network coding
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
Olga Goussevskaia, Roger Wattenhofer
MOBIQUITOUS
2008
IEEE
14 years 2 months ago
Congestion control protocol for wireless sensor networks handling prioritized heterogeneous traffic
Heterogeneous applications could be assimilated within the same wireless sensor network with the aid of modern motes that have multiple sensor boards on a single radio board. Diff...
Muhammad Mostafa Monowar, Md. Obaidur Rahman, Al-S...
ADHOCNOW
2011
Springer
12 years 11 months ago
Joint Duty Cycle Scheduling, Resource Allocation and Multi-constrained QoS Routing Algorithm
Wireless mesh sensor networks (WMSNs) have recently gained a lot of interest due to their communication capability to support various applications with different Quality of Service...
Jamila Ben Slimane, Yeqiong Song, Anis Koubaa, Mou...
INFOCOM
2007
IEEE
14 years 2 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
WINET
2010
97views more  WINET 2010»
13 years 6 months ago
Routing in the frequency domain
Abstract The design of single transceiver based multichannel multi-hop wireless mesh networks focuses on the trade-off between rapid neighbor synchronization and maximizing the usa...
Jay A. Patel, Haiyun Luo, Indranil Gupta