Location aided probabilistic broadcast algorithm for mobile Ad-hoc network routing

On-demand routing protocols are widely used in mobile Ad-hoc network （MANET）. Flooding is an important dissemination scheme in routing discovering of on-demand routing protocol. However, in high-density MANET redundancy flooding packets lead to dramatic deterioration of the performance which calls broadcast storm problem （BSP）. A location-aided probabilistic broadcast （LAPB） algorithm for routing in MANET is proposed to reduce the number of routing packets produced by flooding in this paper. In order to reduce the redundancy packets, only nodes in a specific area have the probability, computed by location information and neighbor knowledge, to propagate the routing packets. Simulation results demonstrate that the LAPB algorithm can reduce the packets and discovery delay （DD） in the routing discovery phase.

A Collaborative Approach for Secured Routing in Mobile Ad-Hoc Network

Mobile computing is the most powerful application for network com-munication and connectivity,given recent breakthroughs in thefield of wireless networks or Mobile Ad-hoc networks(MANETs).There are several obstacles that effective networks confront and the networks must be able to transport data from one system to another with adequate precision.For most applications,a frame-work must ensure that the retrieved data reflects the transmitted data.Before driv-ing to other nodes,if the frame between the two nodes is deformed in the data-link layer,it must be repaired.Most link-layer protocols immediately disregard the frame and enable the high-layer protocols to transmit it down.In other words,because of asset information must be secured from threats,information is a valu-able resource.In MANETs,some applications necessitate the use of a network method for detecting and blocking these assaults.Building a secure intrusion detection system in the network,which provides security to the nodes and route paths in the network,is a major difficulty in MANET.Attacks on the network can jeopardize security issues discovered by the intrusion detection system engine,which are then blocked by the network’s intrusion prevention engine.By bringing the Secure Intrusion Detection System(S-IDS)into the network,a new technique for implementing security goals and preventing attacks will be developed.The Secure Energy Routing(SER)protocol for MANETs is introduced in this study.The protocol addresses the issue of network security by detecting and preventing attacks in the network.The data transmission in the MANET is forwarded using Elliptical Curve Cryptography(ECC)with an objective to improve the level of security.Network Simulator–2 is used to simulate the network and experiments are compared with existing methods.

Load-balanced broadcast routing in wireless Ad-hoc networks

In wireless Ad-hoc networks, where mobile hosts are powered by batteries, the entire network may be partitioned because of the drainage of a small set of batteries. Therefore, the crucial issue is to improve the energy efficiency, with an objective of balancing energy consumption. A greedy algorithm called weighted minimum spanning tree （WMST） has been proposed, in which time complexity is O（n^2）. This algorithm takes into account the initial energy of each node and energy consumption of each communication. Simulation has demonstrated that the performance of the proposed algorithm improves the load balance and prolongs the lifetime.

Survivability Evaluation in Large-Scale Mobile Ad-Hoc Networks

Survivability refers to the ability of a network system to fulfill critical services in a timely manner to end users in the presence of failures and/or attacks. In order to establish a highly survivable system, it is necessary to measure its survivability to evaluate the performance of the system＇s services under adverse conditions. According to survivability requirements of large-scale mobile ad-hoc networks （MANETs）, we propose a novel model for quantitative evaluation on survivability. The proposed model considers various types of faults and connection states of mobile hosts, and uses the continuous time Markov chain （CTMC） to describe the survivability of MANETs in a precise manner. We introduce the reliability theory to perform quantitative analysis and survivability evaluation of segment-by-segment routing （SSR）, multipath-based segment-by-segment routing （MP-SSR）, and segment-by-segment-based multipath routing （SS-MPR） in large-scale MANETs. The proposed model can be used to analyze the network performance much more easily than a simulation-based approach. Numerical validation shows that the proposed model can be used to obtain a better evaluation result on the survivability of large-scale MANETs.

Optimization of Route Repair in Mobile Ad-hoc Network

A main shortcoming of mobile Ad-hoc network's reactive routing protocols is the large volume of far-reaching control traffic required to support the route discovery (RD) and route repair (RR) mechanism. Using a random mobility model, this paper derives the probability equation of the relative distance (RDIS) between any two mobile hosts in an ad-hoc network. Consequently, combining with average equivalent hop distance (AEHD), a host can estimate the routing hops between itself and any destination host each time the RD/RR procedure is triggered, and reduce the flooding area of RD/RR messages. Simulation results show that this optimized route repair (ORR) algorithm can significantly decrease the communication overhead of RR process by about 35%.

Analytical Comparison of Resource Search Algorithms in Non-DHT Mobile Peer-to-Peer Networks

One of the key challenges in ad-hoc networks is the resource discovery problem.How efciently&quickly the queried resource/object can be resolved in such a highly dynamic self-evolving network is the underlying question?Broadcasting is a basic technique in the Mobile Ad-hoc Networks(MANETs),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive ooding technique oods the network with query messages,while the random walk scheme operates by contacting subsets of each node’s neighbors at every step,thereby restricting the search space.Many earlier works have mainly focused on the simulation-based analysis of ooding technique,and its variants,in a wired network scenario.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of mobile P2P networks.In this article,we mathematically model different widely used existing search techniques,and compare with the proposed improved random walk method,a simple lightweight approach suitable for the non-DHT architecture.We provide analytical expressions to measure the performance of the different ooding-based search techniques,and our proposed technique.We analytically derive 3 relevant key performance measures,i.e.,the avg.number of steps needed to nd a resource,the probability of locating a resource,and the avg.number of messages generated during the entire search process.

Improvisation of Node Mobility Using Cluster Routing-based Group Adaptive in MANET

In today's Internet routing infrastructure,designers have addressed scal-ing concerns in routing constrained multiobjective optimization problems examining latency and mobility concerns as a secondary constrain.In tactical Mobile Ad-hoc Network(MANET),hubs can function based on the work plan in various social affairs and the internally connected hubs are almost having the related moving standards where the topology between one and the other are tightly coupled in steady support by considering the touchstone of hubs such as a self-sorted out,self-mending and self-administration.Clustering in the routing process is one of the key aspects to increase MANET performance by coordinat-ing the pathways using multiple criteria and analytics.We present a Group Adaptive Hybrid Routing Algorithm(GAHRA)for gathering portability,which pursues table-driven directing methodology in stable accumulations and on-request steering strategy for versatile situations.Based on this aspect,the research demonstrates an adjustable framework for commuting between the table-driven approach and the on-request approach,with the objectives of enhancing the out-put of MANET routing computation in each hub.Simulation analysis and replication results reveal that the proposed method is promising than a single well-known existing routing approach and is well-suited for sensitive MANET applications.

Performance Analysis of Grid Based AODV Routing Algorithm for AD Hoc Wireless Networks

In many traditional On Demand routing algorithms in Ad hoc wireless networks, a simple flooding mechanism is used to broadcast route request (RREQ) packets when there is a need to establish a route from a source node to a destination node. The broadcast of RREQ may lead to high channel contention, high packet collisions, and thus high delay to establish the routes, especially with high density networks. Ad hoc on Demand Distance Vector Routing Protocol (AODV) is one among the most effective Reactive Routing Protocols in MANETs which use simple flooding mechanism to broadcast the RREQ. It is also used in Wireless Sensor Networks (WSN) and in Vehicular Ad hoc Networks (VANET). This paper proposes a new modified AODV routing protocol EGBB-AODV where the RREQ mechanism is using a grid based broadcast (EGBB) which reduces considerably the number of rebroadcast of RREQ packets, and hence improves the performance of the routing protocol. We developed a simulation model based on NS2 simulator to measure the performance of EGBB-AODV and compare the results to the original AODV and a position-aware improved counter-based algorithm (PCB-AODV). The simulation experiments that EGBB-AODV outperforms AODV and PCB-AODV in terms of end-to-end delay, delivery ratio and power consumption, under different traffic load, and network density conditions.

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%.

A Systematic Overview of Underwater Wireless Sensor Networks:Applications,Challenge and Research Perspectives

Underwater Wireless Sensor Networks(UWSNs)are becoming increasingly popular in marine applications due to advances in wireless and microelectronics technology.However,UWSNs present challenges in processing,energy,and memory storage due to the use of acoustic waves for communication,which results in long delays,significant power consumption,limited bandwidth,and packet loss.This paper provides a comprehensive review of the latest advancements in UWSNs,including essential services,common platforms,critical elements,and components such as localization algorithms,communication,synchronization,security,mobility,and applications.Despite significant progress,reliable and flexible solutions are needed to meet the evolving requirements of UWSNs.The purpose of this paper is to provide a framework for future research in the field of UWSNs by examining recent advancements,establishing a standard platform and service criteria,using a taxonomy to determine critical elements,and emphasizing important unresolved issues.

Toward path reliability by using adaptive multi-path routing mechanism for multimedia service in mobile Ad-hoc network

Traditional multi-path routing mechanisms aim to establish complete node or link disjoint paths. However, under some circumstances if multiple paths cannot be established based on the current network topology, the traditional multi-path routing mechanism will degenerate into single path routing mechanism, thus the advantages of multi-path routing cannot be exhibited. To enhance the end-to-end path reliability, an adaptive multi-path routing mechanism with path segment is proposed, in which multi-path can be established at part of the end-to-end path. In this way the reliability of the path can be enhanced. This path segment mechanism can divide the end-to-end path into several short segments, and a parallel forwarding mechanism is proposed for guaranteeing the quality of service of multimedia services over the wireless network. Simulations show that the network performance metrics such as the packet delivery ratio, the end-to-end delay and the number of route discoveries are all improved by using the adaptive multi-path routing mechanism.

Contact modeling and prediction-based routing in sparse mobile networks

Mobile ad-hoc networks(MANETs)provide highly robust and self-configuring network capacity required in many critical applications,such as battlefields,disaster relief,and wild life tracking.In this paper,we focus on efficient message forwarding in sparse MANETs,which suffers from frequent and long-duration partitions.Asynchronous contacts become the basic way of communication in such kind of network instead of data links in traditional ad-hoc networks.Current approaches are primarily based on estimation with pure probability calculation.Stochastic forwarding decisions from statistic results can lead to disastrous routing performance when wrong choices are made.This paper introduces a new routing protocol,based on contact modeling and contact prediction,to address the problem.Our contact model focuses on the periodic contact pattern of nodes with actual inter-contact time involved,in order to get an accurate realization of network cooperation and connectivity status.The corresponding contact prediction algorithm makes use of both statistic and time sequence information of contacts and allows choosing the relay that has the earliest contact to the destination,which results in low average latency.Simulation is used to compare the routing performance of our algorithm with three other categories of forwarding algorithm proposed already.The results demonstrate that our scheme is more efficient in both data delivery and energy consumption than previously proposed schemes.

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.

Hybrid Trust Based Reputation Mechanism for Discovering Malevolent Node in MANET

A self-contained connection of wireless links that functions without any infrastructure is known as Mobile Ad Hoc Network(MANET).A MANET’s nodes could engage actively and dynamically with one another.However,MAN-ETs,from the other side,are exposed to severe potential threats that are difficult to counter with present security methods.As a result,several safe communication protocols designed to enhance the secure interaction among MANET nodes.In this research,we offer a reputed optimal routing value among network nodes,secure computations,and misbehavior detection predicated on node’s trust levels with a Hybrid Trust based Reputation Mechanism(HTRM).In addition,the study designs a robust Public Key Infrastructure(PKI)system using the suggested trust evaluation method in terms of“key”generation,which is a crucial component of a PKI cryptosystem.We also concentrate on the solid node authenticating process that relies on pre-authentication.To ensure edge-to-edge security,we assess safe,trustworthy routes to secure computations and authenticate mobile nodes,incorporating uncertainty into the trust management solution.When compared to other protocols,our recommended approach performs better.Finally,we use simulations data and performance evaluation metrics to verify our suggested approach’s validity Our approach outperformed the competing systems in terms of overall end-to-end delay,packet delivery ratio,performance,power consumption,and key-computing time by 3.47%,3.152%,2.169%,and 3.527%,3.762%,significantly.

Graph partitioning algorithm for opportunistic routing in large-scale wireless network

Opportunistic routing takes advantage of the broadcast nature of wireless communications by forwarding data through a set of opportunistic paths instead of one ＇best＇ path in traditional routing. However, using the global scheduling opportunistic scheme like the existing opportunistic routing protocol （ExOR） would consume considerable transmission latency and energy in large-scale wireless topologies. In this article, a graph partitioning algorithm is proposed, namely, minimum cut with laplacians （MCL）, to divide the Ad-hoc network topology into subgraphs with minimized edge cuts across them. Then the existing opportunistic routing can be applied locally in each subgraph. In this way, forwarders in different subgraphs can transmit simultaneously, and each node only needs to maintain a local forwarder list instead of a global one. The simulations show that using MCL scheme in the opportunistic routing can reduce the end-to-end delay by about 49%, and increase the life time of the wireless node by about 39%.

一种基于簇域机制的ZRP路由协议

针对区域路由协议域形成算法的缺陷,提出一种改进的协议C-ZRP.通过改变域的形成方法,使节点不再重复进入多个域,从而减少域内节点的路由表数,以及减少路由查找时产生的广播包,进而减少路由开销,与此同时,引入地理位置信息进行区域内路由触发更新,减少网络开销.基于NS-2模拟器,对该协议与ZRP协议进行了模拟实验,实验结果表明,新协议在控制路由开销和网络开销上有明显的优势.

基于改进的MAC和μTESLA的MANET安全路由算法

针对现有移动自组网安全路由协议难以兼顾数据完整性和机密性的问题,提出了一种结合数据完整性保护和数据机密性保护的安全路由协议。在数据完整性保护方面,采用单向hash函数和密钥生成消息认证码,鉴别路由中数据的完整性;在数据机密性保护方面,采用μTESLA协议传输加密数据包,在不同的时段传输不同的密钥,通过对称密钥的延迟透露模拟非对称机制,降低认证广播的资源消耗。仿真实验表明,该方法不仅在安全性方面优于现有的路由协议,而且在报文送达率、路由开销和端到端平均时延评价指标上也优于现有路由协议。

k-冗余结构无线自组网广播算法研究

针对k-冗余连接路由算法的特点,对最优广播树的生成算法进行了研究。首先根据最优广播树的数学模型,证明了它是一个NP难题(NP-Complete)。然后针对网络拓扑的特点提出了启发式广播树生成算法。针对算法的特点,分析了算法复杂度和算法的效率。结合GlomoSim仿真平台,在无线网络环境下对算法的效率进行了仿真,将协议的性能与简单广播算法进行了比较。仿真结果表明,启发式广播算法能够减小网络开销和节点的转发次数,提高网络的传输效率。

Message redundancy removal of multi-copy routing in delay tolerant MANET

This article puts forward a new scheme to control message redundancy efficiently in delay tolerant mobile Ad-hoc networks （MANET）. The class of networks generally lacks end-to-end connectivity. In order to improve the efficiency that messages are delivered successfully, multiple message copies routing protocols are usually used, but the network load is increased due to a large number of message redundancies. In the study, by using counter method, every node adds an encounter counter based on epidemic routing scheme. The counter records the number which the node encounters other nodes with the same message copy. If the counter of a node reaches tbe installed threshold, the node removes the copy. Theoretical analysis gives a lower bound of threshold in delay tolerant MANET. According to the lower bound of threshold, a rational threshold is installed in real environment. With proposed scheme message copies decrease obviously and are removed completely finally. The successful delivery efficiency is still the same as epidemic routing and the redundant copies are efficiently controlled to a relatively low level Computer simulations give the variation of message copies concerning different thresholds in fast and slow mobility scenes.

一种新的Ad Hoc网络中节约能量的广播路由协议

移动AdHoc网络中移动节点通过电池来供应能量,如果部分电池的能量被耗尽,整个网络将变成多个分离的网络,网络的生命周期减小。在路由协议的设计中如何有效地使用能量、延长网络的生命周期有重要的意义。论文对已知的节约能量的广播路由算法进行了讨论,并从平衡节点的能量消耗的角度出发,提出了一种新的节约能量的路由算法AMLE。AMLE通过Prim算法构造一个具有MLE(MinimumLongestEdge)性质的广播树,并通过区域预测机制来维护广播树,在不增加节点总的能量消耗的前提下平衡各节点的能量消耗。