An evolutionary approach to routing in mobile AD HOC networks using dominating sets.

This thesis presents a new approach to routing in ad-hoc wireless networks using virtual backbones that may be approximated by the graph theoretic concept of dominating sets. · Ad hoc wireless networks provide a flexible and quick means of establishing wireless peer-to-peer communications. Routing remains the main challenging problem in an ad hoc network due to its multihop nature and dynamic network topology. Several protocols based on virtual backbones in ad hoc wireless networks have been proposed that may be used to simplify the routing process. However, little is known about the network routing performance of these protocols and no attempt has previously been made to directly compare them. This thesis is the first research effort to implement, analyze and compare the routing performance of dominating-set-based routing protocols. In this study, we examine four existing routing approaches using a virtual backbone, or spine , imposed on the ad­hoc network. We then propose an evolutionary approach to constructing a stable minimum connected dominating set in an ad hoc wireless network: this employs the use of a genetic algorithm. Since the mobile· nodes that constitute an ad hoc wireless network are constantly in motion, the network configuration is subject to constant change in a manner that resembles the biological process of mutation. This evolution of networks over time lends itself naturally to a model based on genetic algorithms. As part of an in-depth study of the application of genetic algorithms in the field of wireless networks, a scatternet formation protocol for Bluetooth networks was designed, developed and evaluated. This helped to build the knowledge base required to implement new routing protocols using the network simulator ns-2. Simulation studies were then conducted using ns-2 to compare the performance of previously proposed dominating­set-based routing approaches. In this thesis, we analyze the performance of our evolutionary routing approach and compare it with the previous approaches. We present our simulation results and show that our evolutionary routing approach outperforms the other routing algorithms with respect to end-to-end packet delay, throughput, packet delivery ratio and routing overhead· across several different scenarios. Thus, we demonstrate the advantages of utilizing a genetic algorithm to construct a backbone that is · used to effectively route packets in an ad-hoc wireless network

A zone-based shared-tree multicast protocol for mobile ad hoc networks

This paper proposes a new multicast protocol for mobile ad hoc networks (MANETs). The proposed protocol, Shared-Tree MZR, is a shared tree variant of the Multicast Routing Protocol based on Zone Routing (MZR). The concept of zone-based multicast routing for mobile ad hoc networks was originally proposed in MZR. The new protocol utilizes the advantages of the shared-tree together with the advantages of the zone-based routing. The performance of the protocol is analyzed for various network conditions. The test results show that the new protocol performs well and has significantly low overhead in scenarios with multiple sources

Multilevel adaptive security system

Recent trends show increased demand for content-rich media such as images, videos and text in ad-hoc communication. Since such content often tends to be private, sensitive, or paid for, there exists a requirement for securing such information over resource constrained ad hoc networks. In this work, traditional data security mechanisms, existing ad hoc secure routing protocols and multilevel security are first reviewed. Then a new system, called the Multilevel Adaptive Security System, which incorporates the multilevel security concept at both the application layer and the network layer, is proposed to provide adaptive security services for data and routing processes. MLASS is composed of two subsystems: Content-Based Multi-level Data Security (CB-MLDS) for content-rich data protection and Multi-Level On-demand Secure Mobile Ad hoc Routing (MOSAR) for secure route selection. The structure of each sub-system is explained in detail; experiments for each sub-system were conducted and the performance was analyzed. It is shown that MLASS is a practical security solution that is flexible enough to adapt to a range of security requirements and applies appropriate level of security services to data and its distribution over ad hoc networks. MLASS provides a balance between security, performance and resource

Geographic Adaptive Fidelity and Geographic Energy Aware Routing in Ad Hoc Routing

Location based routing protocols are the kinds of routing protocols, which use of nodes’ location information, instead of links’ information for routing. They are also known as position based routing. In position based routing protocols, it is supposed that the packet source node has position information of itself and its neighbors and packet destination node. In recent years, many location based routing protocols have been developed for ad hoc and sensor networks. In this paper we shall present the concept of location-based routing protocol, its advantages and disadvantages. We shall also look into two popular location-based protocols: Geographic Adaptive Fidelity (GAF) and Geographic and Energy Aware Routing (GEAR)

Social relationship based routing for delay tolerant Bluetooth-enabled PSN communications

PhDOpportunistic networking is a concept derived from the mobile ad hoc networking in which devices have no prior knowledge of routes to the intended destinations. Content dissemination in opportunistic networks thus is carried out in a store and forward fashion. Opportunistic routing poses distinct challenges compared to the traditional networks such as Internet and mobile ad hoc networks where nodes have prior knowledge of the routes to the intended destinations. Information dissemination in opportunistic networks requires dealing with intermittent connectivity, variable delays, short connection durations and dynamic topology. Addressing these challenges becomes a significant motivation for developing novel applications and protocols for information dissemination in opportunistic networks. This research looks at opportunistic networking, specifically at networks composed of mobile devices or, pocket switched networks. Mobile devices are now accepted as an integral part of society and are often equipped with Bluetooth capabilities that allow for opportunistic information sharing between devices. The ad hoc nature of opportunistic networks means nodes have no advance routing knowledge and this is key challenge. Human social relationships are based on certain patterns that can be exploited to make opportunistic routing decisions. Targeting nodes that evidence high popularity or high influence can enable more efficient content dissemination. Based on this observation, a novel impact based neighbourhood algorithm called Lobby Influence is presented. The algorithm is tested against two previously proposed algorithms and proves better in terms of message delivery and delay. Moreover, unlike other social based algorithms, which have a tendency to concentrate traffic through their identified routing nodes, the new algorithm provides a fairer load distribution, thus alleviating the tendency to saturate individual nodes

A Composite Trust Model for Secure Routing in Mobile Ad-Hoc Networks

It is imperative to address the issue of secure routing in mobile ad-hoc networks (MANETs) where the nodes seek for cooperative and trusted behaviour from the peer nodes in the absence of well-established infrastructure and centralized authority. Due to the inherent absence of security considerations in the traditional ad-hoc routing protocols, providing security and reliability in the routing of data packets is a major challenge. This work addresses this issue by proposing a composite trust metric based on the concept of social trust and quality-of-service (QoS) trust. Extended from the ad-hoc on-demand distance vector (AODV) routing protocol, we propose an enhanced trust-based model integrated with an attack-pattern discovery mechanism, which attempts to mitigate the adversaries craving to carry out distinct types of packet-forwarding misbehaviours. We present the detailed mode of operations of three distinct adversary models against which the proposed scheme is evaluated. Simulation results under different network conditions depict that the combination of social and QoS trust components provides significant improvement in packet delivery ratio, routing overhead, and energy consumption compared to an existing trust-based scheme

An efficient QOS routing protocol for mobile ad-hoc networks

To satisfy the user requirements for continuous and real-time multimedia information, the concept of Quality of Service (QoS) has emerged as a main issue in mobile ad-hoc networks. QoS routing is to find a route according to the QoS requirements of the users. In this paper, we propose an efficient QoS routing protocol that is based on AODV over TDMA, one of the typical routing protocols for mobile ad-hoc networks, by making a bandwidth reservation for QoS guarantee. While the existing schemes calculate the maximum available bandwidth for each candidate path, our scheme is to check only if the bandwidth of a given path satisfies the end-to-end QoS requirement. Also, the key idea in the bandwidth reservation is to select carefully time slots without causing any conficts in the wireless environment, thereby maximizing the bandwidth efficiency. In order to evaluate the performance of the proposed QoS routing protocol, some simulations are carried out in the adhoc environment. The simulation results show that the proposed protocol provides sufficiently low and stable delay performance regardless of the offered load.1st IFIP International Conference on Ad-Hoc NetWorkingRed de Universidades con Carreras en Informática (RedUNCI

Geocasting and Multicasting Routing Operation in Mobile Ad Hoc Network

Abstract: The paper considers, the different multicasting routing protocols in wireless mobile Ad hoc network (MANET).An Ad hoc network is composed of mobile nodes without the presence of a wired support infrastructure .In this environment routing/multicasting protocols are faced with the challenge of producing multihop router under host mobility and band constraints. Various approaches and routing protocol have been proposed to address Ad hoc networking problems and multiple standardization effort within the Internet Engineering Task Force, along with academic and industrial research projects. In recent year, a number of new multicast protocols of different styles have been proposed for Ad hoc networks. Geocast Adaptive Mesh Environment for Routing [GAMER] is one which provides geocast communication in an Ad hoc network and it adapts to the correct network environment by dynamically changing the density of the mesh. Forwarding Group Multicast Protocol [FGMP] is based on the forward group concept and it dynamically refreshes the forward group member using a procedure to On-Demand routing. The relative strengths, weakness and applicability of each multicast protocol to diverse situations have considered and analyzed. Index Terms: FGMP Protocol, GAMER Protocol, MANETs, multicast, routing. An Ad hoc networks [1] [2] , is a dynamically reconfigurable wireless network with no fixed infrastructure (or) central administration. Due to the limited radio propagation range of wireless devices, routers are often "multihop". Applications such as disaster recovery, crowd control, search, rescue and automated battlefields are typical examples of where Ad hoc networks are deployed. Nodes in these networks more arbitrary thus network topology changes frequently and unpredictably. Moreover, bandwidth and battery power are limited. These constraints, in combination with the dynamic network topology make routing and multicasting in Ad hoc networks extremely challenging. Various multicast protocols have been newly proposed to perform multicasting in Ad hoc network. However, no operation study between them has yet been performed. The comparative analysis of Ad hoc unicast routing protocols has been reported. This paper gives a comparison study of two protocols with different characteristics: GAMER [3] and FGMP The rest of the paper is organized as follows. Section I presents an overview of the multicast protocols. The section II discusses the future enhancements, and concluding remarks are made in section III.