Sciweavers

120 search results - page 3 / 24
» Effective Routing and Scheduling in Adversarial Queueing Net...
Sort
View
MOBIHOC
2003
ACM
14 years 7 months ago
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
In hostile environments, the enemy can launch traffic analysis against interceptable routing information embedded in routing messages and data packets. Allowing adversaries to tra...
Jiejun Kong, Xiaoyan Hong
CORR
2002
Springer
92views Education» more  CORR 2002»
13 years 7 months ago
Source Routing and Scheduling in Packet Networks
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of pat...
Matthew Andrews, Antonio Fernández, Ashish ...
IPCCC
2007
IEEE
14 years 1 months ago
Rerouting Time and Queueing in Proactive Ad Hoc Networks
In a MANET network where nodes move frequently, the probability of connectivity loss between nodes might be high, and communication sessions may easily loose connectivity during t...
Vinh Pham, Erlend Larsen, Knut Øvsthus, Paa...
EOR
2008
133views more  EOR 2008»
13 years 7 months ago
Vehicle routing with dynamic travel times: A queueing approach
Transportation is an important component of supply chain competitiveness since it plays a major role in the inbound, inter-facility, and outbound logistics. In this context, assig...
Tom Van Woensel, Laoucine Kerbache, Herbert Perema...
JSAC
2010
86views more  JSAC 2010»
13 years 5 months ago
A randomized countermeasure against parasitic adversaries in wireless sensor networks
—Due to their limited capabilities, wireless sensor nodes are subject to physical attacks that are hard to defend against. In this paper, we first identify a typical attacker, c...
Panagiotis Papadimitratos, Jun Luo, Jean-Pierre Hu...