Timer Entrenched Baited Scheme to Locate and Remove Attacks in MANET

The Mobile Ad-hoc Network(MANET)is a dynamic topology that provides a variety of executions in various disciplines.The most sticky topic in organizationalfields was MANET protection.MANET is helpless against various threats that affect its usability and accessibility.The dark opening assault is considered one of the most far-reaching dynamic assaults that deteriorate the organi-zation's execution and reliability by dropping all approaching packages via the noxious node.The Dark Opening Node aims to deceive any node in the company that wishes to connect to another node by pretending to get the most delicate ability to support the target node.Ad-hoc On-demand Distance Vector(AODV)is a responsive steering convention with no corporate techniques to locate and destroy the dark opening center.We improved AODV by incorporating a novel compact method for detecting and isolating lonely and collaborative black-hole threats that utilize clocks and baits.The recommended method allows MANET nodes to discover and segregate black-hole network nodes over dynamic changes in the network topology.We implement the suggested method's performance with the help of Network Simulator(NS)-3 simulation models.Furthermore,the proposed approach comes exceptionally near to the original AODV,absent black holes in terms of bandwidth,end-to-end latency,error rate,and delivery ratio.

Improved QoS-Secure Routing in MANET Using Real-Time Regional ME Feature Approximation

Mobile Ad-hoc Network(MANET)routing problems are thoroughly studied several approaches are identified in support of MANET.Improve the Quality of Service(QoS)performance of MANET is achieving higher performance.To reduce this drawback,this paper proposes a new secure routing algorithm based on real-time partial ME(Mobility,energy)approximation.The routing method RRME(Real-time Regional Mobility Energy)divides the whole network into several parts,and each node’s various characteristics like mobility and energy are randomly selected neighbors accordingly.It is done in the path discovery phase,estimated to identify and remove malicious nodes.In addition,Trusted Forwarding Factor(TFF)calculates the various nodes based on historical records and other characteristics of multiple nodes.Similarly,the calculated QoS Support Factor(QoSSF)calculating by the Data Forwarding Support(DFS),Throughput Support(TS),and Lifetime Maximization Support(LMS)to any given path.One route was found to implement the path of maximizing MANET QoS based on QoSSF value.Hence the proposed technique produces the QoS based on real-time regional ME feature approximation.The proposed simulation implementation is done by the Network Simulator version 2(NS2)tool to produce better performance than other methods.It achieved a throughput performance had 98.5%and a routing performance had 98.2%.

Trust-based Intelligent Scheme for Mitigating Black Hole Attacks in IoT

Internet of Things(IoT)networks are characterized by a multitude of wireless,interconnected devices that can dynamically join or exit the network without centralized administration or fixed infrastructure for routing.While multipath routing in IoT networks can improve data transmission reliability and load balancing by establishing multiple paths between source and destination nodes,these networks are susceptible to security threats due to their wireless nature.Traditional security solutions developed for conventional networks are often ill-suited to the unique challenges posed by IoT environments.In response to these challenges,this paper proposes the integration of the Ad hoc On-demand Multipath Distance Vector(AOMDV)routing protocol with a trust model to enhance network performance.Key findings from this research demonstrate the successful fusion of AOMDV with a trust model,resulting in tangible improvements in network performance.The assessment of trustworthiness bolsters both security and routing capabilities in IoT networks.The trust model plays a crucial role in mitigating black hole attacks in IoT networks by evaluating the trustworthiness of nodes and helping in the identification and avoidance of malicious nodes that may act as black holes.Simulation results validate the efficacy of the proposed trust-based routing mechanism in achieving its objectives.Trust plays a pivotal role in decision-making and in the creation of secure distribution systems.By assessing the trustworthiness of nodes,both network security and routing efficiency can be enhanced.The effectiveness of the proposed trust-based routing mechanism is scrutinized through simulations,offering insights into its potential advantages in terms of improved network security and routing performance in the context of the IoT.

CROSS LAYER COORDINATED ENERGY SAVING STRATEGY IN MANET

Mobile Ad hoc NETwork (MANET) consists of a set of mobile hosts which can operate independently without infrastructure base stations. Energy saving is a critical issue for MANET since most mobile hosts will operate on battery powers. A cross layer coordinated framework for energy saving is proposed in this letter. On-demand power management, physical layer and medium access control layer dialogue based multi-packet reception, mobile agent based topology discovery and topology control based transmit power-aware and battery power-aware dynamic source routing are some of new ideas in this framework.

Survivability modeling and analysis on 3D mobile ad-hoc networks

Most existing work on survivability in mobile ad-hoc networks(MANETs) focuses on two dimensional(2D) networks.However,many real applications run in three dimensional(3D) networks,e.g.,climate and ocean monitoring,and air defense systems.The impact on network survivability due to node behaviors was presented,and a quantitative analysis method on survivability was developed in 3D MANETs by modeling node behaviors and analyzing 3D network connectivity.Node behaviors were modeled by using a semi-Markov process.The node minimum degree of 3D MANETs was discussed.An effective approach to derive the survivability of k-connected networks was proposed through analyzing the connectivity of 3D MANETs caused by node misbehaviors,based on the model of node isolation.The quantitative analysis of node misbehaviors on the survivability in 3D MANETs is obtained through mathematical description,and the effectiveness and rationality of the proposed approach are verified through numerical analysis.The analytical results show that the effect from black and gray attack on network survivability is much severer than other misbehaviors.

Anonymous multipath routing protocol based on secret sharing in mobile ad hoc networks

Because the intrinsic characteristics of mobile ad hoc networks（MANETs） cause several vulnerabilities,anonymous routing protocols attract much more attention in secure mobile ad hoc networks for the purposes of security and privacy concerns.Until recently,lots of anonymous routing protocols have been proposed.However,most of them are single path or use one path at a time,and the multipath schemes can not thwart both the passive attacks and active attacks simultaneously.Thus an anonymous multipath routing protocol based on secret sharing is proposed.The protocol provides identity anonymity,location anonymity,data and traffic anonymity by employing cryptograph technology and secret sharing in MANET communication process.Meanwhile,a hash function is introduced to detect active attacks in the data transmission process.The protocol can effectively thwart various passive attacks and reduce the successful probability of active attacks（such as interception and physical destroy attacks）.Simulation results show that the proposed scheme provides a reasonably good level of network security and performance.

DBLAR:A DISTANCE-BASED LOCATION-AIDED ROUTING FOR MANET

In location-aided routing of Mobile Ad hoc NETworks(MANET),nodes mobility and the inaccuracy of location information may result in constant flooding,which will reduce the network performance.In this paper,a Distance-Based Location-Aided Routing(DBLAR) for MANET has been proposed.By tracing the location information of destination nodes and referring to distance change between nodes to adjust route discovery dynamically,the proposed routing algorithm can avoid flooding in the whole networks.Besides,Distance Update Threshold(DUT) is set up to reach the balance between real-time ability and update overhead of location information of nodes,meanwhile,the detection of relative distance vector can achieve the goal of adjusting forwarding condition.Simulation results reveal that DBLAR performs better than LAR1 in terms of packet successful delivery ratio,average end-to-end delay and routing-load,and the set of DUT and relative distance vector has a significant impact on this algorithm.

New clustering algorithm for interconnection of MANET and internet

This paper presents coreagent based clustering (CBC) algorithm,a novel heuristic clustering scheme for interconnection of MANET and Internet using power,movement probability and hop length as constraints.CBC includes two phases as cluster initialization and cluster maintenance.In phase one,the selection of clusterheads obeys the first two constraints,whereas the father node of each clustering node is chosen according to above three ones.Phase two concerns the case of node insertion or removal.Easy access and little alteration of conventional mobile IP are some characters of this algorithm.Simulation results demonstrate that CBC has many advantages as less average hop length,good robustness and less overheads,and the clustered network architecture behaves stably when topology changes.

Recovery from Wormhole Attack in Mobile Ad Hoc Network (MANET)

Wormhole attack is a serious threat against MANET (mobile ad hoc network) and its routing protocols. A new approach—tunnel key node identification (TKNI) was proposed. Based on tunnel-key-node identification and priority-based route discovery, TKNI can rapidly rebuild the communications that have been blocked by wormhole attack. Compared to previous approaches, the proposed approach aims at both static and dynamic topology environment, involves addressing visible and invisible wormhole attack modes, requires no extra hardware, has a low overhead, and can be easily applied to MANET.

Algorithm and application of multiuser detection for CDMA-based MANET

Throughput of mobile ad hoc network （MANET） is limited by collision avoidance. In CDMA-based MANET, this limitation can be overcome by multiuser detection （MUD） because conventional colliding packets can be detached and detected by MUD so that multi-packet reception （MPR） is possible. This paper introduces the principles of MUD algorithm for MANET, and proposes an adaptive blind MUD algorithm. A special medium access control （MAC） protocol is designed to make MANET more efficient. This is achieved by sending more packets to a destination simultaneously. The proposed MUD algorithm and MAC protocol allow CDMA-based MANET to support MPR. Simulations show a remarkable improvement in the throughput performance of MANET.

An effective connected dominating set based mobility management algorithm in MANETs

This paper proposes a connected dominating set (CDS) based mobility management algorithm, CMMA, to solve the problems of node entering, exiting and movement in mobile ad hoc networks (MANETs), which ensures the connectivity and efficiency of the CDS. Compared with Wu's algorithm, the proposed algorithm can make full use of present network conditions and involves fewer nodes. Also it has better performance with regard to the approximation factor, message complexity, and time complexity.

A LOOP-BASED APPROACH IN CLUSTERING AND ROUTING IN MOBILE AD HOC NETWORKS

Although clustering is a convenient framework to enable traffic control and service support in Mobile Ad hoc NETworks （MANETs）, it is seldom adopted in practice due to the additional traffic overhead it leads to for the resource limited ad hoc network. In order to address this problem, we proposed a loop-based approach to combine clustering and routing. By employing loop topologies, topology information is disseminated with a loop instead of a single node, which provides better robustness, and the nature of a loop that there are two paths between each pair of nodes within a loop composed of setup procedure, regular procedure and emergent route recovering. suggests smart route recovery strategy. Our approach is recovery procedure to achieve clustering, routing and

Resistance to Malicious Packet Droppers Through Enhanced AODV in a MANET

Packet dropping in a mobile ad hoc network can manifest itself as the data plane attacks as well as control plane attacks.The former deal with malicious nodes performing packet drop on the data packets following the route formation and the latter deal with those malicious nodes which either drop or manipulate the control packets to degrade the network performance.The idea of the proposed approach is that during the route establishment,each of the on-path nodes is provided with pre-computed hash values which have to be used to provide a unique acknowledgement value to the upstream neighbor which acts as a proof of the forwarding activity.The analysis phase results in the detection of nodes which exhibited malicious behavior in the current communication session so as to avoid them in the future communication sessions resulting in an improved packet delivery fraction even in the presence of one or more malicious nodes in the network.The communication overhead incurred is minimum since the acknowledgement reports are sent to the destination for a transmission of N packets rather than an individual acknowledgement for each transmitted packet.In contrast to some of the existing techniques,the proposed mechanism is not dependent on the deployment of additional infrastructure like special Intrusion Detection System(IDS)nodes.The only overhead incurred is in the form of control packets exchanged for the reports request and the reports submission.

Signcryption-Based Key Management for MANETs Applications in Mobile Commerce

Mobile commerce uses wireless device and wireless link to result in the transfer of values in exchange of information, services or goods. Wireless mobile ad hoc networks （MANETs） will bring a revolution to the business model of mobile commerce if such networks are used as the underlying network technology for mobile commerce. Mobile commerce will remain in a niche market until the security issue is properly addressed. Hence, security is also very important for MANET applications in mobile commerce. Robust key management is one of the most crucial technologies for security of MANETs. In this paper, a new solution for key management is proposed using identity-based （ID-based） signcryption and threshold secret sharing. It enables flexible and efficient key management while respecting the constraints of MANETs. In our solution, each mobile host uses its globally unique identity as its public key. It greatly decreases the computation and storage costs of mobile hosts, as well as communication cost for system key management.

A Novel Multi-Level Trust Algorithm for Mobile Ad Hoc Networks

Firstly, a multilevel trust algorithm for MANET （mobile ad hoe networks） is presented in this paper and the trust level is defined as a three-tuple type in this multilevel trust algorithm. The paper introduces the multilevel trust into MANET, thereby controlling restricted classified information flows among nodes that have different trust levels. Secondly, the infrastructure of MANET that suit to our multi-level trust is presented, Some conclusions are given at lastly.

FAST CAPACITY ESTIMATION ALGORITHMS FOR MANETS USING DIRECTIONAL ANTENNAS

In this letter,capacity estimation for Mobile Ad hoc NETworks (MANETs) using direc- tional antennas are studied.Two Matrix-based Fast Calculation Algorithms (MFCAs) are proposed to estimate the network capacity in a network scenario in which there is no channel sharing among multiple sessions and traffic is sensitive to delay with an end-to-end delay constraint.The first algo- rithm MFCA-1 is used to estimate network capacity in a situation where all links have the same delay. It estimates the maximum number of k-hop sessions in a network based on the k-hop adjacency matrix of the network.The second algorithm MFCA-2 is used to estimate network capacity in a situation where different links may have different delays.It calculates the maximum number of sessions in a network with an end-to-end delay constraint based on the adjacency matrix and the link-delay matrix of the network.Numerical and simulation results show that both MFCA-1 and MFCA-2 can calculate network capacity much faster than the well-known Brute-Force Search Algorithm (BFSA) but with the same accuracy.

Speed aware self-adapting and reconfigurable routing mechanism in MANET

A self-adapting and reconfigurable routing mechanism is proposed according to the average moving speed of the nodes in mobile ad hoc network （MANET）. This mechanism is based on the perception of moving speed and a predesigned selection metric to choose the optimal routing protocol. The routing evaluation and selection metric is derived by OPNET simulations. AODV and OLSR are used as the example to show the process of this mechanism with the moving speed varying. The routing protocol can be configured without central configuration and human management. Besides, the overhead of the mechanism is reasonable and doesnot affect the quality of service （QoS） of the traffic in the network. Results show that the optimal routing protocol can be configured adaptively according to the speed so that better performance than end-to-end delay and packet delivery ratio. a specific protocol can be obtained in terms of

Average flooding distance for MANETs in random graph models with spatial reuse

The flooding distance is an important parameter in the design and evaluation of a routing protocol, which is related not only to the delay time in the route discovery, but also to the stability and reliability of the route. In this paper, the average flooding distance （AFD） for a mobile ad hoc network （MANET） in a random graph model was given based on the dynamic source routing （DSR） protocol. The influence of spatial reuse on the AFD was also studied. Compared with that in the model without the spatial reuse, the AFD in the model with the spatial reuse has much smaller value, when the connetivity probability between nodes in the network is small and when the number of reused times is large. This means that the route discovery with the spatial reuse is much more effective.

DSR-Based Selective Repeat ARQ Protocol in MANET

The efficient route algorithms involved in mobile ad hoc network(MANET) are studied. An arrangement of a combination of the traditional dynamic source routing(DSR) protocol is put forward and the selective repeat ARQ protocol is put forward by analyzing and studying them in detail and providing the scheme. In networks, especially in wireless networks, the nodes are capable to process data much faster than transmission, the DSR-based selective repeat ARQ protocol has real meanings in MANET.

DECLARATIVE HYBRID ROUTING PROTOCOLS IN AD HOC NETWORKS

This paper presents adaptive hybrid protocols based on the declarative network and mainly discusses the principle and realization of the Bayesian-estimation based adaptive hybrid protocol in the declarative network, which is well adapted to the Mobile Ad hoc NETwork (MANET). The adaptive hybrid protocol is designed for ad hoc networks which have characteristics like self-organizing, no trusted party, flexibility, etc. The nodes that run the hybrid protocol can automatically select one routing protocol that is suitable for different network environment. The Bayesian-estimation based adaptive strategy, that improves the adaptability and stability of the protocol, succeeds in the Rapidnet, a declarative network engine. The result in the Rapidnet proves that the hybrid protocol and the adaptive strategy are feasible. The experiment on the ns-3 simulator, an emerging discrete-event network simulator, validates that this protocol performs well and reduces communication overheads.