3,564 research outputs found
A Self-Organization Framework for Wireless Ad Hoc Networks as Small Worlds
Motivated by the benefits of small world networks, we propose a
self-organization framework for wireless ad hoc networks. We investigate the
use of directional beamforming for creating long-range short cuts between
nodes. Using simulation results for randomized beamforming as a guideline, we
identify crucial design issues for algorithm design. Our results show that,
while significant path length reduction is achievable, this is accompanied by
the problem of asymmetric paths between nodes. Subsequently, we propose a
distributed algorithm for small world creation that achieves path length
reduction while maintaining connectivity. We define a new centrality measure
that estimates the structural importance of nodes based on traffic flow in the
network, which is used to identify the optimum nodes for beamforming. We show,
using simulations, that this leads to significant reduction in path length
while maintaining connectivity.Comment: Submitted to IEEE Transactions on Vehicular Technolog
On Capacity and Delay of Multi-channel Wireless Networks with Infrastructure Support
In this paper, we propose a novel multi-channel network with infrastructure
support, called an MC-IS network, which has not been studied in the literature.
To the best of our knowledge, we are the first to study such an MC-IS network.
Our proposed MC-IS network has a number of advantages over three existing
conventional networks, namely a single-channel wireless ad hoc network (called
an SC-AH network), a multi-channel wireless ad hoc network (called an MC-AH
network) and a single-channel network with infrastructure support (called an
SC-IS network). In particular, the network capacity of our proposed MC-IS
network is times higher than that of an SC-AH network and an
MC-AH network and the same as that of an SC-IS network, where is the number
of nodes in the network. The average delay of our MC-IS network is times lower than that of an SC-AH network and an MC-AH network, and
times lower than the average delay of an SC-IS network, where
and denote the number of channels dedicated for infrastructure
communications and the number of interfaces mounted at each infrastructure
node, respectively. Our analysis on an MC-IS network equipped with
omni-directional antennas only has been extended to an MC-IS network equipped
with directional antennas only, which are named as an MC-IS-DA network. We show
that an MC-IS-DA network has an even lower delay of compared with an SC-IS network and our
MC-IS network. For example, when and , an
MC-IS-DA network can further reduce the delay by 24 times lower that of an
MC-IS network and reduce the delay by 288 times lower than that of an SC-IS
network.Comment: accepted, IEEE Transactions on Vehicular Technology, 201
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
Adaptive multi-channel MAC protocol for dense VANET with directional antennas
Directional antennas in Ad hoc networks offer more benefits than the traditional antennas with omni-directional mode. With directional antennas, it can increase the spatial reuse of the wireless channel. A higher gain of directional antennas makes terminals a further transmission range and fewer hops to the destination. This paper presents the design, implementation and simulation results of a multi-channel Medium Access Control (MAC) protocols for dense Vehicular Ad hoc Networks using directional antennas with local beam tables. Numeric results show that our protocol performs better than the existing multichannel protocols in vehicular environment
Continuum Equilibria and Global Optimization for Routing in Dense Static Ad Hoc Networks
We consider massively dense ad hoc networks and study their continuum limits
as the node density increases and as the graph providing the available routes
becomes a continuous area with location and congestion dependent costs. We
study both the global optimal solution as well as the non-cooperative routing
problem among a large population of users where each user seeks a path from its
origin to its destination so as to minimize its individual cost. Finally, we
seek for a (continuum version of the) Wardrop equilibrium. We first show how to
derive meaningful cost models as a function of the scaling properties of the
capacity of the network and of the density of nodes. We present various
solution methodologies for the problem: (1) the viscosity solution of the
Hamilton-Jacobi-Bellman equation, for the global optimization problem, (2) a
method based on Green's Theorem for the least cost problem of an individual,
and (3) a solution of the Wardrop equilibrium problem using a transformation
into an equivalent global optimization problem
Spatial networks with wireless applications
Many networks have nodes located in physical space, with links more common
between closely spaced pairs of nodes. For example, the nodes could be wireless
devices and links communication channels in a wireless mesh network. We
describe recent work involving such networks, considering effects due to the
geometry (convex,non-convex, and fractal), node distribution,
distance-dependent link probability, mobility, directivity and interference.Comment: Review article- an amended version with a new title from the origina
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
- âŠ