Sciweavers

1687 search results - page 169 / 338
» On the complexity of scheduling in wireless networks
Sort
View
VTC
2008
IEEE
162views Communications» more  VTC 2008»
16 years 24 days ago
A Selective Cluster Index Scheduling Method in OFDMA
—OFDM is an attractive solution for the design of future wireless communications due to its robustness to dispersion in multipath environments. Additional diversity gains can be ...
Marios Nicolaou, Angela Doufexi, Simon Armour
PERCOM
2004
ACM
16 years 6 months ago
Mix Zones: User Privacy in Location-aware Services
Privacy of personal location information is becoming an increasingly important issue. This paper refines a method, called the mix zone, developed to enhance user privacy in locati...
Alastair R. Beresford, Frank Stajano
EMNETS
2007
15 years 10 months ago
Robust node localization for wireless sensor networks
The node localization problem in Wireless Sensor Networks has received considerable attention, driven by the need to obtain a higher location accuracy without incurring a large, p...
Radu Stoleru, John A. Stankovic, Sang Hyuk Son
TSP
2010
15 years 1 months ago
Randomized and distributed self-configuration of wireless networks: two-layer Markov random fields and near-optimality
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
Sung-eok Jeon, Chuanyi Ji
MOBIHOC
2005
ACM
16 years 6 months ago
Timed grid routing (TIGR) bites off energy
Energy efficiency and collisions avoidance are both critical properties to increase the lifetime and effectiveness of wireless networks. This paper proposes a family of algorithms...
Roy Friedman, Guy Korland