171 research outputs found
Recommended from our members
Efficient route discovery for reactive routing
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Information on the location of mobile nodes in Mobile Ad-hoc Networks (MANETs) has
the potential to significantly improve network performance. This thesis uses node location information to develop new techniques for route discovery in on-demand routing protocols such as the Ad-hoc On-Demand Distance Vector (AODV), thus making an important contribution to enhancing the experience of using mobile networks.
A Candidate Neighbours to Rebroadcast the Route Request (CNRR) approach has been
proposed to reduce the deleterious impact, known as the broadcast storm, of RREQ packets
flooding in traditional on-demand routing protocols. The main concept behind CNRR is
specifying a set of neighbours which will rebroadcast the received RREQ. This is a departure from the traditional approach of all receiving nodes rebroadcasting RREQs and has the effect of reducing the problem of redundancy from which mobile networks suffer. The proposed protocol has been developed in two phases: Closest-CNRR and Furthest-CNRR. The simulation results show that the proposed algorithms have a significant effect as they reduce the routing overhead of the AODV protocol by up to 28% compared to the C-CNRR, and by up to 17.5% compared to the F-CNRR. Notably, the proposed algorithms simultaneously achieve better throughput and less data dropping.
The Link Stability and Energy Aware protocol (LSEA) has been developed to reduce the
overhead while increasing network lifetimes. The LSEA helps to control the global
dissemination of RREQs in the network by eliminating those nodes that have a residual
energy level below a specific threshold value from participation in end-to-end routes. The proposed LSEA protocol significantly increases network lifetimes by up to 19% compared with other on-demand routing protocols while still managing to obtain the same packet delivery ratio and network throughput levels. Furthermore, merging the LSEA and CNRR concepts has the great advantage of reducing the dissemination of RREQs in the network without loss of reachability among the nodes.
This increases network lifetimes, reduces the overhead and increases the amount of data
sent and received. Accordingly, a Position-based Selective Neighbour (PSN) approach has
been proposed which combines the advantages of zoning and link stability. The results
show that the proposed technique has notable advantages over both the AODV and MAAODV
as it improves delivery ratios by 24.6% and 18.8%, respectively.Funded by National Council for Training -
Sudan and the Sudan Academy of Science
Probabilistic route discovery for Wireless Mobile Ad Hoc Networks (MANETs)
Mobile wireless ad hoc networks (MANETs) have become of increasing interest in view of their promise to extend connectivity beyond traditional fixed infrastructure networks. In MANETs, the task of routing is distributed among network nodes which act as both end points and routers in a wireless multi-hop network environment.
To discover a route to a specific destination node, existing on-demand routing protocols employ a broadcast scheme referred to as simple flooding whereby a route request packet (RREQ) originating from a source node is blindly disseminated to the rest of the network nodes. This can lead to excessive redundant retransmissions, causing high channel contention and packet collisions in the network, a phenomenon called a broadcast storm.
To reduce the deleterious impact of flooding RREQ packets, a number of route discovery algorithms have been suggested over the past few years based on, for example, location, zoning or clustering. Most such approaches however involve considerably increased complexity requiring additional hardware or the maintenance of complex state information. This research argues that such requirements can be largely alleviated without sacrificing performance gains through the use of probabilistic broadcast methods, where an intermediate node rebroadcasts RREQ packets based on some suitable forwarding probability rather than in the traditional deterministic manner.
Although several probabilistic broadcast algorithms have been suggested for MANETs in the past, most of these have focused on “pure” broadcast scenarios with relatively little investigation of the performance impact on specific applications such as route discovery. As a consequence, there has been so far very little study of the performance of probabilistic route discovery applied to the well-established MANET routing protocols. In an effort to fill this gap, the first part of this thesis evaluates the performance of the routing protocols Ad hoc On demand Distance Vector (AODV) and Dynamic Source Routing (DSR) augmented with probabilistic route discovery, taking into account parameters such as network density, traffic density and nodal mobility. The results reveal encouraging benefits in overall routing control overhead but also show that network operating conditions have a critical impact on the optimality of the forwarding probabilities.
In most existing probabilistic broadcast algorithms, including the one used here for preliminary investigations, each forwarding node is allowed to rebroadcast a received packet with a fixed forwarding probability regardless of its relative location with respect to the locations of the source and destination pairs. However, in a route discovery operation, if the location of the destination node is known, the dissemination of the RREQ packets can be directed towards this location. Motivated by this, the second part of the research proposes a probabilistic route discovery approach that aims to reduce further the routing overhead by limiting the dissemination of the RREQ packets towards the anticipated location of the destination. This approach combines elements of the fixed probabilistic and flooding-based route discovery approaches. The results indicate that in a relatively dense network, these combined effects can reduce the routing overhead very significantly when compared with that of the fixed probabilistic route discovery.
Typically in a MANET there are regions of varying node density. Under such conditions, fixed probabilistic route discovery can suffer from a degree of inflexibility, since every node is assigned the same forwarding probability regardless of local conditions. Ideally, the forwarding probability should be high for a node located in a sparse region of the network while relatively lower for a node located in a denser region of the network. As a result, it can be helpful to identify and categorise mobile nodes in the various regions of the network and appropriately adjust their forwarding probabilities. To this end the research examines probabilistic route discovery methods that dynamically adjust the forwarding probability at a node, based on local node density, which is estimated using number of neighbours as a parameter. Results from this study return significantly superior performance measures compared with fixed probabilistic variants.
Although the probabilistic route discovery methods suggested above can significantly reduce the routing control overhead without degrading the overall network throughput, there remains the problem of how to select efficiently forwarding probabilities that will optimize the performance of a broadcast under any given conditions. In an attempt to address this issue, the final part of this thesis proposes and evaluates the feasibility of a node estimating its own forwarding probability dynamically based on locally collected information. The technique examined involves each node piggybacking a list of its 1-hop neighbours in its transmitted RREQ packets. Based on this list, relay nodes can determine the number of neighbours that have been already covered by a broadcast and thus compute the forwarding probabilities most suited to individual circumstances
Internet protocol MANET vs named data MANET: A critical evaluation
Many researches have been done in the field of mobile networking, specifically in the field of ad-hoc networks.The major aim of these networks is the delivery of data to a given node at the destination, irrespective of its location.Mobile Ad-hoc Network (MANET) employs the traditional TCP/IP structure to provide end-to-end communication between nodes (we named this type of architecture is IP-MANET).However, due to their
mobility and the limited resource in wireless networks, each layer in the TCP/IP model requires redefinition or modifications to function efficiently in MANET. Named Data MANET (NDMANET)
architecture is a recently emerging research area. The in-network chunk-based caching feature of NDN is beneficial in coping with the mobility and intermittent connectivity challenges in MANETs.In the natural disaster field, MANET is considered a challenging task because of the unpredictable changes in the network topology due to the absence of any centralized control.The goals of this paper have two ways: first, this study provides a performance comparison of IP-MANET to ND-MANET in terms of throughput, delay, and packet loss.While the second contribution is to identify which architecture has an impact on the natural disaster (i.e., Flooding disaster) in rural areas and suggests which one may perform better.For experimental purposes, our analyses IP-MANET and ND-MANET by extensive simulations in the NS 3 simulator under a number of different network scenarios, and show that how number of nodes and variety packets size affect their performance
A Secure 3-Way Routing Protocols for Intermittently Connected Mobile Ad Hoc Networks
The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET
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
Mobile Ad hoc Networking: Imperatives and Challenges
Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self-organize into arbitrary and temporary, "ad-hoc" network topologies, allowing people and devices to seamlessly internetwork in areas with no pre-existing communication infrastructure, e.g., disaster recovery environments. Ad hoc networking concept is not a new one, having been around in various forms for over 20 years. Traditionally, tactical networks have been the only communication networking application that followed the ad hoc paradigm. Recently, the introduction of new technologies such as the Bluetooth, IEEE 802.11 and Hyperlan are helping enable eventual commercial MANET deployments outside the military domain. These recent evolutions have been generating a renewed and growing interest in the research and development of MANET. This paper attempts to provide a comprehensive overview of this dynamic field. It first explains the important role that mobile ad hoc networks play in the evolution of future wireless technologies. Then, it reviews the latest research activities in these areas, including a summary of MANET\u27s characteristics, capabilities, applications, and design constraints. The paper concludes by presenting a set of challenges and problems requiring further research in the future
Cross-layer optimizations in multi-hop ad hoc networks
Unlike traditional wireless networks, characterized by the presence of last-mile, static and
reliable infrastructures, Mobile ad Hoc Networks (MANETs) are dynamically formed by
collections of mobile and static terminals that exchange data by enabling each other's
communication. Supporting multi-hop communication in a MANET is a challenging
research area because it requires cooperation between different protocol layers (MAC,
routing, transport). In particular, MAC and routing protocols could be considered
mutually cooperative protocol layers. When a route is established, the exposed and
hidden terminal problems at MAC layer may decrease the end-to-end performance
proportionally with the length of each route. Conversely, the contention at MAC layer
may cause a routing protocol to respond by initiating new routes queries and routing table
updates.
Multi-hop communication may also benefit the presence of pseudo-centralized virtual
infrastructures obtained by grouping nodes into clusters. Clustering structures may
facilitate the spatial reuse of resources by increasing the system capacity: at the same
time, the clustering hierarchy may be used to coordinate transmissions events inside the
network and to support intra-cluster routing schemes. Again, MAC and clustering
protocols could be considered mutually cooperative protocol layers: the clustering
scheme could support MAC layer coordination among nodes, by shifting the distributed
MAC paradigm towards a pseudo-centralized MAC paradigm. On the other hand, the
system benefits of the clustering scheme could be emphasized by the pseudo-centralized
MAC layer with the support for differentiated access priorities and controlled contention.
In this thesis, we propose cross-layer solutions involving joint design of MAC, clustering
and routing protocols in MANETs.
As main contribution, we study and analyze the integration of MAC and clustering
schemes to support multi-hop communication in large-scale ad hoc networks. A novel
clustering protocol, named Availability Clustering (AC), is defined under general nodes'
heterogeneity assumptions in terms of connectivity, available energy and relative
mobility. On this basis, we design and analyze a distributed and adaptive MAC protocol,
named Differentiated Distributed Coordination Function (DDCF), whose focus is to
implement adaptive access differentiation based on the node roles, which have been
assigned by the upper-layer's clustering scheme. We extensively simulate the proposed
clustering scheme by showing its effectiveness in dominating the network dynamics,
under some stressing mobility models and different mobility rates. Based on these results,
we propose a possible application of the cross-layer MAC+Clustering scheme to support
the fast propagation of alert messages in a vehicular environment.
At the same time, we investigate the integration of MAC and routing protocols in large
scale multi-hop ad-hoc networks. A novel multipath routing scheme is proposed, by
extending the AOMDV protocol with a novel load-balancing approach to concurrently
distribute the traffic among the multiple paths. We also study the composition effect of a
IEEE 802.11-based enhanced MAC forwarding mechanism called Fast Forward (FF),
used to reduce the effects of self-contention among frames at the MAC layer. The
protocol framework is modelled and extensively simulated for a large set of metrics and
scenarios.
For both the schemes, the simulation results reveal the benefits of the cross-layer
MAC+routing and MAC+clustering approaches over single-layer solutions
- …