Sciweavers

2571 search results - page 276 / 515
» Approximation schemes for wireless networks
Sort
View
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
15 years 8 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
TCOM
2008
192views more  TCOM 2008»
15 years 6 months ago
Joint source coding, routing and power allocation in wireless sensor networks
This paper proposes a cross-layer optimization framework for the wireless sensor networks. In a wireless sensor network, each sensor makes a local observation of the underlying phy...
Jun Yuan, Wei Yu
BROADNETS
2007
IEEE
16 years 1 months ago
Modeling and performance analysis of an improved DCF-based mechanism under noisy channel
The ISM free-licence band is highly used by wireless technologies such IEEE 802.11, Bluetooth as well as private wireless schemes. This huge utilisation increases dramatically the ...
Adlen Ksentini, Marc Ibrahim
IMC
2010
ACM
15 years 4 months ago
The effect of packet loss on redundancy elimination in cellular wireless networks
Network-level redundancy elimination (RE) algorithms reduce traffic volume on bandwidth-constrained network paths by avoiding the transmission of repeated byte sequences. Previous...
Cristian Lumezanu, Katherine Guo, Neil Spring, Bob...
MOBICOM
2012
ACM
13 years 9 months ago
AutoMAC: rateless wireless concurrent medium access
Current wireless network design is built on the ethos of avoiding interference. In this paper we question this long-held design principle. We show that with appropriate design, su...
Aditya Gudipati, Stephanie Pereira, Sachin Katti