TPSR: Transmission Power Based Source Routing Protocol for Mobile Ad Hoc Networks with Unidirectional Links

The year 2005 witnesses the third occasion that the Wireless Personal Area and Ad-hoc Networks minitrack is part of the annual HICSS conference. This year there was a substantial increase in submissions (thus a substantial decrease in the acceptance rate), indicating the growing importance of research in this area. The minitrack is also focused on fundamental challenges and issues arising in wireless sensor networks and their applications. Wireless sensor networks differ from other wireless networks in the need for unattended and very low-energy operation, in the possibility of collaboration and distributed sensor calibration, and in the mission oriented nature of most sensor networks. Thus our mini track looks at two very important streams of research. After a strict review process nine papers were selected to be included in the program of the minitrack. The first paper is titled “BT-Crowds: Crowds-style Anonymity with Bluetooth and Java,” presenting an interesting idea on how anonymity can be achieved when sending messages in WPAN environments. Our second paper revisits scatternet formation issues of Bluetooth based ad hoc networks thus the title: “A Dynamic and Distributed Scatternet Formation Protocol for Real-life Bluetooth Scatternets.” The third paper is titled “Secure Dynamic Source Routing” and presents a new variant of the DSR routing protocol with special emphasis on security. In the fourth paper, the discussion concerns “Routing Based Feedback towards Applications in Mobile Ad Hoc Networks,” where routing notifications are relayed via event channels. “A Location Service Mechanism for Position-Based Multicasting in Wireless Mobile Ad hoc Networks” is the title of the fifth paper in the minitrack. It presents some innovative ideas on how location information can be managed for multicast communications in ad-hoc networks. In the sixth paper, “Sliding Window Protocol for Secure Group Communication in Ad Hoc Networks,” the authors propose a sliding window protocol for determining multiple routes in a multi-communications environment. In the seventh paper titled “Ad Hoc Routing Protocol Avoiding Route Breaks Based on AODV,” the authors propose improvements to the well-known AODV ad hoc routing protocol The eight paper, “Joint Scheduling and Routing Algorithm for Ad Hoc Wireless,” presents an innovative and interesting idea wrapped around an iterative algorithm on power control. In the final paper of the minitrack, “Performance Issues of Ad Hoc Routing Protocols in a Network Scenario used for VideoPhone Applications,” the authors present a simulation based performance analysis of different ad hoc routing protocols using the application pointed to in the title. These papers highlight some of the issues and work towards solutions in Personal Area and ad hoc networks which are among the most active research fields in wireless networking. We believe that the papers will provide opportunities for researchers to come together and discuss and debate the results of the interesting experiments that are described in the papers. We are confident that the minitrack will achieve its goal of bringing together leading researchers, to present new results and discuss synergies between the two areas. We also take this opportunity to thank all the reviewers for their valuable and professional work as well as all the authors who submitted papers and thus helped us to create such a strong minitrack. We would also like to express our sincere gratitude to the conference organizers for their hard work and help.

Ad Hoc Routing with Distributed Ordered Sequences

Today, the use of Mobile Ad Hoc Network (MANET) is becoming increasingly popular due to its flexibility and ease of use wherever and whenever. MANET is able to adapt to many applications, such as disaster management and military operations. The MANET routing protocol consists of two types, namely Proactive Routing Protocols and On Demand Routing Protocols. Destination-Sequence Distance-Vector (DSDV) is an example of a protocol that includes Proactive Routing Protocols. Meanwhile, Ad Hoc on-Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR) are examples of protocols that include On Demand Routing Protocols or Reactive Routing Protocols. Because routing protocols greatly affect MANET performance significantly, it is necessary to study the performance of routing protocols. This paper discusses the performance comparison of MANET routing protocol based on RandomWaypoint mobility model. The experiment was carried out by applying the MANET routing protocol to the RandomWaypoint mobility model. Routing protocols used are AODV, DSDV and DSR. The simulation is done using NS-2 software. The total of nodes used in simulations is 100, 150, 200 and 250 nodes respectively. Length of simulation time 900 s. The simulation area take place in urban residential areas. Performance evaluation is performed on variable packet delivery ratio (PDR), throughput, average end to end delay, packet loss and normalized routing load (NRL).

Mobile Ad Hoc Networks (MANETs) pose challenges in terms of power control, due to their fixed transmission power, the mobility of nodes and a constantly changing topology. High levels of power are needed in wireless networks, particularly for routing. In order to address this problem, power aware routing protocols have been proposed, with the aim of maximising the lifetime of the network. This paper presents an enhancement to the Ad Hoc On Demand Distance Vector (AODV) protocol, by reducing transmission power, when a large number of other radios are within range. This protocol, called DP-AODV (Dynamic Power AODV) combines the hello packet mechanism and the power control mechanism in order to reduce interference between nodes and increase the throughput in the network, thus reducing the overall power consumption. A performance evaluation of this enhanced protocol is carried out in comparison with three standard routing protocols, Ad Hoc On Demand Distance Vector (AODV), Ad Hoc On Demand Multipath Distance Vector (AOMDV) and Dynamic Source Routing (DSR), using network simulator 2 (NS2). Keywords-MANET; Dynamic Power; Density; Mobility; Interference.

The rapid advances in the wireless communication industry have paved the way for the enhancement of wireless mobile ad-hoc networks (MANETs) to support various domains including civilian environments, emergency operations, and military affairs. Source routing in MANETs is subject to some issues such as changes in the network topology, which lead to frequent link breakages that may increase the requests of route discoveries. Thus, this paper aims to enhance on-demand source routing protocols by proposing two mechanisms, a zone-based route discovery mechanism (ZRDM) and a link failure prediction mechanism (LFPM). ZRDM aims to control the flooding of route requests, and LFPM aims to avoid route breakages caused by node mobility. The performance of the proposed mechanisms was evaluated using network simulator 3 in terms of normalized routing load, average end-to-end delay, and packet delivery ratio. The experimental results showed that the proposed mechanisms outperform well-known mechanisms such as the dynamic source routing (DSR) protocol, reliable DSR, and zone-based DSR and segment-based DSR.

Mobile Ad hoc Networks (MANET) comprises of self-organizing autonomous mobile nodes. MANETs are open and decentralized. Therefore they are vulnerable to malicious entities. MANETs are multi-hop wireless network where all nodes supportively maintain network connectivity without a centralized infrastructure. Since MANETs are infrastructure less and independent, the secure communication is the main issue. Therefore they are vulnerable to malicious entities. Here the location identity and traffic can be traced out by an outside observer. Anonymity means secure communications by hiding node identities and preventing traffic analysis attacks by outside observers. This paper proposes Position based Anonymous Routing Scheme in MANETs (PARS).Here the routing is based on Greedy Perimeter Stateless Routing Protocol. The objective is an anonymous routing protocol for the network. The proposed one is a zone based anonymous GPSR based protocol that can provide source, destination and route anonymity. Performance of the proposed system is compared with that of GPSR and AODV using Network Simulator. Index Terms: Anonymous routing, position-based routing, random forwarder, zone partition. I. Introduction Mobile Ad hoc Networks are collection of independent mobile nodes that can communicate by radio waves. It is an infrastructure less self-organizing network. The nodes that are in radio range can communicate by single hop or by multi hop with the help of intermediate nodes. The network is open and decentralized and fully distributed. So they are perfect choice for communication and information sharing. MANETs are susceptible to malicious entities that aim to alter and analyzed the traffic analysis by communication eaves dropping or attacking routing protocols. MANETs are characterized by their distributed operation, multi hop routing, dynamic topology and shared physical medium. Nodes in a MANET are independently free to move in any direction. Due to the lack of a centralized coordinator security is the major concern here. Wireless communication can endure interferences or malicious interceptions; whereas multi-hop communication assumes that each node will perform properly its functions to support network services. Further, self-organization increases the complexity of security management operations as access control, node authentication, secure routing and cryptographic key distribution. There is no fixed infrastructure and the topology is frequently changing due to node mobility or environmental changes. Therefore, it is very hard to maintain a stable and efficient end-to-end route in an ad-hoc network. Each node in MANET is energy constrained. There is verylimited physical security in MANET. The type of attacks can be Active attacks or Passive attacks. The common security issues are Passive attacks which include eaves dropping and information disclosure. Active attacks include Do Sand Data modification. There are other more specific problems with mobile ad hoc network such as vulnerability of channels and nodes, Byzantine black hole and Byzantine wormhole attack. The security issue also includes attacks that may inject erroneous routing information and diverting network traffic thus making routing inefficient. There are many methods to reduce the impact of these attacks, which include a secure routing using public and private key s to get a certification authority and use of digital signatures and prior it rust relationships. Routing is the process of communication from one node to the other host in a network. Routing is the process off or warding packet towards its destination using most efficient path. Routing efficiency is measured in terms of Number of hops, traffic, security, etc. Routing protocols in MANETs are divided as reactive proactive and hybrid. Reactive Protocol maintains the routes in on demand manner. In route discovery phase it floods the route request (RREQ) packets throughout the network. Dynamic source Routing (DSR), ad hoc on- demand distance vector routing (AODV) are some of the examples of reactive protocols. In proactive approach every node in the MANET continuously maintains the complete routing information of the entire network. This is accomplished by flooding network periodically with network status information. Global State Routing (GSR), Hierarchical State Routing (HSR) and Destination Sequenced Distance Vector Routing (DSDV) are some of the examples of proactive

Ad-hoc networking allows users to form temporary wireless networks without existing infrastructure. Each node acts both as host and router and must therefore be willing to forward packets for other nodes. This is done using a mobile ad-hoc network (MANET) routing protocol. Frequent topology changes make such routing challenging. Existing protocols include dynamic source routing (DSR), the cluster-based routing protocol (CBRP), and the ad hoc on-demand distance vector (AODV) protocol, among others. Using existing protocols, however, some nodes may be unduly loaded and end-to-end delay may be high. Further, existing protocols are hard to upgrade once they are in use. To address these problems, a new routing protocol, MARP, using mobile agents is presented. Mobile agents are software entities that can move between network nodes and execute programs they carry with them wherever they are running. Our agent-based algorithm implements a demand-based protocol that provides efficient routing at the application layer. A proof of concept implementation has been developed using Aglets and simulated to evaluate its performance. The details of the protocol and its performance are reported in this paper.

This paper conduct a comprehensive simulation study on the behavior of TCP-friendly Rate Control (TFRC) protocol over Ad-Hoc On Demand Vector (AODV) routing protocol and Dynamic Source Routing (DSR) protocol. The aim are first, to measure the performance of TFRC in terms of throughput, delay and jitter. The second objective is to identify which Mobile Ad-Hoc Network (MANET) routing protocols work well with TFRC. We conduct the experiment by sending multimedia streaming traffic carried by TFRC over AODV and DSR respectively. Random-Waypoint mobility model is used for both experiments. Results obtained shows that in average TFRC over AODV has more throughput and less delay as compared with TFRC over DSR. However, in terms of jitter, TFRC over DSR gives better result.

Routing protocols design is an important and essential issue for Vehicular Ad Hoc Networks. In this paper, a more realistic simulation environment is developed based on VanetMobiSim and OPNET, and the performance of several classical routing protocols such as Optimized Link State Routing (OLSR), Geographic Routing Protocol (GRP), Ad hoc On Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR) in various network conditions is evaluated and compared. Network delay and network packet loss are simulated with different nodes' density. The simulation results show that DSR is not suitable for dense VANETs, while AODV and OLSR have better network adaptability in dense VANETs. The performance of GRP is inferior to AODV and OLSR.

Mobile devices are able to build their own networks, which are referred to as mobile ad hoc networks. These networks do not require any kind of permanent wiring or other infrastructure (MANETs). The success of MANETs and their adaptability to a variety of tasks is, to a considerable extent, based on the routing protocols that they use. Using metrics such as routing overhead, end-to-end delay, and packet delivery ratio, we compare and contrast the various routing protocols that can be employed in MANETs, including proactive, reactive, and hybrid protocols. This comparison and contrast is carried out in this study. In addition to this, we discuss the simulation tools that are utilized to evaluate the efficacy of MANET routing algorithms and define the several performance indicators that may be utilizedin the course of this endeavor. This paper makes a contribution to an ongoing body of research into the analysis of routing protocols in MANETs by offering guidance to network engineers and researchers on how to select the most appropriate routing protocol and simulation tool for a particular MANET scenario. In doing so, the paper maximizes the potential for effective and efficient communication between mobile nodes, which is one of the main goals of the research.

Wireless technology based on the IEEE 802.11 standard is widely deployed. This technology is used to support multiple types of communication services (data, voice, image) with different QoS requirements. MANET (Mobile Adhoc NETwork) does not require a fixed infrastructure. Mobile nodes communicate through multihop paths. The wireless communication medium has variable and unpredictable characteristics. Furthermore, node mobility creates a continuously changing communication topology in which paths break and new one form dynamically. The routing table of each router in an adhoc network must be kept up-to-date. MANET uses Distance Vector or Link State algorithms which insure that the route to every host is always known. However, this approach must take into account the adhoc networks specific characteristics: dynamic topologies, limited bandwidth, energy constraints, limited physical security, ... Two main routing protocols categories are studied in this paper: proactive protocols (e.g. Optimised Link State Routing - OLSR) and reactive protocols (e.g. Ad hoc On Demand Distance Vector - AODV, Dynamic Source Routing - DSR). The proactive protocols are based on periodic exchanges that update the routing tables to all possible destinations, even if no traffic goes through. The reactive protocols are based on on-demand route discoveries that update routing tables only for the destination that has traffic going through. The present paper focuses on study and performance evaluation of these categories using NS2 simulations. We have considered qualitative and quantitative criteria. The first one concerns distributed operation, loop-freedom, security, sleep period operation. The second are used to assess performance of different routing protocols presented in this paper. We can list end-to-end data delay, jitter, packet delivery ratio, routing load, activity distribution. Comparative study will be presented with number of networking context consideration and the results show the appropriate routing protocol for two kinds of communication services (data and voice).

Mobile Ad hoc Network (MANET) is the cornerstone for the Internet of Things (IoT) and Vehicle to Everything (V2X) networks, its devices are remarkable of lightweight to be portable and free to join or disjoined the network. Therefore, one of the MANET routing types is reactive routing protocols. Reactive routing protocols set up the connection between devices either on-demand such as Ad Hoc On-demand Distance Vector (AODV) protocol or source routing such as Dynamic Source Routing (DSR) protocol. Reactive routing protocols increase routing overhead on discovering new routes. Thus routing overhead, and delay will increase. In this paper, the method of generating a fuzzy model is presented. Also, a tuned fuzzy stability model is introduced to handle the imprecision of routing decisions by the Fuzzy Stability model for Ad Hoc On-demand Distance Vector (FSAODV) and Fuzzy Stability model for Dynamic Source Routing (FSDSR). The results showed that FSAODV and FSDSR have outperformed the state of art protocols AODV and DSR respectively.

Mobile Ad Hoc Network (MANET) is a type of network with special characteristics and it needs special mechanism to bear with its ad hoc behavior. The important issue in MANET is routing protocol. Routing protocol is a standard used to determine the route path taken during the transmission of data. In this paper we will focus on Ad Hoc On Demand Distance Vector (AODV) routing protocol. The simulation experiments have been carried out using OMNeT++ network simulator to study the routing protocol performance in the heterogeneous MANET architecture. The metrics used to analyze the performance of the routing protocol are throughput and packet delivery ratio (PDR).

In order to guarantee the effective communication mode under any circumstances in nuclear power plants, Mobile Ad Hoc network will be introduced to achieve the goal. In this paper, a detecting algorithm is provided to study unidirectional links. With the emulation experiment which results in the occurrence rate of both unidirectional and bidirectional links, analyses of unidirectional links which originates from diversity in transmission power and signal interference is presented, hoping that it will provide assistance in routing protocol of Mobile Ad Hoc Network.

Design and development of routing protocols for Mobile Ad Hoc Networks (MANETs) is an active area of research. The standard practice among researchers working in this emerging domain is to evaluate the performance of their routing protocols in a network simulator. It is now a well known fact that the simulation studies are scenario specific and hence their results can not be generalized. In this paper, we present mathematical models of two key performance metrics, routing overhead and route optimality, of BeeAdHocMANET routing protocol. One of the key components of our BeeAdHocmodel is the collision model at Medium Access Control (MAC) layer. The mathematical expressions of the performance metrics provide valuable insight about the behavior of BeeAdHocin particular, and a typical ad hoc routing protocol in general, without resorting to scenario specific time consuming simulations.