Sciweavers

2571 search results - page 98 / 515
» Approximation schemes for wireless networks
Sort
View
GLOBECOM
2008
IEEE
15 years 7 months ago
Maximum-Lifetime Coding Subgraph for Multicast Traffic in Wireless Sensor Networks
It has been shown that network coding can lead to significant improvement in network capacity and reduction in power consumption for multicast traffic in wireless networks. In this...
Vahid Shah-Mansouri, Vincent W. S. Wong
JVCIR
2006
280views more  JVCIR 2006»
15 years 6 months ago
Error resiliency schemes in H.264/AVC standard
Real-time transmission of video data in network environments, such as wireless and Internet, is a challenging task, as it requires high compression efficiency and network friendly...
Sunil Kumar, Liyang Xu, Mrinal K. Mandal, Sethuram...
INFOCOM
2008
IEEE
16 years 1 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu
INFOCOM
2012
IEEE
13 years 9 months ago
Constant-approximation for target coverage problem in wireless sensor networks
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai...
WCNC
2008
IEEE
16 years 1 months ago
A Resource Allocation Scheme for TH-UWB Networks with Multiple Sinks
Abstract—In this work, we study the time-slot allocation problem in a multi-sink single-hop TH-UWB network scenario, where the traffic from a sensor node is anycasted via a sing...
Hwee-Xian Tan, Mun-Choon Chan, Peng Yong Kong, Che...