Sciweavers

7133 search results - page 222 / 1427
» Communication algorithms with advice
Sort
View
INFOCOM
2008
IEEE
16 years 15 days ago
On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
Yan Wu, Sonia Fahmy, Ness B. Shroff
154
Voted
INFOCOM
2008
IEEE
16 years 15 days ago
A Distributed Minimum-Distortion Routing Algorithm with In-Network Data Processing
—In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g. capacity constraints) and to increase the utility of data in the output ...
Ramin Khalili, James F. Kurose
INFOCOM
2008
IEEE
16 years 15 days ago
Approximation Algorithms for Scheduling Real-Time Multicast Flows in Wireless LANs
—Abstract—In recent years, numerous large-scale Wireless LANs (WLAN) have been deployed all over the world. However, the shortage of non-interfering channels makes it a challen...
Yigal Bejerano, Dongwook Lee, Prasun Sinha, Lisa Z...
ICC
2007
IEEE
142views Communications» more  ICC 2007»
16 years 12 days ago
Energy efficiency of MIMO-based Sensor Networks with a Cooperative Node Selection Algorithm
– Low-cost and low-power sensor nodes forming Wireless Sensor Networks (WSNs) have become suitable for a wide range of applications during recent years. These networks, due to th...
George N. Bravos, Athanasios G. Kanatas
ICC
2007
IEEE
143views Communications» more  ICC 2007»
16 years 12 days ago
Application-Aware Topology Formation Algorithm for Peer-to-Peer Networks
—When constructing an unstructured P2P topology, one should consider the application running on top of it in order to achieve a good performance for the whole P2P system. It is n...
Kin Wah Kwong, Danny H. K. Tsang