Virtual reality mobility model for wireless ad hoc networks

For wireless ad hoc networks simulation, node＇s mobility pattern and traffic pattern are two key elements. A new simulation model is presented based on the virtual reality collision detection algorithm in obstacle environment, and the model uses the path planning method to avoid obstacles and to compute the node＇s moving path. Obstacles also affect node＇s signal propagation. Considering these factors, this study implements the mobility model for wireless ad hoc networks. Simulation results show that the model has a significant impact on the performance of protocols.

Multilevel security model for ad hoc networks

Modern battlefield doctrine is based on mobility, flexibility, and rapid response to changing situations. As is well known, mobile ad hoc network systems are among the best utilities for battlefield activity. Although much research has been done on secure routing, security issues have largely been ignored in applying mobile ad hoc network theory to computer technology. An ad hoc network is usually assumed to be homogeneous, which is an irrational assumption for armies. It is clear that soldiers, commanders, and commanders-in-chief should have different security levels and computation powers as they have access to asymmetric resources. Imitating basic military rank levels in battlefield situations, how multilevel security can be introduced into ad hoc networks is indicated, thereby controlling restricted classified information flows among nodes that have different security levels.

Analysis of reactive routing protocols for mobile ad hoc networks in Markov models

Mobile ad hoc networks （MANETs） have become a hot issue in the area of wireless networks for their non-infrastructure and mobile features. In this paper, a MANET is modeled so that the length of each link in the network is considered as a birthdeath process and the space is reused for n times in the flooding process, which is named as an n-spatiai reuse birth-death model （n-SRBDM）. We analyze the performance of the network under the dynamic source routing protocol （DSR） which is a famous reactive routing protocol. Some performance parameters of the route discovery are studied such as the probability distribution and the expectation of the flooding distance, the probability that a route is discovered by a query packet with a hop limit, the probability that a request packet finds a τ-time-valid route or a symmetric-valid route, and the average time needed to discover a valid route. For the route maintenance, some parameters are introduced and studied such as the average frequency of route recovery and the average time of a route to be valid. We compare the two models with spatial reuse and without spatial reuse by evaluating these parameters. It is shown that the spatial reuse model is much more effective in routing.

Linear Network Coding Based Fast Data Synchronization for Wireless Ad Hoc Networks with Controlled Topology

Fast data synchronization in wireless ad hoc networks is a challenging and critical problem.It is fundamental for efficient information fusion,control and decision in distributed systems.Previously,distributed data synchronization was mainly studied in the latency-tolerant distributed databases,or assuming the general model of wireless ad hoc networks.In this paper,we propose a pair of linear network coding(NC)and all-to-all broadcast based fast data synchronization algorithms for wireless ad hoc networks whose topology is under operator’s control.We consider both data block selection and transmitting node selection for exploiting the benefits of NC.Instead of using the store-and-forward protocol as in the conventional uncoded approach,a compute-and-forward protocol is used in our scheme,which improves the transmission efficiency.The performance of the proposed algorithms is studied under different values of network size,network connection degree,and per-hop packet error rate.Simulation results demonstrate that our algorithms significantly reduce the times slots used for data synchronization compared with the baseline that does not use NC.

The Research on QoS Model Design in Mobile Ad Hoc Networks

Wireless Ad Hoc Networks is a special kind of wireless communication network. With the great development of multimedia applications, how to provide QoS guarantee in the MAC layer is the hot topic in wireless ad hoc network (MANET). This paper designed a QoS model in MANET. The feasibility and reliability of this model is analyzed and verified. Compared with the traditional model, the proposed approach is improved in MAC layer in order to achieve high control rate of low-priority transactions.

DTMC-based Modeling and Analysis of Obstacle Ad hoc Networks

One of the main characteristics of Ad hoc networks is node mobility, which results in constantly changing in network topologies. Consequently, the ability to forecast the future status of mobility nodes plays a key role in QOS routing. We propose a random mobility model based on discretetime Markov chain, called ODM. ODM provides a mathematical framework for calculating some parameters to show the future status of mobility nodes, for instance, the state transition probability matrix of nodes, the probability that an edge is valid, the average number of valid-edges and the probability of a request packet found a valid route. Furthermore, ODM can account for obstacle environment. The state transition probability matrix of nodes can quantify the impact of obstacles. Several theorems are given and proved by using the ODM. Simulation results show that the calculated value can forecast the future status of mobility nodes.

Network Coding and Quality of Service for Mobile <i>Ad Hoc</i>Networks

Network Coding is a relatively new forwarding paradigm where intermediate nodes perform a store, code, and forward operation on incoming packets. Traditional forwarding approaches, which employed a store and forward operation, have not been able to approach the limit of the max-flow min-cut throughput wherein sources transmitting information over bottleneck links have to compete for access to these links. With Network Coding, multiple sources are now able to transmit packets over bottleneck links simultaneously, achieving the max-flow min-cut through-put and increasing network capacity. While the majority of the contemporary literature has focused on the performance of Network Coding from a capacity perspective, the aim of this research has taken a new direction focusing on two Quality of Service metrics, e.g., Packet Delivery Ratio (PDR) and Latency, in conjunction with Network Coding protocols in Mobile Ad Hoc Networks (MANETs). Simulations are performed on static and mobile environments to determine a Quality of Service baseline comparison between Network Coding protocols and traditional ad hoc routing protocols. The results show that the Random Linear Network Coding protocol has the lowest Latency and Dynamic Source Routing protocol has the highest PDR in the static scenarios, and show that the Random Linear Network Coding protocol has the best cumulative performance for both PDR and Latency in the mobile scenarios.

The impact of hidden node on model of ad hoc network

To deal with hidden nodes in ad hoc network, we take throughput as the metric to evaluate the performance of network. Firstly, we modeled the MAC layer of ad hoc network based on 802.11 DCF without the existence of hidden nodes. By means of the proposed model, we evaluated the throughput performance of DCF in multi-hop wireless networks. Secondly, we performed simulations to validate this model. The outcome of comparison is that there exists much difference in throughput between the model and the simulation. For reducing this difference, we modified the model by involving hidden nodes under the condition that the AODV route protocol was chosen, and analytically analyzed the influence of hidden nodes on theoretical throughput. At last, we validated the accuracy of this model by comparing the analytical results with simulation results.

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.

一种Ad Hoc下的网络编码模型NCMA

在Ad Hoc无线网络上实现网络编码是当前网络编码研究的热点之一,如何高效地选取编码节点已经成为网络编码研究的瓶颈。提出了一个适应用Ad Hoc网络的网络编码模型NCMA,NCMA将编码节点的选取与路由紧密结合,并给出了一种基于路由的编码节点选取方案,该方案可以在数据传输过程中简单、高效地选取编码节点,编码节点选取算法可以有效地控制因编码节点选取带来的延迟;NCMA实现了传统数据传输方式和编码数据传输方式的结合,可以将编码损益控制在一个单跳网络范围内,方便于无线节点之间的侦听操作,有利于减少复杂传输路径带来的各种失误。分析表明,该模型具有效率高、通用性好、实现简单等特点。

ON THE CAPACITY REGION OF WIRELESS AD HOC RELAY NETWORKS

Network capacity is a key characteristic to evaluate the performance of wireless networks, The goal of this paper is to study the capacity of wireless ad hoe relay network. In the model, there is at lnost ns source nodes transmitting signal simultaneously in the network and the arbitrarily complex network coding is allowed. The upper capacity bound of the network model are derived From the max-flow rain-cut theorem and the lower capacity bound are obtained by the rate-distortion function For the Gaussian source. Finally, simulation results show that the upper network capacity will decrease as the number of source nodes is increased.

A DUAL RESERVATION CDMA-BASED MAC PROTOCOL WITH POWER CONTROL FOR AD HOC NETWORKS

This paper proposes a new multi-channel Medium Access Control (MAC) protocol named as Dual Reservation Code Division Multiple Access (CDMA) based MAC protocol with Power Control (DRCPC). The code channel is divided into common channel,broadcast channel and several data chan-nels. And dynamic power control mechanism is implemented to reduce near-far interference. Compared with IEEE 802.11 Distributed Coordination Function (DCF) protocol,the results show that the pro-posed mechanism improves the average throughput and limits the transmission delay efficiently.

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

一种Ad Hoc网络组移动模型

战术互联网是AdHoc网络的主要应用,在该网络环境下,节点由于作战使命及建制的约束,移动节点常呈现出“组移动”的特征且组内节点通常分布在相对狭长的地带。针对战术互联网中移动节点的移动特征,提出了一种符合战术互联网环境的组移动模型:狭长的组移动模型(CGM:ConfinedGroupMobility),并从网络拓扑结构和对路由协议性能的影响两个方面与目前广泛采用的参考点组移动模型(RPGM:ReferencePointGroupMobility)进行了比较。仿真表明,不同的组移动模型对AdHoc网络的性能仿真将产生较大的影响。

一种Ad Hoc网络群组移动模型

全面介绍了当前群组移动模型的研究进展,分析了不同群组移动模型的特点和应用范围,针时现有移动模型不能有效反映群组节点运动过程中行为特性的不足,提出了基于Gibbs分布模拟退火的群组移动(Gibbs sampler based simulated annealing group mobility,简称GGM)模型,并与目前广泛采用的参考点群组移动(reference point group mobility,简称RPGM)模型进行仿真比较,分析了两种群组移动模型对网络协议性能评价与网络拓扑的影响.仿真结果表明,通过选择不同的Gibbs势函数,GGM模型能够有效描述群体运动过程中的聚集行为、分散行为和列队行为;模型比较的结果也表明,不同的移动模型对Ad Hoc网络协议性能具有不同的影响.

Ad hoc网络信任模型的研究

利用基于身份的公钥系统和(t,n)门限密码,实现一个Ad hoc网络的信任模型。在该信任模型中,系统私钥由所有节点共享,任意t个节点一起来完成可信中心的功能,为任意节点生成私钥。并且,无需权威机构来进行初始化,在系统私钥保持不变的前提下,节点拥有的部分系统私钥和门限t的值可以随时更新。该信任模型满足Ad hoc网络拓扑结构经常变化和移动节点资源受限的特性,可以用于建立一个安全的Ad hoc网络。

一种最大化Ad Hoc网络生存期的拓扑控制算法

如何延长无线自组网生存期是拓扑控制技术研究的重点.根据无线自组网通信的特点,基于目前使用最广泛的网络生存期定义和能耗模型,综合考虑节点的发送和接收功耗,通过分析网络生存期与节点通信距离、电路损耗及节点负载量的关系,得出拓扑控制与网络生存期的关系.在此基础上提出延长网络生存期的分布式拓扑控制算法MLTC.网络中每个节点收集其邻居节点信息,分布式构建具有最长路径生存期特性的局部生成子图,并选取覆盖所有最优相邻节点的最小发射功率为此节点的发射功率.算法在保证网络连通性与无向性的同时,使得节点能用最小功率构建保存了原图最长生存期路径的子图.理论分析和仿真实验结果表明,MLTC算法在不同的发送和接收功耗比下均能有效延长网络的生存期.

一个ad hoc网络中的簇结构模式

提出一种adhoc网络中新的簇结构模式 采用约束特征值的概念对adhoc网络中节点移动的约束环境进行数学抽象 ,定义了节点属性的数学表达式 以节点的通信能力值和状态变化值作为选择簇头节点的依据 ,在此基础上提出了分簇算法GM BFS ,对平面adhoc网络进行分簇 。

移动模型对Ad hoc网络路由协议能耗的影响

Ad hoc网络节点能量受限的路由协议的研究是目前的一个热点,IETF的MANET小组提出的几种经典的路由协议,属于最短路由,即最小跳数路由,没有考虑能量因素。由于Ad hoc网络中的节点是由电池供电,整个网络是一个能量受限系统,如何节省节点的能量,尽可能延长网络的可操控时间成为衡量路由协议性能的重要指标。目前针对这几种路由协议基于节点能量约束的评估很少。基于移动模型,该文以能量消耗程度为指标,对Ad hoc 4种典型的路由协议在不同的运动场景下进行了比较系统的仿真研究,得出了一些有益的结论,为进一步研究基于能耗的Ad hoc网络路由协议提供一些参考。

无线Ad hoc网络中一种基于网络编码的协同MAC协议

协同通信中,中继节点通常用来转发源节点的数据分组。但是从中继节点的角度出发,帮助其它节点转发数据会降低其自身的性能,导致中继低效率问题的出现。针对此问题,该文基于网络编码设计了一种适用于无线Ad hoc网络的协同MAC协议。该协议将网络编码和协同机制相结合,在需要协同传输时,利用网络编码让中继节点在发送源节点数据的同时也发送自身的数据,利用网络编码来解决协同传输中中继低效率问题,进一步提升协同传输的性能。该文还在2维Markov退避模型的基础上,加入了网络编码和协同机制,对所提协议在多跳网络中进行了吞吐量性能分析,并探讨了网络节点数、多跳和信道质量对吞吐量性能的影响。仿真结果表明,相比一般的协同MAC协议,采用网络编码的协同MAC协议可以显著的改善系统性能,是解决协同传输中的中继低效率问题的有效手段。