Sciweavers

5316 search results - page 897 / 1064
» Which Search Problems Are Random
Sort
View
EPEW
2007
Springer
15 years 8 months ago
An Efficient Counter-Based Broadcast Scheme for Mobile Ad Hoc Networks
In mobile ad hoc networks (MANETs), broadcasting plays a fundamental role, diffusing a message from a given source node to all the other nodes in the network. Flooding is the simpl...
Aminu Mohammed, Mohamed Ould-Khaoua, Lewis M. Mack...
CN
2007
137views more  CN 2007»
15 years 4 months ago
AID: A global anti-DoS service
Distributed denial of service (DDoS) has long been an open security problem of the Internet. Most proposed solutions require the upgrade of routers across the Internet, which is e...
Shigang Chen, Yibei Ling, Randy Chow, Ye Xia
JACM
2006
134views more  JACM 2006»
15 years 4 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
INFOCOM
2010
IEEE
15 years 2 months ago
A Node-failure-resilient Anonymous Communication Protocol through Commutative Path Hopping
Abstract—With rising concerns on user privacy over the Internet, anonymous communication systems that hide the identity of a participant from its partner or third parties are hig...
Fengjun Li, Bo Luo, Peng Liu, Chao-Hsien Chu
TON
2010
147views more  TON 2010»
15 years 2 months ago
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
Tao Shu, Marwan Krunz