History-Based Backoff Algorithms for Mobile Ad Hoc Networks

Mobile Ad hoc Network (MANET) is a wireless network consisting of mobile devices (laptops, smart phones, etc.) that move and communicate with each other without the use of any existing network infrastructure or centralized server to avoid collisions which have negative effects on the performance of the network. Access to the shared media is controlled by a Backoff algorithm that is a part of the Media Access Protocol. In this paper, we improve the History Based Probabilistic Backoff (HPPB) algorithm by modifying the increment/decrement behavior of the Contention Window to introduce History Based Increment Backoff (HBIB) algorithm which outperforms HBPB in terms of throughput and end-to-end delay with various numbers of nodes and different traffic loads.

Multipath Source Self Repair Routing Algorithm for Mobile Ad Hoc Networks

A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is balanced, the link state in the network can be checked in time, the number of the times the route discovery mechanism starts is decreased. If only one route which will be broken can be used to transmit the packets, the route discovery mechanism is restarted.The algorithm is implemented on the basis of dynamic source routing (DSR). The effect of MSSRR on lifetime of the access from the source to the destination and the overhead is discussed. Compared with the performance of DSR,it can be seen that the algorithm can improve the performance of the network obviously and the overhead almost does not increase if the average hop count is larger.

An Ant Colony Algorithm Based Congestion Elusion Routing Strategy for Mobile Ad Hoc Networks

A critical challenge for mobile ad hoc networks is the design of efficient routing protocols which are able to provide high bandwidth utilization and desired fairness in mobile wireless environment without any fixed communication establishments. Although extensive efforts have already been devoted to providing optimization based distributed congestion elusion strategy for efficient bandwidth utilization and fair allocation in both wired and wireless networks,a common assumption therein is the fixed link capacities,which will unfortunately limit the application scope in mobile ad hoc networks where channels keep changing. In this paper,an effective congestion elusion strategy is presented explicitly based on ant colony algorithm for mobile ad hoc networks, which will explore the optimal route between two nodes promptly,meanwhile forecast congestion state of the link. Accordingly,a new path will be found rapidly to have the flow spread around to relieve the congestion degree. Compared with OLSR,the strategy proposed will greatly reduce the packet loss ratio and the average end-to-end delay at the same time,which illustrate that it will make use of networking resource effectively.

A reliable routing algorithm based on fuzzy Petri net in mobile ad hoc networks

A novel reliable routing algorithm in mobile ad hoc networks using fuzzy Petri net with its reasoning mechanism was proposed to increase the reliability during the routing selection. The algorithm allows the structured representation of network topology, which has a fuzzy reasoning mechanism for finding the routing sprouting tree from the source node to the destination node in the mobile ad boc environment. Finally, by comparing the degree of reliability in the routing sprouting tree, the most reliable route can be computed. The algorithm not only offers the local reliability between each neighboring node, but also provides global reliability for the whole selected route. The algorithm can be applied to most existing on-demand routing protocols, and the simulation results show that the routing reliability is increased by more than 80% when applying the proposed algorithm to the ad hoc on demand distance vector routing protocol.

Ants-Based On-Demand Routing Algorithm for Mobile Ad Hoc Networks

An ants-based on-demand routing algorithm （AORA） specialized for mobile ad hoc networks is proposed. AORA measures the network＇s traffic information including delivery time, route energy etc. by the continuous delivery of data packets, then calculates the compositive parameter for each route which can be seen as the stigmity and uses it to choose the comparatively optimal route in real time. To adjust the weight of each traffic information, the algorithm can meet the different demand of the network＇s user. Multipath source self repair routing （MSSRR） algorithm and dynamic source routing （DSR） can be seen as the special samples of AORA. The routing overhead is not increased in this algorithm. By using simulation, it can be seen that the performance of AORA is better than that of DSR in all scenarios obviously, especially the delivery fraction is increased by more than 100 96.

Hybrid ants-like search algorithms for P2P media streaming distribution in ad hoc networks

Media streaming delivery in wireless ad hoc networks is challenging due to the stringent resource restrictions,po-tential high loss rate and the decentralized architecture. To support long and high-quality streams,one viable approach is that a media stream is partitioned into segments,and then the segments are replicated in a network and served in a peer-to-peer(P2P) fashion. However,the searching strategy for segments is one key problem with the approach. This paper proposes a hybrid ants-like search algorithm(HASA) for P2P media streaming distribution in ad hoc networks. It takes the advantages of random walks and ants-like algorithms for searching in unstructured P2P networks,such as low transmitting latency,less jitter times,and low unnecessary traffic. We quantify the performance of our scheme in terms of response time,jitter times,and network messages for media streaming distribution. Simulation results showed that it can effectively improve the search efficiency for P2P media streaming distribution in ad hoc networks.

Design and analysis of a network coding algorithm for ad hoc networks

Network coding is proved to have advantages in both wireline and wireless networks. Especially, appropriate network coding schemes are programmed for underlined networks. Considering the feature of strong node mobility in aviation communication networks, a hop-by-hop network coding algorithm based on ad hoc networks was proposed. Compared with COPE-like network coding algorithms, the proposed algorithm does not require overhearing from other nodes, which meets confidentiality requirements of aviation communication networks. Meanwhile, it does save resource consumption and promise less processing delay. To analyze the performance of the network coding algorithm in scalable networks with different traffic models, a typical network was built in a network simulator, through which receiving accuracy rate and receiving delay were both examined.The simulation results indicate that, by virtue of network coding, the proposed algorithm works well and improves performance significantly. More specifically, it has better performance in enhancing receiving accuracy rate and reducing receiving delay, as compared with any of the traditional networks without coding. It was applied to both symmetric and asymmetric traffic flows and, in particular, it achieves much better performance when the network scale becomes larger. Therefore, this algorithm has great potentials in large-scale multi-hop aviation communication networks.

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.

Genetic Algorithm Routing Protocol for Mobile Ad Hoc Network

Mobile ad hoc network(MANET)is a dynamically reconfigurable wireless network with time-variable infrastructure.Given that nodes are highly mobile,MANET’s topology often changes.These changes increase the difficulty in finding the routes that the packets use when they are routed.This study proposes an algorithm called genetic algorithm-based location-aided routing(GALAR)to enhance the MANET routing protocol efficiency.The GALAR algorithm maintains an adaptive update of the node location information by adding the transmitting node location information to the routing packet and selecting the transmitting node to carry the packets to their destination.The GALAR was constructed based on a genetic optimization scheme that considers all contributing factors in the delivery behavior using criterion function optimization.Simulation results showed that the GALAR algorithm can make the probability of packet delivery ratio more than 99%with less network overhead.Moreover,GALAR was compared to other algorithms in terms of different network evaluation measures.The GALAR algorithm significantly outperformed the other algorithms that were used in the study.

Collision Resolution MAC Protocols for Wireless Ad Hoc Networks

In wireless ad hoc networks, nodes cooperatively form a network without any infrastructure such as a BS/AP (base station or access point). The widely-used contention-based MAC protocol, IEEE 802.11b, is inefficient in multi-hop networks due to the hidden and exposed terminal problems. The most popular schedule-based MAC protocol, TDMA (time division multiple access), is difficult to implement in an ad hoc network due to the lack of infrastructure. The contribution of this paper is to provide the community novel and efficient MAC (medium access control) protocols (i.e., a collision resolution protocol) for a wireless ad hoc network without a centralized infrastructure. We propose two new MAC protocols (one distributed algorithm and one cluster-based algorithm) that use a collision resolution scheme for a network with a single BS/AP. We first compare the performance of our distributed algorithm with our cluster-based algorithm. Then, we compare our algorithm that performs better (i.e., our cluster-based algorithm) to TDMA in a two-hop network. The simulation results illustrate that our cluster-based algorithm provides higher throughput and lower delay than TDMA in a two-hop network.

AN ENHANCEMENT SCHEME OF TCP PROTOCOL IN MOBILE AD HOC NETWORKS:MME-TCP

Transmission Control Protocol (TCP) optimization in Mobile Ad hoc NETworks (MANETs) is a challenging issue because of some unique characteristics of MANETs. In this paper,a new end-to-end mechanism based on multiple metrics measurement is proposed to improve TCP performance in MANETs. Multi-metric Measurement based Enhancement of TCP (MME-TCP) designs the metrics and the identification algorithm according to the characteristics of MANETs and the experiment results. Furthermore,these metrics are measured at the sender node to reduce the overhead of control information over networks. Simulation results show that MME-TCP mechanism achieves a significant performance improvement over standard TCP in MANETs.

A Dynamic Protocol Stack Structure for Diversified QoS Requirements in Ad Hoc Network

A dynamic protocol stack(DPS) for ad hoc networks, together with a protocol stack construction scheme that is modeled as a multiconstrained knapsack problem is proposed. Compared to the traditional static protocol stack, DPS operates in a dynamic and adaptive manner and is scalable to network condition changes. In addition, a protocol construction algorithm is proposed to dynamically construct of the protocol stack each network node. Simulation results show that, the processing and forwarding performance of our scheme is close to 1 Gb/s, and the performance of our algorithm is close to that of the classical algorithms with much lower complexity.

Adaptive Backoff Algorithm for IEEE 802.11 MAC Protocol

A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that can communicate directly over wireless media, without the need for a preconfigured infrastructure. Several approaches have been suggested to improve Quality of Service (QoS) in IEEE 802.11-based MANETs through modifying some of the IEEE 802.11 Medium Access Control (MAC) algorithms, such as the backoff algorithm that is used to control the packets collision aftermath. In this work, an adaptive IEEE 802.11 backoff algorithm to improve QoS is de-veloped and tested in simulations as well as in testbed implementation. While the Binary Exponential Backoff (BEB) algorithm deployed by IEEE 802.11 reacts based on individual packet transmit trials, the new algo-rithm takes the history of successive packet transmit trials into account to provide a better QoS performance. The new algorithm has been tested against the legacy IEEE 802.11 through simulations using QualNet and a Linux-based testbed comprising a number of stations. The performed tests have shown significant im-provements in performance, with up to 33.51% improvement in delay and 7.36% improvement in packet delivery fraction compared to the original IEEE 802.11.

Ad Hoc Network Hybrid Management Protocol Based on Genetic Classifiers

The purpose of this paper is to solve the problem of Ad Hoc network routing protocol using a Genetic Algorithm based approach. In particular, the greater reliability and efficiency, in term of duration of communication paths, due to the introduction of Genetic Classifier is demonstrated.

Design Method Based on Routing Tree for Topology Update in Ad Hoc Network

A design method based on the tree-model structure for topology update is presented. The routing tree of every node in network is built by defining the data structure and is used to save the topology information of neighbor nodes. The node topology update is accomplished by exchanging their routing trees. For saving the precious wireless bandwidth, the routing tree is sparsely shaped before sending by pruning the redundant routing information. Then, the node topology update is implemented by using algorithms of inserting and deleting routing sub-trees.

Ad hoc网络中的路由算法

Adhoc网络近年来的快速发展可望成为下一代网络的核心.在此背景下,对于相关路由算法进行全面的概括和总结对于Adhoc网络的研究具有很重要的意义.本文介绍和分析了当前Adhoc网络中的各种主要路由算法,包括表驱动路由协议和源发起按需路由,特别是源发起按需路由.对于源发起按需路由的时间复杂性、通信复杂性等作了较为详细的分析和性能比较,给出了各自的缺点和优点分析.同时进一步研究了Adhoc网络中的不同算法的QoS问题,不仅考虑到时延、带宽,也考虑到链路或路由的稳定性、功率消耗等.在文章的后面部分,介绍了作者在QoS路由算法方面的一些研究思路以及多路由算法最新的发展趋势.

Ad hoc网络信道接入技术研究

Ad hoc网络是一种特殊的对等式网络。传统的基于固定的或有中心的网络的协议不能满足 Ad hoc网络的需要。首先研究了 Ad hoc网络信道接入协议要考虑的隐终端问题和暴露终端问题 ,并给出了一种可能的双信道解决方案。在分析了现有的两种退避算法后 ,提出使用退避计数器广播加信道争用估计技术来消除不公平现象。在这些结果的基础上 ,提出了一种新的信道接入协议。

一种用于Ad Hoc网络的分布式证书撤销算法

分析了AdHoc网络安全基础设施存在的问题,提出了一种用于AdHoc网络的分布式证书撤销算法.该算法把证书的撤销分为无条件撤销和有条件撤销两类.利用撤销矩阵R(T)和权值向量W(T)分别对网络节点之间的撤销关系和网络节点的可信度进行描述,并引入撤销影响因子α来限制单个节点撤销操作的力度,增加多节点联合撤销的力度,以提高撤销的可靠性.通过权值迭代关系式逐步实现网络运行过程中权值的不断更新变化.最后定量分析了分布式证书撤销算法的可靠性,以及撤销影响因子α的取值和其对证书撤销可靠性的影响.

一种新型的Ad Hoc网络分簇算法及其性能仿真

现存的Ad Hoc网络分簇算法大都只考虑影响网络性能的某个方面的因素,因此这些分簇算法的应用场合非常受限。本文在现存分簇算法的基础上设计了一种考虑多方面因素的新型分簇算法,可以在一定程度上改善网络的性能,并且具有较强的通用性。首先介绍了分簇算法提出的背景和一些相关的定义和假设,然后说明了几种现存的分簇算法的不足。接着重点分析了一种性能较好的分簇算法—自适应按需加权分簇算法,最后通过模拟对该分簇算法与其它几种算法进行了性能比较和评价。