Sciweavers

2571 search results - page 86 / 515
» Approximation schemes for wireless networks
Sort
View
ICC
2007
IEEE
142views Communications» more  ICC 2007»
15 years 10 months ago
Optimal Pricing for Selfish Users and Prefetching in Heterogeneous Wireless Networks
Prefetching has been shown to be an effective technique for reducing resource cost and delay in heterogeneous wireless networks. However, in modern wireless local area networks, th...
Jonathan Y. Lau, Ben Liang
COMCOM
2006
148views more  COMCOM 2006»
15 years 6 months ago
An adaptive bluetooth packet selection and scheduling scheme in interference environments
Bluetooth is a new technology for Wireless Personal Area Networks (WPANs). It intends to eliminate the need of wires and connectors between a variety of devices, like PCs and thei...
Chen-Han Shih, Kuochen Wang, Hung-Cheng Shih
INFOCOM
2008
IEEE
16 years 1 months 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
JCS
2007
84views more  JCS 2007»
15 years 6 months ago
On the security of group communication schemes
Many emerging applications in both wired and wireless networks need support of secure group communications. There have been many secure group communication schemes in the setting ...
Shouhuai Xu
WIOPT
2006
IEEE
16 years 23 days ago
Ad Hoc networks with topology-transparent scheduling schemes: Scaling laws and capacity/delay tradeoffs
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
Daniele Miorandi, Hwee Pink Tan, Michele Zorzi