Sciweavers

867 search results - page 4 / 174
» Network Robustness and Graph Topology
Sort
View
AP2PC
2004
Springer
14 years 1 months ago
Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance
Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust sel...
George H. L. Fletcher, Hardik A. Sheth, Katy B&oum...
INFOCOM
2008
IEEE
14 years 2 months ago
Robust Planarization of Unlocalized Wireless Sensor Networks
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
Fenghui Zhang, Anxiao Jiang, Jianer Chen
JUCS
2006
117views more  JUCS 2006»
13 years 7 months ago
Resource Efficient Maintenance of Wireless Network Topologies
Abstract: Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if th...
Tamás Lukovszki, Christian Schindelhauer, K...
WOWMOM
2009
ACM
143views Multimedia» more  WOWMOM 2009»
14 years 2 months ago
Improving partial cover of Random Walks in large-scale Wireless Sensor Networks
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
Leonidas Tzevelekas, Ioannis Stavrakakis
CORR
2006
Springer
101views Education» more  CORR 2006»
13 years 7 months ago
Geographic Gossip: Efficient Aggregation for Sensor Networks
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....