LEO/MEO双层卫星网络层间星际链路建立策略的性能研究

从改善LEO/MEO双层卫星网络拓扑结构稳定性的角度出发,该文提出了3种基于集中重建的层间星际链路建立策略。新策略的基本思想是通过强制所有层间星际链路在相同时间进行重建来大幅减少网络拓扑的重构次数。仿真结果表明,与原有的策略相比,该文提出的策略能够以可接受的代价提高LEO/MEO双层卫星网络拓扑结构的稳定性。     

A BER-Based Partitioned Model for a 2.4GHz Vehicle-to-Vehicle Expressway Channel

Statistical channel models based on BER performance are presented for a frequency- and time-selective vehicle-to-vehicle wireless communications link in an expressway environment in Atlanta, Georgia, where both vehicles traveled in the same direction. The models are developed from measurements taken using the direct sequence spread spectrum (DSSS) technique at 2.45GHz. A collection of tapped delay line models, referred to as a “partitioned” model in the paper, is developed to attempt to capture the extremes of BER performance of the recorded channel. Overall and partition models are compared to the recorded channel in terms of the BER statistics obtained when the channels are inserted in a dedicated short range radio (DSRC) standard simulation system. The quality of the match between synthesized and recorded channel BER statistics is analyzed with respect to type of modulation (fixed or adaptive), the frame length, and the length of the interval over which the BER was calculated. Guillermo Acosta was born in Mexico City, Mexico, in 1962. He is a Ph.D. Candidate and a graduate research assistant in the School of Electrical and Computer Engineering at the Georgia Institute of Technology, in Atlanta, Georgia. He obtained his Bachelor of Engineering with Honors and Master of Engineering, both in Electrical Engineering, from Stevens Institute of Technology, Hoboken, New Jersey, in 1985 and 1987, respectively. He also obtained a Master of Business Administration with Honors from the Instituto Tecnologico Autonomo de Mexico (ITAM), Mexico City, Mexico, in 1996. Mr. Acosta has held technical and managerial positions in the recording, radio, and TV industries and in the Communications Ministry of Mexico. He has been an adjunct instructor in Electrical Engineering in the Instituto Tecnologico y Estudios Superiores de Monterrey Campus Estado de Mexico (ITESM-CEM) and the Universidad Iberoamericana. He is member of the IEEE, INCE, Tau Beta Pi, and Eta Kappa Nu. Mary Ann Ingram received the B.E.E. and Ph.D. degrees from the Georgia Institute of Technology, in Atlanta, Georgia, in 1983 and 1989, respectively. From 1983 to 1986, she was a Research Engineer with the Georgia Tech Research Institute in Atlanta, performing studies on radar electronic countermeasure (ECM) systems. In 1986, she became a graduate research assistant with the School of Electrical and Computer Engineering at the Georgia Institute of Technology, where in 1989, she became a Faculty Member and is currently Professor. Her early research areas were optical communications and radar systems. In 1997, she established the Smart Antenna Research Laboratory (SARL), which emphasizes the application of multiple antennas to wireless communication systems. The SARL performs system analysis and design, channel measurement, and prototyping, relating to a wide range of wireless applications, including wireless local area network (WLAN) and satellite communications, with focus on the lower layers of communication networks. Dr. Ingram is a Senior Member of the IEEE.     

An efficient and flexible MPLS signaling framework for mobile networks

Multiprotocol Label Switching (MPLS) has gained momentum in recent years as an effective tool to provide Quality of Service (QoS) in a variety of networks. This has in turn created active interest in the area of recovery in MPLS based networks. A number of recovery schemes for MPLS domains have been proposed in recent years. However, the current schemes lack support for recovery in dynamic network topologies. In this paper, a new flexible signaling protocol for LSP rerouting in dynamic network environments is introduced. The signaling protocol recovers from node and link failures reactively, taking a local approach to LSP reestablishment. The performance of the signaling protocol is evaluated through simulations. Results indicate that the protocol can effectively and efficiently handle rerouting in dynamic networks with a low protocol signaling overhead as compared to contemporary MPLS rerouting protocols. This would enable the MPLS based IP-QoS support mechanisms to extend to dynamic network topologies. A preliminary version of this work was presented at the 2004 IEEE International Conference on Communications, Paris. Ramprasad Nagarajan has received his B.E. degree in Electronics and Telecommunications from Pune University, India in 1999. He received his M.S. degree in Electrical and Computer Engineering from the Ohio State University, Columbus, OH in 2004. Currently, he is a Wireless Network Engineer in Nortel Networks, specializing in the area of network architecture and design of wireless packet core networks. Ramprasad’s current research interests include the study of wireless network evolution trends, next generation wireless networks, network capacity planning, performance analysis, and optimization. He is a member of the IEEE. Eylem Ekici has received his B.S. and M.S. degrees in Computer Engineering from Bogazici University, Istanbul, Turkey, in 1997 and 1998, respectively. He received his Ph.D. degree in Electrical and Computer Engineering from Georgia Institute of Technology, Atlanta, GA, in 2002. Currently, he is an assistant professor in the Department of Electrical and Computer Engineering of the Ohio State University, Columbus, OH. Dr. Ekici’s current research interests include wireless sensor networks, vehicular communication systems, next generation wireless systems, and space-based networks, with a focus on routing and medium access control protocols, resource management, and analysis of network architectures and protocols. He also conducts research on interfacing of dissimilar networks.     

A distributed QoS routing based on ant algorithm for LEO satellite network

Low Earth Orbit (LEO) satellites provide short round-trip delays and are becoming in- creasingly important. One of the challenges in LEO satellite networks is the development of specialized and efficient routing algorithms. To satisfy the QoS requirements of multimedia applications, satellite routing protocols should consider handovers and minimize their effect on the active connections. A distributed QoS routing scheme based on heuristic ant algorithm is proposed for satisfying delay bound and avoiding link congestion. Simulation results show that the call blocking probabilities of this al- gorithm are less than that of Shortest Path First (SPF) with different delay bound.     

A survivable routing protocol for two-layered LEO/MEO satellite networks

Due to the rapid development of space communication, satellite networks will be confronted with more complex space environment in future, which poses the important demand on the design of the survivable and efficient routing protocols. Among satellite networks, two-layered Low Earth Orbit (LEO)/Medium Earth Orbit (MEO) satellite networks (LMSNs) have become an attractive architecture for their better communication service than single-layered satellite networks. To determine the topological dynamics of LMSN, the satellite group and group manager (SGGM) method is a prevalent strategy. However, it can not precisely capture the topological dynamics of the LEO layer, which may result in the unreliability of data transmission. Besides, most existing routing protocols based on the SGGM method will collapse once any top satellite fails. To overcome both limitations, this paper proposes a new topology control strategy for LMSNs. The proposed strategy determines the snapshot in terms of the topological change of the LEO layer, which ensures the topological consistency of routing calculation. Moreover, a new survivable routing protocol (SRP) is presented for LMSNs by combining both centralized and distributed routing strategies. The SRP can provide strong survivability under the LEO or MEO satellite failure. Besides, it can also achieve the minimum delay routing provided the MEO layer can effectively work. The performance of SRP is also evaluated by simulation and analysis.     

A new architecture for 3G and WLAN integration and inter-system handover management

WLAN has strong potential to provide a perfect broadband complement to the 3G wireless systems. This has raised much interest in their integration. In this paper, a novel architecture using the Network Inter-operating Agent (NIA), and Integration Gateway (IG) is proposed to integrate the 3G systems and WLANs of various providers that may not necessarily have direct service level agreement (SLA) among them. The proposed architecture is scalable as it eliminates the need for the creation of bilateral SLA among the 3G and WLAN operators. In addition, inter-system handover (ISHO) protocols using the concept of the dynamic boundary area is proposed to support seamless roaming between 3G and WLAN. The dynamic boundary area is determined based on the speed of the user and WLAN cell size. The ISHO procedures are initiated when a mobile user enters the boundary area of the WLAN and are completed before the user leaves the coverage area of the serving WLAN. This ensures that the roaming from WLAN to 3G is transparent to the applications. The performance evaluation shows that the proposed boundary area based ISHO algorithm outperforms the existing 3G/WLAN ISHO algorithms. Shantidev Mohanty (SM’04) received his B. Tech. (Hons.) degree from the Indian Institute of Technology, Kharagpur, India and the M.S. degree from the Georgia Institute of Technology, Atlanta, Georgia, in 2000 and 2003, respectively, both in electrical engineering. He is currently a graduate research assistant with the Broadband and Wireless Networking Laboratory and a Ph.D. candidate at the School of Electrical and Computer Engineering, Georgia Institute of Technology. His current research interests include wireless networks, mobile communications, mobility management, ad-hoc and sensor networks, and cross-layer protocol design. From 2000 to 2001 he worked as a mixed signal design engineer for Texas Instruments, Bangalore, India. He worked as a summer intern for Bell Labs, Lucent Technologies, Holmdel, New Jersey, during the summers of 2002 and 2003 and for Applied Research, Telcordia Technologies, Piscataway, New Jersey, uring the summer of 2004.     

Packet routing algorithm for LEO satellite constellation network

A novel distributed packet routing algorithm for Low Earth Orbit (LEO) satellite networks based on spiderweb topology is presented. The algorithm gives the shortest path with very low computational complexity and without on-board routing tables, which is suitable and practical for on-board processing. Simulation results show its practicability and feasibility.     

A Receiver-Centric Transport Protocol for Mobile Hosts with Heterogeneous Wireless Interfaces

Numerous transport protocols have been proposed in related work for use by mobile hosts over wireless environments. A common theme among the design of such protocols is that they specifically address the distinct characteristics of the last-hop wireless link, such as random wireless errors, round-trip time variations, blackouts, handoffs, etc. In this paper, we argue that due to the defining role played by the wireless link on a connection’s performance, locating the intelligence of a transport protocol at the mobile host that is adjacent to the wireless link can result in distinct performance advantages. To this end, we present a receiver-centric transport protocol called RCP (Reception Control Protocol) that is a TCP clone in its general behavior, but allows for better congestion control, loss recovery, and power management mechanisms compared to sender-centric approaches. More importantly, in the context of recent trends where mobile hosts are increasingly being equipped with multiple interfaces providing access to heterogeneous wireless networks, we show that a receiver-centric protocol such as RCP can enable a powerful and comprehensive transport layer solution for such multi-homed hosts. Specifically, we describe how RCP can be used to provide: (i) a scalable solution to support interface specific congestion control for a single active connection; (ii) seamless server migration capability during handoffs; and (iii) effective bandwidth aggregation when receiving data through multiple interfaces, either from one server, or from multiple replicated servers. We use both packet level simulations, and real Internet experiments to evaluate the proposed protocol. In consideration of the typically prevalent server-client nature of traffic in the Internet, we term the protocol ‘receiver-centric’ although precisely it is the mobile host that drives the protocol operation. Note that in this paper, we define the sender and the receiver of a connection with respect to the direction of the data flow. Hung-Yun Hsieh received the B.S. and M.S. degrees in electrical engineering from National Taiwan University, Taipei, Taiwan, ROC, and the Ph.D. degree in electrical and computer engineering from Georgia Institute of Technology, Atlanta, Georgia, USA. He joined the Department of Electrical Engineering and the Graduate Institute of Communication Engineering at National Taiwan University as an Assistant Professor in August 2004. His research interests include wireless networks, mobile computing, and Internet protocols. E-mail: hungyun@ntu.edu.tw Kyu-Han Kim is currently a Ph.D student in the Department of Electrical Engineering and Computer Sicence at Univeristy of Michigan at Ann Arbor. He received his M.S. degree in computer science from Georgia Institute of Technology, where he worked in the GNAN Research Group under the guidance of Prof. Raghupathy Sivakumar. His main research interests are mobile computing, wireless networks, and network performance evaluation. E-mail: kyuhkim@eecs.umich.edu Yujie Zhu received her bachelor’s degree and master’s degree from the Electrical Engineering Department of Beijing University of Aeronautics and Astronautics in 1994 and 1997 respectively. After that she worked as a Network Engineer in ATM Network Management Center of China Telecom, Guangzhou Co. She is currently a Ph.D. student in the ECE department of Georgia Tech. Her research interest includes transport layer protocols, sensor networks and mobile ad-hoc networks. E-mail: zhuyujie@ece.gatech.edu Raghupathy Sivakumar received the BE degree in Computer Science from Anna University, India, in 1996 and master’s and doctoral degrees in Computer Science from the University of Illinois at Urbana-Champaign in 1998 and 2000 respectively. He joined the School of Electrical and Computer Engineering at the Georgia Institute of Technology as an Assistant Professor in August 2000. His research interests are in wireless network protocols, mobile computing, and network quality of service. E-mail: siva@ece.gatech.edu An erratum to this article is available at .     

LEO/MEO卫星网络中运用自组网思想的动态路由算法

分析了基于星际链路的LEO/MEO路由算法的特点及卫星网与自组网的相同之处，借鉴了自组网路由协议中适用于卫星网的部分，提出了LEO/MEO卫星网络中运用自组网思想的动态路由算法，并对算法进行了模型仿真和性能分析，这种算法增强了卫星网络的自适应性，使网络具有自治性强，功能更全面、系统开销小、适用范围广等特点。     

M<Emphasis Type="SmallCaps">AP</Emphasis>: Medial axis based geometric routing in sensor networks

One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consideration includes scalability, routing complexity, quality of communication paths and the load sharing of the routes. In this paper, we show that a compact and expressive abstraction of network connectivity by the medial axis enables efficient and localized routing. We propose MAP, a Medial Axis based naming and routing Protocol that does not require geographical locations, makes routing decisions locally, and achieves good load balancing. In its preprocessing phase, MAP constructs the medial axis of the sensor field, defined as the set of nodes with at least two closest boundary nodes. The medial axis of the network captures both the complex geometry and non-trivial topology of the sensor field. It can be represented succinctly by a graph whose size is in the order of the complexity of the geometric features (e.g., the number of holes). Each node is then given a name related to its position with respect to the medial axis. The routing scheme is derived through local decisions based on the names of the source and destination nodes and guarantees delivery with reasonable and natural routes. We show by both theoretical analysis and simulations that our medial axis based geometric routing scheme is scalable, produces short routes, achieves excellent load balancing, and is very robust to variations in the network model. A preliminary version appeared in ACM International Conference on Mobile Computing and Networking (MobiCom’05), August, 2005. This work was supported in part by the Lee Center for Advanced Networking at the California Institute of Technology, and by NSF grant CCR-TC-0209042. Jie Gao’s work was done at Center for the Mathematics of Information, California Institute of Technology, Pasadena, CA 91125. Anxiao (Andrew) Jiang’s work was done at Department of Electrical Engineering, California Institute of Technology, Pasadena, CA 91125. Jehoshua Bruck is the Gordon and Betty Moore Professor of Computation and Neural Systems and Electrical Engineering at the California Institute of Technology. During 2003–2005 he served as the founding Director of Caltech's Information Science and Technology (IST) program. He received the B.Sc. and M.Sc. degrees in electrical engineering from the Technion, Israel Institute of Technology, in 1982 and 1985, respectively and the Ph.D. degree in Electrical Engineering from Stanford University in 1989. His research combines work on the design of distributed information systems and the theoretical study of biological circuits and systems. Dr. Bruck has an extensive industrial experience, including working with IBM Research for ten years where he participated in the design and implementation of the first IBM parallel computer. He was a co-founder and chairman of Rainfinity (acquired in 2005 by EMC), a spin-off company from Caltech that focused on software products for management of network information systems. He is an IEEE fellow, and his awards include the National Science Foundation Young Investigator award and the Sloan fellowship. He published more than 200 journal and conference papers and he holds 25 US patents. His papers were recognized in journals and conferences, including, winning the 2005 S. A. Schelkunoff Transactions prize paper award from the IEEE Antennas and Propagation society and the 2003 Best Paper Award in the 2003 Design Automation Conference. Jie Gao received her Ph.D in computer science from Stanford University in 2004, and her BS degree from University of Science and Technology of China in 1999. She is currently an assistant professor at Computer Science department, State University of New York, Stony Brook. Her research interests include algorithms, ad hoc communication and sensor networks, and computational geometry. Anxiao (Andrew) Jiang received the B.S. degree with honors in 1999 from the Department of Electronic Engineering, Tsinghua University, Beijing, China, and the M.S. and Ph.D. degrees in 2000 and 2004, respectively, from the Department of Electrical Engineering, California Institute of Technology. He is currently an assistant professor in the Department of Computer Science, Texas A&M University. He was a recipient of the four-year Engineering Division Fellowship from the California Institute of Technology in 1999. His research interests include algorithm design, ad hoc communication and sensor networks, and file storage and retrieval.     

Alternate Testing of RF Transceivers Using Optimized Test Stimulus for Accurate Prediction of System Specifications

In the recent past, with the emergence of System-on-Chip (SoC), focus has shifted towards testing system specifications rather than device or module specifications. While the problem of test accessibility for test stimulus application and response capture for such high-speed systems remains a challenge to the test engineers, new test strategies are needed which can address the problem in a practical manner. In this paper, the problem of testing the transmitter and the receiver subsystems of a RF transceiver for system level specification is addressed. Instead of using different conventional test stimuli for testing each of the system level specifications of RF subsystems, a specially crafted test stimulus is used for testing all the specifications from the response of the subsystem-under-test. A new simulation approach has also been developed to perform fast behavioral simulations in frequency domain for the system-under-test. In the test method, frequency domain test response spectra are captured and non-linear regression models are constructed to map the spectral measurements onto the specifications of interest. In the presented simulation results, the test stimuli have been validated using netlist level simulation of the subsystem-under-test and specifications have been predicted within an error of ±3% of the actual value.Soumendu Bhattacharya was born in Calcutta, India, in 1978. He received his Bachelors degree from Indian Institute of Technology, Kharagpur, India, in 2000. In 2002, he received the M.S.E.E. degree in electrical engineering from Georgia Institute of Technology, Atlanta, USA. He is currently working toward his Ph.D. degree. In the summer of 2001, he worked as a summer intern in National Semiconductor, Santa Clara, CA, USA. His research interests are in the area of test generation for mixed-signal and RF circuits and systems and design-for-test.Achintya Halder received the B.S. degree in electronics and electrical communication engineering from the Indian Institute of Technology, Kharagpur, in 1998. He worked as an IC design engineer with Texas Instruments until 2000. Currently, he is a Ph.D. student and a research assistant with the School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta. His research area is analog/RF and mixed signal testing.Ganesh P. Srinivasan received the B.E. degree in Electronics and Communication Engineering from the National Institute of Technology and Science, University of Madras, Chennai (Madras), India, in 2002. He received the M.S. degree in Electrical and Computer engineering from the Georgia Institute of Technology, Atlanta, GA, in 2004 and is currently pursuing his Ph.D. degree in Electrical and Computer Engineering at the Georgia Institute of Technology, Atlanta, GA. His research interests include low cost testing approaches for analog/RF and mixed-signal circuits, and improving performance of low cost testers for enabling high quality tests.Abhijit Chatterjee received the Bachelor of Technology degree in electrical engineering from the Indian Institute of Technology, Kanpur, India, in 1981, the M.S. degree in electrical engineering and computer science from University of Illinois at Chicago in 1983 and the Ph.D. degree in electrical and computer engineering from the University of Illinois at Urbana-Champaign in 1990. Until December 1992, he was a Research Staff Member at the General Electric Research and Development Center in Schenectady, NY. His work has been cited by the Wall Street Journal and presented on a Japanese network TV program called High Tech Shower International. He is a collaborating partner in NASAs New Millennium Project. Dr. Abhijit Chatterjee is also the author of one U.S. patent and has over one hundred publications in referenced journals and conferences.     

QoS Mechanisms for the MAC Protocol of IEEE 802.11 WLANs

There are two essential ingredients in order for any telecommunications system to be able to provide Quality-of-Service (QoS) guarantees: connection admission control (CAC) and service differentiation. In wireless local area networks (WLANs), it is essential to carry out these functions at the MAC level. The original version of IEEE 802.11 medium access control (MAC) protocol for WLANs does not include either function. The IEEE 802.11e draft standard includes new features to facilitate and promote the provision of QoS guarantees, but no specific mechanisms are defined in the protocol to avoid over saturating the medium (via CAC) or to decide how to assign the available resources (via service differentiation through scheduling). This paper introduces specific mechanisms for both admission control and service differentiation into the IEEE 802.11 MAC protocol. The main contributions of this work are a novel CAC algorithm for leaky-bucket constrained traffic streams, an original frame scheduling mechanism referred to as DM-SCFQ, and a simulation study of the performance of a WLAN including these features. This work has been partly funded by the Mexican Science and Technology Council (CONACYT) through grant 38833-A. José R. Gallardo received the B.Sc. degree in Physics and Mathematics from the National Polytechnic Institute in Mexico City, the M.Sc. degree in Electrical Engineering from CICESE Research and Graduate Education Center in Ensenada, Mexico, and the D.Sc. degree in Electrical Engineering from the George Washington University, Washington, DC. From 1997 to 2000 he worked as a Research Associate at the Advanced Communications Engineering Centre of the University of Western Ontario, London, Ontario, Canada. From May to December 2000, he worked as a Postdoctoral Fellow at the Broadband Wireless and Internetworking Research Laboratory of the University of Ottawa. Since December 2000, Dr. Gallardo has been with the Electronics and Telecommunications Department of CICESE Research Center, where he is a full professor. His main areas of interest are traffic modeling, traffic control, as well as simulation and performance evaluation of broadband communications networks, with recent emphasis on wireless local area networks (WLANs) and wireless sensor networks (WSNs). Paúl Medina received the B.Eng. degree from the Sonora Institute of Technology, Obregon, Mexico, and the M.Sc. degree from CICESE Research and Graduate Education Center, Ensenada, Mexico, both in Electrical Engineering. From July to September 2005, he worked as a Research Associate at the Broadband Wireless and Internetworking Research Laboratory of the University of Ottawa, Canada. Mr. Medina is currently with CENI²T, Ensenada, Mexico, working as a lead engineer in projects related to routing and access control in wireless sensor networks, as well as IP telephony over wireless LANs. Weihua Zhuang received the B.Eng. and M.Eng. degrees from Dalian Maritime University, Liaoning, China, and the Ph.D. degree from the University of New Brunswick, Canada, all in electrical engineering. Since October 1993, she has been with the Department of Electrical and Computer Engineering, University of Waterloo, ON, Canada, where she is a full professor. She is a co-author of the textbook Wireless Communications and Networking (Prentice Hall, 2003). Dr. Zhuang received the Outstanding Performance Award in 2005 from the University of Waterloo, and the Premier’s Research Excellence Award in 2001 from the Ontario Government. She is an Editor/Associate Editor of IEEE Transactions on Wireless Communications, IEEE Transactions on Vehicular Technology, EURASIP Journal on Wireless Communications and Networking, and International Journal of Sensor Networks. Her current research interests include multimedia wireless communications, wireless networks, and radio positioning.     

适于低轨卫星IP网络的核心群合并共享树组播算法

为了解决低轨卫星IP网络中现有典型源组播算法的信道资源浪费问题,该文提出了一种低树代价的组播算法,即核心群合并共享树(CCST)算法,包括动态近似中心(DAC)选核方法和核心群合并组播路径构建方法。DAC方法基于逻辑位置形成的虚拟静态、结构规则的网络拓扑选择核节点。在核心群合并方法中,以核节点作为初始核心群,通过核心群和剩余组成员的最短路径方法逐步扩展直至整棵组播树构建完成,从而使得组播树的树代价最小,大大提高了网络的传输带宽利用率和组播传输效率。最后,与低轨卫星IP网络中的其他几种典型算法进行了性能对比,仿真结果说明,CCST算法的树代价性能比其它算法有较大改善,而端到端传播时延略高。     

On-demand diversity wireless relay networks

There has been much recent attention on using wireless relay networks to forward data from mobile nodes to a base station. This network architecture is motivated by performance improvements obtained by leveraging the highest quality links to a base station for data transfer. With the advent of agile radios it is possible to improve the performance of relay networks through intelligent frequency assignments. First, it is beneficial if the links of the relay network are orthogonal with respect to each other so that simultaneous transmission on all links is possible. Second, diversity can be added to hops in the relay network to reduce error rates. In this paper we present algorithms for forming such relay networks dynamically. The formation algorithms support intelligent frequency assignments and diversity setup. Our results show that algorithms that order the sequence in which nodes join a relay network carefully, achieve the highest amount of diversity and hence best performance. This research is supported in part by NSF grant CNS-0508114. JaeSheung Shin received the B.S. and M.S. degree in Computer Science and Engineering from DongGuk University, Korea, in 1991 and 1993, respectively. He is currently working toward the Ph.D. degree in Computer Science and Engineering at the Pennsylvania State University, University Park. He is a research assistant at the Networking and Security Research Center (NSRC). Prior to joining Pennsylvania State University, he was with Electronics and Telecommunications Research Institute (ETRI), Korea, since 1993. He worked on development of 2G and 3G wireless cellular core network elements. His research interests include mobility management and signaling for wireless cellular and routing and resource allocation for multi-radio multi-hop wireless cellular networks. Kyounghwan Lee received the B.S. degree in Electrical and Electronics Engineering from University of Seoul, Seoul, Korea, in 2000, and the M.S. degree in Information and Communication Engineering from Gwangju Institute of Science and Technology, Gwangju, Korea, in 2002. He is currently a Ph.D candidate at the Electrical Engineering department at the Pennsylvania State University and a research assistant at the Wireless Communications and Networking Laboratory (WCAN@PSU). His research interests include wireless communication theory and relay networks. E-mail: kxl251@psu.edu Aylin Yener received the B.S. degrees in Electrical and Electronics Engineering, and in Physics, from Bogazici University, Istanbul, Turkey, in 1991, and the M.S. and Ph.D. degrees in Electrical and Computer Engineering from Rutgers University, NJ, in 1994 and 2000, respectively. During her Ph.D. studies, she was with Wireless Information Network Laboratory (WINLAB) in the Department of Electrical and Computer Engineering at Rutgers University, NJ. Between fall 2000 and fall 2001, she was with the Electrical Engineering and Computer Science Department at Lehigh University, PA, where she was a P.C. Rossin assistant professor. Currently, she is with the Electrical Engineering department at the Pennsylvania State University, University Park, PA, as an assistant professor. Dr. Yener is a recipient of the NSF CAREER award in 2003. She is an associate editor of the IEEE Transactions on Wireless Communications. Dr. Yener’s research interests include performance enhancement of multiuser systems, wireless communication theory and wireless networking. Thomas F. La Porta received his B.S.E.E. and M.S.E.E. degrees from The Cooper Union, New York, NY, and his Ph.D. degree in Electrical Engineering from Columbia University, New York, NY. He joined the Computer Science and Engineering Department at Penn State in 2002 as a Full Professor. He is the Director of the Networking Research Center at Penn State. Prior to joining Penn State, Dr. La Porta was with Bell Laboratories since 1986. He was the Director of the Mobile Networking Research Department in Bell Laboratories, Lucent Technologies. He is an IEEE Fellow and Bell Labs Fellow. Dr. La Porta was the founding Editor-in-Chief of the IEEE Transactions on Mobile Computing. He has published over 50 technical papers and holds 25 patents.     

End-to-end delay margin balancing approach for routing in multi-class networks

This paper presents Quality of Service (QoS) based routing and priority class assignment algorithms. It introduces an end-to-end delay margin balancing approach to routing, and uses it to formulate a nonlinear optimization problem. In a single-class network, the formulation is shown to be convex; however in a multi-class priority network, it is only convex within specific regions, and is infeasible otherwise. A centralized off-line computation technique is proposed to calculate both the route configuration and end-to-end priority assignment. A gradient-based solution in the convex region and a heuristic to overcome the multi-class discontinuity are derived. An approximation of the optimization problem is developed for on-line distributed processing is then presented. Using the approximation, arriving traffic flows can use vector routing tables to search for routes. Compared with minimum-hop, minimum-delay, and min-interference routing algorithms, the proposed approach enables the single-class network to accommodate more users of different end-to-end delay requirements. In a multi-class priority network, results show that using the objective function to combine route and priority class assignment further increases the supportable network traffic volume. Mohamed Ashour received his B.Sc. (1991) and M.Sc. (1997) in Electrical Engineering from Ain Shams University, Cairo, Egypt. He worked for Hughes and General Dynamics as a Telecommunications Engineer. Currently, he is a Ph.D. Candidate in the Department of Electrical and Computer Engineering of McGill University, Montreal, Quebec, Canada. His current area of research is focused on traffic engineering, routing, and QoS provisioning in DiffServ and MPLS Networks. He is also interested in multi-class queuing analysis of long-range traffic, and QoS provisioning in ad hoc networks and satellite communications. Tho Le-Ngoc obtained his B. Eng. (with Distinction) in Electrical Engineering in 1976, his M.Eng. in Microprocessor Applications in 1978 from McGill University, Montreal, and his Ph.D. in Digital Communications 1983 from the University of Ottawa, Canada. During 1977–1982, he was with Spar Aerospace Limited as a Design Engineer and then a Senior Design Engineer, involved in the development and design of the microprocessor-based controller of Canadarm (of the Space Shuttle), and SCPC/FM, SCPC/PSK, TDMA satellite communications systems. During 1982–1985, he was an Engineering Manager of the Radio Group in the Department of Development Engineering of SRTelecom Inc., developed the new point-to-multipoint DA-TDMA/TDM Subscriber Radio System SR500. He was the System Architect of this first digital point-to-multipoint wireless TDMA system. During 1985–2000, he was a Professor the Department of Electrical and Computer Engineering of Concordia University. Since 2000, he has been with the Department of Electrical and Computer Engineering of McGill University. His research interest is in the area of broadband digital communications with a special emphasis on Modulation, Coding, and Multiple-Access Techniques. He is a Senior Member of the Ordre des Ingénieur du Quebec, a Fellow of the Institute of Electrical and Electronics Engineers (IEEE), a Fellow of the Engineering Institute of Canada (EIC), and a Fellow of the Canadian Academy of Engineering (CAE). He is the recipient of the 2004 Canadian Award in Telecommunications Research, and recipient of the IEEE Canada Fessenden Award 2005.     

Energy aware efficient geographic routing in lossy wireless sensor networks with environmental energy supply

Wireless sensor networks are characterized by multihop wireless lossy links and resource constrained nodes. Energy efficiency is a major concern in such networks. In this paper, we study Geographic Routing with Environmental Energy Supply (GREES) and propose two protocols, GREES-L and GREES-M, which combine geographic routing and energy efficient routing techniques and take into account the realistic lossy wireless channel condition and the renewal capability of environmental energy supply when making routing decisions. Simulation results show that GREESs are more energy efficient than the corresponding residual energy based protocols and geographic routing protocols without energy awareness. GREESs can maintain higher mean residual energy on nodes, and achieve better load balancing in terms of having smaller standard deviation of residual energy on nodes. Both GREES-L and GREES-M exhibit graceful degradation on end-to-end delay, but do not compromise the end-to-end throughput performance. Kai Zeng received his B.E. degree in Communication Engineering and M.E. degree in Communication and Information System both from Huazhong University of Science and Technology, China, in 2001 and 2004, respectively. He is currently a Ph.D. student in the Electrical and Computer Engineering department at Worcester Polytechnic Institute. His research interests are in the areas of wireless ad hoc and sensor networks with emphases on energy-efficient protocol, cross-layer design, routing, and network security. Kui Ren received his B. Eng. and M. Eng. both from Zhejiang University, China, in 1998 and 2001, respectively. He worked as a research assistant at Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences from March 2001 to January 2003, at Institute for Infocomm Research, Singapore from January 2003 to August 2003, and at Information and Communications University, South Korea from September 2003 to June 2004. Currently he is a PhD candidate in the ECE department at Worcester Polytechnic Institute. His research interests include ad hoc/sensor network security, wireless mesh network security, Internet security, and security and privacy in ubiquitous computing environments. Wenjing Lou is an assistant professor in the Electrical and Computer Engineering department at Worcester Polytechnic Institute. She obtained her Ph.D. degree in Electrical and Computer Engineering from University of Florida in 2003. She received the M.A.Sc. degree from Nanyang Technological University, Singapore, in 1998, the M.E. degree and the B.E. degree in Computer Science and Engineering from Xi’an Jiaotong University, China, in 1996 and 1993 respectively. From December 1997 to July 1999, she worked as a Research Engineer in Network Technology Research Center, Nanyang Technological University. Her current research interests are in the areas of ad hoc and sensor networks, with emphases on network and system security and routing. Patrick J. Moran received his MSEE from Carnegie Mellon University, 1993. He is currently the CTO and Founder of AirSprite Technologies Inc, and is driving the company to utilize advanced networking protocols for low-power wireless network systems. His interests include architecture, protocols and high performance implementation of emerging communication technologies. Patrick has been involved in deployment of communication and signal processing technologies since graduating from the University of Minn. in 1986. He holds several patents and publications relating to storage, medical and data processing information systems. He is a member of the IEEE.     

Effective Capacity-Based Quality of Service Measures for Wireless Networks

An important objective of next-generation wireless networks is to provide quality of service (QoS) guarantees. This requires a simple and efficient wireless channel model that can easily translate into connection-level QoS measures such as data rate, delay and delay-violation probability. To achieve this, in Wu and Negi (IEEE Trans. on Wireless Communications 2(4) (2003) 630–643), we developed a link-layer channel model termed effective capacity, for the setting of a single hop, constant-bit-rate arrivals, fluid traffic, and wireless channels with negligible propagation delay. In this paper, we apply the effective capacity technique to deriving QoS measures for more general situations, namely, (1) networks with multiple wireless links, (2) variable-bit-rate sources, (3) packetized traffic, and (4) wireless channels with non-negligible propagation delay. Dapeng Wu received B.E. in Electrical Engineering from Huazhong University of Science and Technology, Wuhan, China, in 1990, M.E. in Electrical Engineering from Beijing University of Posts and Telecommunications, Beijing, China, in 1997, and Ph.D. in Electrical and Computer Engineering from Carnegie Mellon University, Pittsburgh, PA, in 2003. From July 1997 to December 1999, he conducted graduate research at Polytechnic University, Brooklyn, New York. During the summers of 1998, 1999 and 2000, he conducted research at Fujitsu Laboratories of America, Sunnyvale, California, on architectures and traffic management algorithms in the Internet and wireless networks for multimedia applications. Since August 2003, he has been with Electrical and Computer Engineering Department at University of Florida, Gainesville, FL, as an Assistant Professor. His research interests are in the areas of networking, communications, multimedia, signal processing, and information and network security. He received the IEEE Circuits and Systems for Video Technology (CSVT) Transactions Best Paper Award for Year 2001. Currently, he is an Associate Editor for the IEEE Transactions on Vehicular Technology and Associate Editor for International Journal of Ad Hoc and Ubiquitous Computing. He served as Program Chair for IEEE/ACM First International Workshop on Broadband Wireless Services and Applications (BroadWISE 2004); and as TPC member of over 20 conferences such as IEEE INFOCOM'05, IEEE ICC'05, IEEE WCNC'05, and IEEE Globecom'04. He is Vice Chair of Mobile and wireless multimedia Interest Group (MobIG), Technical Committee on Multimedia Communications, IEEE Communications Society. He is a member of the Award Committee, Technical Committee on Multimedia Communications, IEEE Communications Society. He is also Director of Communications, IEEE Gainesville Section. 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.     

Handoff Performance Improvement with Latency Reduction in Next Generation Wireless Networks

The next generation (NG) wireless networks are expected to provide mobile users with the real-time multimedia services. High sensitivity to time constraints like delay and jitter is one of the important characteristics of the multimedia traffic. In order to maintain a certain quality of service (QoS) level, the handoff latency should be minimized. Furthermore, if the new cell is not ready at the actual handoff time, the handoff call may be even forced terminated. Hence, the handoff preparation latency directly affects the performance of the cellular networks in terms of QoS support and the handoff blocking probability. In this paper, we present the expected visitor list (EVL) method to achieve reduced handoff blocking probability and maintain a certain QoS level in the network by minimizing handoff preparation latency. The handoff signaling decomposition is introduced to make the neighbor cells aware of the resource demands and QoS requirements of the mobile terminal before the actual handoff time. The obtained information about the prospective active mobile terminal is stored in an EVL entry at the neighbor cells. The call admission control (CAC) with QoS-provisioning is run against each EVL entry. According to the CAC result, the network preparation algorithms are executed and the results are stored in the entry. No resource reservation or allocation is performed in advance, and the varying network conditions are reflected to validity and admission status of the entries. The results of handoff preparation algorithms stored in the EVL entry are activated at the actual handoff time and hence the handoff latency is minimized. Performance evaluation through mathematical analysis and extensive simulation experiments show that the EVL method reduces handoff latency and hence handoff call blocking probability significantly without introducing high overhead.Özgür B. Akan received the B.S. and M.S. degrees in electrical and electronics engineering from Bilkent University and Middle East Technical University, Ankara, Turkey, in 1999 and 2001, respectively. He received the Ph.D. degree in electrical and computer engineering from the Broadband and Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, in 2004. He is currently an Assistant Professor with the Department of Electrical and Electronics Engineering, Middle East Technical University. His current research interests include sensor networks, next-generation wireless networks, and deep space communication networks.Buyurman Baykal received his B.Sc. (High Hons.) degree in Electrical and Electronics Engineering from Middle East Technical University in 1990; M.Sc. (Distinction) and Ph.D. degrees in 1992 and 1995 from Imperial College of Science, Technology and Medicine. Dr. Baykal has research and teaching interests in speech processing, signal processing for telecommunications, and communication networks. He has extensive experience both in the theory and applications of adaptive signal processing techniques to communication applications such as acoustic echo cancellation, noise reduction, channel equalization and digital receiver design through self-conducted research and industry-funded research projects. He conducts research and implementation work on low bit rate speech coding and content based indexing of audio signals. He is also involved in communication network research with particular interest in ATM/IP design aspects, wireless networks and network management issues. Dr. Baykal is an Associate Editor of Computer Networks (Elsevier Science), Sensor Letters (American Scientific Publishing), a past Associate Editor of the IEEE Transactions on Circuits and Systems Part II—Analog and Digital Signal Processing (TCAS-II). He authored and co-authored over 50 technical papers.     

Minimum energy transmission scheduling subject to deadline constraints

We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount of data that must be served by a common deadline. Given that, for each user, the channel fade state determines the throughput per unit of energy expended, our objective is to minimize the overall expected energy consumption while satisfying the deadline constraint. We consider both a linear and a strictly convex rate-power curve and obtain optimal solutions, based on dynamic programming (DP), and tractable approximate heuristics in both cases. For the special non-fading channel case with convex rate-power curve, an optimal solution is obtained based on the Shortest Path formulation. In the case of a linear rate-power curve, our DP solution has a nice “threshold” form; while for the convex rate-power curve we are able to obtain a heuristic algorithm with comparable performance with that of the optimal scheduling scheme. Alessandro Tarello received his M.Sc. and Ph.D. degrees in Electrical and Communication Engineering from Politecnico di Torino, Torino, Italy, in 2002 and 2006 respectively. He currently holds a Postdoctoral position at Politecnico di Torino. He visited the Laboratory for Information and Decision Systems at MIT, Cambridge, MA, USA, in 2004 and 2005. During Summer 2005 he also visited the Jet Propulsion Laboratory, Pasadena, CA, USA. He received the best student paper award at the Third International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOPT’05). His research interests are in the fields of stochastic and fluid models for performance evaluation of packet networks and optimization techniques for wireless and ad-hoc networks. Jun Sun received his B.S. degree in Computer Engineering from University of Florida in 1997 and his M.S. in Electrical Engineering from Massachusetts Institute of Technology in 2002. He is currently a Ph.D. student in the Laboratory for Information and Decision Systems at MIT. His research interest is on communication networks with emphasis on satellite and wireless networks. Murtaza Zafer received his B.Tech degree in Electrical Engineering from the Indian Institute of Technology (IIT), Madras, India, in 2001 and his M.S. degree in Electrical Engineering and Computer Science from the Massachusetts Institute of Technology (MIT), MA, USA, in 2003. Currently, he is pursuing his doctoral studies at the Laboratory for Information and Decision Systems (LIDS) in the department of Electrical Engineering and Computer Science at MIT. He spent the summer of 2004 at the Mathematical Sciences Research center, Bell Laboratories and the summer of 2003 at Qualcomm, Inc. His research interests lie in queueing theory, information theory, control and optimization theory and its applications to wireless communication networks. He is the co-recipient of the best Student Paper award at WiOpt, 2005. He also received the Siemens (India) and Philips (India) award for academic excellence. Eytan Modiano received his B.S. degree in Electrical Engineering and Computer Science from the University of Connecticut at Storrs in 1986 and his M.S. and PhD degrees, both in Electrical Engineering, from the University of Maryland, College Park, MD, in 1989 and 1992 respectively. He was a Naval Research Laboratory Fellow between 1987 and 1992 and a National Research Council Post Doctoral Fellow during 1992–1993. Between 1993 and 1999 he was with MIT Lincoln Laboratory where he was the project leader for MIT Lincoln Laboratory’s Next Generation Internet (NGI) project. Since 1999 he has been on the faculty at MIT; where he is presently an Associate Professor. His research is on communication networks and protocols with emphasis on satellite, wireless, and optical networks. He is currently an Associate Editor for Communication Networks for IEEE Transactions on Information Theory and for The International Journal of Satellite Communications. He had served as a guest editor for IEEE JSAC special issue on WDM network architectures; the Computer Networks Journal special issue on Broadband Internet Access; the Journal of Communications and Networks special issue on Wireless Ad-Hoc Networks; and for IEEE Journal of Lightwave Technology special issue on Optical Networks. He is the Technical Program co-chair for Wiopt 2006, IEEE Infocom 2007, and ACM MobiHoc 2007.     

A New Call Admission Control Scheme Based on Mobile Position Estimation in DS-CDMA Systems

Call dropping is considered more annoying than call blocking in wireless cellular networks. The cost of the classical method of employing guard channels to decrease the call dropping rate is the increase in call blocking rate. Since subscriber mobility changes in time, the number of handoff attempts in each cell is subject to fluctuations, making static assignments (or periodical update) of a given number of guard channels inefficient. In this paper, we propose an adaptive scheme that employs reservations, instead of static assignments, to adaptively adjust the number of guard channels in each cell according to the current requirements. Thus, unnecessary allocation of guard channels is avoided resulting in a lower cost in terms of call dropping. The reservation requests are made according to the recent mobility pattern of the subscriber. A likelihood value is associated with each reservation request so that fewer channels are reserved by benefiting from the statistical accumulation of the requests. The channels are reserved by considering the interference that would be created once they are in use. The proposed scheme is evaluated against the classical guard channel scheme with a realistic mobility model.This author is currently associated with Georgia Institute of Technology-Regional Engineering Program (GTREP).Tuna Tugcu received his B.S. and Ph.D. degrees in computer engineering from Bogazici University in 1993 and 2001, respectively, M.S. degree from New Jersey Institute of Technology in 1994. He pursued post-doctorate study in Broadband and Wireless Networking Lab at Georgia Institute of Technology until July 2002. Currently, he is a visiting assistant professor at Georgia Institute of Technology-Regional Engineering Program. His research interests include real-time systems, communication networks, and wireless communications. Dr. Tugcu is a member of the IEEE.Cem Ersoy received his B.S. and M.S. degrees in electrical engineering from Bogazici University in 1984 and 1986, respectively. He worked as an R&D engineer in NETAS A.S. between 1984 and 1986. He received his PhD in electrical engineering from Polytechnic University in 1992. Currently, he is a professor in the Computer Engineering Department of Bogazici University. His research interests include performance evaluation and topological design of communication networks, wireless communications and mobile applications. Dr. Ersoy is a Senior Member of the IEEE.