Multi-radio diversity in wireless networks

This paper describes the Multi-Radio Diversity (MRD) wireless system, which uses path diversity to improve loss resilience in wireless local area networks (WLANs). MRD coordinates wireless receptions among multiple radios to improve loss resilience in the face of path-dependent frame corruption over the radio. MRD incorporates two techniques to recover from bit errors and lower the loss rates observed by higher layers, without consuming much extra bandwidth. The first technique is frame combining, in which multiple, possibly erroneous, copies of a given frame are combined together in an attempt to recover the frame without retransmission. The second technique is a low-overhead retransmission scheme called request-for-acknowledgment (RFA), which operates above the link layer and below the network layer to attempt to recover from frame combining failures. We present an analysis that determines how the parameters for these algorithms should be chosen. We have designed and implemented MRD as a fully functional WLAN infrastructure based on 802.11a. We evaluate the MRD system under several different physical configurations, using both UDP and TCP, and measured throughput gains up to 3× over single radio communication schemes employing 802.11’s autorate adaptation scheme. Computer and Communication Sciences, EPFL, Switzerland. Allen Miu received his Ph.D. degree at the Massachusetts Institute of Technology in 2006 and is currently a wireless systems architect at Ruckus Wireless, Inc. He received his S.M. in Computer Science from MIT and a B.Sc. with highest honors in Electrical Engineering and Computer Science from the University of California at Berkeley. He previously worked on the Cricket Indoor Location System and was a research intern at Microsoft Research, Redmond in 2000 and Hewlett-Packard Laboratories, Palo Alto in 2002. His research interests include wireless networks, location systems, mobile computing, and embedded systems. Hari Balakrishnan is an Associate Professor in the EECS Department and a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL) at MIT. His research interests is in the area of networked computer systems. In addition to many widely cited papers, several systems developed as part of his research are available in the public domain. He received a Ph.D. in Computer Science from the University of California at Berkeley in 1998 and a B.Tech. from the Indian Institute of Technology (Madras) in 1993. His honors include an Alfred P. Sloan Research Fellowship (2002), an NSF CAREER Award (2000), the ACM doctoral dissertation award for his work on reliable data transport over wireless networks (1998), and seven award-winning papers at various top conferences and journals, including the IEEE Communication Society’s William R. Bennett Prize (2004). He has also received awards for excellence in teaching and research at MIT (Spira, Junior Bose, and Harold Edgerton faculty achievement awards). C. Emre Koksal received his B.S. degree in Electrical Engineering from the Middle East Technical University, Ankara in 1996. He received his S.M. and Ph.D. degrees from MIT in Electrical Engineering and Computer Science in 1998 and 2002 respectively. He was a postdoctoral fellow in the Networks and Mobile Systems Group in the Computer Science and Artificial Intelligence Laboratory at MIT until 2003. Since then he has been a senior researcher jointly in the Laboratory for Computer Communications and the Laboratory for Information Theory at EPFL, Switzerland. His general areas of interest are wireless communications, computer networks, information theory, stochastic processes and financial economics. He also has a certificate on Financial Technology from the Sloan School of Management at MIT.     

基于改进遗传算法的机器人路径规划

本文在应用遗传算法进行机器人路径规划时,针对遗传算法的"早熟收敛"和"收敛速度慢"两大难题,结合具体的应用背景,在各种改进遗传操作的基础上,把遗传算法和简单图搜索方法相结合,减少了搜索的盲目性,使得优秀个体能较快地产生,算法在很少的进化代数中就可以求出问题最优解.算法的分析和测试表明,本文算法的改进是有效的.     

汽车覆盖件模具激光表面强化中环带区域的测量及轨迹规划

在模具表面激光强化中,测量及轨迹规划是工艺实值墓丶方?本文针对汽车覆盖件模具表面较为常见的侧壁结构,从中抽取出更为基本的一类型面--环带,提出了一种基于特征线的环带测量及轨迹规划的方法.并且在建立环带数学模型的基础上对误差进行了分析,证明了这种方法不仅简单、高效,而且满足相应的加工工艺要求.     

HFC网络回传通道设计分析及其关键技术

提出HFC网络回传通道设计的可靠性、开放性、扩展性和实用性原则 ,阐明这四大设计原则的准确含义 ,指明正、反向通道设计的异同。分析回传通道设计的 3项关键技术 :控制汇聚噪声 ,实施电平均衡 ,防止回传通道过激励而发生信道阻塞。     

Development of Dual-light Path Monitoring System of Optical Thin-film Thickness

The accurate monitoring of optical thin-film thickness is a key technique for depositing optical thin-film. For existing coating equipments, which are low precision and automation level on monitoring thin-film thickness, a new photoelectric control and analysis system has been developed. In the new system, main techniques include a photoelectric system with dual-light path, a dual-lock-phase circuit system and a comprehensive digital processing-control-analysis system. The test results of new system show that the static and dynamic stabilities and the control precision of thin-fihn thickness are extremely increased. The standard deviation of thin-film thickness, which indicates the duplication of thin-film thick-ness monitoring, is equal to or less than 0.72%. The display resolution limit on reflectivity is 0.02%. In the system, the linearity of drift is very high, and the static drift ratio approaches zero.     

基于SPA联系数的同异反定量推理路径选择

基于集对分析（ＳＡＰ）的同异返定量推理已在学生成绩推算中得到应用。文章侧重研讨基于ＳＰＡ联系同异反定量推理路径的选择,给出其一般规则,并举例说明其应用。     

Shared partial path protection in WDM networks with shared risk link groups

For 100% shared risk link group (SRLG) failure protection, conventional full path protection has to satisfy SRLG-disjoint constraints, i.e., its working path and backup path cannot go though the same SRLG. With the increase of size and number of SRLGs, capacity efficiency of conventional shared full path protection becomes poorer due to SRLG-disjoint constraints and the blocking probability becomes much higher due to severe traps. To solve these problems, we present a partial path protection scheme where SRLG-disjoint backup paths may only cover part of the working path. Full path protection becomes a special case of partial path protection, in which the backup path covers the full working path. By choosing the most survivable partial backup path as backup path, we can make the impact of SRLG failures as low as possible and accept as many as possible connection requests. Assuming every SRLG has the same probability to fail, we present a heuristic algorithm to find the most survivable partial backup path by choosing full path protection first, iteratively computing partial backup paths and choosing the most survivable one. The benefit of this heuristic algorithm is that it can find the optimal results within less iteration. Analytical and simulation results show that, compared to conventional full path protection, our proposed scheme can significantly reduce blocking probability with little sacrifice on survivability. The proposed scheme is very useful particularly when the network contains a lot of SRLGs and the blocking probability of conventional full path protection becomes too high.

一种基于端到端测量的路径性能参数估计算法

现有的网络性能估计技术不能实现对路径容量和可用带宽的同时测量。该文通过对存在拥塞链路的路径作随机分析,得到了一种对路径可用带宽的近似估计式,并通过对Kapoor(2004)中的方法进行改进, 提出了一种基于端到端的可以同时对单拥塞路径的容量及可用带宽进行估算的算法。在较准确估算路径容量的同时,达到了用同一组样本实例同时估计路径容量和可用带宽的目的。仿真验证了算法的有效性和准确性。     

无线Ad hoc网络中基于节点停留概率的路径压缩

该文提出一种基于节点停留概率的路径压缩算法NSP-PCA。通过计算造成路径变化的节点相对于另一节点传输区域的停留概率,动态预测压缩路径的稳定性,并以此为依据决定压缩操作的优先级。仿真表明,NSP-PCA能有效控制短暂缩减和多次缩减等非正常压缩,在端到端时延,路由开销和包发送率方面均优于SHORT和PCA压缩算法。     

基于视觉分析的智能拾网球机器人研究

针对目前智能拾网球效率低的问题,本文给出一种基于图像处理算法和蚁群算法的智能拾取网球机器人,该机器人结构为笼式结构,系统通过摄像头实时采集图像信息,使用WIFI传送到PC机,PC机利用图像处理算法从场景中提取所有网球及每个网球的坐标点,使用蚁群算法对提取的网球坐标点进行路径规划得到拾球最短路径;通过摄像头实时采集的图片数据提取拾球机器人的实时位置及方位,控制机器人按规划好的路径对网球进行顺序拾取。