890 research outputs found
A Novel Communications Protocol Using Geographic Routing for Swarming UAVs Performing a Search Mission
This research develops the UAV Search Mission Protocol (USMP) for swarming UAVs and determines the protocol\u27s effect on search mission performance. It is hypothesized that geographically routing USMP messages improves search performance by providing geography-dependent data to locations where it impacts search decisions. It is also proposed that the swarm can use data collected by the geographic routing protocol to accurately determine UAV locations and avoid sending explicit location updates. The hypothesis is tested by developing several USMP designs that are combined with the Greedy Perimeter Stateless Routing (GPSR) protocol and a search mission swarm logic into a single network simulation. The test designs use various transmission power levels, sensor types and swarm sizes. The simulation collects performance metrics for each scenario, including measures of distance traveled, UAV direction changes, number of searches and search concentration. USMP significantly improves mission performance over scenarios without inter-UAV communication. However, protocol designs that simply broadcast messages improve search performance by 83% in total searches and 20% in distance traveled compared to geographic routing candidates. Additionally, sending explicit location updates generates 3%-6% better performance per metric versus harvesting GPSR\u27s location information
Resource-efficient strategies for mobile ad-hoc networking
The ubiquity and widespread availability of wireless mobile devices with ever increasing
inter-connectivity (e. g. by means of Bluetooth, WiFi or UWB) have led to new and emerging
next generation mobile communication paradigms, such as the Mobile Ad-hoc NETworks
(MANETs). MANETs are differentiated from traditional mobile systems by their unique properties,
e. g. unpredictable nodal location, unstable topology and multi-hop packet relay. The
success of on-going research in communications involving MANETs has encouraged their applications
in areas with stringent performance requirements such as the e-healthcare, e. g. to
connect them with existing systems to deliver e-healthcare services anytime anywhere. However,
given that the capacity of mobile devices is restricted by their resource constraints (e. g.
computing power, energy supply and bandwidth), a fundamental challenge in MANETs is how
to realize the crucial performance/Quality of Service (QoS) expectations of communications in
a network of high dynamism without overusing the limited resources.
A variety of networking technologies (e. g. routing, mobility estimation and connectivity
prediction) have been developed to overcome the topological instability and unpredictability
and to enable communications in MANETs with satisfactory performance or QoS. However,
these technologies often feature a high consumption of power and/or bandwidth, which makes
them unsuitable for resource constrained handheld or embedded mobile devices. In particular,
existing strategies of routing and mobility characterization are shown to achieve fairly
good performance but at the expense of excessive traffic overhead or energy consumption. For
instance, existing hybrid routing protocols in dense MANETs are based in two-dimensional organizations
that produce heavy proactive traffic. In sparse MANETs, existing packet delivery
strategy often replicates too many copies of a packet for a QoS target. In addition, existing
tools for measuring nodal mobility are based on either the GPS or GPS-free positioning systems,
which incur intensive communications/computations that are costly for battery-powered
terminals. There is a need to develop economical networking strategies (in terms of resource
utilization) in delivering the desired performance/soft QoS targets.
The main goal of this project is to develop new networking strategies (in particular, for
routing and mobility characterization) that are efficient in terms of resource consumptions while
being effective in realizing performance expectations for communication services (e. g. in the
scenario of e-healthcare emergency) with critical QoS requirements in resource-constrained
MANETs.
The main contributions of the thesis are threefold:
(1) In order to tackle the inefficient bandwidth utilization of hybrid service/routing discovery
in dense MANETs, a novel "track-based" scheme is developed. The scheme deploys
a one-dimensional track-like structure for hybrid routing and service discovery. In comparison
with existing hybrid routing/service discovery protocols that are based on two-dimensional
structures, the track-based scheme is more efficient in terms of traffic overhead (e. g. about 60%
less in low mobility scenarios as shown in Fig. 3.4). Due to the way "provocative tracks" are
established, the scheme has also the capability to adapt to the network traffic and mobility for
a better performance.
(2) To minimize the resource utilization of packet delivery in sparse MANETs where wireless
links are intermittently connected, a store-and-forward based scheme, "adaptive multicopy
routing", was developed for packet delivery in sparse mobile ad-hoc networks. Instead
of relying on the source to control the delivery overhead as in the conventional multi-copy
protocols, the scheme allows each intermediate node to independently decide whether to forward
a packet according to the soft QoS target and local network conditions. Therefore, the
scheme can adapt to varying networking situations that cannot be anticipated in conventional
source-defined strategies and deliver packets for a specific QoS targets using minimum traffic
overhead.
ii
(3) The important issue of mobility measurement that imposes heavy communication/computation
burdens on a mobile is addressed with a set of resource-efficient "GPS-free" soluti ons,
which provide mobility characterization with minimal resource utilization for ranging and signalling
by making use of the information of the time-varying ranges between neighbouring
mobile nodes (or groups of mobile nodes). The range-based solutions for mobility characterization
consist of a new mobility metric for network-wide performance measurement, two
velocity estimators for approximating the inter-node relative speeds, and a new scheme for
characterizing the nodal mobility. The new metric and its variants are capable of capturing the
mobility of a network as well as predicting the performance. The velocity estimators are used to
measure the speed and orientation of a mobile relative to its neighbours, given the presence of a
departing node. Based on the velocity estimators, the new scheme for mobility characterization
is capable of characterizing the mobility of a node that are associated with topological stability,
i. e. the node's speeds, orientations relative to its neighbouring nodes and its past epoch time.
iiiBIOPATTERN EU Network of Excellence (EU Contract 508803
Amorphous Placement and Informed Diffusion for Timely Monitoring by Autonomous, Resource-Constrained, Mobile Sensors
Personal communication devices are increasingly equipped with sensors for passive monitoring of encounters and surroundings. We envision the emergence of services that enable a community of mobile users carrying such resource-limited devices to query such information at remote locations in the field in which they collectively roam. One approach to implement such a service is directed placement and retrieval (DPR), whereby readings/queries about a specific location are routed to a node responsible for that location. In a mobile, potentially sparse setting, where end-to-end paths are unavailable, DPR is not an attractive solution as it would require the use of delay-tolerant (flooding-based store-carry-forward) routing of both readings and queries, which is inappropriate for applications with data freshness constraints, and which is incompatible with stringent device power/memory constraints. Alternatively, we propose the use of amorphous placement and retrieval (APR), in which routing and field monitoring are integrated through the use of a cache management scheme coupled with an informed exchange of cached samples to diffuse sensory data throughout the network, in such a way that a query answer is likely to be found close to the query origin. We argue that knowledge of the distribution of query targets could be used effectively by an informed cache management policy to maximize the utility of collective storage of all devices. Using a simple analytical model, we show that the use of informed cache management is particularly important when the mobility model results in a non-uniform distribution of users over the field. We present results from extensive simulations which show that in sparsely-connected networks, APR is more cost-effective than DPR, that it provides extra resilience to node failure and packet losses, and that its use of informed cache management yields superior performance
On the Delay of Reactive-Greedy-Reactive Routing in Unmanned Aeronautical Ad-hoc Networks
AbstractReactive-Greedy-Reactive (RGR) has been proposed as a promising routing protocol in highly mobile density-variable Unmanned Aeronautical Ad-hoc Networks (UAANETs). In RGR, location information of Unmanned Aerial Vehicles (UAVs) as well as reactive end-to-end paths are employed in the routing process. It had already been shown that RGR outperforms existing routing protocols in terms of packet delivery ratio. In this paper, the delay performance of RGR is evaluated and compared against Ad-hoc On-demand Distance Vector (AODV) and Greedy Geographic Forwarding (GGF).We considerextensive simulation scenariostocover both searchingand tracking applicationsofUAANETs. The results illustrate that when the number of UAVs is high enough in a searching mission to form a connected UAANET, RGR performs well. In sparsely connected searching scenarios or dense tracking scenarios, RGR may also slightly decrease delay compared to traditional reactive routing protocols for similar PDR
Performance Evaluation of Ad Hoc Routing in a Swarm of Autonomous Aerial Vehicles
This thesis investigates the performance of three mobile ad hoc routing protocols in the context of a swarm of autonomous unmanned aerial vehicles (UAVs). It is proposed that a wireless network of nodes having an average of 5.1774 log n neighbors, where n is the total number of nodes in the network, has a high probability of having no partitions. By decreasing transmission range while ensuring network connectivity, and implementing multi-hop routing between nodes, spatial multiplexing is exploited whereby multiple pairs of nodes simultaneously transmit on the same channel. The proposal is evaluated using the Greedy Perimeter Stateless Routing (GPSR), Optimized Link State Routing (OLSR), and Ad hoc On-demand Distance Vector (AODV) routing protocols in the context of a swarm of UAVs using the OPNET network simulation tool. The first-known implementation of GPSR in OPNET is constructed, and routing performance is observed when routing protocol, number of nodes, transmission range, and traffic workload are varied. Performance is evaluated based on proportion of packets successfully delivered, average packet hop count, and average end-to-end delay of packets received. Results indicate that the routing protocol choice has a significant impact on routing performance. While GPSR successfully delivers 50% more packets than OLSR, and experiences a 53% smaller end-to-end delay than AODV when routing packets in a swarm of UAVs, increasing transmission range and using direct transmission to destination nodes with no routing results in a level of performance not achieved using any of the routing protocols evaluated
Improving the Performance of Medium Access Control Protocols for Mobile Adhoc Network with Smart Antennas
Requirements for high quality links and great demand for high throughput in Wireless
LAN especially Mobile Ad-hoc Network has motivated new enhancements and work in
Wireless communications such as Smart Antenna Systems. Smart (adaptive) Antennas
enable spatial reuse, increase throughput and they increase the communication range
because of the increase directivity of the antenna array. These enhancements quantified
for the physical layer may not be efficiently utilized, unless the Media Access Control
(MAC) layer is designed accordingly.
This thesis implements the behaviours of two MAC protocols, ANMAC and MMAC
protocols in OPNET simulator. This method is known as the Physical-MAC layer
simulation model. The entire physical layer is written in MATLAB, and MATLAB is
integrated into OPNET to perform the necessary stochastic physical layer simulations.
The aim is to investigate the performance improvement in throughput and delay of the
selected MAC Protocols when using Smart Antennas in a mobile environment. Analytical
methods were used to analyze the average throughput and delay performance of the
selected MAC Protocols with Adaptive Antenna Arrays in MANET when using spatial
diversity. Comparison study has been done between the MAC protocols when using
Switched beam antenna and when using the proposed scheme.
It has been concluded that the throughput and delay performance of the selected protocols
have been improved by the use of Adaptive Antenna Arrays. The throughput and delay
performance of ANMAC-SW and ANMAC-AA protocols was evaluated in details
against regular Omni 802.11 stations. Our results promise significantly enhancement over
Omni 802.11, with a throughput of 25% for ANMAC-SW and 90% for ANMC-AA.
ANMAC-AA outperforms ANMAC-SW protocol by 60%. Simulation experiments
indicate that by using the proposed scheme with 4 Adaptive Antenna Array per a node,
the average throughput in the network can be improved up to 2 to 2.5 times over that
obtained by using Switched beam Antennas. The proposed scheme improves the
performances of both ANMAC and MMAC protocols but ANMAC outperforms MMAC
by 30%
On the Performance of Pedestrian Content Distribution
Mobile communication devices may be used for spreading multimedia data without
support of an infrastructure. Such a scheme, where the data is carried by people walking around and
relayed from device to device by means of short range radio, could potentially form a public content
distribution system that spans vast urban areas. There are basically only three system parameters that can
be determined in the design: the transmission range of the nodes, the setup time when nodes make a
contact, and their storage capacity. The transport mechanism is the flow of people and it can be studied
but not engineered. The question addressed in this paper is how well pedestrian content distribution may
work. We answer this question by modeling the mobility of people moving around in a city, constrained
by a given topology. The model is supplemented by simulation of similar or related scenarios for
validation and extension. Our conclusion is that contents spread well with pedestrian speeds already at
low arrival rates into a studied region. Our contributions are both the results on the feasibility of
pedestrian content distribution and the queuing analytic model that captures the flow of people
Statistical Multiplexing and Traffic Shaping Games for Network Slicing
Next generation wireless architectures are expected to enable slices of
shared wireless infrastructure which are customized to specific mobile
operators/services. Given infrastructure costs and the stochastic nature of
mobile services' spatial loads, it is highly desirable to achieve efficient
statistical multiplexing amongst such slices. We study a simple dynamic
resource sharing policy which allocates a 'share' of a pool of (distributed)
resources to each slice-Share Constrained Proportionally Fair (SCPF). We give a
characterization of SCPF's performance gains over static slicing and general
processor sharing. We show that higher gains are obtained when a slice's
spatial load is more 'imbalanced' than, and/or 'orthogonal' to, the aggregate
network load, and that the overall gain across slices is positive. We then
address the associated dimensioning problem. Under SCPF, traditional network
dimensioning translates to a coupled share dimensioning problem, which
characterizes the existence of a feasible share allocation given slices'
expected loads and performance requirements. We provide a solution to robust
share dimensioning for SCPF-based network slicing. Slices may wish to
unilaterally manage their users' performance via admission control which
maximizes their carried loads subject to performance requirements. We show this
can be modeled as a 'traffic shaping' game with an achievable Nash equilibrium.
Under high loads, the equilibrium is explicitly characterized, as are the gains
in the carried load under SCPF vs. static slicing. Detailed simulations of a
wireless infrastructure supporting multiple slices with heterogeneous mobile
loads show the fidelity of our models and range of validity of our high load
equilibrium analysis
Amorphous Placement and Retrieval of Sensory Data in Sparse Mobile Ad-Hoc Networks
Abstract—Personal communication devices are increasingly being equipped with sensors that are able to passively collect information from their surroundings – information that could be stored in fairly small local caches. We envision a system in which users of such devices use their collective sensing, storage, and communication resources to query the state of (possibly remote) neighborhoods. The goal of such a system is to achieve the highest query success ratio using the least communication overhead (power). We show that the use of Data Centric Storage (DCS), or directed placement, is a viable approach for achieving this goal, but only when the underlying network is well connected. Alternatively, we propose, amorphous placement, in which sensory samples are cached locally and informed exchanges of cached samples is used to diffuse the sensory data throughout the whole network. In handling queries, the local cache is searched first for potential answers. If unsuccessful, the query is forwarded to one or more direct neighbors for answers. This technique leverages node mobility and caching capabilities to avoid the multi-hop communication overhead of directed placement. Using a simplified mobility model, we provide analytical lower and upper bounds on the ability of amorphous placement to achieve uniform field coverage in one and two dimensions. We show that combining informed shuffling of cached samples upon an encounter between two nodes, with the querying of direct neighbors could lead to significant performance improvements. For instance, under realistic mobility models, our simulation experiments show that amorphous placement achieves 10% to 40% better query answering ratio at a 25% to 35% savings in consumed power over directed placement.National Science Foundation (CNS Cybertrust 0524477, CNS NeTS 0520166, CNS ITR 0205294, EIA RI 0202067
- …