Sciweavers

2571 search results - page 90 / 515
» Approximation schemes for wireless networks
Sort
View
SODA
2004
ACM
98views Algorithms» more  SODA 2004»
15 years 8 months ago
End-to-end packet-scheduling in wireless ad-hoc networks
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
INFOCOM
2009
IEEE
16 years 1 months ago
Minimum-Latency Beaconing Schedule in Multihop Wireless Networks
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
Peng-Jun Wan, Xiao-Hua Xu, Lixin Wang, Xiaohua Jia...
WASA
2009
Springer
126views Algorithms» more  WASA 2009»
16 years 1 months ago
Data Collection with Multiple Sinks in Wireless Sensor Networks
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multip...
Sixia Chen, Matthew Coolbeth, Hieu Dinh, Yoo-Ah Ki...
TCOM
2011
138views more  TCOM 2011»
15 years 1 months ago
Exact and Asymptotic Outage Probability Analysis for Decode-and-Forward Networks
Abstract—We consider decode-and-forward cooperative networks and we derive analytical expressions as well as tractable asymptotic approximations for the outage probability of a n...
Ioannis Chatzigeorgiou, Weisi Guo, Ian J. Wassell,...
MOBIHOC
2012
ACM
13 years 9 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn