Routing in Mobile Ad Hoc Networks

In this paper, we address the problem of multicast routing in mobile ad-hoc networks from the viewpoint of energy efficiency. In an ad-hoc wireless network, each node runs on a local energy source which has a limited energy life span. Thus, energy conservation is a critical issue in mobile ad-hoc networks. One approach for energy conservation is to establish routes that require lowest total energy consumption. This optimization problem is referred as the minimum-energy multicast routing problem (MEMRP). In this paper, propose new efficient heuristic algorithms for the construction of energy-efficient multicast routes in mobile ad-hoc networks. These algorithms exploit the broadcast nature of the wireless channel, and address the need for energy-efficient operations. Empirical studies show that our algorithms are able to achieve better performance than algorithms that have been developed for MEMRP.

The (MANET) ad-hoc mobile network is an automated, network in which android systems link to wireless devices. Ad hoc word means "for this purpose". In MANET any device can easily move in various directions. MANETs (Mobile Ad Hoc Networks) are the basics of broadband networks. In MANET network user can link and get connected anywhere, anytime through communication. MANET introduces a new co system for communication. MANET does not require a fixed structure relies on unconnected ports for service transportation delivery. The temporary hoc network is not dependent on mobile devices (android phones, laptop, PCs, sensors, etc.) that connect exclusively to wireless connectors. Ad-hoc work on a distributed system to provide the required network performance when there is no fixed structure. In this network, it acts as a standalone network or with many attachment points on mobile networks. This paper provides view on the features, applications of ad hoc networks, characteristics and various attacks and challenges faced by programmers and Users . We analyze MANET security objectives and will outline the features, structure, types and challenges of research and the latest trend analysis presented on Mobile Ad Hoc Network to explore open-ended issues in developing navigation strategies for MANET.

It is our great pleasure to welcome you to the 3rd ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN'05), held in conjunction with the 12th ACM Conference on Computer and Communications Security (CCS'05), November 7, 2005, in Alexandria, Virginia.This year we received a total of 39 submissions on various aspects of ad-hoc and sensor network security. The program committee selected 6 as regular papers that cover a variety of topics, including trust establishment in Mobile Ad-Hoc Networks (MANETs), security of vehicular ad-hoc networks, secure group communication, key pre-distribution for sensor networks, jamming attacks against sensor network MAC protocols, and defense against Denial-of-Service (DoS) attacks. This year we continue the tradition of SASN'03 and SASN'04 to encourage the presentation and discussion of work-in-progress on ad-hoc and sensor network security. Among the 39 submissions, the program committee selected 7 papers to present in work-in-progress sessions, covering topics on anonymous routing for MANETs, key distribution for inter-group multicast in ad-hoc networks, improved topology assumptions for threshold cryptography in MANETs, RFID security, tracing in mobile wireless sensor networks, time synchronization attacks in sensor networks, and coordinated deployment for improving secure communications and sensing coverage in wireless sensor networks. In addition, the program includes a panel on Advances in Sensor and Ad-hoc Network Security and an invited keynote talk by Radha Poovandran (University of Washington) on Information Assurance in MANETs and Wireless Sensor Networks. We hope that these proceedings will serve as a valuable reference for security researchers and developers.

Fuzzy logic based cross-layer design to improve Quality of Service in Mobile ad-hoc networks for Next-gen Cyber Physical System

An ad-hoc Wireless Local Area Network (WLAN) is a network without infrastructure connectivity where different types of hosts (nodes) exist; such as PDAs (personal digital assistants), laptops and cellular phones. These nodes are equipped with short range transmitters and receivers, and antennas which may be Omni directional (broadcast), highly directional (Point-to-point), or a combination of the two. A Mobile Ad hoc Network (MANET) is a collection of mobile hosts that move in different directions and speeds without the need to maintain connectivity with existing network infrastructure. Different routing protocols have been designed since the existence of ad hoc networks. This work presented below proposes a new routing protocol for ad hoc networks which aims to reduce network overhead, power consumption, Multi-user Interference (MUI), and provide link reliability. In recent years, a vast research has been seen going on in the field of Mobile Ad Hoc Networks (MANETs). Due to limited resources in MANETs, to design an efficient and reliable routing strategy is still a challenge. An intelligent routing strategy is required to efficiently use the limited resources. Also the algorithms designed for traditional wired networks such as link-state or distance vector, does not scale well in wireless environment

With the Development of mobile ad hoc network (MANET), Quality of Service (QoS) routing and power-aware routing become more and more important. In the past, QoS guarantee and power control issues were treated separately. In this paper, we propose a novel on-demand QoS routing protocol, PMQR (power-aware multi-path QoS routing) in TDMA-based MANETs. Our protocol combines QoS routing and power-aware routing, which can provide QoS guarantee and achieve energy conservation by taking into account both the transmission power and the remaining energy at the intermediate nodes between a source and a destination. PMQR also can establish multiple paths, even for a single call, when the route search cannot find a path that meets the QoS requirements. Simulation results show that PMQR has good network performance and balances the energy consumption of mobile hosts.

A set of mobile nodes that link with one another via the use of wireless networks in order to establish a network structure without the need of infrastructure or centralized management is referred to as a mobile ad-hoc network. This work offers a concept for energy-efficient honeycomb-based routing in MANET that it calls Improved Energy Efficient Honeycomb based Routing (IEEHR). The presence of malicious nodes brings a wide variety of dangers to MANETs, which is why security is another essential component of delivering quality of service (QoS). In spite of the fact that a variety of defense mechanisms have been suggested for MANETs, the vast majority of these proposed solutions are either ineffective against certain types of assaults or offer security at the expense of quality of service. In this research, we present a strategy by integrating social trust and QoS trust. The results of a simulation experiment carried out with Network Simulator-2 (NS2) and under a variety of network conditions demonstrate that combining social and quality of service (QoS) trust parameters can significantly improve the routing of security and quality of service in words of overhead, packet delivery ratio, and energy consumption.

A Mobile Ad Hoc Network represents a system of wireless mobile nodes that can freely and dynamically selforganize into arbitrary and temporary network topologies, allowing people and devices to seamlessly communicate without any pre-existing communication architecture. The growth of real time multimedia application in such environments, has drawn a lot of attention to wireless networks that support quality of service (QoS). In this work, the QoS metrics, delay and link life time (LLT) of the path are dynamically calculated. Based on these values the routing decisions are made. Here the multipath routing protocol is taken as the base protocol. The proposed algorithm finds the multiple QoS routes only, based on the QoS metrics and stores only those paths in the routing table. The route is selected based on the integrated QoS metric and is used to transmit the data. The base protocol used is multipath AODV(Ad Hoc On demand Distance Vector ) routing protocol. The proposed protocol may take extra time during route discovery process to compute the additional QoS parameters, but this time is compensated by having only QoS paths for data transmission. A few patents on the QoS Routing for MANETS have been reviewed.The simulator NS-2.34 is used to simulate and compare the performance of the protocols in terms of the QoS metrics such as end-to-end delay, PDR in the MANET. Keywords: Mobile Ad Hoc Network (MANET), Quality of Service (QoS), Destination Sequence Distance Vector (DSDV), Dynamic Source Routing (DSR), Ad Hoc On demand Distance Vector (AODV), LLT (Link Life Time), RLT (Route Life Time), PLTR (Percentage Life Time Ratio), TCP (Transmission Control Protocol), CBR (Constant Bit Rate), PDR (Packet Delivery Ratio).

In this paper, we propose a cooperative routing in mobile ad-hoc wireless sensor networks with Rayleigh fading environments. The main features and contributions of the proposed cooperative routing are as follows. First, the construction of stable routing route by using entropy concepts in the view points of mobility of nodes. Second, the cooperative-aided transmission using the stable relay which can be selected by using entropy concepts. Third, we present a theoretical analysis model for the proposed cooperative routing with the outage probability of the end-to-end performance. Fourth, we consider a realistic approach based on mobile nodes as well as fixed nodes in the points of view of the mobile ad-hoc wireless sensor networks. The performance evaluation of our protocol is implemented via simulation and analysis.

With the expansion of real-time applications for mobile ad hoc networks the need for quality of service (QoS) support has become essential. Providing QoS in this kind of networks is a big challenge requiring a complex QoS model or framework. This paper deals with quality of service models in mobile wireless ad hoc networks, provides a brief overview of existing models and describes a new QoS framework based on the extension of existing QoS models. Proposed QoS framework increases service differentiation in the network and provides them various QoS levels. It also improves one-way delay as a QoS network parameter. We validated our proposal by means of network simulation. This paper also presents simulation scenarios and evaluation details.KeywordsSource NodeAdmission ControlRandom Early DetectionExplicit Congestion NotificationEgress NodeThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Routing in mobile Ad-Hoc networks is normally a difficult task, but even more challenging if the network is expected to provide support for audio and video streaming between human-carried devices. Besides normal movement and signal impairment difficulties, those multimedia applications may impose extra end-to-end requirements. The computation of optimized and/or constrained network paths using one or more metric restrictions is called QoS (Quality-of-Service) routing. This paper presents QMRS, a QoS routing protocol for Ad-Hoc networks which aims to support applications with QoS requirements including requirements for the end-to-end delay. This protocol proposes a on-demand multiple routes discovery mechanism that is able to find up to three node-disjoint paths that meet the QoS requirement. Additionally, and for the purpose of guarantee the stability of the routing process, it uses the signal strength of the links between neighbouring nodes to elect the most stable route. Such route will be used as the primary choice to forward traffic. The other discovered routes will be maintained as backup in order to eventually replace the primary route, in case of disruption or degradation of required QoS.

A stable and reliable routing mechanism for vehicular ad hoc networks (VANETs) is an important step toward the provision of long data transmission applications, such as file sharing and music download. Traditional mobile ad hoc network (MANET) routing protocols are not suitable for VANET because the mobility model and environment of VANET are different from those of traditional MANET. To solve this problem, we proposed a new stable routing algorithm, called stable directional forward routing. The novelty of the proposed routing protocol is its combining direction broadcast and path duration prediction into ad hoc on-demand distance vector routing protocols, which including: (1) Nodes in VANET are grouped based on the position, only nodes in a given direction range participating in the route discovery process to reduce the frequency of flood requests, (2) Route selection is based on the link duration while not the hops or other metrics to increase the path duration, (3) Route discovery is executed before the path expiration in order to decrease the end to end delay. The performance of the new scheme is evaluated through extensive simulations with Qualnet. Simulation results indicate the benefits of the proposed routing strategy in terms of decreasing routing control packet, reducing the number of link-breakage events, improving the packet delivery ratio and decreasing the end-to-end delay.

In this paper the Policing Traffic Management (PTM) is applied to improve the Quality of Service (QoS) over Inter-Vehicular Communications (IVCS). Bangkok is the capital city, and it is crowned of Ad Hoc nodes such as Mobile Ad Hoc Networks (MANET), FleetNET, CARNET, BTSNET and electronic devices. Each network has unique data traffic characteristics. For MANNET, most traffic is video and voice traffic; BTSNET is data traffic; CARNET is data and video traffic; and FleetNET is voice and data traffic. BTSNET can be implemented in regular traffic patterns for helping other networks to use as intermediate nodes for delivering their traffic. But some places are congested and packet-drops are emerged which will degrade the QoS of Multimedia traffic. The proposed algorithm PTM is an extension of the Adaptive Rate Control algorithm (ARC) which mainly improves the QoS performance by adjusting data transmission rate, rather than the fixed rate, based on traffic priority as voice, video and data after the collection of current number of packet drop, each data rate and packet delay time. Besides, this scheme will allow some dropped packets to retransmit based on priority. Several simulations are performed using NS-2 and EZsim under the congested situation and the results from our proposed algorithm are compared to the ones from traditional method without policing scheme. We found impressive results that support our algorithm.

Power control algorithms for mobile ad hoc networks

Power-aware routing has proven to be effective in maximizing the life time of ad-hoc networks. However, all the previous research focused on the power-aware routing algorithms in a cooperative network, where all the nodes honestly report battery usage. However, selfish nodes in ad-hoc networks have incentives to misreport lower residual energy to maximize their own usage. In this paper, we first show that it is a dominant strategy for a selfish node to report lower residual energy in a power-aware ad-hoc network, which diminishes the benefits of power-aware routing algorithms. We then propose a novel power-aware reputation system (PARS), to stimulate cooperation on power-aware routing in ad-hoc networks. Analysis and simulation results show that PARS is effective in supporting power-aware routing in selfish ad-hoc networks.