Results 1 - 10
of
18,831
Downscaling Network Scenarios with Denial of
"... Abstract — A major challenge that researchers face in studying Denial of service (DoS) attacks is the size of the network to be investigated. A typical DoS attack usually takes place over a large portion of the Internet and involves a considerable number of hosts. This can be intractable for testbed ..."
Abstract
- Add to MetaCart
for testbed experimentation, and even simulation. Therefore, it is important to simplify a network scenario with DoS attacks before applying it to a simulation/testbed platform. Several approaches have been proposed in the literature to downscale a network scenario, while preserving certain critical
How practical is network coding?
, 2006
"... With network coding, intermediate nodes between the source and the receivers of an end-to-end communication session are not only capable of relaying and replicating data messages, but also of coding incoming messages to produce coded outgoing ones. Recent studies have shown that network coding is ..."
Abstract
-
Cited by 1016 (23 self)
- Add to MetaCart
With network coding, intermediate nodes between the source and the receivers of an end-to-end communication session are not only capable of relaying and replicating data messages, but also of coding incoming messages to produce coded outgoing ones. Recent studies have shown that network coding
Probabilistic Routing in Intermittently Connected Networks
- SIGMOBILE Mobile Computing and Communication Review
, 2004
"... In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There does ..."
Abstract
-
Cited by 654 (6 self)
- Add to MetaCart
. There does, however, exist a number of scenarios where connectivity is intermittent, but where the possibility of communication still is desirable. Thus, there is a need for a way to route through networks with these properties. We propose PROPHET, a probabilistic routing protocol for intermittently
Directed Diffusion for Wireless Sensor Networking
- IEEE/ACM Transactions on Networking
, 2003
"... Advances in processor, memory and radio technology will enable small and cheap nodes capable of sensing, communication and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the directed diffusion paradigm for such ..."
Abstract
-
Cited by 675 (9 self)
- Add to MetaCart
Advances in processor, memory and radio technology will enable small and cheap nodes capable of sensing, communication and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the directed diffusion paradigm
Application of Phylogenetic Networks in Evolutionary Studies
- SUBMITTED TO MBE 2005
, 2005
"... The evolutionary history of a set of taxa is usually represented by a phylogenetic tree, and this model has greatly facilitated the discussion and testing of hypotheses. However, it is well known that more complex evolutionary scenarios are poorly described by such models. Further, even when evoluti ..."
Abstract
-
Cited by 887 (15 self)
- Add to MetaCart
The evolutionary history of a set of taxa is usually represented by a phylogenetic tree, and this model has greatly facilitated the discussion and testing of hypotheses. However, it is well known that more complex evolutionary scenarios are poorly described by such models. Further, even when
A Secure Routing Protocol for Ad Hoc Networks
, 2002
"... Most recent ad hoc network research has focused on providing routing services without considering security. In this paper, we detail security threats against ad hoc routing protocols, specifically examining AODV and DSR. In light of these threats, we identify three different environments with distin ..."
Abstract
-
Cited by 508 (0 self)
- Add to MetaCart
with distinct security requirements. We propose a solution to one, the managed-open scenario where no network infrastructure is pre-deployed, but a small amount of prior security coordination is expected. Our protocol, ARAN, is based on certificates and successfully defeats all identified attacks.
Network Coding for Large Scale Content Distribution
"... We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduling of bloc ..."
Abstract
-
Cited by 493 (7 self)
- Add to MetaCart
-riding are in place. We demonstrate through simulations of scenarios of practical interest that the expected file download time improves by more than 20-30 % with network coding compared to coding at the server only and, by more than 2-3 times compared to sending unencoded information. Moreover, we show that network
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks
, 2003
"... An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vec ..."
Abstract
-
Cited by 534 (8 self)
- Add to MetaCart
operations in the protocol. SEAD performs well over the range of scenarios we tested, and is robust against multiple uncoordinated attackers creating incorrect routing state in any other node, even in spite of any active attackers or compromised nodes in the network.
Data Streams: Algorithms and Applications
, 2005
"... In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has emerg ..."
Abstract
-
Cited by 533 (22 self)
- Add to MetaCart
emerged for reasoning about algorithms that work within these constraints on space, time, and number of passes. Some of the methods rely on metric embeddings, pseudo-random computations, sparse approximation theory and communication complexity. The applications for this scenario include IP network traffic
GPS-free positioning in mobile ad hoc networks
- Cluster Computing
, 2001
"... this paper, we describe an algorithm for the positioning of nodes in an ad hoc network that does not use GPS. The algorithm provides a position information to the nodes in the scenarios where an infrastructure does not exist and GPS cannot be used. GPS-free positioning is also desirable, when the GP ..."
Abstract
-
Cited by 462 (12 self)
- Add to MetaCart
this paper, we describe an algorithm for the positioning of nodes in an ad hoc network that does not use GPS. The algorithm provides a position information to the nodes in the scenarios where an infrastructure does not exist and GPS cannot be used. GPS-free positioning is also desirable, when
Results 1 - 10
of
18,831