A Trust Based Threshold Revocation Scheme for MANETs

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

Now a day's use of wireless communication is very common and growing faster. There are different types of wireless networks which are designed as per the requirement of data rate and coverage. In this paper scope is limited to widely study and used network called Mobile Ad hoc Network (MANET). MANET is collection of wireless devices which communicate among each other without need of any physical infrastructure as well as centralize administrations. Each mobile node in MANET acts as peer node. The communication is MANET is based on routing methods and hence since from last 2 decade there are number of routing methods designed with objective of improving the Quality of Service (QoS) performance of MANET. As the mobile nodes in MANET are moving randomly with varying mobility speed, this can leads the challenging tasks to achieve the guaranteed QoS performance. Therefore it is required to have efficient routing protocol with load balancing and dynamic behaviour of mobile nodes handling in MANET. In this paper, our goal first is to present the study on different QoS aware routing methods and non-routing methods designed by various research groups for MANET. Second objective is to design novel QoS Aware routing protocol for improving the QoS performance in MANET. Additionally, we are presenting the current research gap based on analysis of all recent methods of QoS improvement. The outcome of this paper is the current research problems and efficient QAODV routing method.

Networks are being used in various areas and the demand of users nowadays has motivated the emergence of the Mobile Ad Hoc Network (MANET). MANET is a dynamic network without fixed infrastructure due to their wireless nature and can be deployed as multi-hop packet networks. It is a wireless network and has dynamic topology due to its node mobility. There are two types of MANET, homogeneous and heterogeneous MANET. An architecture has been designed in previous work to model these two types of MANET. Three scenarios have been defined from this architecture: scenario I (communication entirely within MANET, homogeneous MANET), scenario II (communication between MANET and wireless LAN, heterogeneous MANET) and scenario III (communication between MANET with wireless LAN and wired LAN, heterogeneous MANET). MANET has its own routing protocols which can compromised with frequent route exchange, dynamic topology, bandwidth constraint and multi-hop routing. Ad hoc On Demand Distance Vector (AODV) is one of the routing protocols in MANET. The aim of this research is to assess the effects of different packet size with the implementation of AODV routing protocols in homogeneous and heterogeneous MANET through the simulation method. The three scenarios above have been developed in the OMNeT++ network simulator. The results achieved from the test have been evaluated using the metrics assigned, throughput and packet delivery ratio (PDR). The tests show that the increase of throughput and PDR performance was parallel with the increase of packet size. From the test also, we can conclude that the performance due to the packet size effect in homogeneous MANET is better than in heterogeneous MANET.

The emerging trend of using mobile agents for mobile adhoc network (MANET) applications intensifies the need for protecting them. Here we propose a distributed trust based framework to protect both the agents and the host platforms (running at the nodes). This paper develops a distributed reputation model of MANET using concepts from Dempster-Shafer theory. The agents and the host platforms work together so that each trusted node may form a consistent trust view of MANET. An agent may share its view of the network with a visited host. To speed up convergence, a node broadcasts information regarding a suspected node. Thus an inactive node, without deploying agents may also get a partial view of the network. The agents use combination of encryption and digital signature to provide privacy and authentication services. Node mobility and the effect of environmental noise are considered. The results show the robustness of our proposed scheme.

In this research, our aim is to construct an effective quality of service (QoS) routing scheme for mobile ad hoc networks (MANET) that provides the service to satisfy required quality by absorbing dynamic changes of network resources. In this paper, we propose an application-level QoS routing scheme for MANETs (ALRS) as a novel QoS routing, that includes following three significant features: (1) estimation of consumed bandwidth on each node using 2-hop neighbors' traffic information, (2) route construction combined with admission control on each application session using (1), and (3) route maintenance based on (1) and (2). ALRS realizes control of generated traffic in MANET effectively and enables to provide the service to satisfy required quality for dynamic changes of network resources. By using our proposed scheme, it is expected that the availability of bandwidth would greatly improve for high-load communication, such as multimedia application on MANET. From our simulation results, it has shown, that our proposed scheme, by effective suppression of traffic, increased delivery ratio up to 40%, without any deterioration of throughput compared to traditional method. Results show that our proposed scheme enables to provide the service to satisfy the required quality

Mobile Ad hoc network (MANET) is a short range network which enables various mobile nodes to communicate with each other. The range of mobile node for communication is limited in the MANET so two nodes of different network which are placed in long distance are unable to communicate between them. Utility of MANET can be enhanced by providing Internet connectivity to the mobile nodes. MANET is infrastructureless and Internet is infrastructure type network so they require an interface to connect with each other. So in this situation, Gateway, a device which acts as an interface and a router, provides the MANET nodes connectivity to fixed networks. A mobile node in MANET has to find a route to a gateway first to communicate with the Internet host. It requires an efficient gateway discovery mechanism for improve the overall performance of network. For this process various approaches have been proposed in the past. The popular approaches are reactive, proactive and hybrid gateway discovery mechanisms. This paper focuses on various issues for MANET-Internet integration and their proposed technical solutions by various proposals for different Internet gateway discovery mechanisms to improve the performance.

Mobile Ad-hoc Network (MANET) comprise of independent ambulant nodes with no any stable infrastructure. All mobile nodes are co-operatively transfer their data packets to different mobile nodes in the network. Mobile nodes are depends on intermediate nodes when transmission range beyond limit i.e. multi hop network. As MANET is a highly dynamic network, mobile nodes can leave and join a network at anytime. Security is the biggest issue in MANET as MANET is infrastructure-less and autonomous. In MANET, correspondence between two mobile nodes is performed by routing protocols wherein every versatile node can make directly communication with other versatile node. In the event that both portable nodes are inside a transmission range of each other, then they can straightforwardly make communication with each other. Otherwise, transmission is done through the intermediate node. The nature of its wireless nature is also additionally turns into the purpose of its greatest vulnerability. In this manner, diminishing the confidence level of the system as it appropriate to availability, integrity, reliability and privacy concerns. There are different routing protocols for providing security that are designed based on various cryptographic techniques. To obtain a rapid knowledge of security design, we are giving a review on different cryptographic techniques to secure MANET. In this review, we presents security techniques and protocols related to cryptographic techniques.

Mobile ad hoc networks (MANETs) can be defined as a collection of large number of mobile nodes. Due to self configuring ability of nodes and infrastructure less nature of network, MANET is preferred in variety of applications such as military, disaster stuck areas, emergency recovery etc. MANET is vulnerable to various attacks due to its open medium and wide distribution of nodes. This itself emphasize the importance of security and need for an efficient system, for example intrusion detection system in MANET. In literature, various intrusion detection systems (IDS) have been proposed for detecting the node that misbehaves in the network. The misbehaviour such as, delay or drop in data packets or acknowledgement packets, drop packets and modify routing information etc. are present. These misbehaviour need to be detected well in advance to keep network secure. In this paper we propose and implement, new IDS named as Secure Acknowledgement (ACK) System. The Secure ACK system is purely an acknowledgement based technique. The type of misbehaviour detected by proposed system is about delay in packet transmission. In this system, for every three consecutive nodes in the route, the third node is required to send back an acknowledgement packet to the first node in the group. Based on the non-receipt of ACK packet within predefine time to the first node in the group, it reports about misbehaviour activity in the network. As soon as the proposed system detects misbehaving node present in the network, it stops the further data transmission. So, the misbehaving node will not be able to damage network thereafter.

Mobile Ad Hoc Networks (MANET), due to their lack of physical infrastructures or centralized authorities, pose a number of security challenges to a protocol designer. In particular, several typical application scenarios demand the design of protocols that cannot base their security on the existence of trusted parties or setup information, but rather need to leverage uniquely on assumptions limiting the corrupting power of the adversaries. This naturally defines security design and analysis paradigms similar to those of the Threshold Cryptography area, where it is typically assumed that an adversary can corrupt up to a limited amount of entities or resources. Therefore a secure realization of primitives from Threshold Cryptography in MANET promises to be applicable to several MANET protocols.Recently, in [10], we started the analysis of Threshold Cryptography solutions over MANET, by focusing on the problem of extending to these networks known efficient threshold signature schemes for wired networks. In particular, we noted a major design difficulty due to the lack of full network connectivity that significantly constrained the network topology assumptions under which a MANET threshold signature scheme can be proved secure. In this paper we continue our investigation and present a new MANET threshold signature scheme that is secure under significantly improved topology assumptions. Surprisingly, we break through an apparent barrier due to well-known results from the Distributed Computing area.

Mobile Ad Hoc Network (MANET) comprises a group of mobile or wireless nodes that are placed randomly and dynamically which causes the constant change between nodes. When considering a routing protocol to deploy in any given situation on MANET, factors such as the mobility model, mobility of nodes, the network size and packet size should be carefully considered because the routing protocols configured with the mobility model can highly affect the performance of MANET. This paper analysed the impact of two different routing protocols (i.e. Dynamic Source Routing (DSR) and Optimized Link State Routing (OLSR)) on the performance of Random WayPoint (RWP) mobility model. Three measures of performance metrics (i.e. average throughput, average delay and average traffic received) were used. In all three-performance metrics, the simulated results indicated that Random WayPoint (RWP) configured with OLSR protocol performed better than RWP configured with DSR protocol. This indicates that the choice of a routing protocol for a specific mobility model should be considered in a network design.

The communication between mobile node and fixed node is achieved through the Integrated Internet MANET (IIM) with the help of the gateway by increasing the application domain of mobile ad hoc network. The wireless channel and dynamic nature of Mobile Ad hoc Networks (MANETs) experiences integrated MANETs to suffer from security susceptibility. Methods/Analysis: An untrustworthy mobile node can harm the data and adversely affect the communication between a mobile node and a fixed node in IIM. In this manner, examining the trust level impacts the certainty with which an element may decide for information transmission. In order to provide a secure data transmission we are proposing an Effective Trusted Knowledge Algorithm (ETKA) that calculates the nodes trust. Findings: The proposed algorithm has two phases for finding the trusted node. In the first phase, observing the nodes in promiscuous mode, in the second phase, the effective trust value is calculated by hybrid method. Improvement: Through extensive simulation analysis, we can come to an end that the developed mechanism leads to a successful methodology towards security and protection of data from untrusted nodes in integrated internet and MANET.

As technology progresses, networking undergoes continuous evolution to align with contemporary trends. Mobile Ad hoc Networks (MANETs) have emerged as a pivotal technology facilitating communication among mobile nodes sans a central administering node. MANETs find diverse applications spanning communication networks to battlefield scenarios. Nonetheless, MANETs encounter various challenges, including load balancing, energy efficiency, packet loss, and connection failures. Routing, among these challenges, assumes a pivotal role in defining network performance and connectivity capacity within MANETs. Moreover, the energy consumption of mobile nodes, often reliant on batteries with limited rechargeability, presents a significant concern in MANETs. This paper delves into diverse techniques devised to tackle the issues of energy efficiency and load balancing in MANETs. Additionally, it offers a comparative analysis to consolidate the survey findings. The outcomes of this study enrich our comprehension of energy-efficient and load-balanced routing protocols in MANETs, thereby facilitating the design and deployment of efficient networking solutions.

Mobile Ad Hoc Network (MANET) is a dynamic network without fixed infrastructure due to their wireless nature and can be deployed as multi-hop packet networks. It is a wireless network and has dynamic topology due to its node mobility. Networks are being used in various areas and the demand of users nowadays has motivated the emergence of the heterogeneous MANET. Compared to homogeneous MANET, heterogeneous MANET is more open to other types of network for example wireless LAN, cellular network and fixed network. In MANET, the concern is more to configuration and one of the important elements in configuration is routing. Ad hoc On Demand Distance Vector (AODV) is one of the routing protocols in MANET which can compromise with MANET characteristics. The aim of this research is to assess the performance of AODV in different mobility speed for homogeneous MANET and heterogeneous MANET through the simulation method. The simulation scenarios derived from the HetMAN architecture (as been discussed in previous work) have been developed in the OMNeT++ network simulator. The results achieved from the test have been evaluated using the metrics assigned; throughput and packet delivery ratio (PDR). The tests show that, as the speed increase, the throughput and PDR decrease for both homogeneous and heterogeneous MANET. From the test also, we can conclude that the performance in homogeneous MANET is better than in heterogeneous MANET.

Most existing trust-based security schemes for mobile ad-hoc networks (MANETs) consider packet loss an indicator of possible attacks by malicious nodes. There may be several reasons for packet losses, such as interference, queue overflow, and node mobility. Identifying the real underlying cause of a packet loss event is important for any security solution. To detect truly malicious nodes, it is necessary to carry out a fine-grained analysis (FGA) to determine the underlying cause of such loss. Without such analysis, the performance of any security solution may degrade, due to the punishment of innocent nodes while actual malicious nodes may remain undetected. Therefore, approaches are required that can correctly identify the reason for packet losses and can react accordingly. In this paper, we present a scheme that is able to correctly identify malicious nodes, using network parameters to determine whether packet losses are due to queue overflows or node mobility in MANETs. The contributions of this paper include the FGA scheme for packet loss and the development of a comprehensive trust model for malicious node identification and isolation. Our proposed FGA scheme is evaluated in terms of effectiveness and performance metrics under different network parameters and configurations. The experimental results show that our proposed trust model achieves a significant reduction in false positives rate and an increase in the rate of detection of truly malicious nodes compared with traditional non-FGA schemes.

In the mobile ad-hoc network (MANET), mobile nodes can freely move to anywhere whenever they want to. As MANET is no communication infrastructure, the route maintenance for transmitting the data and the volume of being transmitted data are important issues. In this paper, we adopt the content caching scheme to reduce the consumption of network bandwidth and node’s battery power. The proposed caching scheme stores the data being delivered by a neighboring node located in 1 hop away from itself. This has resulted in the increases of the probability that a mobile node stores the data to be used in future request. In evaluation, we examined our proposed scheme in the view of the cache hit ratio as the function of the number of mobile nodes and 4 mobility models: random way point, random direction, boundless simulation area and Gaussian-Markov. From simulation results, we confirm that the proposed scheme offers better performance substantially.