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.     

Harnessing Traffic Uncertainties in Wireless Mesh Networks—A Stochastic Optimization Approach

In this paper, we investigate the routing optimization problem in wireless mesh networks. While existing works usually assume static and known traffic demand, we emphasize that the actual traffic is time-varying and difficult to measure. In light of this, we alternatively pursue a stochastic optimization framework where the expected network utility is maximized. For multi-path routing scenario, we propose a stochastic programming approach which requires no priori knowledge on the probabilistic distribution of the traffic. For the single-path routing counterpart, we develop a learning-based algorithm which provably converges to the global optimum solution asymptotically.

Self-management in chaotic wireless deployments

Over the past few years, wireless networking technologies have made vast forays into our daily lives. Today, one can find 802.11 hardware and other personal wireless technology employed at homes, shopping malls, coffee shops and airports. Present-day wireless network deployments bear two important properties: they are unplanned, with most access points (APs) deployed by users in a spontaneous manner, resulting in highly variable AP densities; and they are unmanaged, since manually configuring and managing a wireless network is very complicated. We refer to such wireless deployments as being chaotic. In this paper, we present a study of the impact of interference in chaotic 802.11 deployments on end-client performance. First, using large-scale measurement data from several cities, we show that it is not uncommon to have tens of APs deployed in close proximity of each other. Moreover, most APs are not configured to minimize interference with their neighbors. We then perform trace-driven simulations to show that the performance of end-clients could suffer significantly in chaotic deployments. We argue that end-client experience could be significantly improved by making chaotic wireless networks self-managing. We design and evaluate automated power control and rate adaptation algorithms to minimize interference among neighboring APs, while ensuring robust end-client performance. This work was supported by the Army Research Office under grant number DAAD19-02-1-0389, and by the NSF under grant numbers ANI-0092678, CCR-0205266, and CNS-0434824, as well as by IBM and Intel. Aditya Akella obtained his Ph.D. in Computer Science from Carnegie Mellon University in September 2005. He obtained a B.Tech in Computer Science and Engineering from IIT Madras in May 2000. Currently, Dr. Akella is a post-doctoral associate at Stanford University. He will join the Computer Sciences faculty at the University of Wisconsin-Madison in Fall 2006. Dr. Akella's research interests include Internet Routing, Network Protocol Design, Internet Security, and Wireless Networking. His web page is at . Glenn Judd, is a Computer Science Ph.D. candidate at Carnegie Mellon University. His research interests include wireless networking and pervasive computing. He has an M.S. and B.S. in Computer Science from Brigham Young University. Srinivasan Seshan is currently an Associate Professor and holds the Finmeccanica chair at Carnegie Mellon University’s Computer Science Department. Dr. Seshan received his Ph.D. in 1995 from the Computer Science Department at University of California, Berkeley. From 1995 to 2000, Dr. Seshan was a research staff member at IBM’s T.J. Watson Research Center. Dr. Seshan’s primary interests are in the broad areas of network protocols and distributed network applications. In the past, he has worked on topics such as transport/routing protocols for wireless networks, fast protocol stack implementations, RAID system design, performance prediction for Internet transfers, Web server benchmarking, new approaches to congestion control, firewall design and improvements to the TCP protocol. His current work explores new approaches in overlay networking, sensor networking, online multiplayer games and wide-area Internet routing. His web page is at . Peter Steenkiste is a Professor of Computer Science and of Electrical and Computer Engineering at Carnegie Mellon University. His research interests include networking, distributed systems, and pervasive computing. He received an M.S. and Ph.D. in Electrical Engineering from Stanford University and an Engineering degree from the University of Gent, Belgium. You can learn more about his research from his home page .     

Effective capacity channel model for frequency-selective fading channels

To efficiently support quality of service (QoS) in future wireless networks, it is important to model a wireless channel in terms of connection-level QoS metrics such as data rate, delay and delay-violation probability. To achieve this, in [7], we proposed and developed a link-layer channel model termed effective capacity (EC) for flat fading channels. In this paper, we apply the effective capacity technique to modeling frequency selective fading channels. Specifically, we utilize the duality between the distribution of a queue with superposition of N i.i.d. sources, and the distribution of a queue with a frequency-selective fading channel that consists of N i.i.d. sub-channels, to model a frequency selective fading channel. In the proposed model, a frequency selective fading channel is modeled by three EC functions; we also propose a simple and efficient algorithm to estimate these EC functions. Simulation results show that the actual QoS metric is closely approximated by the QoS metric predicted by the proposed EC channel model. The accuracy of the prediction using our model can translate into efficiency in admission control and resource reservation. 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 30 conferences. 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 Best Paper 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 Associate Professor. His research interests include signal processing, coding for communications systems, information theory, networking, cross-layer optimization and sensor networks.     

Real-time CBR traffic scheduling in IEEE 802.16-based wireless mesh networks

This paper studies packet transmission scheduling for real-time constant-bit-rate (CBR) traffic in IEEE 802.16-based wireless mesh networks. We first formulate and solve the scheduling problem as a binary linear programming problem. The computational complexity of the optimum scheduling solution may prevent it from being implemented in practice. We then propose a heuristic scheme, namely bottleneck first scheduling scheme, where scheduling decisions at stations (base station or subscriber stations) with higher traffic loads are done before those at stations with lower traffic loads. At each station, scheduling decisions for CBR packets with more hops to their destinations are done first. Numerical results show that the proposed scheduling scheme achieves the same capacity as the optimal one while obtaining satisfactory delay performance. Dongmei Zhao received the Ph.D. degree in Electrical and Computer Engineering from the University of Waterloo, Waterloo, Ontario, Canada in June 2002. Since July 2002 she has been with the Department of Electrical and Computer Engineering, McMaster University, Hamilton, Ontario, Canada where she is an assistant professor. Dr. Zhao’s research interests include modeling and performance analysis, quality-of-service provisioning, access control and admission control in wireless networks. Dr. Zhao is a member of the IEEE and a registered Professional Engineer of Ontario. Jun Zou received the B.S. and M. Eng. Degrees from Tianjin University, China in 1999 and 2002, respectively. He worked at Siemens Communication Networks Ltd., Beijing from 2002 to 2004. Currently, he is a Ph.D. student at McMaster University, Canada. His research interests include wireless networking, routing protocols, architecture of next generation networks, network security and their applications in telecommunication industry.     

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.     

Directional Controlled Fusion in Wireless Sensor Networks

Though data redundancy can be eliminated at aggregation point to reduce the amount of sensory data transmission, it introduces new challenges due to multiple flows competing for the limited bandwidth in the vicinity of the aggregation point. On the other hand, waiting for multiple flows to arrive at a centralized node for aggregation not only uses precious memory to store these flows but also increases the delays of sensory data delivery. While traditional aggregation schemes can be characterized as “multipath converging,” this paper proposes the notation of “multipath expanding” to solve the above problems by jointly considering data fusion and load balancing. We propose a novel directional-controlled fusion (DCF) scheme, consisting of two key algorithms termed as directional control and multipath fusion. By adjusting a key parameter named multipath fusion factor in DCF, the trade-offs between multipath-converging and multipath-expanding can be easily achieved, in order to satisfy specific QoS requirements from various applications. We present simulations that verify the effectiveness of the proposed scheme.

Exploiting Mobility for Energy Efficient Data Collection in Wireless Sensor Networks

We analyze an architecture based on mobility to address the problem of energy efficient data collection in a sensor network. Our approach exploits mobile nodes present in the sensor field as forwarding agents. As a mobile node moves in close proximity to sensors, data is transferred to the mobile node for later depositing at the destination. We present an analytical model to understand the key performance metrics such as data transfer, latency to the destination, and power. Parameters for our model include: sensor buffer size, data generation rate, radio characteristics, and mobility patterns of mobile nodes. Through simulation we verify our model and show that our approach can provide substantial savings in energy as compared to the traditional ad-hoc network approach. Sushant Jain is a Ph.D. candidate in the Department of Computer Science and Engineering at the University of Washington. His research interests are in design and analysis of routing algorithms for networking systems. He received a MS in Computer Science from the University of Washington in 2001 and a B.Tech degree in Computer Science from IIT Delhi in 1999. Rahul C. Shah completed the B. Tech (Hons) degree from the Indian Institute of Technology, Kharagpur in 1999 majoring in Electronics and Electrical Communication Engineering. He is currently pursuing his Ph.D. in Electrical Engineering at the University of California, Berkeley. His research interests are in energy-efficient protocol design for wireless sensor/ad hoc networks, design methodology for protocols and next generation cellular networks. Waylon Brunette is a Research Engineer in the Department of Computer Science and Engineering at the University of Washington. His research interests include mobile and ubiquitous computing, wireless sensor networks, and personal area networks. Currently, he is engaged in collaborative work with Intel Research Seattle to develop new uses for embedded devices and RFID technologies in ubiquitous computing. He received a BS in Computer Engineering from the University of Washington in 2002. Gaetano Borriello is a Professor in the Department of Computer Science and Engineering at the University of Washington. His research interests are in embedded and ubiquitous computing, principally new hardware devices that integrate seamlessly into the user’s environment with particular focus on location and identification systems. His principal projects are in creating manageable RFID systems that are sensitive to user privacy concerns and in context-awareness through sensors distributed in the environment as well as carried by users. Sumit Roy received the B. Tech. degree from the Indian Institute of Technology (Kanpur) in 1983, and the M. S. and Ph. D. degrees from the University of California (Santa Barbara), all in Electrical Engineering in 1985 and 1988 respectively, as well as an M. A. in Statistics and Applied Probability in 1988. His previous academic appointments were at the Moore School of Electrical Engineering, University of Pennsylvania, and at the University of Texas, San Antonio. He is presently Prof, of Electrical Engineering, Univ. of Washington where his research interests center around analysis/design of communication systems/networks, with a topical emphasis on next generation mobile/wireless networks. He is currently on academic leave at Intel Wireless Technology Lab working on high speed UWB radios and next generation Wireless LANs. His activities for the IEEE Communications Society includes membership of several technical committees and TPC for conferences, and he serves as an Editor for the IEEE Transactions on Wireless Communications.     

A stochastic control approach for scheduling multimedia transmissions over a polled multiaccess fading channel

We develop scheduling strategies for carrying multimedia traffic over a polled multiple access wireless network with fading. We consider a slotted system with three classes of traffic (voice, streaming media and file transfers). A Markov model is used for the fading and also for modeling voice packet arrivals and streaming arrivals. The performance objectives are a loss probability for voice, mean network delay for streaming media, and time average throughput for file transfers. A central scheduler (e.g., the access point in a single cell IEEE 802.11 wireless local area network (WLAN)) is assumed to be able to keep track of all the available state information and make the scheduling decision in each slot (e.g., as would be the case for PCF mode operation of the IEEE 802.11 WLAN). The problem is modeled as a constrained Markov decision problem. By using constraint relaxations (a linear relaxation and Whittle type relaxations) an index based policy is obtained. For the file transfers the decision problem turns out to be one with partial state information. Numerical comparisons are provided with the performance obtained from some simple policies. This work was supported by a research grant from Intel Technology India Pvt. Ltd. Munish Goyal obtained his Masters and PhD degree in telecommunications from the Indian Institute of Science, Bangalore, India and the B.E. degree in Electronics and Communication from the Indian Institute of Technology, Roorkee, India. Currently, he is a postdoctoral research fellow at the ARC Center of Excellence for Mathematics and Statistics of Complex Systems, University of Melbourne, Australia. His research interests include modelling, analysis and control problems arising in stochastic systems especially telecommunication systems. Anurag Kumar obtained his B.Tech. degree from the Indian Institute of Technology at Kanpur, and the PhD degree from Cornell University, both in Electrical Engineering. He was then with Bell Laboratories, Holmdel, N.J., for over 6 years. Since 1988 he has been with the Indian Institute of Science (IISc), Bangalore, in the Dept. of Electrical Communication Engineering, where he is now a Professor, and is also the Chairman of the department. From 1988 to 2003 he was the Coordinator at IISc of the Education and Research Network Project (ERNET), India’s first wide-area packet switching network. His area of research is communication networking, specifically, modeling, analysis, control and optimisation problems arising in communication networks and distributed systems. Recently his research has focused primarily on wireless networking. He has been elected Fellow of the IEEE, and the Indian National Science Academy (INSA), both from 2006, and has been a Fellow of the Indian National Academy of Engineering (INAE) since 1998. He is an associate editor of IEEE Transactions on Networking, and of IEEE Communications Surveys and Tutorials. He is a coauthor of the advanced text-book “Communication Networking: An Analytical Approach,” by Kumar, Majunath and Kuri, published by Morgan-Kaufman/Elsevier. Vinod Sharma received his B.Tech in Electrical Engineering from Indian Institute of Technology, New Delhi in 1978 and PhD in Electrical and Computer Engineering from Carnegie Mellon University in 1984. He worked in Northeastern University and University of California at Los Angeles before joining Indian Instutute of Science in 1988 where currently he is a Professor. He has held visiting positions at INRS Montreal, Helsinki University of Technology, Tokyo University of Science, Institute Mittag-Leffler and INRIA, Sophia Antipolis. His current interests are in Communication Networks, Wireless Communications and Queueing Theory.     

How is the capacity of ad hoc networks improved with directional antennas?

The capacity of wireless ad hoc networks is constrained by the interference caused by the neighboring nodes. Gupta and Kumar have shown that the throughput for such networks is only Θ bits per second per node in a unit area domain when omnidirectional antennas are used [1]. In this paper we investigate the capacity of ad hoc wireless networks using directional antennas. Using directional antennas reduces the interference area caused by each node, thus increases the capacity of the network. We will give an expression for the capacity gain and we argue that in the limit, when the beam-width goes to zero the wireless network behaves like the wired network. In our analysis we consider both arbitrary networks and random networks where nodes are assumed to be static. We have also analyzed hybrid beamform patterns that are a mix of omnidirectional/directional and a better model of real directional antennas. Simulations are conducted for validation of our analytical results. Su Yi received the B.S. and M.S degrees in automation from Tsinghua University, China, in 1998 and 2001, respectively. She received her Ph.D. degree in electrical engineering from Rensselaer Polytechnic Institute, in December 2005. Her research interests include various topics in wireless ad hoc networks, including capacity of wireless networks, error control coding, and multimedia communications over wireless. Yong Pei is currently a tenure-track assistant professor in the Computer Science and Engineering Department, Wright State University, Dayton, OH. Previously he was a visiting assistant professor in the Electrical and Computer Engineering Department, University of Miami, Coral Gables, FL. He received his B.S. degree in electrical power engineering from Tsinghua University, Beijing, in 1996, and M.S. and Ph.D. degrees in electrical engineering from Rensselaer Polytechnic Institute, Troy, NY, in 1999 and 2002, respectively. His research interests include information theory, wireless communication systems and networks, and image/video compression and communications. He is a member of IEEE and ACM. Shivkumar Kalyanaraman is an Associate Professor at the Department of Electrical, Computer and Systems Engineering at Rensselaer Polytechnic Institute in Troy, NY. He received a B.Tech degree from the Indian institute of Technology, Madras, India in July 1993, followed by M.S. and Ph.D. degrees in computer and Information Sciences at the Ohio State University in 1994 and 1997 respectively. His research interests are in network traffic management topics such as congestion control, reliability, connectionless traffic engineering, quality of service (QoS), last-mile community wireless networks, low-cost free-space-optical networks, automated network management using online simulation, multicast, multimedia networking, and performance analysis. His special interest lies in developing the interdisciplinary connections between network architecture and fields like control theory, economics, scalable simulation technologies, video compression and optoelectronics. He is a member of ACM and IEEE. Babak Azimi-Sadjadi received his B.Sc. from Sharif University of Technology in 1989, his M.Sc. from Tehran University in 1992, and his Ph.D. from the University of Maryland at College Park in 2001 all in Electrical Engineering. He is currently with Intelligent Automation Inc. where he is a Senior Research Scientist He also has a joint appointment with the department of Electrical, Systems, and Computer Engineering of Rensselaer Polytechnic Institute where he is a research assistant professor. His research interests include, nonlinear filtering, networked control systems, and wireless networks.     

A Path-Centric Channel Assignment Framework for Cognitive Radio Wireless Networks

Today’s static spectrum allocation policy results in a situation where the available spectrum is being exhausted while many licensed spectrum bands are under-utilized. To resolve the spectrum exhaustion problem, the cognitive radio wireless network, termed CogNet in this paper, has recently been proposed to enable unlicensed users to dynamically access the licensed spectrum bands that are unused in either temporal or spatial domain, through spectrum-agile cognitive radios. The CogNet plays the role of secondary user in this shared spectrum access framework, and the spectrum bands accessible by CogNets are inherently heterogeneous and dynamic. To establish the communication infrastructure for a CogNet, the cognitive radio of each CogNet node detects the accessible spectrum bands and chooses one as its operating frequency, a process termed channel assignment. In this paper we propose a graph-based path-centric channel assignment framework to model multi-hop ad hoc CogNets and perform channel assignment from a network perspective. Simulation results show that the path-centric channel assignment framework outperforms traditional link-centric approach.

Channel Access Scheme for MIMO-Enabled Ad Hoc Networks with Adaptive Diversity/Multiplexing Gains

Transmission power control (TPC) is used in wireless networks to improve channel reuse and/or reduce energy consumption. It has been often applied to single-input single-output (SISO) systems, where each node is equipped with a single antenna. Multi-input multi-output (MIMO) systems can improve the throughput or the signal-to-noise ratio (SNR) by providing multiplexing or diversity gains, respectively. In this paper, we incorporate a power-controlled MAC protocol for a wireless network with two antennas per node. Our protocol, coined CMAC, combines different types of MIMO gains, allowing for dynamic switching between diversity and multiplexing modes so as to maximize a utility function that depends on both energy consumption and throughput. CMAC adapts the “antenna mode,” the transmission power, and the modulation order on a per-packet basis. By “antenna mode” we mean one of five possible transmit/receive antenna configurations: 1 × 1 (SISO), 2 × 1 (MISO-D), 1 × 2 (SIMO-D), 2 × 2 (MIMO-D), and 2 × 2 (MIMO-M). The second, third, and fourth configurations offer a diversity gain, whereas the last configuration offers a multiplexing gain. By using control packets to bound the transmission power of potentially interfering terminals, CMAC allows for multiple interference-limited transmissions to take place in the vicinity of a receiving terminal. We study via simulations the performance of CMAC in ad hoc topologies. Our results indicate that relative to non-adaptive protocols, CMAC achieves a significant improvement in both the overall energy consumption and the throughput.

Localized Algorithms for Energy Efficient Topology in Wireless Ad Hoc Networks

Topology control in wireless ad hoc networks is to select a subgraph of the communication graph (when all nodes use their maximum transmission range) with some properties for energy conservation. In this paper, we propose two novel localized topology control methods for homogeneous wireless ad hoc networks. Our first method constructs a structure with the following attractive properties: power efficient, bounded node degree, and planar. Its power stretch factor is at most , and each node only has to maintain at most neighbors where the integer is an adjustable parameter, and β is a real constant between 2 and 5 depending on the wireless transmission environment. It can be constructed and maintained locally and dynamically. Moreover, by assuming that the node ID and its position can be represented in bits each for a wireless network of n nodes, we show that the structure can be constructed using at most 24n messages, where each message is bits. Our second method improves the degree bound to k, relaxes the theoretical power spanning ratio to , where is an adjustable parameter, and keeps all other properties. We show that the second structure can be constructed using at most 3n messages, where each message has size of bits. We also experimentally evaluate the performance of these new energy efficient network topologies. The theoretical results are corroborated by the simulations: these structures are more efficient in practice, compared with other known structures used in wireless ad hoc networks and are easier to construct. In addition, the power assignment based on our new structures shows low energy cost and small interference at each wireless node. The work of Xiang-Yang Li is partially supported by NSFCCR-0311174. Wen-Zhan Song received Ph.D. from Illinois Institute of Technology in 2005, BS and MS from Nanjing University of Science and Technology in 1997 and 2000. He is currently an assistant professor in Washington State University. His current research interest is mainly focus on network protocol and algorithm design, especially in wireless networks, sensor networks and Peer-to-Peer networks. He is a member of the IEEE. Yu Wang received the Ph.D. degree in computer science from Illinois Institute of Technology in 2004, the BEng degree and the MEng degree in computer science from Tsinghua University, China, in 1998 and 2000. He has been an assistant professor of computer science at the Univeristy of North Carolina at Charlotte since 2004. His current research interests include wireless networks, mobile computing, algorithm design, and artificial intelligence. He is a member of the ACM, IEEE, and IEEE Communication Society. Xiang-Yang Li has been an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He hold MS (2000) and PhD (2001) degree at Computer Science from University of Illinois at Urbana-Champaign. He received his Bachelor degree at Computer Science and Bachelor degree at Business Management from Tsinghua University, P.R. China in 1995. His research interests span the computational geometry, wireless ad hoc networks, game theory, cryptography and network security. He is a Member of the ACM, IEEE, and IEEE Communication Society. Ophir Frieder is the IITRI Professor of Computer Science at the Illinois Institute of Technology. His research interests span the general area of distributed information systems. He is a Member of ACM and a Fellow of the IEEE.     

Energy-efficient scheduling with individual packet delay constraints over a fading channel

This article focuses on energy-efficient packet transmission with individual packet delay constraints over a fading channel. The problem of optimal offline scheduling (vis-à-vis total transmission energy), assuming information of all packet arrivals and channel states before scheduling, is formulated as a convex optimization problem with linear constraints. The optimality conditions are analyzed. From the analysis, a recursive algorithm is developed to search for the optimal offline scheduling. The optimal offline scheduler tries to equalize the energy-rate derivative function as much as possible subject to causality and delay constraints, in contrast to the equalization of transmission rates for optimal scheduling in static channels. It is shown that the optimal offline schedulers for fading and static channels have a similar symmetry property. Combining the symmetry property with potential idling periods, upper and lower bounds on the average packet delay are derived. The properties of the optimal offline schedule and the impact of packet sizes, individual delay constraints, and channel variations are demonstrated via simulations. A heuristic online scheduling algorithm, assuming causal traffic and channel information, is proposed and shown via simulations to achieve energy and delay performances comparable to those of the optimal offline scheduler in a wide range of scenarios.

Potential Cognitive Radio Denial-of-Service Vulnerabilities and Protection Countermeasures: a Multi-dimensional Analysis and Assessment

Cognitive radios sense spectrum activity and apply spectrum policies in order to make decisions on when and in what bands they may communicate. These activities go beyond what is done when traditional radios communicate. This paper examines the denial of service vulnerabilities that are opened by these additional activities and explores potential protection remedies that can be applied. An analysis of how vulnerable are victim cognitive radios to potential denial of service attacks is presented along different axis, namely the network architecture employed, the spectrum access technique used and the spectrum awareness model. The goal is to assist cognitive radio designers to incorporate effective security measures now in the early stages of cognitive radio development.

Scheduling Sleeping Nodes in High Density Cluster-based Sensor Networks

In order to conserve battery power in very dense sensor networks, some sensor nodes may be put into the sleep state while other sensor nodes remain active for the sensing and communication tasks. In this paper, we study the node sleep scheduling problem in the context of clustered sensor networks. We propose and analyze the Linear Distance-based Scheduling (LDS) technique for sleeping in each cluster. The LDS scheme selects a sensor node to sleep with higher probability when it is farther away from the cluster head. We analyze the energy consumption, the sensing coverage property, and the network lifetime of the proposed LDS scheme. The performance of the LDS scheme is compared with that of the conventional Randomized Scheduling (RS) scheme. It is shown that the LDS scheme yields more energy savings while maintaining a similar sensing coverage as the RS scheme for sensor clusters. Therefore, the LDS scheme results in a longer network lifetime than the RS scheme. Jing Deng received the B.E. and M.E. degrees in Electronic Engineering from Tsinghua University, Beijing, P. R. China, in 1994 and 1997, respectively, and the Ph.D. degree in Electrical and Computer Engineering from Cornell University, Ithaca, NY, in 2002. Dr. Deng is an assistant professor in the Department of Computer Science at the University of New Orleans. From 2002 to 2004, he visited the CASE center and the Department of Electrical Engineering and Computer Science at Syracuse University, Syracuse, NY as a research assistant professor, supported by the Syracuse University Prototypical Research in Information Assurance (SUPRIA) program. He was a teaching assistant from 1998 to 1999 and a research assistant from 1999 to 2002 in the School of Electrical and Computer Engineering at Cornell University. His interests include mobile ad hoc networks, wireless sensor networks, wireless network security, energy efficient wireless networks, and information assurance. Wendi B. Heinzelman is an assistant professor in the Department of Electrical and Computer Engineering at the University of Rochester. She received a B.S. degree in Electrical Engineering from Cornell University in 1995 and M.S. and Ph.D. degrees in Electrical Engineering and Computer Science from MIT in 1997 and 2000 respectively. Her current research interests lie in the areas of wireless communications and networking, mobile computing, and multimedia communication. Dr. Heinzelman received the NSF Career award in 2005 for her work on cross-layer optimizations for wireless sensor networks, and she received the ONR Young Investigator award in 2005 for her research on balancing resource utilization in wireless sensor networks. Dr. Heinzelman was co-chair of the 1st Workshop on Broadband Advanced Sensor Networks (BaseNets '04), and she is a member of Sigma Xi, the IEEE, and the ACM. Yunghsiang S. Han was born in Taipei, Taiwan, on April 24, 1962. He received the B.S. and M.S. degrees in electrical engineering from the National Tsing Hua University, Hsinchu, Taiwan, in 1984 and 1986, respectively, and the Ph.D. degree from the School of Computer and Information Science, Syracuse University, Syracuse, NY, in 1993. From 1986 to 1988 he was a lecturer at Ming-Hsin Engineering College, Hsinchu, Taiwan. He was a teaching assistant from 1989 to 1992 and from 1992 to 1993 a research associate in the School of Computer and Information Science, Syracuse University. From 1993 to 1997 he was an Associate Professor in the Department of Electronic Engineering at Hua Fan College of Humanities and Technology, Taipei Hsien, Taiwan. From 1997 to 2004 he was with the Department of Computer Science and Information Engineering at National Chi Nan University, Nantou, Taiwan. He was promoted to Full Professor in 1998. From June to October 2001 he was a visiting scholar in the Department of Electrical Engineering at University of Hawaii at Manoa, HI, and from September 2002 to January 2004 he was the SUPRIA visiting research scholar in the Department of Electrical Engineering and Computer Science and CASE center at Syracuse University, NY. He is now with the Graduate Institute of Communication Engineering at National Taipei University, Taipei, Taiwan. His research interests are in wireless networks, security, and error-control coding. Dr. Han is a winner of 1994 Syracuse University Doctoral Prize. Pramod K. Varshney was born in Allahabad, India on July 1, 1952. He received the B.S. degree in electrical engineering and computer science (with highest honors), and the M.S. and Ph.D. degrees in electrical engineering from the University of Illinois at Urbana-Champaign in 1972, 1974, and 1976 respectively. Since 1976 he has been with Syracuse University, Syracuse, NY where he is currently a Professor of Electrical Engineering and Computer Science and the Research Director of the New York State Center for Advanced Technology in Computer Applications and Software Engineering. His current research interests are in distributed sensor networks and data fusion, detection and estimation theory, wireless communications, intelligent systems, signal and image processing, and remote sensing he has published extensively. He is the author of Distributed Detection and Data Fusion, published by Springer-Verlag in 1997 and has co-edited two other books. Dr. Varshney is a member of Tau Beta Pi and is the recipient of the 1981 ASEE Dow Outstanding Young Faculty Award. He was elected to the grade of Fellow of the IEEE in 1997 for his contributions in the area of distributed detection and data fusion. In 2000, he received the Third Millennium Medal from the IEEE and Chancellor's Citation for exceptional academic achievement at Syracuse University. He serves as a distinguished lecturer for the AES society of the IEEE. He is on the editorial board Information Fusion. He was the President of International Society of Information Fusion during 2001.     

Distributed power allocation and scheduling for parallel channel wireless networks

In this paper we develop distributed approaches for power allocation and scheduling in wireless access networks. We consider a model where users communicate over a set of parallel multi-access fading channels, as in an orthogonal frequency division multiple access (OFDMA) system. At each time, each user must decide which channels to transmit on and how to allocate its power over these channels. We give distributed power allocation and scheduling policies, where each user’s actions depend only on knowledge of their own channel gains. Assuming a collision model for each channel, we characterize an optimal policy which maximizes the system throughput and also give a simpler sub-optimal policy. Both policies are shown to have the optimal scaling behavior in several asymptotic regimes. Xiangping Qin received the B.S. and M.S. degrees in Electrical Engineering from Tsinghua University,China in 1998 and 2000 respectively, and the Ph.D. degree in Electrical Engineering from Northwestern University in 2005. She is currently a senior engineer at Samsung Information Systems America. In 2005/2006, She was a postdoctoral associate in the Department of Electrical and Computer Engineering at Boston University. In 2004, she was an intern on the technical staff of Intel Cooperate Technology Laboratory, Oregon. Her primary research interests include wireless communication and data networks. She is the recipient of aWalter P. Murphy Fellowship for the 2000/2001 academic year from the ECE Department at Northwestern University. Randall A. Berry received the B.S. degree in Electrical Engineering from the University of Missouri-Rolla in 1993 and the M.S. and Ph.D. degrees in Electrical Engineering and Computer Science from the Massachusetts Institute of Technology in 1996 and 2000, respectively. In September 2000, he joined the faculty of Northwestern University, where he is currently an Associate Professor in the Department of Electrical Engineering and Computer Science. In 1998 he was on the technical staff at MIT Lincoln Laboratory in the Advanced Networks Group, where he worked on optical network protocols. His current research interests include wireless communication, data networks and information theory. Dr. Berry is the recipient of a 2003 NSF CAREER award and the 2001-02 best teacher award from the ECE Department at Northwestern. He is currently serving on the editorial board of IEEE Transactions on Wireless Communications and is a guest editor of an upcoming special issue of IEEE Transactions on Information Theory on “Relaying and Cooperation in Networks.”     

An Analog/Digital Baseband Processor Design of a UWB Channelized Receiver for Transmitted Reference Signals

The frequency channelized receiver enables the use of practical analog-to-digital converters (ADC) to digitize ultra-wideband (UWB) signals. The design issues of the analog and digital baseband processor for the channelized receiver in a UWB transmitted reference (TR) system are investigated. In the analog part, the receiver performance is shown to be weakly dependent on the analog filter bandwidth, the filter order, and the ADC oversampling ratio assuming white input noise. In the digital part, the coarse acquisition performance is shown to be significantly better in a channelized receiver than in a fullband receiver. The implementation issues for fine synchronization and correlation window length are also studied. Lei Feng received the B.S. and M.S. degree in electrical engineering from Peking University, Beijing, in 1997 and 2000, respectively. He is currently working toward the Ph.D degree in electrical engineering at University of Southern California, Los Angeles, CA. His doctoral research focuses on the design of wideband communication transceivers for wireless and wireline applications. Won Namgoong received the BS degree in Electrical Engineering and Computer Science from the University of California at Berkeley in 1993, and the MS and Ph.D. degrees in Electrical Engineerig from Stanford University in 1995 and 1999, respectively. In 1999, he joined the faculty of the Electrical Engineering Department at the University of Southern California, where he is an Assistant Professor. His current research areas include wireless/wireline communication systems, signal processing systems, RF circuits, and low-power/high-speed circuits. In 2002, he received the National Science Foundation (NSF) CAREER Award.     

Performance of a burst-frame-based CSMA/CA protocol: Analysis and enhancement

In this paper, we develop an analytical model to evaluate the delay performance of the burst-frame-based CSMA/CA protocol under unsaturated conditions, which has not been fully addressed in the literature. Our delay analysis is unique in that we consider the end-to-end packet delay, which is the duration from the epoch that a packet enters the queue at the MAC layer of the transmitter side to the epoch that the packet is successfully received at the receiver side. The analytical results give excellent agreement with the simulation results, which represents the accuracy of our analytical model. The results also provide important guideline on how to set the parameters of the burst assembly policy. Based on these results, we further develop an efficient adaptive burst assembly policy so as to optimize the throughput and delay performance of the burst-frame-based CSMA/CA protocol. Kejie Lu received the B.E. and M.E. degrees in Telecommunications Engineering from Beijing University of Posts and Telecommunications, Beijing, China, in 1994 and 1997, respectively. He received the Ph.D. degree in Electrical Engineering from the University of Texas at Dallas in 2003. In 2004 and 2005, he was a postdoctoral research associate in the Department of Electrical and Computer Engineering, University of Florida. Currently, he is an assistant professor in the Department of Electrical and Computer Engineering, University of Puerto Rico at Mayagüez. His research interests include architecture and protocols design for computer and communication networks, performance analysis, network security, and wireless communications. Jianfeng Wang received the B.E. and M.E. degrees in electrical engineering from Huazhong University of Science and Technology, China, in 1999 and 2002, respectively, and the Ph.D. degree in electrical engineering from University of Florida in 2006. From January 2006 to July 2006, he was a research intern in wireless standards and technology group, Intel Corporation. In October 2006, he joined Philips Research North America as a senior member research staff in wireless communications and networking department. He is engaged in research and standardization on wireless networks with emphasis on medium access control (MAC). 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. 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, and the Best Paper Award in International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QShine) 2006. Currently, he serves as the Editor-in-Chief of Journal of Advances in Multimedia, and an Associate Editor for IEEE Transactions on Wireless Communications, IEEE Transactions on Circuits and Systems for Video Technology, IEEE Transactions on Vehicular Technology, and International Journal of Ad Hoc and Ubiquitous Computing. He is also a guest-editor for IEEE Journal on Selected Areas in Communications (JSAC), Special Issue on Cross-layer Optimized Wireless Multimedia Communications. He served as Program Chair for IEEE/ACM First International Workshop on Broadband Wireless Services and Applications (BroadWISE 2004); and as a technical program committee member of over 30 conferences. 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 Best Paper Award Committee, Technical Committee on Multimedia Communications, IEEE Communications Society. Yuguang Fang received a Ph.D. degree in Systems Engineering from Case Western Reserve University in January 1994 and a Ph.D. degree in Electrical Engineering from Boston University in May 1997. He was an assistant professor in the Department of Electrical and Computer Engineering at New Jersey Institute of Technology from July 1998 to May 2000. He then joined the Department of Electrical and Computer Engineering at University of Florida in May 2000 as an assistant professor and got an early promotion to an associate professor with tenure in August 2003 and to a full professor in August 2005. He has published over 200 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 has served on several editorial boards of technical journals including IEEE Transactions on Communications, IEEE Transactions on Wireless Communications, IEEE Transactions on Mobile Computing and ACM Wireless Networks. He have also been actively participating in professional conference organizations such as serving as The Steering Committee Co-Chair for QShine, the Technical Program Vice-Chair for IEEE INFOCOM’2005, Technical Program Symposium Co-Chair for IEEE Globecom’2004, and a member of Technical Program Committee for IEEE INFOCOM (1998, 2000, 2003–2007). He is a senior member of the IEEE.