面向应用的无线传感器网络

结合具体的应用环境分析了无线传感器网络发展到第二阶段需要考虑的重点问题；探讨了基于上述应用需求的无线传感器网络的协议栈结构和今后的研究方向。     

A call admission and rate control scheme for multimedia support over IEEE 802.11 wireless LANs

Quality of service (QoS) support for multimedia services in the IEEE 802.11 wireless LAN is an important issue for such WLANs to become a viable wireless access to the Internet. In this paper, we endeavor to propose a practical scheme to achieve this goal without changing the channel access mechanism. To this end, a novel call admission and rate control (CARC) scheme is proposed. The key idea of this scheme is to regulate the arriving traffic of the WLAN such that the network can work at an optimal point. We first show that the channel busyness ratio is a good indicator of the network status in the sense that it is easy to obtain and can accurately and timely represent channel utilization. Then we propose two algorithms based on the channel busyness ratio. The call admission control algorithm is used to regulate the admission of real-time or streaming traffic and the rate control algorithm to control the transmission rate of best effort traffic. As a result, the real-time or streaming traffic is supported with statistical QoS guarantees and the best effort traffic can fully utilize the residual channel capacity left by the real-time and streaming traffic. In addition, the rate control algorithm itself provides a solution that could be used above the media access mechanism to approach the maximal theoretical channel utilization. A comprehensive simulation study in ns-2 has verified the performance of our proposed CARC scheme, showing that the original 802.11 DCF protocol can statically support strict QoS requirements, such as those required by voice over IP or streaming video, and at the same time, achieve a high channel utilization. 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 PhD degree in the Department of Electrical and Computer Engineering, University of Florida. He is a student member of IEEE. 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, and the Ph.D. degree in electrical and computer engineering from the University of Florida, Gainesville, in 2005. He is currently a Senior Research Engineer at Motorola Labs, Arlington Heights, IL. His research interests include resource management, medium access control, and quality of service (QoS) in wireless networks. He is a Member of Tau Beta Pi and 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 with tenure in August 2003 and has been an Associate Professor since then. He has published over one hundred (100) 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, IEEE Transactions 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).     

一种新的WDM光网中的共享链路保护策略

研究了WDM光网中的链路保护问题.提出了一种新的共享链路保护策略--基于SRLG的共享链路保护策略(SRLG-SLP).SRLG(共享风险链路组)定义了对一条工作光通道分配保护资源时的资源可用性的约束.它规定任意两条有着同样故障风险或者说处于同一个SRLG的工作光通道不能利用同样的保护资源.另外,还提出了一种更加符合实际的单链路故障模型,其中链路故障间隔时间和链路故障保持时间被考虑作为两个独立的变量.基于该链路故障模型,通过大量的仿真试验,比较了专用链路保护(DLP)、共享链路保护(SLP)和提出的SRLG-SLP保护策略的资源利用率、保护效率以及业务中断率.结果显示,我们提出的SRLG-SLP在保护效率和业务中断率方面的保护性能远好于DLP和SLP,但会牺牲一些资源利用率.     

A new approach based on the surrogating method in the project time compression problems

This paper develops a mathematical model for project time compression problems in CPM/PERT type networks. It is noted this formulation of the problem will be an adequate approximation for solving the time compression problem with any continuous and non-increasing time-cost curve. The kind of this model is Mixed Integer Linear Program (MILP) with zero-one variables, and the Benders' decomposition procedure for analyzing this model has been developed. Then this paper proposes a new approach based on the surrogating method for solving these problems. In addition, the required computer programs have been prepared by the author to execute the algorithm. An illustrative example solved by the new algorithm, and two methods are compared by several numerical examples. Computational experience with these data shows the superiority of the new approach.     

Limited resolution in complex network community detection with Potts model approach

According to Fortunato and Barthélemy, modularity-based community detection algorithms have a resolution threshold such that small communities in a large network are invisible. Here we generalize their work and show that the q-state Potts community detection method introduced by Reichardt and Bornholdt also has a resolution threshold. The model contains a parameter by which this threshold can be tuned, but no a priori principle is known to select the proper value. Single global optimization criteria do not seem capable for detecting all communities if their size distribution is broad.     

神经网络在工程爆破应力波规律探讨中的应用

采用BP（Back Propagation)前馈人工神经网络模型，对工程爆破中柱状震源的自由场应力波传播规律进行了探讨。结果表明：利用人神经网络模型的非线性映射功能，可以较好地给出工程爆破引起的近区自由场力学规律，对于同类型问题的研究，也有着很重要的意义。     

The alternating basis algorithm for assignment problems

The purpose of this paper is to present a new primal extreme point algorithm for solving assignment problems which both circumvents and exploits degeneracy. The algorithm is based on the observation that the degeneracy difficulties of the simplex method result from the unnecessary inspection of alternative basis representations of the extreme points. This paper characterizes a subsetQ of all bases that are capable of leading to an optimal solution to the problem if one exists. Using this characterization, an extreme point algorithm is developed which considers only those bases inQ. Computational results disclose that the new algorithm is substantially more efficient than previously developed primal and primal-dual extreme point (simplex) methods for assignment problems.     

Cost operator algorithms for the transportation problem

A primal transportation algorithm is devised via post-optimization on the costs of a modified problem. The procedure involves altering the costs corresponding to the basic cells of the initial (primal feasible) solution so that it is dual feasible as well. The altered costs are then successively restored to their true values with appropriate changes in the optimal solution by the application of cell or area cost operators discussed elsewhere. The cell cost operator algorithm converges to optimum within (2T – 1) steps for primal nondegenerate transportation problems and [(2T + 1) min (m, n)] – 1 steps for primal degenerate transportation problems, whereT is the sum of the (integer) warehouse availabilities (also the sum of the (integer) market requirements) andm andn denote the number of warehouses and markets respectively. For the area cost operator algorithm the corresponding bounds on the number of steps areT and (T + 1) min (m, n) respectively.This report was prepared as part of the activities of the Management Sciences Research Group, Carnegie—Mellon University, under Contract N00014-67-A-0314-0007 NR 047-048 with the U.S. Office of Naval Research.     

A note on the paper “characterization of all optimal solutions and parametric maximal flows in networks” of G. Ruhe (optimization 16 (1985) 1, 51-61)

First it is shown that the implementation of the algorithm proposed in the considered paper may cause some problems if no further specification is made as to one of its steps. Secondly, such a specification is suggested.     

The Story of Collective Action: The Emergence of Ideological Leaders,Collective Action Network Leaders,and Cross-Sector Network Partners in Civil Society

Collective action and community ecology theories frame this study of longitudinal interorganizational networks in Croatia during the country's political transition. As time progresses toward political stability, grass-roots organizing activities shift through participation in new networks. Although engaged cross-sector communication was important in early stages of the transformation, homophilous partnering emerged as the system stabilized. System stability left room for organizations to exit the collective action network but with costs associated with centralized organizing. Over time, organizations embodied roles as ideological leaders, collective action network leaders, and within-sector network partners. We offer a unique contribution to community ecology and collective action theories with a communication-centered framework that emphasizes the nature of communication in interorganizational networks over a 4-year period.