161 search results - page 31 / 33 » Coverage-Preserving Routing Protocols for Randomly Distribut... |
DCOSS
2006
Springer
13 years 9 months ago
2006
Springer
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...
IPSN
2007
Springer
13 years 11 months ago
2007
Springer
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
MOBICOM
2003
ACM
13 years 10 months ago
2003
ACM
One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number...
MOBICOM
2009
ACM
13 years 12 months ago
2009
ACM
In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schem...
PERCOM
2006
ACM
14 years 5 months ago
2006
ACM
In mobile peer-to-peer (MP2P) networks, nodes tend to gather together rather than scattered uniformly across the network area. This paper considers the clustering of peer nodes an...