Cooperative diversity schemes for asynchronous wireless networks

We construct cooperative diversity coding schemes that mitigate the effects of symbol asynchronicity among network users. We do so by modifying, at the expense of implementation practicality, the signaling complexity of well behaved existing schemes. The modification allows the same good performance (DMT optimality) in the presence of synchronicity, and almost-surely permits full-diversity gains for any event of symbol asynchronicity. This work was in part carried out while Petros Elia was at the University of Southern California. This research is supported in part by NSF-ITR CCR-0326628.     

Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks

We develop and analyze space-time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another in such a manner that the destination terminal can average the fading, even though it is unknown a priori which terminals will be involved. In particular, a source initiates transmission to its destination, and many relays potentially receive the transmission. Those terminals that can fully decode the transmission utilize a space-time code to cooperatively relay to the destination. We demonstrate that these protocols achieve full spatial diversity in the number of cooperating terminals, not just the number of decoding relays, and can be used effectively for higher spectral efficiencies than repetition-based schemes. We discuss issues related to space-time code design for these protocols, emphasizing codes that readily allow for appealing distributed versions.     

Cooperative communication in wireless networks

Transmit diversity generally requires more than one antenna at the transmitter. However, many wireless devices are limited by size or hardware complexity to one antenna. Recently, a new class of methods called cooperative communication has been proposed that enables single-antenna mobiles in a multi-user environment to share their antennas and generate a virtual multiple-antenna transmitter that allows them to achieve transmit diversity. This article presents an overview of the developments in this burgeoning field.     

Power and rate control with outage constraints in CDMA wireless networks

A radio power control strategy to achieve maximum throughput for the up-link of CDMA wireless systems with variable spreading factor is investigated. The system model includes slow and fast fading, rake receiver, and multi-access interference caused by users with heterogeneous data sources. The quality of the communication is expressed in terms of outage probability, while the throughput is defined as the sum of the users' transmit rates. The outage probability is accounted for by resorting to a lognormal approximation. A mixed integer-real optimization problem P1, where the objective function is the throughput under outage probability constraints, is investigated. Problem P1 is solved in two steps: firstly, we propose a modified problem P2 to provide feasible solutions, and then the optimal solution is obtained with an efficient branch-and-bound search. Numerical results are presented and discussed to assess the validity of our approach.     

Multi-radio diversity in wireless networks

This paper describes the Multi-Radio Diversity (MRD) wireless system, which uses path diversity to improve loss resilience in wireless local area networks (WLANs). MRD coordinates wireless receptions among multiple radios to improve loss resilience in the face of path-dependent frame corruption over the radio. MRD incorporates two techniques to recover from bit errors and lower the loss rates observed by higher layers, without consuming much extra bandwidth. The first technique is frame combining, in which multiple, possibly erroneous, copies of a given frame are combined together in an attempt to recover the frame without retransmission. The second technique is a low-overhead retransmission scheme called request-for-acknowledgment (RFA), which operates above the link layer and below the network layer to attempt to recover from frame combining failures. We present an analysis that determines how the parameters for these algorithms should be chosen. We have designed and implemented MRD as a fully functional WLAN infrastructure based on 802.11a. We evaluate the MRD system under several different physical configurations, using both UDP and TCP, and measured throughput gains up to 3× over single radio communication schemes employing 802.11’s autorate adaptation scheme. Computer and Communication Sciences, EPFL, Switzerland. Allen Miu received his Ph.D. degree at the Massachusetts Institute of Technology in 2006 and is currently a wireless systems architect at Ruckus Wireless, Inc. He received his S.M. in Computer Science from MIT and a B.Sc. with highest honors in Electrical Engineering and Computer Science from the University of California at Berkeley. He previously worked on the Cricket Indoor Location System and was a research intern at Microsoft Research, Redmond in 2000 and Hewlett-Packard Laboratories, Palo Alto in 2002. His research interests include wireless networks, location systems, mobile computing, and embedded systems. Hari Balakrishnan is an Associate Professor in the EECS Department and a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL) at MIT. His research interests is in the area of networked computer systems. In addition to many widely cited papers, several systems developed as part of his research are available in the public domain. He received a Ph.D. in Computer Science from the University of California at Berkeley in 1998 and a B.Tech. from the Indian Institute of Technology (Madras) in 1993. His honors include an Alfred P. Sloan Research Fellowship (2002), an NSF CAREER Award (2000), the ACM doctoral dissertation award for his work on reliable data transport over wireless networks (1998), and seven award-winning papers at various top conferences and journals, including the IEEE Communication Society’s William R. Bennett Prize (2004). He has also received awards for excellence in teaching and research at MIT (Spira, Junior Bose, and Harold Edgerton faculty achievement awards). C. Emre Koksal received his B.S. degree in Electrical Engineering from the Middle East Technical University, Ankara in 1996. He received his S.M. and Ph.D. degrees from MIT in Electrical Engineering and Computer Science in 1998 and 2002 respectively. He was a postdoctoral fellow in the Networks and Mobile Systems Group in the Computer Science and Artificial Intelligence Laboratory at MIT until 2003. Since then he has been a senior researcher jointly in the Laboratory for Computer Communications and the Laboratory for Information Theory at EPFL, Switzerland. His general areas of interest are wireless communications, computer networks, information theory, stochastic processes and financial economics. He also has a certificate on Financial Technology from the Sloan School of Management at MIT.     

Cooperative coding for wireless networks

User cooperation represents an effective way of introducing diversity in wireless networks. Spatial diversity gains are obtained through the cooperative use of antennas belonging to several nodes. We design and analyze the performance of channel codes that are capable of achieving the full diversity provided by user cooperation, with the constraint that they also provide the best possible performance in the interuser link. We show that even though the interuser channel is noisy, the codes provide substantial diversity and coding gains over the noncooperative case.     

Transmission capacity of wireless ad hoc networks with outage constraints

In this paper, upper and lower bounds on the transmission capacity of spread-spectrum (SS) wireless ad hoc networks are derived. We define transmission capacity as the product of the maximum density of successful transmissions multiplied by their data rate, given an outage constraint. Assuming that the nodes are randomly distributed in space according to a Poisson point process, we derive upper and lower bounds for frequency hopping (FH-CDMA) and direct sequence (DS-CDMA) SS networks, which incorporate traditional modulation types (no spreading) as a special case. These bounds cleanly summarize how ad hoc network capacity is affected by the outage probability, spreading factor, transmission power, target signal-to-noise ratio (SNR), and other system parameters. Using these bounds, it can be shown that FH-CDMA obtains a higher transmission capacity than DS-CDMA on the order of M/sup 1-2//spl alpha//, where M is the spreading factor and /spl alpha/>2 is the path loss exponent. A tangential contribution is an (apparently) novel technique for obtaining tight bounds on tail probabilities of additive functionals of homogeneous Poisson point processes.     

MAC protocols for wireless sensor networks: a survey

Wireless sensor networks are appealing to researchers due to their wide range of application potential in areas such as target detection and tracking, environmental monitoring, industrial process monitoring, and tactical systems. However, low sensing ranges result in dense networks and thus it becomes necessary to achieve an efficient medium-access protocol subject to power constraints. Various medium-access control (MAC) protocols with different objectives have been proposed for wireless sensor networks. In this article, we first outline the sensor network properties that are crucial for the design of MAC layer protocols. Then, we describe several MAC protocols proposed for sensor networks, emphasizing their strengths and weaknesses. Finally, we point out open research issues with regard to MAC layer design.     

Power-aware routing protocols in ad hoc wireless networks

An ad hoc wireless network has no fixed networking infrastructure. It consists of multiple, possibly mobile, nodes that maintain network connectivity through wireless communications. Such a network has practical applications in areas where it may not be economically practical or physically possible to provide a conventional networking infrastructure. The nodes in an ad hoc wireless network are typically powered by batteries with a limited energy supply. One of the most important and challenging issues in ad hoc wireless networks is how to conserve energy, maximizing the lifetime of its nodes and thus of the network itself. Since routing is an essential function in these networks, developing power-aware routing protocols for ad hoc wireless networks has been an intensive research area in recent years. As a result, many power-aware routing protocols have been proposed from a variety of perspectives. This article surveys the current state of power-aware routing protocols in ad hoc wireless networks.     

Link-layer-and-above diversity in multihop wireless networks

The instability of wireless channels was a haunting issue in communications until recent exploration in utilizing variation. The same transmission might present significantly, and usually independently, different reception quality when broadcast to receivers at different locations. In addition, the same stationary receiver might experience drastic fluctuation over time as well. The combination of link-quality variation with the broadcasting nature of the wireless channel itself disclosed a direction in the research of wireless networking, namely, the utilization of diversity. In this article, we summarize the causes of channel diversity in wireless communications, and how it is perceived in different layers of multihop wireless networks. To promote new research innovations in this area, we concentrate on link-layer diversity and speculate on the challenges and potential of diversity schemes at the network layer.     

Towards benchmarking routing protocols in wireless mesh networks

Wireless mesh networks (WMNs) establish a new, quick and low-cost alternative to provide communications when deploying a fixed infrastructure that could result prohibitive in terms of either time or money. During last years, the specification of multi-hop routing protocols for WMNs has been promoted, leading to their recent exploitation in commercial solutions. The selection of routing protocols for integration in WMNs requires the evaluation, comparison and ranking of eligible candidates according to a representative set of meaningful measures. In this context, the development of suitable experimental techniques to balance different features of each protocol is an essential requirement. This paper copes with this challenging task by proposing a benchmarking methodology to experimentally evaluate and compare the behaviour of these protocols. The feasibility of the proposed approach is illustrated through a simple but real (non-simulated) case study and reflects to what extent this methodology can be useful in increasing our knowledge on how real WMNs behave in practice.     

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.     

Cooperative space-time coding for wireless networks

We consider a cooperative transmission scheme in which the collaborating nodes may have multiple antennas. We present the performance analysis and design of space-time codes that are capable of achieving the full diversity provided by user cooperation. Our codes use the principle of overlays in time and space, and ensure that cooperation takes place as often as possible. We show how cooperation among nodes with different numbers of antennas can be accomplished, and how the quality of the interuser link affects the cooperative performance. We illustrate that space-time cooperation can greatly reduce the error rates of all the nodes involved, even for poor interuser channel quality.     

Cooperative multihop broadcast for wireless networks

We address the minimum-energy broadcast problem under the assumption that nodes beyond the nominal range of a transmitter can collect the energy of unreliably received overheard signals. As a message is forwarded through the network, a node will have multiple opportunities to reliably receive the message by collecting energy during each retransmission. We refer to this cooperative strategy as accumulative broadcast. We seek to employ accumulative broadcast in a large scale loosely synchronized, low-power network. Therefore, we focus on distributed network layer approaches for accumulative broadcast in which loosely synchronized nodes use only local information. To further simplify the system architecture, we assume that nodes forward only reliably decoded messages. Under these assumptions, we formulate the minimum-energy accumulative broadcast problem. We present a solution employing two subproblems. First, we identify the ordering in which nodes should transmit. Second, we determine the optimum power levels for that ordering. While the second subproblem can be solved by means of linear programming, the ordering subproblem is found to be NP-complete. We devise a heuristic algorithm to find a good ordering. Simulation results show the performance of the algorithm to be close to optimum and a significant improvement over the well known BIP algorithm for constructing energy-efficient broadcast trees. We then formulate a distributed version of the accumulative broadcast algorithm that uses only local information at the nodes and has performance close to its centralized counterpart.     

Handovers in wireless ATM networks: in-band signaling protocols andperformance analysis

The first part of this paper presents a novel scheme for handover provisioning in wireless asynchronous transfer mode (W-ATM) networks based on in-band signaling. First, the network architecture and principles of in-band signaling are described, discussing advantages and interaction with other procedures and signaling techniques. Then, loss-free protocols for the handover procedures are presented and compared with existing proposals. The second part of the paper is devoted to performance analysis of the handover procedures. A general methodology for evaluating handover delays and required buffer capacity is introduced and exemplified for one of the protocols introduced before. Numerical results give insight into the handover procedure characteristics and are compared with estimates provided by detailed discrete event simulations for validation purposes. Finally, additional simulation results are presented for parallel, concurrent handovers, evaluating the requirements posed to the network by different handover procedures     

下一代无线IP移动通信网中的IP微移动性协议

与Internet无缝连接和IP基的移动性是下一代移动通信网的重要特点。为了减少移动IP中的时延和信令开销，减少包丢失，提出了支持快速、 可靠切换和IP寻呼（IP paging)的IP微移动性（micro-mobility)协议。本文研究了提交到IETF移动IP工作组（MIP WG)的几种关键IP微移动性协议，分析了协议的动机、特点，比较了性能、信令复杂度和实用性，给出了可能的优化途径。     

On optimum selection relaying protocols in cooperative wireless networks

In this letter, the outage probabilities of selection relaying protocols are analyzed and compared for cooperative wireless networks. It is assumed that both source and relay use equal allocated time in transmission. Depending on the quality of the source-relay channel, the relay may choose either Decode-and-Forward (DF), Amplify-and-Forward (AF), or Direct-Transmission (DT) to forward signals. It turns out that in terms of outage probability, two selection relaying schemes are better than others: selecting between DF and AF protocols (DF-AF) or selecting between DF and DT protocols (DF-DT). It is shown that with an equal power allocation, both of the DF-AF and DF-DT selection relaying protocols have the same asymptotic outage probability. However, with an optimum power allocation strategy, the DF-AF selection scheme is in general better than the DF-DT selection scheme. Note that the optimum power allocations depend on channel variances, not on instantaneous channel gains. When the quality of the relay-destination link is much better than that of the source-relay link, observed from simulation, the outage probability of the DF-AF selection protocol with its optimum power allocation is 1.5dB better than that of the DF-DT selection with its own optimum power allocation. Extensive simulations are presented to validate the analytical results.     

EMS: Efficient mobile sink scheduling in wireless sensor networks

Sink scheduling, in the form of scheduling multiple sinks among the available sink sites to relieve the level of traffic burden, is shown to be a promising scheme in wireless sensor networks (WSNs). However, the problem of maximizing the network lifetime via sink scheduling remains quite a challenge since routing issues are tightly coupled. Previous approaches on this topic either suffer from poor performance due to a lack of joint considerations, or are based on relaxed constraints. Therefore, in this paper, we aim to fill in the research blanks. First, we develop a novel notation Placement Pattern (PP) to bound time-varying routes with the placement of sinks. This bounding technique transforms the problem from time domain into pattern domain, and thus, significantly decreases the problem complexity. Then, we formulate this optimization in a pattern-based way and create an efficient Column Generation (CG) based approach to solve it. Simulations not only demonstrate the efficiency of the proposed algorithm but also substantiate the importance of sink mobility for energy-constrained WSNs.