8 research outputs found
Routing and Security in Mobile Ad Hoc Networks
A Mobile Ad hoc Network (MANET) consists of a set of nodes which can form a network among themselves. MANETs have applications in areas such as military, disaster rescue operations, monitoring animal habitats, etc. where establishing fixed communication infrastructure is not feasible. Routing protocols designed for MANETs can be broadly classified as position-based (geographic), topology-based and hybrid. Geographic routing uses location information of nodes to route messages. Topology-based routing uses network state information for route discovery and maintenance. Hybrid routing protocols use features in both position-based and topology-based approaches. Position-based routing protocols route packets towards the destination using greedy forwarding (i.e., an intermediate node forwards packets to a neighbor that is closer to the destination than itself). If a node has no neighbor that is closer to the destination than itself, greedy forwarding fails. In this case, we say there is void. Different position-based routing protocols use different methods for dealing with voids. Topology-based routing protocols can be classified into on-demand (reactive) routing protocols and proactive routing protocols. Generally, on-demand routing protocols establish routes when needed by flooding route requests throughout the entire network, which is not a scalable approach. Reactive routing protocols try to maintain routes between every pair of nodes by periodically exchanging messages with each other which is not a scalable approach also. This thesis addresses some of these issues and makes the following contribution.
First, we present a position-based routing protocol called Greedy Routing Protocol with Backtracking (GRB) which uses a simple backtracking technique to route around voids, unlike existing position-based routing protocols which construct planarized graph of the local network to route around voids. We compare the performance of our protocol with the well known Greedy Perimeter Stateless Routing (GPSR) protocol and the Ad-Hoc On-demand Distance Vector (AODV) routing protocol as well as the Dynamic Source Routing (DSR) protocol. Performance evaluation shows that our protocol has less control overhead than those of DSR, AODV, and GPSR. Performance evaluation also shows that our protocol has a higher packet-delivery ratio, lower end-to-end delay, and less hop count, on average, compared to AODV, DSR and GPSR. We then present an on-demand routing protocol called ``Hybrid On-demand Greedy Routing Protocol with Backtracking for Mobile Ad-Hoc Networks which uses greedy approach for route discovery. This prevents flooding route requests, unlike the existing on-demand routing protocols. This approach also helps in finding routes that have lower hop counts than AODV and DSR. Our performance evaluation confirms that our protocol performs better than AODV and DSR, on average, with respect to hop count, packet-delivery ratio and control overhead.
In MANETs, all nodes need to cooperate to establish routes. Establishing secure and valid routes in the presence of adversaries is a challenge in MANETs. Some of the well-known source routing protocols presented in the literature (e.g., Ariadne and endairA) which claim to establish secure routes are susceptible to hidden channel attacks. We address this issue and present a secure routing protocol called SAriadne, based on sanitizable signatures. We show that our protocol detects and prevents hidden channel attacks
Advancing the Potential of Routing Protocol in Mobile Ad Hoc Network
An ad hoc network consists of nodes with a radio without wire which has multi hop network surroundings [3]. Their messages can be sent anywhere with the help of intermediate nodes only in limits. Broadcasting is mobile ad hoc networks (MANET) is process to send message one to other nodes of the network [1]. It has far-reaching application in mobile ad hoc networks (MANET). It provides significant control and route administration for all types protocols let it be unicast or multicast protocols. It has become an important and all above to find a strong routing protocol in networking research. MANET has important part like as D.S.R., A.O.D.V. for routing information and location routing are used to established routes [5]. There are many problems in broadcasting of MANETS due to reasons like; Variable and unpredictable characteristics, Fluctuation of Strength, Channel Contention problem and Packet Collision problem [4]. The study had been done to cop up these problems on neighbor coverage based protocol to reduce routing overhead in MANETS. The connectivity factor was also discussed to arrange neighbor coverage system to provide to density adaptation [7]. AODV protocol can be played an important role in optimizing mechanism. This paper presented and completed on new type of rebroadcasting with many performance metrics it is done while using NS-2 Simulator [9]
A Hypothesis for Ad-Hoc Routing Algorithm Improvement
In this article, a new approach to reducing the complexity of routing algorithms is discussed to improve routing in ad hoc networks. To avoid duplicating the routing process for each data transfer, nodes create binary matrices for each base station and update them when the routing is complete. Routing may be made much simpler using the method given here
Recommended from our members
Traffic engineering multi-layer optimization for wireless mesh network transmission a campus network routing protocol transmission performance inhancement
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel UniversityThe wireless mesh network is a potential network for the future due to its excellent inherent characteristic for dynamic self-healing, self-configuration and self-organization. It also has the advantage of easy interoperability networking and the ability to form multi-linked ad-hoc networks. It has a decentralized topology, is cheap and highly scalable. Furthermore, its ease in deployment and easy maintenance are other inherent networking qualities. These aforementioned qualities of the wireless mesh network bring advantages to transmission capability of heterogeneous networks. However, transmissions in wireless mesh network create comparative performance based challenges such as congestion, load-balancing, scalability over increasing networks and coverage capacity. Consequently, these challenges and problems in the routing and switching of packets in the wireless mesh network routing protocols led to a proposal on the resolution of these failures with a combination algorithm and a management based security for the network and its transmitted packets. There are equally contentious services like reliability of the network and quality of service for real-time multimedia traffic flows with other challenges such as path computation and selection in the wireless mesh network.
This thesis is therefore a cumulative proposal to the resolution of the outlined challenges and open research areas posed by using wireless mesh network routing protocol. It advances the resolution of these challenges in the mesh environment using a hybrid optimization – traffic engineering, to increase the effectiveness and the reliability of the network. It also proffers a cumulative resolution of the diverse contributions on wireless mesh network routing protocol and transmission. Adaptation and optimization are carried out on the wireless mesh network designed network using traffic engineering mechanism and technique. The research examines the patterns of mesh packet transmission and evaluates the challenges and failures in the mesh network packet transmission. It develops a solution based algorithm for resolutions and proposes the traffic engineering based solution.. These resultant performances and analysis are usually tested and compared over wireless mesh IEEE802.11n or other older proposed documented solution.
This thesis used a carefully designed campus mesh network to show a comparative evaluation of an optimal performance of the mesh nodes and routers over a normal IEE802.11n based wireless domain network to show differentiation by optimization using the created algorithms. Furthermore, the indexes of performance being the metric are used to measure the utility and the reliability, including capacity and throughput at the destination during traffic engineered transmission. In addition, the security of these transmitted data and packets are optimized under a traffic engineered technique. Finally, this thesis offers an understanding to the security contribution using traffic engineering resolution to create a management algorithm for processing and computation of the wireless mesh networks security needs. The results of this thesis confirmed, completed and extended the existing predictions with real measurement
Multicast for ubiquitos streaming of multimedia content to mobile terminals : Network architecture and protocols
The Universal Mobile Telecommunication Services (UMTS) network was envisioned to carry a wide range of new services; however, the first UMTS release was not designed to efficiently support multimedia content. In this thesis we analyse several mechanisms, and suggest architectural changes to improve UMTS’s capacity for a subset of the multimedia services; high-bandwidth group services. In our initial work we have suggested how IP multicast protocols can be used in the UMTS network to reduce the required network capacity for group services. This proposal was one of many suggestions for the evolving Multimedia Broadcast/Multicast Service (MBMS) architecture for UMTS. The next technique we have suggested and analysed is a new wireless channel type named the "sticky-channel"; this channel is intended for sparsely populated multicast groups. The sticky-channel is able to stick to mobile multicast members in the boarder area of neighbouring radio cells, thus some base stations does not need to broadcast the multicast data. Consequently, the total number of broadcast channels needed to cover a given area is reduced. There is a marginal reduction of required resources with this technique. In the main part of our work we have studied heterogeneous multihop wireless access for multicast traffic in the UMTS network. In a heterogeneous wireless access network, the wireless resources needed to distribute high-bandwidth group services, can be shared among cooperating network technologies. Mobile terminals with a UMTS interface and an IEEE 802.11 interface are readily available, consequently a heterogeneous network with UMTS and 802.11 links will be easy to deploy. We have described a heterogeneous architecture based on those wireless technologies. In this architecture, the range of a UMTS radio channel is reduced, and local IEEE 802.11-based Mobile Ad Hoc Networks (MANETs) forward the data to users located outside the coverage of the reduced UMTS channel. The wireless resources required to transmit a data packet are proportional to (at least) the square of the distance the packet must travel, thus a reduction in the channel range releases a significant amount of UMTS radio resources. Detailed simulation results showed acceptable service quality when the UMTS broadcast channel range is more than halved. Finally we have studied whether Forward Error Correction (FEC) at the packet-level on multicast flows could improve the performance of the heterogeneous wireless access network. There is a marginal improvement. Most of the protection brought by the FEC code has been used to repair the increased packet-loss introduced by the FEC overhead