利用跳频同步的Ad hoc网络时隙同步

本文针对采用跳频数传TDMA接入的Ad hoc网络，提出了一种利用跳频同步来实现TDMA时隙同步的方案。考虑到时隙同步是为了使得各个节点的时隙基准对齐，并不需要保持节点之间具体时间一致，利用跳频同步采用分隔符对跳频帧的定位，对定位进行时延补偿后，可实现时间基准基本对齐。由于同步偏差的存在，通过设置保护带允许时隙的抖动来防止冲突发生。本文给出了具体的同步实现方案，并且与其他的Ad hoc网络时隙同步方案进行了比较。仿真结果表明，该方案占用了较少的传输带宽，提高了效率，并且可以保证一定的同步精度。     

Ad hoc网络中带宽保证路由协议

研究ad hoc网络中无线链路存在邻近链路干扰及隐藏终端和暴露终端问题，提出新的带宽预留模型及带宽保证路由协议(BGRP)，旨在按需探测符合带宽需要的路由路径并预留可靠的带宽资源。理论分析证明，BGRP探测的路由路径能满足带宽需要，而且预留的带宽资源准确有效。仿真结果表明，就有效带宽而言，BGRP较INSIGNIA和BGSR算法有效，而且消息复杂性较小，具有良好的网络扩展性。     

Ad hoc无线网络

Ad hoc网络是没有基础设施的无线网络,本文介绍了Ad hoc无线网络原理、类型和性能特点,详细分析了其关键技术,描述了应用范围和特点。     

Ad hoc网络运动模型及其连通强度相关性的研究

介绍了现有的几种ad hoc运动模型，提出了一种ad hoc连通强度的评价公式，并对三种常用的运动模型进行了仿真。利用Boltzmann函数对仿真数据进行曲线拟和分析，得到三种运动模型各自的节点数、传播范围和连通强度的曲线函数，为实际的ad hoc组网提供了明确的评判依据。     

Ad hoc传感网络及其关键问题

Ad hoc传感网络是一种利用了Ad hoc网络技术的传感网络，首先简单介绍了Ad hoc传感网络的概念、特点和种类，然后讨论了Ad hoc传感网络的体系结构，详细阐述和分析了Ad hoc传感网络设计中的一些关键问题和相关协议，最后对全文进行了小结。     

Ad hoc网络中MAC协议的研究

Ad hoc网络中的MAC协议是一个比较复杂的问题。本文首先分析了Ad hoc网络中实现MAC协议的各种困难，然后详细讨论了隐终端和暴露终端问题。最后比较分析了目前提出的几种Ad hoc环境下的MAC协议并给出了结论。     

无线Ad hoc 网络及其研究难点

无线Ad hoc网络作为没有基础设施的网络，在军事和民用方面具有广阔的应用前景，是目前网络研究中的热点问题。本文对无线Ad hoc网络进行了详细的论述，指出了目前研究中存在的一些难点。     

Ad hoc网络技术讲座 第3讲 Ad hoc网络采用QOS信令机制的研究

信令机制通常是网络中最复杂的功能部件之一，本文首先介绍了移动Ad hoc 网络（MANET）中采用Qos信令机制的必要性，然后详细说明和分析了RSVP及其改进协议在MANET中应用的可行性。接着计论了一种适合于MANET的带内信令机制-INSIGNIA信令机制及其改进协议，最后对全文进行了总结。     

移动Ad Hoc网络关键技术研究

文章介绍了移动ad hoc网络的概念、各种应用以及关键技术,着重对无线TCP进行了研究对TCP Reno中选择确认(SACK)的缺点提出一种新的ASACK方法,使吞吐量得以提高,在节点高速移动时效果尤为明显对TCP Vegas作了改进,提出一种采用RTT通知的TCP Vegas方案,结果使节点高速移动时系统吞吐量明显提高.     

无线Ad hoc网络路由协议比较

无线Ad hoe网络是一种新型的移动计算网络,本文首先介绍了Ad hoe网络的特点以及路由协议分类,然后针对四种典型的路由协议通过NS2仿真器进行了仿真分析和性能比较,并得出了结论。     

车载自组网的现状与发展

简要介绍了车载自组网的发展历史、特点和应用领域。使用分析和比较的方法，讨论各种无线通信技术用于车载自组网的优缺点，并针对车载自组网的应用及特性提出搭建车间通信系统的设计思想和突破方向。为了便于读者跟踪国外先进的研究成果，还介绍了一些在这一领域比较活跃的研究机构以及他们的主要工作。     

The diameter of mobile ad hoc networks

With the prevalence of mobile devices, it is of much interest to study the properties of mobile ad hoc networks. In this paper, we extend the concept of diameter from static ad hoc network to mobile ad hoc network, which is the expected number of rounds for one node to transmit a message to all other nodes in the network, reflecting the worst end‐to‐end delay between any two node. Specifically, we investigate the diameter of identically and independently mobility model in cell‐partitioned network and random walk mobility model in two‐dimensional torus network, achieving the boundary , when (k=Ω(n)), and O(k log2k), respectively, where n is the number of nodes and k is the number of cells of network and especially under random walk mobility model . A comparison is made among the diameter of mobile ad hoc networks under identically and independently mobility model, random walk mobility model and static ad hoc network, showing that mobility dramatically decreases the diameter of the network and speed is an essential and decisive factor of diameter. Copyright © 2016 John Wiley & Sons, Ltd.     

MAC protocols using directional antennas in IEEE 802.11 based ad hoc networks

Using directional antennas can be beneficial for wireless ad hoc networks consisting of a collection of wireless hosts. The most important benefit includes a reduction of the radio interference. Thus, it can significantly increase the spatial reuse, thereby improving the network throughput. To best utilize directional antennas, a suitable Medium Access Control (MAC) protocol must be designed. Current MAC protocols, such as the IEEE 802.11 standard, do not benefit when using directional antennas, because these protocols have been designed for omnidirectional antennas. In this paper, we present modified MAC protocols suitable for 802.11 based ad hoc networks using directional antennas. Our comprehensive simulation results demonstrate the performance improvement obtained with the proposed protocols. Copyright © 2007 John Wiley & Sons, Ltd.     

SDMAC: Selectively Directional MAC protocol for wireless mobile ad hoc networks

Using directional antennas in wireless mobile ad hoc networks can greatly improve the transmission range as well as the spatial reuse. However, it will also cause some problems such as deafness problem and hidden terminal problem, which greatly impair the network performance. This paper first proposes a MAC protocol called Selectively Directional MAC (SDMAC) that can effectively address these problems and significantly improve the network throughput. Then two improvements on SDMAC are proposed. The first one is to improve the network throughput by scheduling the packets in the queue (a scheme called Q-SDMAC), thus the head-of-line (HOL) blocking problem can be addressed. The second one is to relax the assumption that each node knows the relative directions of its neighboring nodes and use caches to buffer those relative directions (a scheme named Q-SDMAC using cache). Extensive simulations show that: (1) SDMAC can achieve much better performance than the existing MAC protocols using directional antennas; (2) The network throughput can be significantly improved by scheduling the packets in the queue; (3) Using caches can still achieve high network throughput when nodes are moving; and (4) Network throughput decreases when directional antennas have side lobe gain.

无线自组织网中VoIP性能研究

目前,VoIP技术及其业务迅速发展,在无线自组织网络中有广泛的应用,有必要对于VoIP在无线自组网中的传输进行分析研究。利用NS-2作为仿真工具对G.711编码标准下多跳无线自组织网中VoIP的传输进行仿真,使用802.11MAC层协议和AODV路由层协议。实验结果表明,无线自组织网络环境下VoIP系统性能(包括丢包率、时延等)受到多跳影响。     

基于节点接入能力的ad hoc网络按需路由协议

基于802.11协议MAC层重传策略,提出一个衡量节点接入能力的参数CAM(capacity of access to medium),以体现节点周围信道的繁忙程度及其抢占信道能力。在此基础上,联合MAC层和网络层进行跨层设计,提出了一个拥塞感知路由CAOR(congestion aware on-demand routing)协议。仿真表明:该协议能够在降低开销的前提下,显著增加网络吞吐量,并降低平均端到端的时延。     

Contention-based forwarding for mobile ad hoc networks

Existing position-based unicast routing algorithms which forward packets in the geographic direction of the destination require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages each node sends out periodically.

Due to mobility, the information that a node receives about its neighbors becomes outdated, leading either to a significant decrease in the packet delivery rate or to a steep increase in load on the wireless channel as node mobility increases. In this paper, we propose a mechanism to perform position-based unicast forwarding without the help of beacons. In our contention-based forwarding scheme (CBF) the next hop is selected through a distributed contention process based on the actual positions of all current neighbors. For the contention process, CBF makes use of biased timers. To avoid packet duplication, the first node that is selected suppresses the selection of further nodes. We propose three suppression strategies which vary with respect to forwarding efficiency and suppression characteristics. We analyze the behavior of CBF with all three suppression strategies and compare it to an existing greedy position-based routing approach by means of simulation with ns-2. Our results show that CBF significantly reduces the load on the wireless channel required to achieve a specific delivery rate compared to the load a beacon-based greedy forwarding strategy generates.     

Interference minimum network topologies for ad hoc networks

This paper investigates the topology control problem with the goal of minimizing mutual interferences in wireless ad hoc networks. It is known that interference is considered as a relationship between link and node in previous works. In this paper, we attempt to capture the physical situation of space‐division multiplex more realistically by defining interference as a relationship between any two bidirectional links. We formulate the pair‐wise interference condition between any two bidirectional links, and demonstrate that the interference condition is equivalent by employing the equal‐power allocation strategy and by employing the minimum‐power allocation strategy. Then we further study the typical interference relationship between a link and its surrounding links. To characterize the extent of the interference between a link and its surrounding links, a new metric, the interference coefficient, is given, and its property is explored in detail by means of analysis and simulation. Based on the insight obtained, a centralized algorithm, BIMA, and a distributed algorithm, LIMA, are proposed to control the network interference. Our simulation indicates that BIMA can minimize the network interference while conserving energy and maintaining good spanner property, and LIMA has relatively good interference performance while keeping low node degree, compared with some well‐known algorithms. Besides, both BIMA and LIMA show good robustness to additive noises in terms of interference performance. Copyright © 2010 John Wiley & Sons, Ltd.     

Location-aware resource management in mobile ad hoc networks

We propose an innovative resource management scheme for TDMA based mobile ad hoc networks. Since communications between some important nodes in the network are more critical, they should be accepted by the network with high priority in terms of network resource usage and quality of service (QoS) support. In this scheme, we design a location-aware bandwidth pre-reservation mechanism, which takes advantage of each mobile node’s geographic location information to pre-reserve bandwidth for such high priority connections and thus greatly reduces potential scheduling conflicts for transmissions. In addition, an end-to-end bandwidth calculation and reservation algorithm is proposed to make use of the pre-reserved bandwidth. In this way, time slot collisions among different connections and in adjacent wireless links along a connection can be reduced so that more high priority connections can be accepted into the network without seriously hurting admissions of other connections. The salient feature of our scheme is the collaboration between the routing and MAC layer that results in the more efficient spatial reuse of limited resources, which demonstrates how cross-layer design leads to better performance in QoS support. Extensive simulations show that our scheme can successfully provide better communication quality to important nodes at a relatively low price. Finally, several design issues and future work are discussed. Xiang Chen received the B.E. and M.E. degrees in electrical engineering from Shanghai Jiao Tong University, Shanghai, China, in 1997 and 2000, respectively. Afterwards, he worked as a MTS (member of technical staff) in Bell Laboratories, Beijing, China. He is currently working toward the Ph.D. degree in the department of Electrical and Computer Engineering at the University of Florida. His research is focused on protocol design and performance evaluation in wireless networks, including cellular networks, wireless LANs, and mobile ad hoc networks. He is a member of Tau Beta Pi and a student member of IEEE. Wei Liu received the BE and ME degrees in electrical engineering from Huazhong University of Science and Technology, Wuhan, China, in 1998 and 2001, respectively. He is currently pursuing the P.hD. degree in the Department of Electrical and Computer Engineering, University of Florida, Gainesville, where he is a research assistant in the Wireless Networks Laboratory (WINET). His research interest includes QoS, secure and power efficient routing, and MAC protocols in mobile ad hoc networks and sensor networks. He is a student member of the IEEE. Hongqiang Zhai received the B.E. and M.E. degrees in electrical engineering from Tsinghua University, Beijing, China, in July 1999 and January 2002 respectively. He worked as a research intern in Bell Labs Research China from June 2001 to December 2001, and in Microsoft Research Asia from January 2002 to July 2002. Currently he is pursuing the Ph.D. degree in the Department of Electrical and Computer Engineering, University of Florida. He is a student member of IEEE. Yuguang Fang received a Ph.D. degree in Systems and Control Engineering from Case Western Reserve University in January 1994, and a Ph.D. degree in Electrical Engineering from Boston University in May 1997. From June 1997 to July 1998, he was a Visiting Assistant Professor in Department of Electrical Engineering at the University of Texas at Dallas. From July 1998 to May 2000, he was an Assistant Professor in the Department of Electrical and Computer Engineering at New Jersey Institute of Technology. In May 2000, he joined the Department of Electrical and Computer Engineering at University of Florida where he got the early promotion to Associate Professor with tenure in August 2003 and to Full Professor in August 2005. He has published over 180 papers in refereed professional journals and conferences. He received the National Science Foundation Faculty Early Career Award in 2001 and the Office of Naval Research Young Investigator Award in 2002. He is currently serving as an Editor for many journals including IEEE Transactions on Communications, IEEE Transactions on Wireless Communications, IEEETransactions on Mobile Computing, and ACM Wireless Networks. He is also actively participating in conference organization such as the Program Vice-Chair for IEEE INFOCOM’2005, Program Co-Chair for the Global Internet and Next Generation Networks Symposium in IEEE Globecom’2004 and the Program Vice Chair for 2000 IEEE Wireless Communications and Networking Conference (WCNC’2000).     

适于ad hoc网络安全通信的新签密算法

首先提出了一个基于身份的新签密算法,并对其安全性和效率进行了分析及证明;结果表明,该算法在随机预言机模型下是可证明安全的,而且与已有基于身份的签密算法相比,其计算量和传输代价小,特别适合用于ad hoc网络的密钥管理、安全路由等通信安全协议.最后,以ad hoc网络分布式门限密钥管理中各服务节点所拥有的系统密钥份额的更新为例,说明了将新签密算法用于ad hoc网络安全协议的方法及其意义.