Sciweavers

2149 search results - page 248 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
MOBIHOC
2005
ACM
16 years 1 months ago
On the node-scheduling approach to topology control in ad hoc networks
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
Budhaditya Deb, Badri Nath
MONET
2006
145views more  MONET 2006»
15 years 1 months ago
Efficient Resource Allocation for Policy-Based Wireless/Wireline Interworking
Abstract This paper proposes efficient resource allocation techniques for a policy-based wireless/wireline interworking architecture, where quality of service (QoS) provisioning an...
Yu Cheng, Wei Song, Weihua Zhuang, Alberto Leon-Ga...
SIGMETRICS
2010
ACM
223views Hardware» more  SIGMETRICS 2010»
15 years 6 months ago
Self-synchronizing properties of CSMA wireless multi-hop networks
We show that CSMA is able to spontaneously synchronize transmissions in a wireless network with constant-size packets, and that this property can be used to devise efficient synch...
Kuang Xu, Olivier Dousse, Patrick Thiran
JPDC
2006
134views more  JPDC 2006»
15 years 1 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
ICDM
2008
IEEE
230views Data Mining» more  ICDM 2008»
15 years 8 months ago
Clustering Distributed Time Series in Sensor Networks
Event detection is a critical task in sensor networks, especially for environmental monitoring applications. Traditional solutions to event detection are based on analyzing one-sh...
Jie Yin, Mohamed Medhat Gaber