基于交叉流网络编码的节能路由

节能路由是无线自组织网络的一个重要研究课题,对延长网络生存时间极为重要。在传统路由下,多对节点之间通信使用的多条数据传递路径会出现交叉存在公共节点,这些公共节点因需要转发来自多条交叉路径的数据包而比其它节点消耗更多的能量,从而过早因能量耗竭而失效。为了克服这一能耗不均衡问题,该文提出基于网络编码的节能路由NCBEER (Network Coding Based Energy Efficient Routing),它可捕捉多条路径交叉的机会,让公共节点对所转发的数据包进行编码,然后把编码数据包多播(Multicast)邻居节点,以减少公共节点转发数据包次数从而降低能耗;推导了编码节点使全部接收节点接收到编码数据包所需要的平均多播次数,定义了无线链路的传输代价,并将之作为信源将流量分配给不同路径的依据。仿真试验表明,NCBEER可降低和均衡节点的能耗,且能够延长网络生存时间。     

基于改进混合蛙跳算法的CVRP求解

该文提出基于实数编码模式的混合蛙跳算法(Shuffled Frog Leaping Algorithm,SFLA)求解容量约束车辆路径问题(Capacitated Vehicle Routing Problem,CVRP);把具有极强局部搜索能力的幂律极值动力学优化(Power Law Extremal Optimization,-EO)融合于SFLA,针对CVRP对-EO过程进行设计和改进。改进的-EO采用新颖的组元适应度计算方法;采用幂律概率分布来挑选需要变异的组元;根据最邻近城市表,采用幂律概率分布挑选变异组元的最佳邻近城市,执行线路间或线路内的变异。求解测试库中的实例,证明该改进算法有效。     

On-the-Fly Reseeding: A New Reseeding Technique for Test-Per-Clock BIST

In this paper we present a new reseeding technique for test-per-clock test pattern generation suitable for at-speed testing of circuits with random-pattern resistant faults. Our technique eliminates the need of a ROM for storing the seeds since the reseeding is performed on-the-fly by inverting the logic value of some of the bits of the next state of the Test Pattern Generator (TPG). The proposed reseeding technique is generic and can be applied to TPGs based on both Linear Feedback Shift Registers (LFSRs) and accumulators. An efficient algorithm for selecting reseeding points is also presented, which targets complete fault coverage and allows to well exploiting the trade-off between hardware overhead and test length. Using experimental results we show that the proposed method compares favorably to the other already known techniques with respect to test length and the hardware implementation cost.     

5G的信号波形

本文介绍了5G采用的多载波波形,包括正交频分多路复用(OFDM),滤波器组多载波(FBMC),通用滤波器多载波(UFMC)和广义频分复用(GFDM),说明其基本原理和优缺点,以及在增强移动宽带(e MMB)、海量机器型通信(m MTC)和超可靠低时延(URLLC)通信中的应用。     

VE-mobicast: a variant-egg-based mobicast routing protocol for sensornets

In this paper, we present a new “spatiotemporal multicast”, called a “mobicast”, protocol for supporting applications which require spatiotemporal coordination in sensornets. The spatiotemporal character of a mobicast is to forward a mobicast message to all sensor nodes that will be present at time t in some geographic zone (called the forwarding zone) Z, where both the location and shape of the forwarding zone are a function of time over some interval (t _start ,t _end ). The mobicast is constructed of a series of forwarding zones over different intervals (t _start ,t _end ), and only sensor nodes located in the forwarding zone in the time interval (t _start ,t _end ) should be awake in order to save power and extend the network lifetime. Existing protocols for a spatiotemporal variant of a multicast system were designed to support a forwarding zone that moves at a constant velocity, , in sensornets. To consider the path of a mobile entity which includes turns, this work mainly develops a new mobicast routing protocol, called the variant-egg-based mobicast (VE-mobicast) routing protocol, by utilizing the adaptive variant-egg shape of the forwarding zone to achieve high predictive accuracy. To illustrate the performance achievement, a mathematical analysis is conducted and simulation results are examined. Yuh-Shyan Chen received the M.S. and Ph.D. degrees in Computer Science and Information Engineering from the National Central University, Taiwan, Republic of China, in June 1991 and Jan. 1996, respectively. He joined the faculty of Department of CSIE, Chung-Hua University, Taiwan, in 1996. He joined the Department of Statistic, National Taipei University in Aug. 2000, and joined the Department of CSIE, National Chung Cheng University in Aug. 2002. Dr. Chen is an associate Professor from Aug. 2003. Since 2006, he has been a Professor at the Department of CSIE, National Taipei University, Taiwan. Dr. Chen served as Co-Editors-in-Chief of International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC); Editorial Board Member of Telecommunication System; Guest Editor of Telecommunication Systems, special issue on “Wireless Sensor Networks” (2004). He was a Vice Co-Chair, Wireless IP Symposium of WirelressCOM, USA (2005); Workshop Co-Chair, IEEE AHUC06, Taiwan (2006); Program Co-Chairs, IFIP NCUS06, Korea (2006). Dr. Chen also served as Program Committee Member of ICPP’03, ICDCS’04, ICCCN’01–06, MSN’05, CCN’02–06, CSA’04 06, NCS’06, MSEAT’03–06, WASN06, USN06, MHNET06, PESYS06, ML06, IWWN06, UIC06, ICWMC06, and HWN-RMQ06; IASTED Technical Committee on Telecommunications (2002–2005); WSEAS International Scientific Committee Member (from 2004). His paper wins the 2001 IEEE 15th ICOIN-15 Best Paper Award. Dr. Chen was a recipient of the 2005 Young Scholar Research Award given by National Chung Cheng University to four young faculty members, 2005. His recent research topics include mobile ad-hoc network, wireless sensor network, and 4G system. Dr. Chen is a member of the IEEE Computer Society and Phi Tau Phi Society. Shin-Yi Ann received the B.S. degree in computer science and engineering from the National Taiwan Ocean University, Taiwan, Republic of China, in June 2002 and the M.S. degree in computer science and information engineering from National Chung Cheng University, Taiwan, Republic of China, in July 2004. His research interest includes wireless sensor network. Yun-Wei Lin received the B.S. degree in computer and information science from the Aletheia University, Taiwan, Republic of China, in June 2003 and the M.S. degree in computer science and information engineering from National Chung Cheng University, Taiwan, Republic of China, in July 2005. His research interests include mobile ad hoc network and wireless sensor network.     

On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks

In many applications, wireless ad-hoc networks are formed by devices belonging to independent users. Therefore, a challenging problem is how to provide incentives to stimulate cooperation. In this paper, we study ad-hoc games—the routing and packet forwarding games in wireless ad-hoc networks. Unlike previous work which focuses either on routing or on forwarding, this paper investigates both routing and forwarding. We first uncover an impossibility result—there does not exist a protocol such that following the protocol to always forward others' traffic is a dominant action. Then we define a novel solution concept called cooperation-optimal protocols. We present Corsac, a cooperation-optimal protocol which consists of a routing protocol and a forwarding protocol. The routing protocol of Corsac integrates VCG with a novel cryptographic technique to address the challenge in wireless ad-hoc networks that a link’s cost (i.e., its type) is determined by two nodes together. Corsac also applies efficient cryptographic techniques to design a forwarding protocol to enforce the routing decision, such that fulfilling the routing decision is the optimal action of each node in the sense that it brings the maximum utility to the node. We evaluate our protocols using simulations. Our evaluations demonstrate that our protocols provide incentives for nodes to forward packets. Additionally, we discuss the challenging issues in designing incentive-compatible protocols in ad hoc networks. Part of this paper appeared in a conference version [49]. Sheng Zhong was supported in part by NSF grants ANI-0207399 and CNS-0524030. Yang Richard Yang was supported in part by NSF grants ANI-0207399, ANI-0238038, and CNS-0435201. This work was partly done while Sheng Zhong was at Yale University; Yanbin Liu was at University of Texas at Austin. Sheng Zhong is an assistant professor in the State University of New York at Buffalo. He received his PhD (2004) from Yale University and his ME (1999), BS (1996) from Nanjing University, China, all in computer science. His research interests include economic incentives and privacy protection, particularly incentive and privacy problems in mobile computing and data mining. Li Erran Li received his B.E. in Automatic Control from Beijing Polytechnic University in 1993, his M.E. in Pattern Recognition from the Institute of Automation, Chinese Academy of Sciences, in 1996, and his Ph.D. in Computer Science from Cornell University in 2001 where Joseph Y. Halpern was his advisor. He is presently a member of the Networking Research Center in Bell Labs. His research interests are in networking with a focus on wireless networking and mobile computing. He has served as a program committee member for several conferences including ACM MobiCom, ACM MobiHoc, IEEE INFOCOM and IEEE ICNP. He is a guest editor for JSAC special issue on Non-Cooperative Behavior in Networking. He has published over 30 papers. Yanbin Liu received her B.E. degree in Computer Science and Technology from Tsinghua University (1993), Beijing, China, in 1993, and her M.S. degree in Computer Science from the University of Texas at Austin (1998), where is a Ph.D. candidate. Since 2006, he has been with IBM TJ Watson Research Center, Hawthorne, NY. Her research interests are in real-time systems, grid computing, mobile computing, and computer networks. Yang Richard Yang received his B.E. degree in Computer Science and Technology from Tsinghua University, Beijing, China, in 1993, and his M.S. and Ph.D. degrees in Computer Science from the University of Texas at Austin in 1998 and 2001, respectively. Since 2001, he has been with the Department of Computer Science, Yale University, New Haven, CT, where currently he is an Associate Professor. His current research interests are in computer networks, mobile computing, and sensor networks. He leads the Laboratory of Networked Systems (LANS) at Yale University.     

The modulo-lattice channel: the key feature in precoding schemes

Precoding for transmission over channels with interference known at the transmitter is reviewed. In contrast to what is usually discussed in literature, precoding employing higher-dimensional lattice quantization for generating the transmit signal is assessed. It is shown that thereby the gap between low-complexity schemes using scalar modulo reductions and theoretical asymptotic results assuming hypothetical optimum quantization operations can be bridged. In this paper, capacity curves obtained from numerical calculations, and approximations to the capacity are provided for various lattices. Moreover, the role of appropriate scaling at transmitter and receiver is discussed in detail.     

电磁诱导透明中探测光量子噪声的研究

首先研究了处在热平衡条件下的A型三能级原子与环境(热辐射场)的涨落耗散,利用马尔科夫近似下的系统 - 源相互作用理论精确推导出A型三能级原子衰减态密度矩阵元的演化方程组.在此基础上进一步研究了热平衡稳定态.最后利用全量子理论对光场失谐时电磁诱导透明中探测光的量子噪声进行了研究.结果表明量子噪声主要来源于激发态的原子态密度以及驱动光的失谐量,因此在冷原子系统中实现EIT并且减少驱动光的失谐量将是控制量子噪声的关键.     

基于ODMRP的贪婪稳定路由协议

针对ODMRP协议在拓扑频繁变化的移动自组网中存在的不足,提出一种贪婪稳定路由协议GS-ODMRP,通过贪婪转发机制建立主路径,每条链路的备用路径基于链路保持连接时间建立,从而提高协议的鲁棒性.仿真结果表明,相比ODMRP协议,GS-ODMRP协议提高了分组传输成功率,并且降低了网络开销和传输时延.     

WDM网状网中的基于平面构造的业务量疏导算法

将多个低于一个波长带宽的低速业务流复用到一个波长上传输的业务量疏导已经得到越来越多 的研究。WDM/SDH环网中的业务量疏导已得到大量研究,WDM网状网中的业务流疏导问题研究相对较少。该文研究静态环境下波长数目受限的业务量疏导问题,提出了一种基于平面构造的启发式业务量疏导算法。仿真结果表明该算法比已知的算法具有更好的性能。