6,521 research outputs found
A Contribution to Secure the Routing Protocol "Greedy Perimeter Stateless Routing" Using a Symmetric Signature-Based AES and MD5 Hash
This work presents a contribution to secure the routing protocol GPSR (Greedy
Perimeter Stateless Routing) for vehicular ad hoc networks, we examine the
possible attacks against GPSR and security solutions proposed by different
research teams working on ad hoc network security. Then, we propose a solution
to secure GPSR packet by adding a digital signature based on symmetric
cryptography generated using the AES algorithm and the MD5 hash function more
suited to a mobile environment
On the Throughput-Delay Trade-off in Georouting Networks
We study the scaling properties of a georouting scheme in a wireless
multi-hop network of mobile nodes. Our aim is to increase the network
capacity quasi linearly with while keeping the average delay bounded. In
our model, mobile nodes move according to an i.i.d. random walk with velocity
and transmit packets to randomly chosen destinations. The average packet
delivery delay of our scheme is of order and it achieves the network
capacity of order . This shows a practical
throughput-delay trade-off, in particular when compared with the seminal result
of Gupta and Kumar which shows network capacity of order and
negligible delay and the groundbreaking result of Grossglausser and Tse which
achieves network capacity of order but with an average delay of order
. We confirm the generality of our analytical results using
simulations under various interference models.Comment: This work has been submitted to IEEE INFOCOM 201
A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks
This paper presents a thorough survey of recent work addressing energy
efficient multicast routing protocols and secure multicast routing protocols in
Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which
witness the need of energy management and security in ad hoc wireless networks.
The objective of a multicast routing protocol for MANETs is to support the
propagation of data from a sender to all the receivers of a multicast group
while trying to use the available bandwidth efficiently in the presence of
frequent topology changes. Multicasting can improve the efficiency of the
wireless link when sending multiple copies of messages by exploiting the
inherent broadcast property of wireless transmission. Secure multicast routing
plays a significant role in MANETs. However, offering energy efficient and
secure multicast routing is a difficult and challenging task. In recent years,
various multicast routing protocols have been proposed for MANETs. These
protocols have distinguishing features and use different mechanismsComment: 15 page
A Survey on Wireless Sensor Network Security
Wireless sensor networks (WSNs) have recently attracted a lot of interest in
the research community due their wide range of applications. Due to distributed
nature of these networks and their deployment in remote areas, these networks
are vulnerable to numerous security threats that can adversely affect their
proper functioning. This problem is more critical if the network is deployed
for some mission-critical applications such as in a tactical battlefield.
Random failure of nodes is also very likely in real-life deployment scenarios.
Due to resource constraints in the sensor nodes, traditional security
mechanisms with large overhead of computation and communication are infeasible
in WSNs. Security in sensor networks is, therefore, a particularly challenging
task. This paper discusses the current state of the art in security mechanisms
for WSNs. Various types of attacks are discussed and their countermeasures
presented. A brief discussion on the future direction of research in WSN
security is also included.Comment: 24 pages, 4 figures, 2 table
Optimal fault-tolerant placement of relay nodes in a mission critical wireless network
The operations of many critical infrastructures (e.g., airports) heavily depend on proper functioning of the radio communication network supporting operations. As a result, such a communication network is indeed a mission-critical communication network that needs adequate protection from external electromagnetic interferences. This is usually done through radiogoniometers. Basically, by using at least three suitably deployed radiogoniometers and a gateway gathering information from them, sources of electromagnetic emissions that are not supposed to be present in the monitored area can be localised. Typically, relay nodes are used to connect radiogoniometers to the gateway. As a result, some degree of fault-tolerance for the network of relay nodes is essential in order to offer a reliable monitoring. On the other hand, deployment of relay nodes is typically quite expensive. As a result, we have two conflicting requirements: minimise costs while guaranteeing a given fault-tolerance. In this paper address the problem of computing a deployment for relay nodes that minimises the relay node network cost while at the same time guaranteeing proper working of the network even when some of the relay nodes (up to a given maximum number) become faulty (fault-tolerance). We show that the above problem can be formulated as a Mixed Integer Linear Programming (MILP) as well as a Pseudo-Boolean Satisfiability (PB-SAT) optimisation problem and present experimental results com- paring the two approaches on realistic scenarios
- …