Sciweavers

306 search results - page 49 / 62
» Routing Algorithms for Anycast Messages
Sort
View
IPPS
2007
IEEE
15 years 10 months ago
Performance Modelling of Necklace Hypercubes
The necklace hypercube has recently been introduced as an attractive alternative to the well-known hypercube. Previous research on this network topology has mainly focused on topo...
Sina Meraji, Hamid Sarbazi-Azad, Ahmad Patooghy
PODC
2009
ACM
15 years 11 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
WINET
2011
14 years 11 months ago
Sleep scheduling with expected common coverage in wireless sensor networks
Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor...
Eyuphan Bulut, Ibrahim Korpeoglu
INFOCOM
2006
IEEE
15 years 10 months ago
Loss-Cognizant Pricing in Feed-Forward Networks with Greedy Users
— We consider feed-forward packet switched networks with fixed routing and random congestion losses. Users of the network are assumed to be greedy in the sense that each user in...
Ashraf Al Daoud, Murat Alanyali
SASN
2006
ACM
15 years 10 months ago
Attack-resilient hierarchical data aggregation in sensor networks
In a large sensor network, in-network data aggregation, i.e., combining partial results at intermediate nodes during message routing, significantly reduces the amount of communic...
Sankardas Roy, Sanjeev Setia, Sushil Jajodia