高动态飞行器自组织网络组网研究

节点高速移动和网络拓扑变化迅速严重影响着高动态飞行器自组织网络性能。提出了一种适于高动态场景的移动自组织网络协议栈设计。该设计着重QoS需求,围绕网络拓扑高动态变化特征,合理配置不同层次的网络协议,适合高动态应用场景。以平面网络为例,分析评估了FANET网络在高动态环境下的性能。实验结果表明,该组网方式可行并能满足高动态飞行器自组织网络的功能和性能需求。还提出了节点在个体移动方式下保持网络高性能的最佳节点数目和网络各层次协议适应高动态拓扑变化的应对策略。     

Cost-effective mobile ad hoc networks management

As there are more and more mobile devices in use, different mobile networking models such as ad hoc or mesh are attracting a large research interest. Self-organizing mobile ad hoc networks (MANET) allow devices to share their services and resources without any central administration or Internet support. In this respect they can become the backbone of the wireless grid or the gateway to existing grids. To achieve these goals, MANET management must be as effective as that of wired networks. This is, however, a challenging task due to network features like mobility, heterogeneity, limited resources of hosts and feeble communication. This paper presents a set of simple, cost-effective and resilient procedures for the basic tasks of MANET creation and management.     

移动Ad hoc网络路由安全性研究

路由协议安全性问题是移动Ad hoc网络研究重要课题。对移动Ad hoc网络路由协议中存在的安全问题和典型解决方案做了综述和分析。根据所适用的算法,将安全路由协议及其改进策略进行了分类。对路由安全性研究有较好的借鉴意义。     

Energy efficient multicast routing in ad hoc wireless networks

In this paper, we discuss the energy efficient multicast problem in ad hoc wireless networks. Each node in the network is assumed to have a fixed level of transmission power. The problem of our concern is: given an ad hoc wireless network and a multicast request, how to find a multicast tree such that the total energy cost of the multicast tree is minimized. We first prove this problem is NP-hard and it is unlikely to have an approximation algorithm with a constant performance ratio of the number of nodes in the network. We then propose an algorithm based on the directed Steiner tree method that has a theoretically guaranteed approximation performance ratio. We also propose two efficient heuristics, node-join-tree (NJT) and tree-join-tree (TJT) algorithms. The NJT algorithm can be easily implemented in a distributed fashion. Extensive simulations have been conducted to compare with other methods and the results have shown significant improvement on energy efficiency of the proposed algorithms.     

A hybrid channel assignment strategy to QoS support of video-streaming over multi-channel ad hoc networks

Currently multi-channel multi-interface ad hoc networks (multi-channel ad hoc networks) have received amount of interest, especially under the context of real-time traffics, such as video applications. Channel assignment is one of the key challenges in multi-channel ad hoc networks. In this paper, based on a representative hybrid channel assignment strategy named as HMCP, a statistic link load based hybrid channel assignment strategy, SLL-HCA, is presented to obtain a better channel assignment metric than that in HMCP. SLL-HCA is based on the HMCP protocol and adopts the statistic link load metric to ensure load balancing in a two-hop neighborhood, and to prevent both the hidden node problem and the exposed node problem. In addition, an enhanced strategy, VE-SLL-HCA, by setting harsher channel assignment conditions and reserving lower interference of routing path for video-streaming traffic than other non-video traffic, is proposed to improve the QoS support of video-streaming over multi-channel ad hoc networks. Simulation results show that SLL-HCA achieves better throughput performance than HMCP in the presence of background traffic including CBR traffic or VBR traffic; and, the PSNR QoS metric for video-streaming is enhanced when using VE-SLL-HCA compared with SLL-HCA and HMCP, which confirms the validity of the proposed strategy for video-streaming traffics. Moreover, the simulation results also indicate that non-video traffic unlikely suffers an unacceptable performance in terms of throughput.     

Enhancing data security in ad hoc networks based on multipath routing

An ad hoc network is a self-organizing network of wireless links connecting mobile nodes. The mobile nodes can communicate without an infrastructure. They form an arbitrary topology, where the nodes play the role of routers and are free to move randomly.     

Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks

We present a mobility resilient deterministic broadcast algorithm with worst-case time complexity of O(nlogn)$O(nlogn)$ for ad hoc networks where the nodes possess collision detection capabilities; n$n$ is the total number of nodes in the network. The algorithm is based on a breadth-first traversal of the network and allows multiple simultaneous transmissions by the nodes. The idea of this broadcast algorithm is then extended to develop a mobility resilient deterministic gossiping algorithm having O(Dnlogn)$O(Dnlogn)$ worst-case run time (D$D$ is the diameter of the network graph), which is an improvement over the existing algorithms. Simulation results show that on an average, the time for completing the broadcast or gossiping is significantly lower than the theoretical worst-case time requirement.     

一种新的移动自组网的数据传输策略*

为了提供移动自组网端到端的健壮的数据传输策略,对基于地理信息的路由协议进行优化,重点解决由于骨干节点停止工作后容易导致的整个网络快速崩溃问题,实现了能量的均衡。同时,根据排队理论,提出了一种移动节点的数据传输等候队列的调度策略,增加了移动自组网的端到端可靠的数据传输。基于NS的仿真实验,从路由协议选择、路由协议优化、数据传输等候队列调度策略方面展示提出的传输策略的优势。实验结果表明,该传输策略提高了节点能量利用率和节点生存时间,增加了数据传输的成功率,提高了网络的稳定性。     

Improving data transmission with helping nodes for geographical ad hoc routing

Many routing protocols for mobile ad hoc networks assume that the node density of the network is sufficiently high that network partitions do not occur. However, in practice, this assumption is invalid since the mobility and random deployment of the nodes can easily cause partitions to take place. Therefore, this paper develops an approach for identifying suitable helping nodes to carry data packets from one partition to another during geographic routing. Unlike the assisting nodes proposed in previous schemes, the helping nodes are chosen from a group of regular mobile nodes that can move freely throughout the network. In addition, handoff procedures which may be required during the routing trip are implemented. Two mechanisms based on the approach were evaluated using network simulator 2. The evaluation results demonstrate that the algorithm successfully improves successful delivery ratio without needing special assisting nodes and only induces a little more routing overhead and energy consumption to the system.     

Distributed power control in cooperative cognitive ad hoc networks

In this paper, a relay selection strategy and distributed power control algorithm are proposed for the underlay spectrum sharing mode based cooperative cognitive ad hoc network with energy-limited users. The study aims to minimize the total power consumption of cooperative cognitive ad hoc network while ensuring the quality of service (QoS) requirement of cognitive user and keeping the interference to primary user below interference tolerance. The power control problem is transformed into a convex optimization problem. Based on Lagrange dual decomposition theory, a gradient iterative algorithm is constructed to search for the optimal solution and complete distributed power optimization. Simulation results show that the algorithm converges fast and reduces transmit power of cognitive users effectively while guaranteeing the QoS requirement.     

Transmission of layered video streaming via multi-path on ad hoc networks

Mobile ad hoc networks without centralized infrastructure change their topology rapidly because of node mobility, making multimedia applications difficult to run across wireless networks. Moreover, video transmission over ad hoc networks causes frequent transmission loss of video packets owing to end-to-end transmission with a number of wireless links, and requires essential bandwidth and restricted delay to provide quality-guaranteed display. This paper presents an architecture supporting transmission of multiple video streams in ad hoc networks by establishing multiple routing paths to provide extra video coding and transport schemes. This study also proposes an on-demand multicast routing protocol to transport layered video streams. The multicast routing protocol transmits layered video streaming based on a weight criterion, which is derived according to the number of receivers, delay and expiration time of a route. A simulation is performed herein to indicate the viability and performance of the proposed approach. The simulation results demonstrate that the proposed transport scheme is more effective than other video transport schemes with single or multiple paths.

一种新的多路径自组网路由算法

传统的单路径路由使自组网路由性能一直不能获得太大的突破。因此,设计有效的和稳定的多路径路由成为最受关注的问题。为此提出了一种新的多路径路由算法,其在路由发现阶段使用了一种新的多路径转发策略。在基于稳定性因子的基础上,该算法计算路径间海明距离并据此选择多条相似的稳定不相交多路由,从而进一步提高该路由算法的性能。模拟结果显示,与经典的多路径路由相比较,该算法是一个有效的多路径自组网路由算法。     

移动Ad hoc网络多径路由协议*

给出移动Ad hoc网络多径路由的分类方法,系统地描述了当前各种典型的MANETs多径路由协议,并比较和分析了这些协议的特点及适用情况.最后结合该领域当前的研究现状,指出多径路由协议存在的问题和未来的研究重点.     

Ad hoc网络中基于带宽的准入控制研究

在决定无线自组织网服务质量的诸多参数中,可用带宽是至关重要的参数。通过引用泊松分布流量产生器产生数据包的概率和发送数据包的概率,研究由于隐藏节点引起冲突的概率,消除由于节点发生碰撞对可用带宽的消耗。通过分析与推导,建立IIAB算法模型,并将IIAB加载到AODV协议,利用RREQ/RREP对新的业务流进行准许接入和资源预留,在此基础上,提出了新的基于IIAB-AODV协议的准入控制机制。通过NS2网络仿真平台模拟表明：提出的模型提高了估测可用带宽的精度以及基于IIAB-AODV协议的准入控制机制更能够保障和提高网络的服务质量。     

Safeguarding ad hoc networks with a self-organized membership control system

One of the key challenges for ad hoc networks is providing distributed membership control. This paper introduces a self-organized mechanism to control user access to ad hoc networks without requiring any infrastructure or a central administration entity. Our mechanism authenticates and monitors nodes with a structure that we call controller set, which is robust to the dynamic network membership. We develop analytical models for evaluating the proposal and validate them through simulations. The analysis shows that the proposed scheme is robust even to collusion attacks and provides availability up to 90% better than proposals based on threshold cryptography. The performance improvement arises mostly from the controller sets capability to recover after network partitions and from the identification and exclusion of malicious nodes.     

Ad hoc网络中一种带预测的路由算法

在自组网中,由于网络节点的移动性及拓扑结构的易变性,设计稳定的路由成为最受关注的问题。根据可靠性为多路径路由选择更多的可靠路径,以满足自组网中多路径传输在路径的数量和质量方面的需求,是多路径路由技术中的一个重要研究课题。为此,基于GRID模型和预测模型提出了一种带预测的稳定不相交备用路由算法,其利用有效限制路由查询包的泛洪区域,并结合预测策略和节点不相交路径算法来选择一条最稳定的不相交备用路由,从而进一步提高该路由算法的性能。模拟结果显示,与其他3个多路径路由相比较,该算法是一个有效的自组网路由算法。     

Dynamic frame length channel assignment in wireless multihop ad hoc networks

A good channel assignment scheme in a multihop ad hoc network should not only guarantee successful data transmissions without collisions but also enhance the channel spatial reuse to maximize the system throughput. From the channel assignment schemes in time division multiple access (TDMA) slot assignment protocols developed in previous studies, we have found that these protocols do not have a convenient frame length shrink scheme after the expansion of the frame length. As the network size grows, the frame length expands quickly, particularly when we set the frame length as a power of two. A very long frame may result in poor channel utilization when it contains many unused slots. In this paper, we propose a dynamic frame length expansion and recovery method called dynamic frame length channel assignment (DFLCA). This strategy is designed to make better use of the available channels by taking advantage of the spatial reuse concept. In DFLCA, the increase in the spatial reuse is achieved by adding certain amount of control overhead. We show that the bandwidth saved due to the channel spatial reuse is larger than the additional bandwidth spent on the control overhead.     

Scalability of routing methods in ad hoc networks

In an ad hoc network each host (node) participates in routing packets. Ad hoc networks based on 802.11 WLAN technology have been the focus of several prior studies. These investigations were mainly based on simulations of scenarios involving up to 100 nodes (usually 50 nodes) and relaxed (too unrealistic) data traffic conditions. Many routing protocols in such setting offer the same performance, and many potential problems stay undetected. At the same time, an ad hoc network may not want (or be able) to limit the number of hosts involved in the network. As more nodes join an ad hoc network or the data traffic grows, the potential for collisions and contention increases, and protocols face the challenging task to route data packets without creating high administrative load. The investigation of protocol behavior in large scenarios exposes many hidden problems. The understanding of these problems helps not only in improving protocol scalability to large scenarios but also in increasing the throughput and other QoS metrics in small ones. This paper studies on the example of AODV and DSR protocols the influence of the network size (up to 550 nodes), nodes mobility, nodes density, suggested data traffic on protocols performance. In this paper we identify and analyze the reasons for poor absolute performance that both protocols demonstrate in the majority of studied scenarios. We also propose and evaluate restructured protocol stack that helps to improve the performance and scalability of any routing protocol in wireless ad hoc networks.     

MANET中一种利用单向链路的按需路由策略

移动Ad hoc网络中提出的许多路由算法会因为真实场景下存在大量单向链路而使其性能大幅降低.为修补和提高路由算法性能,提出了一种利用单向链路的按需路由算法ODRUL(on-demand routing with unidirectional links),该算法在路由发起阶段检测单向链路,并根据源目节点之间的路径存在单向链路与否做出是否利用单向链路的决策.仿真实验结果表明,ODRUL相较传统路由算法有较高的数据包传递率,同时控制开销只有很小幅度的增加,提高了路由算法的总体性能.     

Review of multicast routing mechanisms in mobile ad hoc networks

Frequent interactions among the group members of distributed wireless network environment may be facilitated with the help of Mobile Ad Hoc NETworks (MANETs). Some of the group-oriented applications include disaster management, battlefields, audio/video conferencing, e-commerce, e-education, etc. Group communication demands dynamic construction of efficient and reliable multicast routes under user mobility and varying channel conditions. Multicast routing mechanisms in MANETs have been consistently improved by researchers considering various performance measures such as energy efficient route establishment, packet delivery ratio, quicker and faster proactive route recovery, network life time, reliability, Quality of Service (QoS) based on bandwidth, delays, jitters, and security. The paper focuses on most recent reliable and QoS based multicast routing mechanisms that helps in multimedia communication over MANETs. The mechanisms are considered under different topological routing categories such as mesh, tree, zone and hybrid. We provide an overview of existing multicast routing mechanisms based on routing categories and point to directions for future research and development.