Distributed cross-layer coordination of congestion control and resource allocation in S-TDMA wireless networks

We consider the problem of joint congestion control and resource allocation in spatial-TDMA wireless networks. The design problem is posed as a utility maximization problem subject to link rate constraints which involve both transmission scheduling and power allocation. Starting from the performance limitations of a centralized optimization based on global network information, we proceed systematically in our development of two distributed and transparent protocols that rely on local information only. In the process, we introduce a novel decomposition method for convex optimization, establish its convergence for the utility maximization problem, and demonstrate how it suggests a distributed solution based on TCP/AQM and incremental updates of the transmission schedule. We develop a two-step procedure for finding the schedule updates and suggest two schemes for distributed link scheduling and power control under realistic interference models. Although the final protocols are suboptimal, we isolate and quantify the performance losses incurred by each simplification and demonstrate strong performance in examples.

Joint scheduling and power control supporting multicasting in wireless ad hoc networks

This paper addresses the problem of power control in a multihop wireless network supporting multicast traffic. We face the problem of forwarding packet traffic to multicast group members while meeting constraints on the signal-to-interference-plus-noise ratio (SINR) at the intended receivers. First, we present a distributed algorithm which, given the set of multicast senders and their corresponding receivers, provides an optimal solution when it exists, which minimizes the total transmit power. When no optimal solution can be found for the given set of multicast senders and receivers, we introduce a distributed, joint scheduling and power control algorithm which eliminates the weak connections and tries to maximize the number of successful multicast transmissions. The algorithm allows the other senders to solve the power control problem and minimize the total transmit power. We show that our distributed algorithm converges to the optimal solution when it exists, and performs close to centralized, heuristic algorithms that have been proposed to address the joint scheduling and power control problem.     

Dynamic spectrum allocation in heterogeneous wireless networks under interference constraints across the cell coverage

In order to improve spectrum utilization, dynamic spectrum allocation (DSA) schemes with interference management have been widely investigated, and a special interest is in the current heterogeneous wireless network (HWN) environment. In the previous work, the approach that guarantees quality of service for the cell‐boundary user is extensively used in the DSA scheme. However, such approach gives a pessimistic result. In this paper, we design a DSA scheme for the HWN system, which adopts relatively accurate interference constraints. First, considering that users may randomly locate over the cell, we propose interference constraints across the cell coverage, in which the interference experienced at a point is controlled below the level suffered when using fixed spectrum allocation in only a single network, and the proportion of the cell area where interference is controlled reaches the required area coverage probability. Then under the interference constraints, we formulate the downlink DSA scheme as a combinatorial optimization problem. As the problem is NP‐hard, to reduce the computational complexity, we propose two greedy heuristic algorithms for its solution. Simulation results show that the DSA scheme could improve the total spectrum utility for operators and increase the satisfaction rate of spectrum demands for base stations. Copyright © 2013 John Wiley & Sons, Ltd.     

自适应的认知无线Mesh网络QoS约束的路由与频谱分配算法

提出了一种自适应的满足QoS约束的路由与频谱分配(SA2JR)算法,SA2JR的目标是:在满足无线业务QoS约束的情况下,最大化无线业务接受率,让尽可能多的无线业务需求能够被满足.SA2JR包括2个部分,按需的κ-路径路由(κ-Routing)算法,以及QoS驱动的频谱分配(QDSA)算法.κ-Routing负责为每一个需求产生κ条潜在路由路径,QDSA算法自适应地进行频谱分配,目标是从κ-Routing产生的κ条潜在路由路径中找出一条满足QoS约束的可行路由路径.仿真结果表明SA2JR能达到预定目标,获得了较高的无线业务接受率.     

一种面向无线传感器网络的分布式定位算法

针对无线传感器网络(WSN)的水下应用,在原有同类算法研究的基础上,提出了一种分布式无信标节点的相对定位算法。该算法结合了最高节点度分簇算法和经典度量多维尺度定位的理论。理论分析和仿真实验表明,与SDGPSN定位算法相比,该定位算法提高了约10%的定位精度。     

Distributed topology control of wireless networks

We propose and analyaze a distributed control law that will maintain prescribed local properties of a wireless ad hoc network in the presence of node mobility, MAC layer power control and link fades. The control law uses a simple and intuitive power adaptation mechanism. We consider as an example the topology requirement of maintaining the out-degrees of each node at prescribed values and keeping the in-degree close to the out-degree. The topology objective is achieved by adapting the transmission power based only on local information. This power adaptation algorithm is analyzed using the o.d.e. approach to stochastic approximation. Simulation results verify the analysis and demonstrate its effectiveness. We also study the ability of the proposed objective to maintain connectivity. Although many heuristics are described in the literature to maintain local topological properties, the algorithm proposed in this paper is the first one that has proven convergence properties. Vivek S. Borkar got his B. Tech. (Elec. Engg.) from Indian Institute of Technology, Mumbai, in 1976, M. S. (Systems and Control) from Case Western Reserve Uni. in 1977 and Ph.D. (Elec. Engg. and Comp. Sci.) from Uni. of California, Berkeley. He was with Uni. of Twente (1980–81), TIFR Centre, Bangalore (1982–89), Indian Inst. of Science (1989–99), and has been with School of Technology and Computer Science, Tata Inst. of Fundamental Research, Mumbai, since April 1999. His research interests include stochastic optimization and applications. D. Manjunath received his B.E. from Mysore University, M.S. from Indian Institute of Technology, Madras and Ph.D. from Rensselaer Polytechnic Inst, Troy NY in 1986, 1989 and 1993 respectively. He has been a summer intern in the Corporate R & D Center of GE (1990), a visiting faculty in the Computer and Information Sciences Dept. of the University of Delaware (1992-93), a post doctoral fellow in the Computer Science Dept. of the University of Toronto (1993–84) and on the Electrical Engineering faculty of the Indian Inst. of Technology, Kanpur (1994–98).He has been with the Elec Enggg. Dept. of Indian Inst. of Technology, Bombay in Mumbai since July 1998 where he is now an Associate Professor. His research interests are in the areas of communication networks, performance analysis of systems, queueing systems and multimedia communications.     

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.”     

FP-MAC: A distributed MAC algorithm for 802.15.4-like wireless sensor networks

In this paper we focus on the problems of high latency and low throughput arising from the periodic operation of MAC protocols for wireless sensor networks. In order to meet both design criteria we propose an energy-efficient, low delay, fast-periodic MAC algorithm, namely FP-MAC, that is exclusively designed for 802.15.4-like networks utilizing in full the standard’s physical layer. Our proposal relies on the short periodic communication operation of the nodes comprising the WSN. This is achieved by decreasing the actions that a node needs to perform at the start of every communication period and by incorporating a variable radio-on operation. Moreover, the algorithm introduces differences in nodes’ scheduling to further reduce delay. Local synchronization and the crucial task of determining the proper timing for transmission and reception of data is achieved through the periodic broadcast of special synchronization frames at the beginning of each on-period. FP-MAC is evaluated and compared to S-MAC and T-MAC through extensive simulations, showing a significant improvement in terms of low energy consumption and average MAC delay.     

A wireless multimedia transmission control algorithm over heterogeneous IP networks

In this paper,an algorithm Wireless Multimedia Transmission Control(WMTC) is proposed for multimedia transmission control over wired-wireless networks.The relationship between packet length and packet loss rate in the Gilbert wireless error model is investigated.Furthermore,the algorithm can detect the nature of packet losses by sending large and small packets alternately,and control the sending rate of nodes.In addition,by means of updating factor K,this algorithm can adapt to the changes of network states...     

Spatial channel reuse in wireless sensor networks

Wireless sensor networks (WSN) are formed by network-enabled sensors spatially randomly distributed over an area. Because the number of nodes in the WSNs is usually large, channel reuse must be applied, keeping co-channel nodes sufficiently separated geographically to achieve satisfactory SIR level. The most efficient channel reuse configuration for WSN has been determined and the worst-interference scenario has been identified. For this channel reuse pattern and worst-case scenario, the minimum co-channel separation distance consistent with an SIR level constraint is derived. Our results show that the two-hop co-channel separations often assumed for sensor and ad hoc networks are not sufficient to guarantee communications. Minimum co-channel separation curves given various parameters are also presented. The results in this paper provide theoretical basis for channel spatial reuse and medium access control for WSN s and also serve as a guideline for how channel assignment algorithms should allocate channels. Furthermore, because the derived co-channel separation is a function of the sensor transmission radius, it also provides a connection between network data transport capacity planning and network topology control which is administered by varying transmission powers. Xiaofei Wang is born on July 31st, 1974, in Jilin, People’s Republic of China. He received the M.S. degree in Electrical Engineering from Delft University of Technology, Delft, The Netherlands in 1992, and the Ph.D. degree in Electrical and Computer Engineering from Cornell University, Ithaca, New York in 2005. From 1997 to 1998, he was selected as one of the twenty best master graduate candidates in all fields to participate in the Japan Prizewinners Programme, an international leadership exchange program established by the Dutch Ministry of Culture, Science and Education. From 1998 to 1999, he worked as a researcher at the Department of Electrical Engineering and Applied Mathematics of Delft University of Technology in the areas of Secondary Surveillance Radar and Ground Penetrating Radar. His research interests include wireless sensor networks, wireless mesh networks, wireless networking, error control coding, communication theory and information theory. He is currently working at Qualcomm Incorporated in San Diego, CA. Toby Berger was born in New York, NY on September 4, 1940. He received the B.E. degree in electrical engineering from Yale University, New Haven, CT in 1962, and the M.S. and Ph.D. degrees in applied mathematics from Harvard University, Cambridge, MA in 1964 and 1966, respectively. From 1962 to 1968 he was a Senior Scientist at Raytheon Company, Wayland, MA. From 1968 through 2005 he he held the position of Irwin and Joan Jacobs Professor of Engineering at Cornell University, Ithaca, NY where in 2006 he became a professor in the ECE Deportment of the University of Virginia, Charlottesville, VA. Professor Berger’s research interests include information theory, random fields, communication networks, wireless communications, video compression, voice and signature compression and verification, neuroinformation theory, quantum information theory, and coherent signal processing. Berger has served as editor-in-chief of the IEEE Transactions on Information Theory and as president of the IEEE Information Theory Group. He has been a Fellow of the Guggenheim Foundation, the Japan Society for Promotion of Science, the Ministry of Education of the People’s Republic of China and the Fulbright Foundation. In 1982 he received the Frederick E. Terman Award of the American Society for Engineering Education, he received the 2002 Shannon Award from the IEEE Information Theory Society and has been designated the recipient of the IEEE 2006 Leon K. Kirchmayer Graduate Teaching Award. Berger is a Fellow and Life Member of the IEEE, a life member of Tau Beta Pi, and an avid blues harmonica player.     

Implicit hop-by-hop congestion control in wireless multihop networks

It has been shown that TCP and TCP-like congestion control are highly problematic in wireless multihop networks. In this paper we present a novel hop-by-hop congestion control protocol that has been tailored to the specific properties of the shared medium. In the proposed scheme, backpressure towards the source node is established implicitly, by passively observing the medium. A lightweight error detection and correction mechanism guarantees a fast reaction to changing medium conditions and low overhead. Our approach is equally applicable to TCP- and UDP-like data streams. We demonstrate the performance of our approach by an in-depth simulation study. These findings are underlined by testbed results obtained using an implementation of our protocol on real hardware.     

Integrated power and handoff control for next generation wireless networks

In this paper, joint downlink power control and handoff design is formulated as optimization problems that are amenable to dynamic programming (DP). Based on the DP solutions which are impractical, two new algorithms suitable for next generation wireless networks are proposed. The first one is an integrated hard handoff/power control scheme that endeavors a tradeoff between three performance criteria: transmitted power, number of handoffs, and call quality. The second is a soft handoff/power control algorithm that also takes into account the additional cost of utilizing soft handoff. The proposed algorithms present a paradigm shift in integrated handoff/power control by capturing the tradeoff between user satisfaction and network overhead, therefore enjoy the advantages of joint resource allocation, and provide significant improvement over existing methods. The achievable gains and the tradeoffs in both algorithms are verified through simulations.

Joint route selection and resource allocation in multihop wireless networks based on a game theoretic approach

In this work we aim to design simple, distributed self-configuring solutions for the problem of route selection and channel and power allocation in multihop autonomous wireless systems using a game theoretic perspective. We propose and compare three games with different levels of complexity: a potential flow game where players need complete network knowledge, a local flow game requiring full information of the flow and a low complexity cooperative link game which works with partial information of the flow. All these games have been designed to always assure the convergence to a stable point in order to be implemented as distributed algorithms. To evaluate their quality, we also obtain the best achievable performance in the system using mathematical optimization. The system is modeled with the physical interference model and two different definitions of the network utility are considered: the number of active flows and the aggregated capacity in bps. Results show that the proposed games approach the centralized solution, and specially, that the simpler cooperative link game provides a performance close to that of the flow games.     

Transmission power control and scheduling algorithm in wireless body area networks

Wireless body area networks(WBAN)were expecting to play an essential role for healthcare,sports,leisure,and all the aspect of our daily life.The purpose was to solve two key issues of WBAN.The first issue was which sensor should transmit during each time slot in order to maximize the lifetime as well as maintaining fairness performance.The second issue was which transmit power level should be chosen for the purpose of energy saving without degrading reliability.For the first problem,a distributed scheduling algorithm was proposed to balance lifetime and fairness for WBAN.For the second issue,a modified transmission power control algorithm was presented to adjust transmit power adaptively.Simulation results are presented to demonstrated efficacy of the proposed algorithm.     

Distributed power control over multiple channels for ad hoc wireless networks

In this paper, we investigate the deficiency of uncontrolled asymmetrical transmission power over multiple channels in ad hoc environments. We further propose a novel distributed transmission power control protocol called the distributed power level (DPL) protocol for multi‐channel ad hoc networks without requiring clock synchronization. Specifically, different transmission power levels are assigned to different channels, and nodes search for an idle channel on the basis of the received power so that the maximum allowable power of the preferred data channel is larger than or equal to the received power. If the most preferred channel of the least maximum power is busy, the nodes are able to select the next channel and so forth. As a result, interference is reduced over channels because the nodes that require higher transmission power are separated from interfering with the nodes that require lower transmission power. Two transmission power control modes are introduced for DPL: symmetrical and asymmetrical. For the symmetrical DPL protocol (mode), nodes transmit at the same power level assigned to the selected channel. On the other hand, for the asymmetrical DPL protocol, nodes are allowed to transmit at a lower or equal power level that is assigned to the selected channel. Extensive ns‐2‐based simulation results are presented to demonstrate that the proposed protocols can enhance the network throughput compared with the existing uncontrolled asymmetrical transmission power protocol. Copyright © 2012 John Wiley & Sons, Ltd.     

Data processing and communication strategies for lifetime optimization in wireless sensor networks

In this paper we introduced a novel Linear Programming framework to model sensor network lifetime when data reduction through compression is utilized. Comparative analysis of three data compression and forwarding strategies show that neither data compression nor flow balancing can achieve the maximal possible sensor network lifetime when optimized independently. The comparisons reveal that jointly optimizing data compression and load balancing results in up to an order of magnitude longer network lifetimes than non-optimized data compression and load balancing.     

A power controlled interference aware routing protocol for dense multi-hop wireless networks

A key issue impacting the performance of multi-hop wireless networks is the interference among neighboring nodes. In this paper, we propose a novel and practical interference aware metric, termed as Network Allocation Vector Count (NAVC), to estimate the effects of the interference on the average delay and the available bandwidth. This metric can be easily applied to routing protocols designed for 802.11 based multi-hop networks with no modification to the current 802.11 protocol. The design of NAVC as a metric for the AODV [32] routing protocol, as well as a metric for transmit power control, are described in detail. Our simulation results reveal that the NAVC-driven AODV can greatly improve its performance compared to those protocols based on hop-count. For scenarios of densely deployed nodes, the throughput improvement is often a factor near two, indicating that NAVC is more useful as networks grow denser. Moreover, the network lifetime can be notably prolonged when the NAVC is employed to conduct transmit power control. Our approach is essential for emerging applications such as wireless sensor networks where the interference is heavy and the energy is severely constrained.     

Spectrally efficient communication for wireless sensor networks using a cooperative MIMO technique

The multi-input multi-output (MIMO) communication framework is adopted for wireless sensor networks by having multiple sensors equipped with single-element antennas cooperate in transmission. A power method-based iterative algorithm is developed that computes the optimal transmit and receive eigen-filters distributively among the sensors while transferring most of the computational burden to the central collector node. Since the proposed algorithm implicitly exploits the channel state information (CSI) both at the receiver and the transmitter, it is expected that the resulting spectral efficiency is higher than what can be achieved by receive CSI-only space-time coding. This intuition is confirmed by employing a variable-rate adaptive modulation scheme for the eigen-transmission and comparing its spectral efficiency with that of orthogonal space time block codes (OSTBCs) at specific target bit error rates. The performance is also evaluated using realistic channel estimation as well as the least mean square (LMS) and recursive least square (RLS) algorithms for iterative eigencoding. This material is based upon work supported by the Air Force Office of Scientific Research under Award No. FA9550-04-C-0074 and Toyon Research Corporation Subcontract No. SC6431-1. Seung-Jun Kim received B.S. and M.S. from Seoul National University in 1996 and 1998, respectively, and Ph.D. from University of California, Santa Barbara in 2005, all in electrical engineering. From 1998 to 2000, he served as a Korea Overseas Volunteer at Chiang Rai Teachers College in Chiang Rai, Thailand. Since 2005, he has been with NEC Laboratories America in Princeton, NJ. His research interests lie in detection/estimation theory, spread-spectrum communications, multiple antenna techniques and cross-layer design. Richard E. Cagley received the B.S. degree in engineering from Harvey Mudd College, Claremont, CA in 1997 and the M.S. and Ph.D. degrees in electrical engineering from the University of California, Santa Barbara in 1999 and 2003 respectively. Dr. Cagley currently holds a position with Toyon Research Corporation, Goleta, CA. Prior to joining Toyon, he held positions with Fujant Incorporated, Jet Propulsion Laboratories, and Qualcomm Corporation. His general research interests are in the areas of physical and MAC layer design for wireless communication. This includes multiuser detection, interference cancellation, space-time processing, spectrum management, and digital receiver design. Ronald A. Iltis received the B.A. (Biophysics) from The Johns Hopkins University in 1978, the M.Sc in Engineering from Brown University in 1980, and the Ph.D. in Electrical Engineering from the University of California, San Diego in 1984. Since 1984, he has been with the University of California, Santa Barbara, where he is currently a Professor in the Department of Electrical and Computer Engineering. His current research interests are in CDMA, software radio, radiolocation, and nonlinear estimation. He has also served as a consultant to government and private industry in the areas of adaptive arrays, neural networks and spread-spectrum communications. Dr. Iltis was previously an Editor for the IEEE Transactions on Communications. In 1990 he received the Fred W. Ellersick award for best paper at the IEEE MILCOM conference.     

蜂窝通信网络中的分布式无线信道分配方法

文中提出了一种适用于蜂窝通信网的分布式无线信道分配方法。当网络部署环境中出现干扰后,终端用户通过控制信道,发送反馈信息至基站;基站接收到反馈信息后,对可用信道进行扫频,利用广播帧通知受干扰的终端用户可用信道信息;然后终端用户收到基站发送的广播帧后,根据优先级机制,选择新的信道重新建立与基站的通信,当蜂窝通信网中终端用户受外部干扰而信道中断后,该方法可减少终端用户和基站之间信令的开销。     

Utility-based uplink joint power and subcarrier allocation in SC-FDMA wireless networks

In this letter, the problem of optimal joint uplink power and subcarrier allocation in single-carrier frequency-division multiple access wireless networks with real-time services is addressed, via the introduction and adoption of a utility-based framework. A joint optimisation power and subcarrier allocation problem is formulated and the optimal power allocation is determined, while an iterative algorithm to realise the joint allocation is presented. Finally, numerical results are provided that demonstrate the effectiveness of the proposed approach in terms of power savings and user satisfaction.