分布式队列服务算法在无线网状网包调度中的应用

根据无线网状网的包调度特点,结合已有的差分队列服务算法和分布式贝尔曼-福特算 法,将有线网络中的差分队列服务算法改进为分布式队列服务算法（DQS）,使之实用于无 线网状网中多任务条件下实现系统的吞吐量最大化。仿真实验证明了DQS算法能有效地避免 传统多径传输中的按“类”或 “流”来进行调度的缺陷,有效地减少了数据包的端到端 延时和缓冲区需求,尤其是DQS算法的实际平均吞吐量性能有了很大的提高。     

Joint optimal power control and beamforming in wireless networksusing antenna arrays

The interference reduction capability of antenna arrays and the power control algorithms have been considered separately as means to increase the capacity in wireless communication networks. The minimum variance distortionless response beamformer maximizes the signal-to-interference-and-noise ratio (SINR) when it is employed in the receiver of a wireless link. In a system with omnidirectional antennas, power control algorithms are used to maximize the SINR as well. We consider a system with beamforming capabilities in the receiver, and power control. An iterative algorithm is proposed to jointly update the transmission powers and the beamformer weights so that it converges to the jointly optimal beamforming and transmission power vector. The algorithm is distributed and uses only local interference measurements. In an uplink transmission scenario, it is shown how base assignment can be incorporated in addition to beamforming and power control, such that a globally optimum solution is obtained. The network capacity and the saving in mobile power are evaluated through numerical study     

Supporting network management through distributed directory service

Directory systems have become a field of interest within the context of open systems. This is due to the various requirements raised by the scale of currently interconnected networks. The paper addresses several issues related to applying the X.500 directory service to network management. These include a comparison between the management information base (MIB) for management systems and the directory information base (DIB) for the directory services, a specification of how certain management information is incorporated into the underlying data model of the directory and an information exchange model for ensuring information accessibility to management activities. Some interesting benefits can be realized through integrating the X.500 directory into management systems. A concrete example of using a distributed directory service (DDS) in management illustrates the proposal     

Supporting service differentiation for real-time and best-effort traffic in stateless wireless ad hoc networks (SWAN)

We propose SWAN, a stateless network model which uses distributed control algorithms to deliver service differentiation in mobile wireless ad hoc networks in a simple, scalable and robust manner. The proposed architecture is designed to handle both real-time UDP traffic, and best effort UDP and TCP traffic without the need for the introduction and management of per-flow state information in the network. SWAN supports per-hop and end-to-end control algorithms that primarily rely on the efficient operation of TC/IP protocols. In particular, SWAN uses local rate control for best-effort traffic, and sender-based admission control for real-time UDP traffic. Explicit congestion notification (ECN) is used to dynamically regulate admitted real-time sessions in the face of network dynamics brought on by mobility or traffic overload conditions. SWAN does not require the support of a QoS-capable MAC to deliver service differentiation. Rather, real-time services are built using existing best effort wireless MAC technology. Simulation, analysis, and results from an experimental wireless testbed show that real-time applications experience low and stable delays under various multihop, traffic, and mobility conditions.     

Performance evaluation of packet aggregation scheme for VoIP service in wireless multi-hop network

In a wireless multi-hop network environment, energy consumption of mobile nodes is an important factor for the performance evaluation of network life-time. In Voice over IP (VoIP) service, the redundant data size of a VoIP packet such as TCP/IP headers is much larger than the voice data size of a VoIP packet. Such an inefficient structure of VoIP packet causes heavy energy waste in mobile nodes. In order to alleviate the effect of VoIP packet transmission on energy consumption, a packet aggregation algorithm that transmits one large VoIP packet by combining multiple small VoIP packets has been studied. However, when excessively many VoIP packets are combined, it may cause deterioration of the QoS of VoIP service, especially for end-to-end delay. In this paper, we analyze the effect of the packet aggregation algorithm on both VoIP service quality and the energy consumption of mobile nodes in a wireless multi-hop environment. We build the cost function that describes the degree of trade-off between the QoS of VoIP services and the energy consumption of a mobile node. By using this cost function, we get the optimum number of VoIP packets to be combined in the packet aggregation scheme under various wireless channel conditions. We expect this study to contribute to providing guidance on balancing the QoS of VoIP service and energy consumption of a mobile node when the packet aggregation algorithm is applied to VoIP service in a wireless multi-hop networks.     

On distributed power control in full duplex wireless networks

In this paper, we first consider the problem of distributed power control in a Full Duplex (FD) wireless network consisting of multiple pairs of nodes, within which each node needs to communicate with its corresponding node. We aim to find the optimal transmition power for the FD transmitters such that the network-wide capacity is maximized. Based on the high Signal-to-Interference-Plus-Noise Ratio (SINR) approximation and a more general approximation method for logarithm functions, we develop effective distributed power control algorithms with the dual decomposition approach. We also extend the work to the general FD network scenario, which can be decomposed into subproblems of isolated nodes, paths, and cycles. The corresponding power control problem is then be solved with the distributed algorithm. The proposed algorithms are validated with simulation studies.     

A distributed control strategy for wireless ATM networks

Cellular networks are expected to be upgraded to offer Personal Communication Services (PCS). The mobility management and wireless call control approach used in cellular networks are currently being proposed for use in PCS networks. Recent work indicates that both the signaling load and database update rates caused by these mobility management and call control procedures will increase significantly in next generation PCS networks. In this paper, we propose and analyze a new cluster-based architecture and define algorithms to effectively handle mobility management and call control functions for PCS. We assume an ATM network infrastructure. Some of the key aspects of our proposal include simplifying the mobile location and tracking function, performing connection setup in segments, eliminating the need for user service profile downloads between networks, and more efficient routing of connections by removing the need for an anchor switch. Advantages of this approach include a reduction in signaling traffic load, improved call/connection setup delays, and more efficient routing of connections. We carry out an analysis of our solution for high-tier PCS applications.     

QOS distributed routing protocol for mobile ad-hoc wireless networks using intelligent packet carrying systems

The wireless network should provide high throughput and positive status and this paper suggest a system that supports real-time communications with excellence of service necessities for application based on wireless communications. In addition a hybrid network that interconnects both mobile networks and wireless networks. By inheriting the features of Solid Rocket Booster technology for mobile and wireless networks the race condition, and invalid condition problem has been solved. The number of packets received may vary based on the parameter like mobility, energy, memory, bandwidth, jamming and other parameter. In past years many algorithm has been proposed for increasing the probability of packet delivery but it’s still a challenge. This paper uses an algorithm called intelligent packet carrying systems; it provides a tracking mechanism that tracks nodes in rural places. The effectives and reability has been calculated and the results are obtained using OPNET simulator.     

Spectrum resource allocation for wireless packet access withapplication to advanced cellular Internet service

The advanced cellular Internet service (ACIS) is targeted for applications such as Web browsing with a peak downlink transmission rate on the order of 1-2 Mbits/s using a wide-area cellular infrastructure. In order to provide bandwidth on demand using scarce radio spectrum, the medium-access control (MAC) protocol must: 1) handle dynamic and diverse traffic with high throughput, and 2) efficiently reuse limited spectrum with high peak rates and good quality. Most of the existing approaches do not sufficiently address the second aspect. This paper proposes a dynamic packet assignment (DPA) scheme which, without coordinating base stations, allocates spectrum on demand with no collisions and low interference to provide high downlink throughput. Interference sensing and priority ordering are employed to reduce interference probability. A staggered frame assignment schedule is also proposed to prevent adjacent base stations from allocating the same channel to multiple mobiles at the same time. Simulation results based on a packet data traffic model derived from wide-area network traffic statistics, which exhibit a “self-similar” property when aggregating multiple sources, confirm that this method is able to reuse spectrum efficiently in a large cellular system having many users with short active periods. Distributed iterative power control further enhances spectrum efficiency such that the same channel can be simultaneously reused in every base station     

分布式无线通信系统中的主从协同功控

分布式无线通信系统通过多个基站与移动台协作通信有效地提高了系统的容量和覆盖范围。然而传统的功率控制算法并不适用于移动台同时接收多个基站信号的情况。本文提出了一种基于适用多小区结构的主从协同功控算法。该算法把为移动台服务的基站分为主基站和从基站,各从基站以主基站分配的功率为参考值分配功率,可使整个覆盖区域内的所有移动台达到平衡的信干比,且可适用于任意拓扑结构的,使用全向天线或定向天线的分布式无线通信系统,并可以采用低复杂度和开销的分布式算法实现。仿真结果表明,在不同环境中,与现有的分布式系统中功控算法相比,新算法可以显著地提高整个系统的容量。     

A generalized framework for distributed power control in wireless networks

Most power control algorithms that aim at hitting a signal-to-interference ratio (SIR) target fall within Yates' framework. However, for delay-tolerable applications, it is unnecessary to maintain the SIR at a certain level all the time. To maximize throughput, one should increase one's power when the interference level is low, and the information transmission rate is adjusted accordingly by adaptive modulation and coding techniques. This approach is called opportunistic communications. In this paper, we generalize Yates' result and establish a new framework, which is applicable to systems supporting opportunistic communications and with heterogeneous service requirements. Simulation results show that our proposed algorithm yields significant improvement in throughput when compared with the conventional target tracking approach.     

A call admission control strategy for multiservice wireless cellular packet networks

A simple connection control system for multiservice cellular wireless networks is presented. Mobile stations are classified depending on the traffic they generate (e.g., voice, data). Within each class, two subclasses are also identified: stations which have originated inside the cell and stations which come from adjacent cells. The connection control mechanism is carried out by considering a number of priorities among the various classes and their subclasses. It works on two levels: static and dynamic. The static level looks at packet-level quality of service (QoS), such as cell loss and delay, while the dynamic level takes care of connection dynamics and allows the load of the system to be driven with respect to the various subclasses. Results that illustrate the performance of this control mechanism are presented.     

Fair scheduling in wireless packet networks

Fair scheduling of delay and rate-sensitive packet flows over a wireless channel is not addressed effectively by most contemporary wireline fair-scheduling algorithms because of two unique characteristics of wireless media: (1) bursty channel errors and (2) location-dependent channel capacity and errors. Besides, in packet cellular networks, the base station typically performs the task of packet scheduling for both downlink and uplink flows in a cell; however, a base station has only a limited knowledge of the arrival processes of uplink flows. We propose a new model for wireless fair-scheduling based on an adaptation of fluid fair queueing (FFQ) to handle location-dependent error bursts. We describe an ideal wireless fair-scheduling algorithm which provides a packetized implementation of the fluid mode, while assuming full knowledge of the current channel conditions. For this algorithm, we derive the worst-case throughput and delay bounds. Finally, we describe a practical wireless scheduling algorithm which approximates the ideal algorithm. Through simulations, we show that the algorithm achieves the desirable properties identified in the wireless FFQ model     

QoS-guaranteed packet scheduling in wireless networks

To guarantee the quality of service (QoS) of a wireless network, a new packet scheduling algorithm using cross-layer design technique is proposed in this article. First, the demand of packet scheduling for multimedia transmission in wireless networks and the deficiency of the existing packet scheduling algorithms are analyzed. Then the model of the QoS-guaranteed packet scheduling (QPS) algorithm of high speed downlink packet access (HSDPA) and the cost function of packet transmission are designed. The calculation method of packet delay time for wireless channels is expounded in detail, and complete steps to realize the QPS algorithm are also given. The simulation results show that the QPS algorithm that provides the scheduling sequence of packets with calculated values can effectively improve the performance of delay and throughput.     

Providing deterministic packet delays and packet losses in multimedia wireless networks

‘Anytime, anywhere’ communication, information access and processing are much cherished in modern societies because of their ability to bring flexibility, freedom and increased efficiency to individuals and organizations. Wireless communications, by providing ubiquitous and tetherless network connectivity to mobile users, are therefore bound to play a major role in the advancement of our society. Although initial proposals and implementations of wireless communications are generally focused on near‐term voice and electronic messaging applications, it is recognized that future wireless communications will have to evolve towards supporting a wider range of applications, including voice, video, data, images and connections to wired networks. This implies that future wireless networks must provide quality‐of‐service (QoS) guarantees to various multimedia applications in a wireless environment. Typical traffic in multimedia applications can be classified as either Constant‐Bit‐Rate (CBR) traffic or Variable‐Bit‐Rate (VBR) traffic. In particular, scheduling the transmission of VBR multimedia traffic streams in a wireless environment is very challenging and is still an open problem. In general, there are two ways to guarantee the QoS of VBR multimedia streams, either deterministically or statistically. In particular, most connection admission control (CAC) algorithms and medium access control (MAC) protocols that have been proposed for multimedia wireless networks only provide statistical, or soft, QoS guarantees. In this paper, we consider deterministic QoS guarantees in multimedia wireless networks. We propose a method for constructing a packet‐dropping mechanism that is based on a mathematical framework that determines how many packets can be dropped while the required QoS can still be preserved. This is achieved by employing: (1) An accurate traffic characterization of the VBR multimedia traffic streams; (2) A traffic regulator that can provide bounded packet loss and (3) A traffic scheduler that can provide bounded packet delay. The combination of traffic characterization, regulation and scheduling can provide bounded loss and delay deterministically. This is a distinction from traditional deterministic QoS schemes in which a 0% packet loss are always assumed with deterministically bounding the delay. We performed a set of performance evaluation experiments. The results will demonstrate that our proposed QoS guarantee schemes can significantly support more connections than a system, which does not allow any loss, at the same required QoS. Moreover, from our evaluation experiments, we found that the proposed algorithms are able to out‐perform scheduling algorithms adopted in state‐of‐the‐art wireless MAC protocols, for example Mobile Access Scheme Based on Contention and Reservation for ATM (MASCARA) when the worst‐case traffic is being considered. Copyright © 2002 John Wiley & Sons, Ltd.     

Distributed collision control with the integration of packet size for congestion control in wireless sensor networks

Several great features offered by wireless sensor networks (WSN) result in its wide deployment in various remote and continuous monitoring applications. As such, managing huge collected readings in this domain posted many challenges due to its design limitations. In order to provide seamless data transmission, which is of utmost importance in those delay‐sensitive applications, minimum delay and packet loss occurrence should be considered. Specifically, this paper addresses the common issue of congested networks in WSN with the combination technique of variance‐based distributed contention control (DCC‐V) and packet size optimization. The proposed integration technique, which operates on medium access control layer, takes into consideration the packet size advantages as it plays a key role in determining successful data delivery, given the error‐prone nature of WSN. While ensuring fewer corrupted packets, the proposed contention window (CW) in DCC‐V minimizes the chances of packet collisions and so alleviates congestion. In this technique, CW is determined based on slot utilization and average collision values, which also involve standard deviation measurements. Simulation analysis using network simulator‐2 shows outstanding performance of the proposed solution compared with the existing IEEE 802.15.4 protocol. Copyright © 2014 John Wiley & Sons, Ltd.     

Rate control with distributed joint diversity and power control for wireless networks

Two rate control algorithms with distributed joint diversity and power control are proposed for wireless networks. We prove that with the proposed algorithms, the allowed transmitting rate can converge to the individual rate requirement with which the QoS requirement can be satisfied, and each user can share the bandwidth according to the pre-specified setting so that certain fairness can be maintained among the users in the same cell. Simulation results also show that the scheme with rate control gains larger throughput than the scheme without rate control.     

Provisioning link layer proportional service differentiation in wireless networks with smart antennas

In this paper, we present a collision free MAC protocol for wireless networks with smart antennas that provides proportional service differentiation to various classes of traffic based on their respective bandwidth demand. The proposed protocol works for diverse physical parameters such as number of interfaces at each node, number of communication frequencies, and antenna beamwidth. To the best of our knowledge, this is the first work that provides link layer differentiated services for wireless networks with smart antennas and explores the influence of the physical parameters and network topology on the performance of the MAC layer. Ashish Deopura received his B.Tech degree in Electrical Engineering from the Indian Institute of Technology Delhi, India, in 2003, and he received his M.S. degree in Computer Systems Engineering from the University of Massachusetts Amherst, in 2005. He currently works as a Modeling Engineer for OPNET Technologies located in Bethesda, MD Professor Aura Ganz is the director of the Multimedia Networking Laboratory at the University of Massachusetts at Amherst. She has authored more than 170 journal and conference papers in the areas of multimedia wireless networks, ubiquitous computing, telemedicine, and security. She is a co-author of the book: “Multimedia Wireless Networks”, Prentice Hall, 2003. Some of her recent assignments include: general co-chair of the IEEE UWBNETS workshop, general co-chair of the IEEE BROADMED workshop, general co-chair of the Massachusetts 3rd Annual R&D Conference, keynote speaker at the NSF sponsored workshop in Mobile Computing, and invited speaker at Personal and Local Wireless Network Solutions conference, and Motorola’s Wireless Communications Futures Forum, Wireless Local Area Networks Conference. She has a PhD, MSc and BSc in Computer Science from the Technion in Israel. More details can be found at: dvd1.ecs.umass.edu/wireless.     

Optimized bandwidth allocation with fairness and service differentiation in multimedia wireless networks

In this article we present an optimal Markov Decision‐based Call Admission Control (MD‐CAC) policy for the multimedia services that characterize the next generation of wireless cellular networks. A Markov decision process (MDP) is used to represent the CAC policy. The MD‐CAC is formulated as a linear programming problem with the objectives of maximizing the system utilization while ensuring class differentiation and providing quantitative fairness guarantees among different classes of users. Through simulation, we show that the MD‐CAC policy potentially achieves the optimal decisions. Hence our proposed MD‐CAC policy satisfies its design goals in terms of call‐class‐differentiation, fairness and system utilization. Copyright © 2006 John Wiley & Sons, Ltd.