On Providing Support for Protocol Adaptation in Mobile Wireless Networks

The availability of variety of communication devices offers a choice among networks with vastly different characteristics. No single protocol or application can be expected to perform well over all these networks. A mobile host is likely to encounter these different networks and needs to adapt accordingly. The problem of adapting to a changing network environment is further complicated, because changes in network conditions are usually transparent to higher layers of the protocol stack. In order to allow automatic adaptation of applications and protocols, awareness of link conditions and network environment is necessary. In this paper, we present a uniform mechanism based on ICMP messages for providing information about the environment to the protocol stack. We also show how protocols can adapt to changes in the environment, and in particular, demonstrate dynamic fine tuning of some of the well known protocols such as UDP and TCP. Performance measurements demonstrate that our framework imposes little overheads and improves protocol performance under changing network conditions.     

Effects of Ad Hoc MAC Layer Medium Access Mechanisms under TCP

Mobile computing is the way of the future, as evident by such initiatives as Bluetooth, Iceberg and HomeRF. However, for mobile computing to be successful, an obvious layer, the MAC layer, must be efficient in channel access and reservation. Therefore, in-depth understanding is needed of the wireless MAC layer if wireless computing is to takeoff. Many random access wireless MAC protocols have been proposed and even standardized. However, there has yet been an attempt to understand why certain designs are used and what makes certain protocols better than others. In this paper, we survey several popular, contemporary, wireless, random access MAC protocols and determine the effects behind the design choices of these protocols.     

用WinDriver工具包开发设备驱动程序

针对Windows9x/NT及Windows2000操作系统,利用WinDriver工具包开发了PCI插卡设备驱动程序,保证程序在不同的操作系统下有良好的移植性和兼容性。还结合PCI桥芯片S5933开发了数据采集卡设备驱动程序。     

A Scheduling Framework for UWB & Cellular Networks

The max-min fair scheduling problem in wireless ad-hoc networks is a non-convex optimization problem. A general framework is presented for this optimization problem and analyzed to obtain a dual problem, which involves solving a series of optimization sub-problems. In the limit of infinite bandwidth ( ), the scheduling solution reduces to simultaneous transmission (spread spectrum) on all links (Negi and Rajeswaran, INFOCOM '04 (March 2004)). This motivates the analysis of the scheduling problem in the Ultra Wide Band (UWB) regime ( , but finite), a model for certain practical radios. A quadratic (in 1/W) lower bound to the single link capacity function is developed, which simplifies the dual sub-problem to a quadratic optimization (Negi and Rajeswaran, GLOBECOM '04, (Dec. 2004)). The solution to this sub-problem is then obtained under both total power and power spectral density constraints. This solution is utilized to iteratively construct the schedule (sub-band sizes) and power allocation, thus optimally solving the UWB max-min fair scheduling problem, to within any desired precision. Simulations on medium sized networks demonstrate the excellent performance of this scheme. A cellular architecture (not necessarily UWB) may also be considered in this framework. It is proved that Frequency Division Multiple Access is the optimal scheduling for a multi-band cellular architecture. This work was supported in part by the National Science Foundation under Career award 0347455. Arjunan Rajeswaran received his Masters degree in Electrical and Computer Engineering from Carnegie Mellon University in 2003. Since August 2003, he has been pursuing his doctoral research at Carnegie Mellon. His reserach interests lie in the area of wireless networks. His focus is in the application of information and communication theoretic tools towards wireless network design. Several IEEE publications reflect his curent research on Medium Access Control design and performance. Arjunan received the best student paper award at IEEE/ACM Broadnets 2004. Gyouhwan Kim received his B.S. and M.S. degree in Electronic Engineering from Sogang University in Korea, in 1994 and 1996, respectively. Since 1996, he has been working in the CDMA cellular system development team in Samsung Electronics. Currently, he is also working toward the Ph.D degree in the Department of Electrical and Computer Engineering at Carnegie Mellon University. His main research interests are in wireless networks and communication theory. Rohit Negi received the B.Tech. degree in Electrical Engineering from the Indian Institute of Technology, Bombay, India in 1995. He received the M.S. and Ph.D. degrees from Stanford University, CA, USA, in 1996 and 2000 respectively, both in Electrical Engineering. He has received the President of India Gold medal in 1995. Since 2000, he has been with the Electrical and Computer Engineering department at Carnegie Mellon University, Pittsburgh, PA, USA, where he is an Assistant Professor. His research interests include signal processing, coding for communications systems, information theory, networking, cross-layer optimization and sensor networks.     

A Dynamic Priority MAC Protocol for Time-Bounded Services in Wireless Networks

Wireless Local Area Networks have gained popularity at an unprecedented rate over the last few years. However, as the spectrum of applications they are called to support broadens, their inefficiency in meeting the diverse requirements of a wider range of applications becomes evident. Most existing access mechanisms cannot provide Quality-of-Service (QoS) assurances. Even those that are QoS aware can only provide relative service differentiation. In this work, we propose a dynamic priority medium access scheme to provide time-bounded services. By approximating an ideal Earliest Deadline First (EDF) scheduler, the proposed scheme can offer delay and delay jitter assurances while achieving high medium utilization. Analytical studies and simulation experiments document and confirm the positive characteristics of the proposed mechanism. Orestis Tsigkas received his Diploma in electrical and computer engineering from the Aristotle University of Thessaloniki, Greece in 2002. He is currently working towards his Ph.D. degree in the same department. His research interests include medium access, as well as quality-of-service provisioning. Fotini-Niovi Pavlidou received the Ph.D. degree in electrical engineering from the Aristotle University of Thessaloniki, Greece, in 1988 and the Diploma in mechanical-electrical engineering in 1979 from the same institution. She is currently a Professor at the Department of Electrical and Computer Engineering at the Aristotle University engaged in teaching for the under- and post-graduate program in the areas of mobile communications and telecommunications networks. Her research interests are in the field of mobile and personal communications, satellite communications, multiple access systems, routing and traffic flow in networks and QoS studies for multimedia applications over the Internet. She is being involved with many national and international projects in these areas (Tempus, COST, Telematics,IST) and she has been chairing the European COST262 Action on “Spread Spectrum Systems and Techniques for Wired and Wireless Communications”. She has served as member of the TPC in many IEEE/IEE conferences and she has organized/chaired some conferences like, the “IST Mobile Summit 2002”, the 6th “International Symposium on Power Lines Communications-ISPLC2002”, the “International Conference on Communications-ICT1998” etc. She is a permanent reviewer for many IEEE/IEE journals. She has published about 80 papers in refereed journals and conferences. She has served as guest-editor on special issues as: “Mobile Ad Hoc Networks (MANETs): Standards, Research, Applications” in the International Journal of Wireless Information Networks and “Power Line Communications and Applications” in the International Journal on Communications Systems. She is a senior member of IEEE, currently chairing the joint IEEE VT&AES Chapter in Greece.     

Two Alternative Schemes to EY-NPMA for Medium Access in High Bitrate Wireless LANs

The growing penetration of WLANs in the market, as well as the wider spectrum of applications that these kinds of networks are called to support, demands the introduction of new methods for efficient medium access. Today, the two dominating paradigms in medium access control are those of dynamic assignment and contention based ones. EY-NPMA is a contention based scheme that exhibits very low collision rates, while being quality of service aware. In this paper, we propose a solution to the highly criticised drawback of the EY-NPMA protocol — the increased overhead. Towards this end, we propose and evaluate the performance of two medium access schemes that are based on EY-NPMA and compare them to the base protocol. The theoretical analysis of the proposed schemes shows that they make better utilization of the common medium. It also allows us to determine the optimal working parameters for each one. Furthermore, extended simulation trials validate these results and confirm the good characteristics of the proposed protocols.     

Stepwise Algorithms for Improving the Accuracy of Both Deterministic and Probabilistic Methods in WLAN-based Indoor User Localisation

The performance of three stepwise algorithms designed to improve the accuracy of WLAN-based indoor localisation methods was determined using a robust simulation technique. The majority of WLAN localisation techniques use the receive signal strength indication to estimate a network users location using either a deterministic or a probabilistic approach. Previous work has shown that the rms error of these localisation techniques can be over 5 m, which is unacceptably high for indoor applications. Three different stepwise algorithms, two of which are novel, were simulated across several different test bed layouts in order to determine their effectiveness in reducing the error in the position estimate. Of the three algorithms, the constrained movement algorithm offered the best improvement in accuracy with up to a 40% improvement when using deterministic techniques. For probabilistic tracking, there was minimal improvement in the accuracy.     

Sensor fault detection algorithm based on credibility and neighbor-cooperation

To effectively detect whether a node was failure,one of the effective sensor fault detection methods was to compare historical data of suspicious node with its neighbors.The key points of this method were identification of suspicious nodes,as well as decision problem of sending timing for fault diagnosis messages.To this end,a sensor fault detection algorithm was presented based on credibility and neighbor-cooperation.Firstly,a credibility model to determine whether nodes are suspicious was established.Then suspicious nodes send fault diagnosis requests to neighbor nodes based on neighbor-cooperation.The sending timing was determined by equal probability time window.Finally,it could finish classification of fault condition and state judgment based on diagnosis responds of neighbor nodes.Simulation experiments show that this algorithm can achieve higher fault detection rate with less fault diagnosis times and low data congestion probability.     

科学改造无功补偿装置减少电费支出

分析了功率因数偏低的原因,主要原因有原有低压无功补偿装置设计不合理,器件出现故障,不能提供系统所需的无功补偿功率。通过实例给出了无功补偿装置改造的具体做法,如加装电抗器,选用耐压等级合适的电容器,采用无功补偿装置专用交流接触器,并合理规划了无功补偿柜内散热通道。最后对改造前后的经济效益进行了分析。     

基于FPGA的无线移动通信系统多普勒补偿算法

利用FPGA对一种移动无线通信系统中的多普勒补偿算法进行了实现与验证。首先,对这种基于正交频分复用(OFDM)帧结构的多普勒补偿算法进行了简要介绍,该算法具有计算复杂度低、延时小、便于硬件实现的特点;然后,详细说明了该算法在实际硬件实现中各个模块的逻辑结构和工作流程;最后,将本文所实现的多普勒补偿算法模块应用到了实际的OFDM接收机中,通过硬件测试对算法和硬件实现的有效性进行了验证,并分析了算法的资源开销以及相比原算法的性能增益。