2,320 research outputs found
Survivability in Time-varying Networks
Time-varying graphs are a useful model for networks with dynamic connectivity
such as vehicular networks, yet, despite their great modeling power, many
important features of time-varying graphs are still poorly understood. In this
paper, we study the survivability properties of time-varying networks against
unpredictable interruptions. We first show that the traditional definition of
survivability is not effective in time-varying networks, and propose a new
survivability framework. To evaluate the survivability of time-varying networks
under the new framework, we propose two metrics that are analogous to MaxFlow
and MinCut in static networks. We show that some fundamental
survivability-related results such as Menger's Theorem only conditionally hold
in time-varying networks. Then we analyze the complexity of computing the
proposed metrics and develop several approximation algorithms. Finally, we
conduct trace-driven simulations to demonstrate the application of our
survivability framework to the robust design of a real-world bus communication
network
Data Confidentiality in Mobile Ad hoc Networks
Mobile ad hoc networks (MANETs) are self-configuring infrastructure-less
networks comprised of mobile nodes that communicate over wireless links without
any central control on a peer-to-peer basis. These individual nodes act as
routers to forward both their own data and also their neighbours' data by
sending and receiving packets to and from other nodes in the network. The
relatively easy configuration and the quick deployment make ad hoc networks
suitable the emergency situations (such as human or natural disasters) and for
military units in enemy territory. Securing data dissemination between these
nodes in such networks, however, is a very challenging task. Exposing such
information to anyone else other than the intended nodes could cause a privacy
and confidentiality breach, particularly in military scenarios. In this paper
we present a novel framework to enhance the privacy and data confidentiality in
mobile ad hoc networks by attaching the originator policies to the messages as
they are sent between nodes. We evaluate our framework using the Network
Simulator (NS-2) to check whether the privacy and confidentiality of the
originator are met. For this we implemented the Policy Enforcement Points
(PEPs), as NS-2 agents that manage and enforce the policies attached to packets
at every node in the MANET.Comment: 12 page
- …