Sciweavers

118 search results - page 23 / 24
» Randomness in Wireless Networks: How to Deal with It
Sort
View
TELSYS
2002
131views more  TELSYS 2002»
13 years 4 months ago
Call Blocking Performance Study for PCS Networks under More Realistic Mobility Assumptions
Abstract. In the micro-cell-based PCS networks, due to the high user mobility, handoffs occur more frequently. Hence, the classical assumptions, such as the exponential assumptions...
Helen Zeng, Yuguang Fang, Imrich Chlamtac
MOBIHOC
2005
ACM
14 years 4 months ago
Low-coordination topologies for redundancy in sensor networks
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
Rajagopal Iyengar, Koushik Kar, Suman Banerjee
DCOSS
2006
Springer
13 years 9 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
SIGMETRICS
2009
ACM
182views Hardware» more  SIGMETRICS 2009»
13 years 11 months ago
The age of gossip: spatial mean field regime
Disseminating a piece of information, or updates for a piece of information, has been shown to benefit greatly from simple randomized procedures, sometimes referred to as gossipi...
Augustin Chaintreau, Jean-Yves Le Boudec, Nikodin ...
MSWIM
2005
ACM
13 years 10 months ago
Topology control with better radio models: implications for energy and multi-hop interference
Topology Control (TC) is a well-studied technique used in wireless ad hoc networks to find energy-efficient and/or low-interference subgraphs of the maxpower communication graph....
Douglas M. Blough, Mauro Leoncini, Giovanni Resta,...