移动Ad Hoc网络中一种分布式QoS保证的多址接入协议

基于随机竞争和冲突解决的思想,本文为多跳移动Ad Hoc网络提出了一种分布式服务质量(QoS)保证的多址接入(QMA)协议.该协议中,节点在发送业务分组前利用预报突发进行竞争接入,节点根据业务分组时延情况和最早失效优先原则确定预报突发的长度,所发预报突发能持续到最后的节点优先获得接入.同时,具有实时业务的节点可以按照其优先级在更早的竞争微时隙中开始发送预报突发,而有非实时业务的节点只能在前面竞争微时隙空闲的情况下,才能在后面的微时隙开始发送预报突发,因此发送实时业务的节点可以比发送非实时业务的节点更优先接入信道,从而在移动Ad Hoc网络中实现了对多媒体业务的QoS保证.最后利用OPNET仿真评估了QMA协议的多址性能,并与IEEE 802.11e协议的性能做了比较,结果表明QMA协议可以提供较高的吞吐量和较低的实时业务时延.     

移动Ad Hoc网络按需路由协议的研究

移动Ad Hoc网络是一种具有高度动态拓扑结构、节点任意移动的自组织网络。路由协议能够为数据分组的传输指定路径,是移动节点相互通信的基础,对移动Ad Hoc网络的性能起着至关重要的作用。文中介绍移动Ad Hoc网络及其路由协议的基本概念和特殊性,研究几种典型按需路由协议的原理,对协议进行综合比较,简要讨论了各自的优缺点。     

移动Ad Hoc网络中的QoS路由协议研究

移动Ad Hoc网络是一种无线多跳自治系统网络，如何提供QoS保障是它面临的重要问题，其中QoS路由是一个关键技术。文章首先介绍了AdHoc网络的特点，并且介绍了其QoS保障技术。接着对当前AdHoc网络主要的路由协议进行了详细的分析与研究，并从几个方面进行了比较和分析。最后指出了Ad Hoc网络QoS路由协议中需要解决的问题和今后的研究方向。     

Ad Hoc 网络按需路由协议性能分析

无线移动Ad Hoc网络作为可移动分布式多跳无线网络，没有预先确定的网络拓扑或网络基础设施以及集中控制。为了在这样的网络中促进通信，路由协议主要用于在节点之间发现路径。Ad Hoc网络路由协议的主要目的是网络拓扑的动态变化任意两个节点之间建立一个使得通信总费用和带宽消费最少的正确和有效的通信路径。使用OPNET仿真软件对AODV、DSR协议这两种典型无线移动Ad Hoc网络按需路由协议的参数和性能进行了详细比较和分析。     

移动Ad hoc网络中的信道接入协议

Ad hoc网络中的信道接入是一个比较复杂的问题。本文介绍了 Ad hoc的概念 ,分析了 Ad hoc网络中实施信道接入的各种困难 ,详细讨论了隐终端和暴露终端问题。在此基础上 ,对目前提出的几种 Ad hoc环境下的信道接入协议进行了比较分析 ,并给出结论和研究方向     

移动Ad hoc网络中基于链路稳定性预测的按需路由协议

移动Ad hoc网络拓扑的高度动态变化是造成传统按需路由协议的路由频繁通断的主要原因,因此在传统按需路由协议的基础上进行链路稳定性预测扩展,增强路由稳定性具有十分重要的意义。该文利用分组的接收功率把节点间的相对运动划分为靠近和远离两种类型,然后在不同相对运动类型下根据节点间距离得到了的链路平均维持时间。在路由过程中,中间节点利用得到的链路平均维持时间设置请求报文的转发延迟,通过一定转发规则选择稳定性较强的链路构成路径。仿真结果表明进行链路稳定性预测扩展后的按需路由协议能够有效增强路由的稳定性,并提高网络性能。     

移动Ad Hoc网络中的一种功率控制MAC协议

本文提出了一种应用于移动Ad Hoc网络中的功率控制MAC（medium access contr01）协议，通过两个通信节点之间的控制包中的信息交换来决定数据包的发送功率以及其它邻节点下一次发送RTS控制包的功率。通过仿真与IEEE 802．11 MAC协议进行比较，由仿真结果可以看出，该协议能大大减少移动节点消耗的功率，提高节点的能量利用效率，并保持系统的吞吐量性能。     

按需时隙分配的传感器网络多址接入协议研究

针对目前无线传感器网络多址接入协议存在适用网络范围小、能量消耗较高及吞吐量不能适应数据量突增等问题,提出了一种全局时钟同步方案,以降低数据融合时产生的误差;在此基础上设计了一种按需时隙分配方案,以降低网络能量消耗,提高网络对局部区域流量突增情况的适应能力。对所设计方案与现有方案进行了仿真分析,对比结果表明,所设计方案可以有效降低数据传输能量消耗,增大网络吞吐量,提高网络服务性能。     

移动Ad Hoc网络中MAC协议分析

Ad Hoc网络中MAC协议的研究是一个全新的领域,正逐步受到人们的关注。在移动Ad Hoc网络中,有时会有多个无线设备同时接入信道,从而导致分组之间发生矛盾,致使接收机无法辨认接收到的数据资料,出现信道资源浪费的现象。     

移动Ad Hoc网络原理及技术研究

移动Ad Hoc网络移动通信领域具有十分广泛的应用,本文主要分析其通信原理及应用前景。     

Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks

An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents many types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.     

依据用户妥善安排的多址接入协议在分布式无线网络中的性能研究

本文基于有效竞争预约接入、无冲突轮询传输的思想提出了在多跳分布式无线网络中支持节点移动性和多跳网络结构的依据用户妥善安排的多址接入(UPMA)协议.该协议能够保证发送节点快速接入信道,从而大大提高信道的使用效率.用仿真方法研究了多跳分布式无线网络中采用该协议时的网络性能.结果表明,UPMA协议可以提供较高的通过量、较低的平均分组时延和较小的平均分组丢失率.     

Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks

Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently found attention because of their low routing overhead. The on-demand protocols depend on query floods to discover routes whenever a new route is needed. Such floods take up a substantial portion of network bandwidth. We focus on a particular on-demand protocol, called Dynamic Source Routing, and show how intelligent use of multipath techniques can reduce the frequency of query floods. We develop an analytic modeling framework to determine the relative frequency of query floods for various techniques. Our modeling effort shows that while multipath routing is significantly better than single path routing, the performance advantage is small beyond a few paths and for long path lengths. It also shows that providing all intermediate nodes in the primary (shortest) route with alternative paths has a significantly better performance than providing only the source with alternate paths. We perform some simulation experiments which validate these findings.     

An On-Demand Routing Protocol with Backtracking for Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) is characterized by multi-hop wireless links and frequent node mobility. Communication between non-neighboring nodes requires a multi-hop routing protocol to establish a route. But, the route often breaks due to mobility. The source must rediscover a new route for delivering the data packets. This wastes the resources that are limited in MANET. In this paper, a new on-demand routing protocol is proposed, named on-demand routing protocol with backtracking (ORB), for multi-hop mobile ad hoc networks. We use the multiple routes and cache data technique to reduce the rediscovery times and overhead. After executing the route discovery phase, we find out a set of nodes, named checkpoint, which has the multiple routes to the destination. When a checkpoint node receives a data packet, it caches this data packet in its buffer within a specific time period. When a node detects a broken route during the data packets delivery or receives an error packet, it will either recover the broken route or reply the error packet to the source. If a node can not forward the data packet to the next node, it replies an error packet to the source. This packet is backtracking to search a checkpoint to redeliver the data packet to the destination along other alternate routes. The main advantage of ORB is to reduce the flooding search times, maybe just delay and cost while a route has broken. The experimental results show that the proposed scheme can increase the performance of delivery but reduce the overhead efficiently comparing with that of AODV based routing protocols. Hua-Wen Tsai received the B.S. degree in Information Management from Chang Jung Christian University, Taiwan, in June 1998 and the M.B.A. degree in Business and Operations Management from Chang Jung Christian University, Taiwan, in June 2001. Since September 2001, he has been working towards the Ph.D. degree and currently is a doctoral candidate in the Department of Computer Science and Information Engineering, National Cheng Kung University, Taiwan. His research interests include wireless communication, ad hoc networks, and sensor networks. Tzung-Shi Chen received the B.S. degree in Computer Science and Information Engineering from Tamkang University, Taiwan, in June 1989 and the Ph.D. degree in Computer Science and Information Engineering from National Central University, Taiwan, in June 1994. He joined the faculty of the Department of Information Management, Chung Jung University, Tainan, Taiwan, as an Associate Professor in June 1996. Since November 2002, he has become a Full Professor at the Department of Information Management, Chung Jung University, Tainan, Taiwan. He was a visiting scholar at the Department of Computer Science, University of Illinois at Urbana-Champaign, USA, from June to September 2001. He was the chairman of the Department of Information Management at Chung Jung University from August 2000 to July 2003. Since August 2004, he has become a Full Professor at the Department of Information and Learning Technology, National University of Tainan, Tainan, Taiwan. Currently, he is the chairman of the Department of Information and Learning Technology, National University of Tainan. He co-received the best paper award of 2001 IEEE ICOIN-15. His current research interests include mobile computing and wireless networks, mobile learning, data mining, and pervasive computing. Dr. Chen is a member of the IEEE Computer Society. Chih-Ping Chu received the B.S. degree in agricultural chemistry from National Chung Hsing University, Taiwan, the M.S. degree in computer science from the University of California, Riverside, and the Ph.D. degree in computer science from Louisiana State University. He is currently a Professor in the Department of Computer Science and Information Engineering of National Cheng Kung University, Taiwan. His current research interests include parallel computing, parallel processing, component-based software development, and internet computing.     

一种节省能量的移动Ad Hoc网络组播选路协议

鉴于现有基于网孔的移动Ad Hoc网络组播选路协议都滑考虑如何有效使用电池能量的问题，本文提出了一种节省能量组播选路协议（E^2MRP),E^2MRP协议的两个主要特征是：（1）在创建和维护中继组（RG）的过程中交替采用分组平均能量消耗最少和最大节点花费最小两种标准，（2）采用基于图的组播结构，本文通过仿真分析大大降低了节点的能量消耗，特别是在节移动性较低，组播成员较少时更是如此。     

移动Ad Hoc网络的一种跨层功率控制路由协议

移动ad hoe网络中通信终端能量有限,但在许多应用场景,尤其是战场环境下,节点能量消耗较大,因此采用有效的功率控制策略非常重要.利用信道增益的对称性,在AODV协议的基础上提出了一种不依赖于地理位置信息的跨层功率控制路由协议PBAODV,仿真表明该协议在不影响其他网络性能指标的前提下,有效的降低了系统整体功耗.     

移动自组网QoS路由协议研究

移动自组网是由一组带有无线收发装置的移动节点组成的一个多跳的临时性的自治系统。随着无线通信中多媒体业务的增加,在移动自组网中提供QoS(Quality of Sevice服务质量)保障具有越来越重要的意义,而QoS路由技术则是其中的核心技术和热点问题。文章指出移动自组网QoS路由的困难,对移动自组网典型QoS路由协议进行了详细的分析与比较,并对几种较新的移动自组网QoS路由协议进行了介绍,末了对移动自组网QoS路由协议的发展进行了展望。     

ABRP: Anchor-based Routing Protocol for Mobile Ad Hoc Networks

Ad hoc networks, which do not rely on any infrastructure such as access points or base stations, can be deployed rapidly and inexpensively even in situations with geographical or time constraints. Ad hoc networks are attractive in both military and disaster situations and also in commercial uses like sensor networks or conferencing. In ad hoc networks, each node acts both as a router and as a host. The topology of an ad hoc network may change dynamically, which makes it difficult to design an efficient routing protocol. As more and more wireless devices connect to the network, it is important to design a scalable routing protocol for ad hoc networks. In this paper, we present Anchor-based Routing Protocol (ABRP), a scalable routing protocol for ad hoc networks. It is a hybrid routing protocol, which combines the table-based routing strategy with the geographic routing strategy. However, GPS (Global Positioning System) (Kaplan, Understanding GPS principles and Applications, Boston: Artech House publishers, 1996) support is not needed. ABRP consists of a location-based clustering protocol, an intra-cell routing protocol and an inter-cell routing protocol. The location-based clustering protocol divides the network region into different cells. The intra-cell routing protocol routes packets within one cell. The inter-cell routing protocol is used to route packets between nodes in different cells. The combination of intra-cell and inter-cell routing protocol makes ABRP highly scalable, since each node needs to only maintain routes within a cell. The inter-cell routing protocol establishes multiple routes between different cells, which makes ABRP reliable and efficient. We evaluate the performance of ABRP using ns2 simulator. We simulated different size of networks from 200 nodes to 1600 nodes. Simulation results show that ABRP is efficient and scales well to large networks. ABRP combines the advantages of multi-path routing strategy and geographic routing strategy—efficiency and scalability, and avoids the burden—GPS support.     

适于多跳移动Ad Hoc网络的非对称双信道媒质接入控制协议

In order to resolve the hidden and exposed terminal problems and improve the probability of concurrent packet transmissions for multihop Mobile Ad Hoc Networks (MANETs), a novel slotted Asymmetric Dual-Channel Medium Access Control (ADC-MAC) protocol is proposed. It exploits simultaneous reservation with less collisions and collision-free data packet transmissions, and achieves optimal transmission balance on the Control Channel (CCH) and Data Channel (DCH) by adjusting the relationship between Reservation Slot (RS) on the CCH and the data packet Transmission Slot (TS) on the DCH. Transmission interferences can be avoided by only observing CCH for the transmission time of a data packet. The proposed RS and contention micro-slot backoff mechanisms also greatly improve channel access efficiency. Simulation results show that compared to IEEE 802.11 DCF and p-Mc protocols, the proposed protocol can achieve a throughput gain of 88% in single-hop networks and 151% in multihop networks at the same total data rate.