1,508 research outputs found
Recommended from our members
Minimizing Detection Probability Routing in Ad Hoc Networks Using Directional Antennas
In a hostile environment, it is important for a transmitter to make its wireless transmission invisible to adversaries because an adversary can detect the transmitter if the received power at its antennas is strong enough. This paper defines a detection probability model to compute the level of a transmitter being detected by a detection system at arbitrary location around the transmitter. Our study proves that the probability of detecting a directional antenna is much lower than that of detecting an omnidirectional antenna if both the directional and omnidirectional antennas provide the same Effective Isotropic Radiated Power (EIRP) in the direction of the receiver. We propose a Minimizing Detection Probability (MinDP) routing algorithm to find a secure routing path in ad hoc networks where nodes employ directional antennas to transmit data to decrease the probability of being detected by adversaries. Our study shows that the MinDP routing algorithm can reduce the total detection probability of deliveries from the source to the destination by over 74%.RIGHTS : This article is licensed under the BioMed Central licence at http://www.biomedcentral.com/about/license which is similar to the 'Creative Commons Attribution Licence'. In brief you may : copy, distribute, and display the work; make derivative works; or make commercial use of the work - under the following conditions: the original author must be given credit; for any reuse or distribution, it must be made clear to others what the license terms of this work are
Location Spoofing Detection for VANETs by a Single Base Station in Rician Fading Channels
In this work we examine the performance of a Location Spoofing Detection
System (LSDS) for vehicular networks in the realistic setting of Rician fading
channels. In the LSDS, an authorized Base Station (BS) equipped with multiple
antennas utilizes channel observations to identify a malicious vehicle, also
equipped with multiple antennas, that is spoofing its location. After deriving
the optimal transmit power and the optimal directional beamformer of a
potentially malicious vehicle, robust theoretical analysis and detailed
simulations are conducted in order to determine the impact of key system
parameters on the LSDS performance. Our analysis shows how LSDS performance
increases as the Rician K-factor of the channel between the BS and legitimate
vehicles increases, or as the number of antennas at the BS or legitimate
vehicle increases. We also obtain the counter-intuitive result that the
malicious vehicle's optimal number of antennas conditioned on its optimal
directional beamformer is equal to the legitimate vehicle's number of antennas.
The results we provide here are important for the verification of location
information reported in IEEE 1609.2 safety messages.Comment: 6 pages, 5 figures, Added further clarification on constraints
imposed on the detection minimization strategy. Minor typos fixe
Interference-Aware Scheduling for Connectivity in MIMO Ad Hoc Multicast Networks
We consider a multicast scenario involving an ad hoc network of co-channel
MIMO nodes in which a source node attempts to share a streaming message with
all nodes in the network via some pre-defined multi-hop routing tree. The
message is assumed to be broken down into packets, and the transmission is
conducted over multiple frames. Each frame is divided into time slots, and each
link in the routing tree is assigned one time slot in which to transmit its
current packet. We present an algorithm for determining the number of time
slots and the scheduling of the links in these time slots in order to optimize
the connectivity of the network, which we define to be the probability that all
links can achieve the required throughput. In addition to time multiplexing,
the MIMO nodes also employ beamforming to manage interference when links are
simultaneously active, and the beamformers are designed with the maximum
connectivity metric in mind. The effects of outdated channel state information
(CSI) are taken into account in both the scheduling and the beamforming
designs. We also derive bounds on the network connectivity and sum transmit
power in order to illustrate the impact of interference on network performance.
Our simulation results demonstrate that the choice of the number of time slots
is critical in optimizing network performance, and illustrate the significant
advantage provided by multiple antennas in improving network connectivity.Comment: 34 pages, 12 figures, accepted by IEEE Transactions on Vehicular
Technology, Dec. 201
Airborne Directional Networking: Topology Control Protocol Design
This research identifies and evaluates the impact of several architectural design choices in relation to airborne networking in contested environments related to autonomous topology control. Using simulation, we evaluate topology reconfiguration effectiveness using classical performance metrics for different point-to-point communication architectures. Our attention is focused on the design choices which have the greatest impact on reliability, scalability, and performance. In this work, we discuss the impact of several practical considerations of airborne networking in contested environments related to autonomous topology control modeling. Using simulation, we derive multiple classical performance metrics to evaluate topology reconfiguration effectiveness for different point-to-point communication architecture attributes for the purpose of qualifying protocol design elements
Message and time efficient multi-broadcast schemes
We consider message and time efficient broadcasting and multi-broadcasting in
wireless ad-hoc networks, where a subset of nodes, each with a unique rumor,
wish to broadcast their rumors to all destinations while minimizing the total
number of transmissions and total time until all rumors arrive to their
destination. Under centralized settings, we introduce a novel approximation
algorithm that provides almost optimal results with respect to the number of
transmissions and total time, separately. Later on, we show how to efficiently
implement this algorithm under distributed settings, where the nodes have only
local information about their surroundings. In addition, we show multiple
approximation techniques based on the network collision detection capabilities
and explain how to calibrate the algorithms' parameters to produce optimal
results for time and messages.Comment: In Proceedings FOMC 2013, arXiv:1310.459
Cross-layer schemes for performance optimization in wireless networks
Wireless networks are undergoing rapid progress and inspiring numerous applications. As the application of wireless networks becomes broader, they are expected to not only provide ubiquitous connectivity, but also support end users with certain service guarantees.
End-to-end delay is an important Quality of Service (QoS) metric in multihop wireless networks. This dissertation addresses how to minimize end-to-end delay through joint optimization of network layer routing and link layer scheduling. Two cross-layer schemes, a loosely coupled cross-layer scheme and a tightly coupled cross-layer scheme, are proposed. The two cross-layer schemes involve interference modeling in multihop wireless networks with omnidirectional antenna. In addition, based on the interference model, multicast schedules are optimized to minimize the total end-to-end delay.
Throughput is another important QoS metric in wireless networks. This dissertation addresses how to leverage the spatial multiplexing function of MIMO links to improve wireless network throughput. Wireless interference modeling of a half-duplex MIMO node is presented. Based on the interference model, routing, spatial multiplexing, and scheduling are jointly considered in one optimization model. The throughput optimization problem is first addressed in constant bit rate networks and then in variable bit rate networks. In a variable data rate network, transmitters can use adaptive coding and modulation schemes to change their data rates so that the data rates are supported by the Signal to Noise and Interference Ratio (SINR). The problem of achieving maximum throughput in a millimeter-wave wireless personal area network is studied --Abstract, page iv
A Mixed-Integer Programming Approach for Jammer Placement Problems for Flow-Jamming Attacks on Wireless Communication Networks
In this dissertation, we study an important problem of security in wireless networks. We study different attacks and defense strategies in general and more specifically jamming attacks. We begin the dissertation by providing a tutorial introducing the operations research community to the various types of attacks and defense strategies in wireless networks. In this tutorial, we give examples of mathematical programming models to model jamming attacks and defense against jamming attacks in wireless networks. Later we provide a comprehensive taxonomic classification of the various types of jamming attacks and defense against jamming attacks. The classification scheme will provide a one stop location for future researchers on various jamming attack and defense strategies studied in literature. This classification scheme also highlights the areas of research in jamming attack and defense against jamming attacks which have received less attention and could be a good area of focus for future research. In the next chapter, we provide a bi-level mathematical programming model to study jamming attack and defense strategy. We solve this using a game-theoretic approach and also study the impact of power level, location of jamming device, and the number of transmission channels available to transmit data on the attack and defense against jamming attacks. We show that by increasing the number of jamming devices the throughput of the network drops by at least 7%. Finally we study a special type of jamming attack, flow-jamming attack. We provide a mathematical programming model to solve the location of jamming devices to increase the impact of flow-jamming attacks on wireless networks. We provide a Benders decomposition algorithm along with some acceleration techniques to solve large problem instances in reasonable amount of time. We draw some insights about the impact of power, location and size of the network on the impact of flow-jamming attacks in wireless networks
- …