Sciweavers

2473 search results - page 237 / 495
» The Logic of Communication Graphs
Sort
View
INFOCOM
2009
IEEE
16 years 1 months ago
Minimum Maximum Degree Publish-Subscribe Overlay Network Design
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
Melih Onus, Andréa W. Richa
ICC
2008
IEEE
127views Communications» more  ICC 2008»
16 years 1 months ago
On the Devolution of Large-Scale Sensor Networks in the Presence of Random Failures
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
Fei Xing, Wenye Wang
APPROX
2004
Springer
149views Algorithms» more  APPROX 2004»
16 years 2 days ago
Edge Coloring with Delays
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
Noga Alon, Vera Asodi
INFOCOM
2010
IEEE
15 years 5 months ago
VBS: Maximum Lifetime Sleep Scheduling for Wireless Sensor Networks Using Virtual Backbones
—Wireless sensor network (WSN) applications require redundant sensors to guarantee fault tolerance. However, the same degree of redundancy is not necessary for multi-hop communic...
Yaxiong Zhao, Jie Wu, Feng Li, Sanglu Lu
HOTNETS
2010
15 years 1 months ago
Packet re-cycling: eliminating packet losses due to network failures
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or nod...
Suksant Sae Lor, Raul Landa, Miguel Rio