An anonymous on-demand position-based routing in mobile ad hoc networks

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

Cognition capability has been seen by researchers as the way forward for the design of next generation of Mobile Ad Hoc Networks (MANETs). The reason why a cognitive paradigm would be more suited to a MANET is because MANETs are highly dynamic networks. The topology may change very frequently during the operation of a MANET. Traffic patterns in MANETs can vary from time to time depending on the need of the users. The size of a MANET and node density is also very dynamic and may change without any predictable pattern. In a MANET environment, most of these parameters may change very rapidly and keeping track of them manually would be very difficult. Previous studies have shown that the performance of a certain routing approach in MANETs is dependent on the size of the network and node density. The choice of whether to use a reactive or proactive routing approach comes down to the network size parameter. Static or offline approaches to fine tune a MANET to achieve certain performance goals is hence not very productive as a lot of these parameters keep changing during the course of operation of MANETs. Similarly, the performance of MANETs would improve greatly if the MAC layer entity could operate in a more flexible manner. In this paper we propose a cognitive MANET design that will ensure that all these dynamic parameters are automatically monitored and decisions are based on the current status of these parameters.

Mobile Ad hoc Network (MANET) is the kind of ad hoc networks that dynamically form a temporary network by connecting the mobile nodes without any support of central administration and wires. This work coins the difficulties of delivering the data packets to the MANET circumstance in a reliable fashion and in good timely manner, which reside to be a highly dynamic in nature. In MANET, there are several routing algorithms, which consume topology information to make routing decisions at each node. Practical routing protocols must handle intermittent connectivity and the absence of end-to-end connections. An Efficient Position-Based Opportunistic Routing (EPOR) protocol is proposed and it will be able to take the advantage of stateless property, which uses two terms (1) geographic routing (2) broadcast nature of wireless medium. When the packet transmission starts, neighbor nodes have chance to overhear the transmission of messages, and it will act as a forwarding candidate. Thus, the node which was overheard the transmission information will forward the packets by enhancing the informations. The apt forwarder will identify the falsely relay node within a limited amount of time. The proposed algorithm removes the drawbacks of the existing GPSR and AOMDV. The additional latency occurred by the local route recovery has maximum being reduced and the duplicate relaying due to packet reroute can also be decreased. The proposed scheme of Virtual Destination-based Void Handling (VDVH) combined with EPOR protocol in a communication hole. The EPOR result demonstrates that can able to succeed the greater performance even under high mobility of nodes with considerable overhead and the new VDVH scheme also works well. This paper focuses on various performance evaluation metrics such as latency, throughput for the EPOR routing protocols and experimentally compared the performance of three routing protocols using NS-2 simulator.

Many privacy improving techniques have been proposed based on packet encryption to protect the communication privacy of mobile ad hoc networks (MANETs). However, we show that MANETs are still vulnerable under passive statistical traffic analysis attacks. To demonstrate how to discover the communication patterns without decrypting the captured packets, we present Region based statistical traffic pattern discovery system for MANETs. Region based statistical traffic pattern discovery system for MANETs works passively to perform traffic analysis based on statistical characteristics of captured raw traffic. Region based statistical traffic pattern discovery system for MANETs are capable of discovering the sources, the destinations, and the end-to-end communication relations. Region based statistical traffic pattern discovery system for MANETs perform the traffic analysis as divide the entire network into multiple regions geographically. Empirical studies demonstrate that Region based statistical traffic pattern discovery system for MANETs achieves good accuracy in disclosing the hidden traffic patterns.

WITHDRAWN: Energy efficient node Positioned Learning Automaton and Multilateration data delivery in MANET

Background:AMobileAdHocNetwork (MANET) consistsofmany independentnodes that operate over awireless topology with numerous Quality of Service (QoS) requirements. So, a robust routing protocol that also provides QoS parameters to its different range of applications is needed. Various network parameters like node density, node mobility, field size etc. also effects the QoS parameters of MANETs. Methods: The traditional reactive routing protocols do not have any backup route in case of a node failure and hence are not effective for MANETs. Ad Hoc on Demand Distance Vector Backup Routing (AODV BR) protocol performs better than traditional routing protocols but is not effective when the backup route fails. So, to counter this problem, the authors had proposed AODV nth BR that keeps on providing backup routes when multiple nodes fail and hence successfully transfers the data to the destination. The nodes for backup routing are selected based on their distance from the failed node and energy efficiency. Results: In this paper, the performance of AODV nth BR has been compared with AODV, DSR and AODV BR protocol under varying node density (nodes 20, 60,100) and node mobility conditions (5m/s, 20m/s, 50m/s). The values for Packet Delivery Fraction (PDF) for 60 nodes at speed 20m/s in case of AODV nth BR protocol after 6000 rounds is 0.3054. Comparatively, value of AODV BR is 0.2664, AODV is 0.1936 and DSR is 0.1056. QoS performance is measured in terms of end to end delay, packet delivery fraction and lifetime of devices and it has been shown through simulated results that AODV nth BR protocol gives better output than traditional routing protocols. Conclusion: From the simulated results explained in detail in the paper, it has been observed that route after link breakage is found to be best with AODV nth BR protocol and this can be clearly seen in the QoS parameters obtained.Keywords: AODV BR, AODV nth BR, MANETs, Node Density, Node Mobility

Traffic analysis is considered the most powerful strategy of disclosing the hidden communication relations in an anonymous communication system. Statistical traffic analysis attacks are even more subtle in that the attackers are usually eavesdroppers who do not modify the network's behaviors. Moreover, the attackers even do not need to look into the traffic content, which may be encrypted, in order to analyze the statistical characteristics. Such attacks have been thoroughly investigated for static wireline networks. However, none of these mechanisms can be directly applied to mobile ad hoc networks (MANETs) due to the inability to deal with mobility, the ad hoc infrastructure and the broadcasting nature of wireless transmissions. Recent research conducted on statistical traffic analysis attacks targeting MANETs is restricted to disclosing the end-to-end traffic distribution. In this paper, we present the least squares disclosure attack (LSDA), targeting a popular MANET routing strategy, that is, the position based routing (PBR, a.k.a geographic routing). LSDA utilizes the traffic distribution disclosed by existing solutions, and de-anonymizes the network communication on a per-flow basis by identifying the source and destination of each end-to-end flow. In LSDA, traffic disclosure is modeled as an efficiently solvable least squares problem subject to linear constraints. The empirical study demonstrates that, the proposed solution can de-anonymize the network flows in high accuracy.

Communications void in geographical routing protocols effects the performance of these routing protocols. A geographic routing protocol usually uses a greedy forwarding scheme with a recovery policy to solve the void problem. In this paper, we propose a new positive virtual position (PViP) scheme, for solving the local minimum problem. Positive virtual position of nodes are considered when selecting the next optimum neighbor node. Positive virtual position of a node is the average positions of node's itself position and all single-hop neighbor nodes that are closer to the sink than itself. Simulation results demonstrate that proposed scheme increases the success delivery rate compared with other schemes without any significant overhead.

?????? ???????????? ?????? ??? ???????????? ????????? ??????????????? ?????? ??????????????? ????????? ???????????? ????????? ???????????????, ???????????? ????????? ??????????????? ????????? ????????? TICN(Tactical Information Communication Network)????????? ??????????????? ???????????? ?????? ?????? ??????. TICN????????? ??? ????????? ????????? ???????????? ????????? ????????? ??????????????? ????????? ?????? ???????????????????????? ?????? ????????? ?????????, ????????? ????????? ????????? ?????? ????????? ???????????? ????????? ?????? MANET(Mobile Ad-Hoc Network) ????????? ??????????????????. ??? ??????????????? ?????? MANET ????????? ?????????????????? ?????? ???????????? ???????????? ?????? ????????? ?????????????????? ????????? ?????? ???????????? ????????????, ????????? ??????????????? ??????????????? ????????????, ?????? ???????????? ????????? ??????, ????????? ?????? ?????? ???????????? ????????? ???????????? ????????? ?????? ????????? ??????????????????, ????????? ?????? ????????? ??????????????? ?????? ?????? ??? ?????? ???????????? ?????? MANET ????????? ??????????????? ????????? ????????? ??????.

Over the lasts years there has been a growing interest on mobile ad hoc networks (MANET), in this network nodes are carried by people and connected to each other by multi-hop wireless links. Since the nodes can move freely, then the nodes mobility pattern became an important characteristic of the MANET. In this work we proposed a geographical routing protocol which takes forwarding decisions based on the current node's position and the its future position. To estimate the future position of the node we used a prediction method who has been based on real trajectories data. The algorithm proposed is compared with other proposed algorithms by simulation

To adapt with the frequent link failures in mobile ad-hoc networks, the routing protocols shall catch more than one route, at least two routes. In case of two routes, the first route can be used as the main route; while the other one can be used as a standby route used upon the detections of link failures. If this is the case, the packet losses are virtually decreased to zero, and seamless multimedia communications can be supported over mobile ad-hoc networks. To ensure the existence of two routes between any randomly chosen two nodes, the node density in terms of the number of neighbors must be above a certain threshold. In this paper, we propose a mathematical model to find such node density, and propose some solutions in case the node density is below the required density in order to increase it to the required node density. Our results show that the probability to have two routes rapidly increases with node density till it reaches the saturation region, where the increase of node density has negligible improvement in terms of network availability. This paper shows that the network nodes must have at least 16 neighbors in order to ensure the existence of two routes between any randomly chosen source and destination pair.

Anonymous communications in mobile ad hoc networks is an important and effective way against malicious traffic analysis. Various anonymous routing schemes have been proposed for MANETs. However, most works failed to resist the global tracker, and always ignored the reliability of data delivery. In this paper, a comprehensive anonymous communication protocol, called ARSC, is proposed. The ARSC consists of anonymous routing, which is based on identity-based encryption pseudonym and single-round onion, and secure checking of traffic forwarding in data transmission phase, to achieve strong route anonymity and improve reliability of packet delivery in the data transmission phase. From the security analysis, our protocol ARSC is more secure than other schemes such as ANODR, SDAR, AnonDSR, CAR and MASK. Moreover, simulation experiments show that the ARSC has better performance than any other onion-structured anonymous routing protocols.

The concept of VANET (Vehicular Ad hoc Network) is derived from the idea of MANET (Mobile Ad hoc Network), where each vehicle is considered as a mobile node. Localization technique based on the clustering methods is an important issue for both MANET and VANET. To find out the position of a node and also provide the link stability in the ad hoc network is a present research area from the researcher view. Now-a-days a large spectrum of work has already been done in clustering techniques in ad hoc network, especially in VANET. The clustering technique is very much useful for reliable and faster data communication in both the forms of networks. The objective of this paper is to provide an idea about the localization concept related to clustering method based on both GPS and GPS free situations in real world scenario.

Position-based routing protocols take advantage of location information to perform a stateless and efficient routing. To enable position-based routing, a node must be able to discover the location of the messages’ destination node. This task is typically accomplished by a location service. Recently, several location service protocols have been developed for ad hoc networks.In this paper we propose a novel location service called PHLS: Predictive Hierarchical Location Service. In PHLS, the entire network is partitioned into a hierarchy of smaller and smaller regions. For each node, one node in each-level region of the hierarchy is chosen as its local location server. When the network initializes or when a node attaches the network, nodes contact their local location server with their current location information (ie. position and velocity). Then, they only need to update their location server when they move away from their current region. Finally, nodes query their location servers and get the exact or predicted location of destination nodes.KeywordsMobile NodeLocation InformationDestination NodeLocation ServerPredictive SchemeThese 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.

Ant colony optimization (ACO) is a stochastic approach for solving combinatorial optimization problems like routing in computer networks. The idea of this optimization is based on the food accumulation methodology of the ant community. Zone based routing algorithms is build on the concept of individual node's position for routing of packets in mobile ad-hoc networks. Here the nodes' position can be further utilized to discover routes by the Ants in optimized way. Position based routing algorithms (POSANT) had some significant loopholes to find route (source to destination) like it never guarantees the route would be the shortest one, in cases while it is able to find it. On the contrary, routing algorithms which are based on ant colony optimization find routing paths that are close in length to the shortest paths. The drawback of these algorithms is the large number of control messages that needs to be sent or the long delay before the routes are established from a source to a destination. Here In this paper we have used Zone based ANT colony using Clustering which assures to find shortest route using the DIR principle (In this principle, the source or intermediate node transmits message to several neighbors and the node whose direction is closest to the direction of destination gets selected as the next hop forwarding node.) together with minimum overhead for route discovery and mobility management. Unlike other Zone based approach, in clustering it is not required to consider zone related information of each node while finding shortest path. Here, it is being proposed a new routing algorithm for mobile ad hoc network by combining the concept of Ant Colony approach and Zone based routing approach using clustering to get shortest path with small number of control messages to minimize the overhead. Simulations show that Zone Based ant colony routing algorithm has relatively short route establishment overhead than other zone based ant colony algorithms in highly mobile scenarios.