Sciweavers

5234 search results - page 824 / 1047
» Simulation of Computer Network Attacks
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 8 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
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...
ISCAPDCS
2007
15 years 5 months ago
Efficient soft QoS guarantee in mobile ad hoc networks
More and more Quality of Service (QoS) sensitive applications, such as streaming media, high bandwidth content distribution and VoIP, will be deployed in Mobile Ad hoc Networks (M...
Gaogang Xie, Zhenyu Li, Valérie Issarny, Al...
TKDE
2008
137views more  TKDE 2008»
15 years 4 months ago
GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks
Abstract-- In peer-to-peer (P2P) networks, reputation aggregation and peer ranking are the most time-consuming and spacedemanding operations. This paper proposes a gossip-based rep...
Runfang Zhou, Kai Hwang, Min Cai
CORR
2004
Springer
142views Education» more  CORR 2004»
15 years 4 months ago
Dynamic Localization Protocols for Mobile Sensor Networks
The ability of a sensor node to determine its physical location within a network (Localization) is of fundamental importance in sensor networks. Interpretating data from sensors i...
Sameer Tilak, Vinay Kolar, Nael B. Abu-Ghazaleh, K...