Sciweavers

223 search results - page 41 / 45
» Design time analysis of multiagent protocols
Sort
View
PEWASUN
2007
ACM
13 years 9 months ago
Worst-case lifetime computation of a wireless sensor network by model-checking
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...
Laurent Mounier, Ludovic Samper, Wassim Znaidi
PODC
2006
ACM
14 years 1 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
WWW
2004
ACM
14 years 8 months ago
Accurate, scalable in-network identification of p2p traffic using application signatures
The ability to accurately identify the network traffic associated with different P2P applications is important to a broad range of network operations including application-specifi...
Subhabrata Sen, Oliver Spatscheck, Dongmei Wang
WISEC
2009
ACM
14 years 2 months ago
Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks
Recent studies show that network coding can provide significant benefits to network protocols, such as increased throughput, reduced network congestion, higher reliability, and ...
Jing Dong, Reza Curtmola, Cristina Nita-Rotaru
GLOBECOM
2007
IEEE
14 years 1 months ago
Dynamic Multipath Onion Routing in Anonymous Peer-To-Peer Overlay Networks
— Although recent years provided many protocols for anonymous routing in overlay networks, they commonly rely on the same communication paradigm: Onion Routing. In Onion Routing ...
Olaf Landsiedel, Lexi Pimenidis, Klaus Wehrle, Hei...