Sciweavers

552 search results - page 73 / 111
» Routing complexity of faulty networks
Sort
View
PODC
2009
ACM
14 years 8 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
PERCOM
2008
ACM
14 years 7 months ago
Topology Formation in IEEE 802.15.4: Cluster-Tree Characterization
The IEEE 802.15.4 standard defines a set of procedures to set-up a Low-Rate Wireless Personal Area Network where nodes self-organize into a logical communication structure through ...
Francesca Cuomo, Sara Della Luna, Petia Todorova, ...
MSWIM
2004
ACM
14 years 1 months ago
Experimental evaluation of wireless simulation assumptions
All analytical and simulation research on ad hoc wireless networks must necessarily model radio propagation using simplifying assumptions. Although it is tempting to assume that a...
David Kotz, Calvin C. Newport, Robert S. Gray, Jas...
DBISP2P
2004
Springer
150views Database» more  DBISP2P 2004»
14 years 1 months ago
Adapting the Content Native Space for Load Balanced Indexing
Today, there is an increasing demand to share data with complex data types (e.g., multi-dimensional) over large numbers of data sources. One of the key challenges is sharing these ...
Yanfeng Shu, Kian-Lee Tan, Aoying Zhou
TPDS
2010
136views more  TPDS 2010»
13 years 6 months ago
Gossip-Based Self-Management of a Recursive Area Hierarchy for Large Wireless SensorNets
—A recursive multi-hop area hierarchy has a number of applications in wireless sensor networks, the most common being scalable point-to-point routing, so-called hierarchical rout...
Konrad Iwanicki, Maarten van Steen