Sciweavers

179 search results - page 28 / 36
» Distributed Graph Layout for Sensor Networks
Sort
View
MSWIM
2004
ACM
15 years 2 months ago
Quantile models for the threshold range for k-connectivity
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
Henri Koskinen
HPCC
2007
Springer
15 years 3 months ago
On Pancyclicity Properties of OTIS Networks
The OTIS-Network (also referred to as two-level swapped network) is composed of n clones of an n-node original network constituting its clusters. It has received much attention due...
Mohammad R. Hoseinyfarahabady, Hamid Sarbazi-Azad
INFOCOM
2009
IEEE
15 years 4 months ago
Duty-Cycle-Aware Broadcast in Wireless Sensor Networks
—Broadcast is one of the most fundamental services in wireless sensor networks (WSNs). It facilitates sensor nodes to propagate messages across the whole network, serving a wide ...
Feng Wang, Jiangchuan Liu
DCOSS
2006
Springer
15 years 1 months ago
Distance-Sensitive Information Brokerage in Sensor Networks
In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms o...
Stefan Funke, Leonidas J. Guibas, An Nguyen, Yusu ...
93
Voted
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
15 years 2 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar