多功能基站移动终端分组数据业务研究

在GSM多功能基站的基础上增加了实现移动终端分组数据业务的功能,使得多功能基站的功能更加完善,相比于商用基站简化了终端分组数据业务实现的过程且能够在控制端对网络数据的交互进程实施管控。通过对多功能基站的系统参数配置,与终端之间的信令交互,以及对网络层的数据处理之后终端可以在多功能基站下实现分组数据业务,最后在控制终端对网络数据的交互进程进行管控。经过测试证明多功能基站系统能够有效的实现终端分组数据业务。     

QoS-oriented packet scheduling scheme for opportunistic networks

The unique characteristics of opportunistic networks (ONs), such as intermittent connectivity and limited network resources, makes it difficult to support quality of service (QoS) provisioning, particularly to guarantee delivery ratio and delivery delay. In this paper, we propose a QoS-oriented packet scheduling scheme (QPSS) to make decisions for bundle transmissions to satisfy the needs for the delivery ratio and delivery delay constraints of bundles. Different from prior works, a novel bundle classification method based on the reliability and latency requirements is utilized to decide the traffic class of bundles. A scheduling algorithm of traffic class and bundle redundancy is used to maintain a forwarding and dropping priority queue and allocate network resources in QPSS. Simulation results indicate that our scheme not only achieves a higher overall delivery ratio but also obtains an approximate 14% increase in terms of the amount of eligible bundles.     

Scheduling with base station diversity and fairness analysis for the downlink of CDMA cellular networks

Efficient packet scheduling in CDMA cellular networks is a challenging problem due to the time variant and stochastic nature of the channel fading process. Selection diversity is one of the most effective techniques utilizing random and independent variations of diverse channels to improve the performance of communication over fading channels. In this paper, we propose two packet scheduling schemes exploiting base station selection diversity in the downlink of CDMA cellular networks. The proposed schemes rely on the limited instantaneous channel state information (CSI) to select the best user from the best serving base station at each time slot. This technique increases the system throughput by increasing multiuser diversity gain and reducing the effective interference among adjacent base stations. Results of Monte Carlo simulations are given to demonstrate the improvement of system throughput using the proposed scheduling schemes. In addition, we investigate fairness issue of wireless scheduling schemes. Due to different characteristics of wireless scheduling schemes, the existing fairness indexes may result in misleading comparison among different schemes. We propose a new fairness index to compare the overall satisfaction of the network users for different scheduling schemes. Copyright © 2006 John Wiley & Sons, Ltd.     

GPRS中分组调度算法

主要讨论通用无线分组业务（GPRS）调度算法。首先介绍了一些常用分组调度算法，给出了GPRS中服务质量（QoS)定义和GPRS中选择分组调度算法原则，并根据对GPRS特性和三种算法性能的分析与比较，提出了一种新的基于延迟约束分组调度算法。通过仿真发现，新算法可在满足延迟要求基础上以较小复杂度获得比其余算法更高的资源利用率。     

一种基于捕获的扩频分组无线网MAC层协议及其性能分析

在分组接入过程中,当每个用户终端以随机竞争的方式获得所需的频谱资源时,会引起用户间的冲突和资源的浪费,造成系统性能的降低。本文引入了一种基于捕获的接入方法,当一个时隙中存在多个干扰分组时,该方法仍有捕获到某个分组的可能,该方法在系统高负载的情况下能有效地利用资源。性能分析和计算结果表明,基于捕获的方法改善了系统的性能。     

动态关断资源栅格的异构无线网络基站节能算法

针对现有的基于载频/时隙关断的基站节能算法没有考虑异构网络之间的协同或者只考虑单一的业务与实际网络情况不相适应的问题,在异构网络环境下提出了动态关断资源栅格(RG,resource grid)的基站节能新算法——DRGSM(dynamic resource grid shut mode)算法。该算法根据网络的即时负载,当有业务接入时,动态打开RG以满足业务的QoS要求;当RG闲置时,即将其关断以实现节能。仿真结果表明,所提算法较现有的基于载频/时隙关断的基站节能算法,明显地降低了能耗,提高了节能百分比。     

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.     

Efficient packet scheduling for heterogeneous multimedia provisioning over broadband satellite networks: An adaptive multidimensional QoS‐based design

With their inherent broadcast capabilities and reliable extensive geographical coverage, the broadband satellite networks are emerging as a promising approach for the delivery of multimedia services in 3G and beyond systems. Given the limited capacity of the satellite component, to meet the diverse quality of service (QoS) demands of multimedia applications, it is highly desired that the available resources can be adaptively utilized in an optimized way. In this paper, we draw our attention on the development and evaluation of an efficient packet scheduling scheme in a representative broadband satellite system, namely satellite digital multimedia broadcasting (SDMB), which is positioned as one of the most attractive solutions in the convergence of a closer integration with the terrestrial mobile networks for a cost‐effective delivery of point‐to‐multipoint services. By taking into account essential aspects of a successful QoS provisioning while preserving the system power/resource constraints, the proposed adaptive multidimensional QoS‐based (AMQ) packet scheduling scheme in this paper aims to effectively satisfy diverse QoS requirements and adaptively optimize the resource utilization for the satellite multimedia broadcasting. The proposed scheme is formulated via an adaptive service prioritization algorithm and an adaptive resource allocation algorithm. By taking into account essential performance criteria, the former is capable of prioritizing contending flows based on the QoS preferences and performance dynamics, while the latter allocates the resources, in an adaptive manner, according to the current QoS satisfaction degree of each session. Simulation results show that the AMQ scheme achieves significantly better performance than those of existing schemes on multiple performance metrics, e.g. delay, throughput, channel utilization and fairness. Copyright © 2008 John Wiley & Sons, Ltd.     

空天地一体化网络中联合地面基站选择及功率分配

针对由卫星通信网络、地面移动网络以及空中飞行平台所组成的空天地一体化网络(Hybrid Satellite-Aerial-Terrestrial Network,HSAT)下行链路的系统吞吐量问题,提出了基于多目标遗传算法的地面基站选择及功率分配算法。在这一网络中,空中飞行平台需要地面基站为其进行中继通信。因此,地面中继基站的选择和功率分配决定了系统的吞吐量。所提算法为了取得对系统吞吐量更好的优化效果,将优化系统吞吐量和满足约束条件建模成两个优化目标,通过设计特有的迭代选择过程使地面基站选择和功率分配不断优化。仿真分析表明,所提算法在保证用户最低通信需求的前提下,有效提升了系统的吞吐量。     

用于多信道无线网络的综合链路速率分配算法

This paper presents a link allocation and rate assignment algorithm for multi-channel wireless networks. The objective is to reduce network conflicts and guarantee the fairness among links. We first design a new network model. With this network model, the multi-channel wireless network is divided into several subnets according to the number of channels. Based on this, we present a link allocation algorithm with time complexity O(l2 ) to allocate all links to subnets. This link allocation algorithm adopts conflict matrix to minimize the network contention factor. After all links are allocated to subnets, the rate assignment algorithm to maximize a fairness utility in each subnet is presented. The rate assignment algorithm adopts a near-optimal algorithm based on dual decomposition and realizes in a distributed way. Simulation results demonstrate that, compared with IEEE 802. 11b and slotted seeded channel hopping algorithm, our algorithm decreases network conflicts and improves the network throughput significantly.     

A cross-layer design: energy efficient multilevel dynamic feedback scheduling in wireless sensor networks using deadline aware active time quantum for environmental monitoring

Recently, Packet scheduling plays a vital role in Wireless Sensor Networks (WSNs). The major key challenges include delay, packet dropping, energy consumption and lifetime due to constraints in energy and computing resources. All the research works on packet scheduling scheme in WSN uses only First Come First Served (FCFS) and Dynamic Multilevel Priority (DMP) schemes. FCFS works based on packet arrival time, it leads to starvation and high processing overhead for real-time packets. DMP works in multilevel with dynamic priority reduces the transmission overhead and bandwidth; it consumes more resources for real-time task leads to deadlock. To solve these problems, this work presents Multilevel Dynamic Feedback Scheduling (MDFS) algorithm. The sensor node classifies the emergency and normal data into three different ready queues named as high, medium and low priority, respectively. The queues are connected with a feedback mechanism; each packet from the sensor node has its own time quantum value based on the deadline. The updated time quantum value is compared with the boundary value of the queues, depends on the updated value the data packets are moved between queues with help of feedback mechanism. The simulation result proves that the projected MDFS outperforms in WSN environment.     

Joint processing of topology control and channel assignment in wireless ad hoc networks

Network topology construction and its channel assignment for each node in the constructed network topology are two main problems in the initialization of topology building. Topology control is an effective way to solve the problem of topology building. To investigate the joint effect of topology control and channel assignment, we propose a joint processing scheme composed of a k‐Neighbor topology control algorithm and a greedy channel assignment (GCA) algorithm in this paper. Based on this joint processing scheme, the relationships between the energy consumption, the total required channel number and the network connectivity are discussed. We also discuss the impact of some parameters on the performance of networks in terms of the path loss factor, node density, maximum node degree, etc. Our main contributions in this paper is that we find that topology control has a good effect on improving the performance of channel assignment, and the proposed joint processing scheme can reduce the required channel number effectively, compared with its theoretical upper bound. In particular, if the node degree in a network is not more than k, various simulations indicate that the required channel number is not more than 2k + 1. Copyright © 2008 John Wiley & Sons, Ltd.     

Optimal base station selection based on dynamic programming for reprogramming in mine wireless network

The nodes of large-scale wireless network which widely used in safety-critical systems often update new code,the way of wireless reprogramming is efficiency and flexibility.The problem of selecting the optimal base station when nodes uniformly distributed in mine wireless network environment and all other nodes were reprogrammed efficiency.Firstly,the model of base station selecting was established by covering process of reprogramming.Then the problem was transformed into solving the minimum of longest non-cyclic path between node and base station in undirected circulant graph.Finally,the optimal algorithm based on dynamic programming which included optimal substructure and overlapping subproblems was proposed.Numerical analysis and experimental results show that the time consumption of proposed algorithm is more stable than other optimal algorithm when the complexity of network is increased sharply.     

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.     

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

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

移动通信基站机房能耗数据采集与分析

基站机房的节能降耗是通信行业的重中之重,而全面而透彻地分解和分析基站机房的能耗组成、来源是首要的目标和出发点。广西移动与工信部通信计量中心合作,通过在试点基站建立能耗数据采集系统以获取实时数据,并结合话务、数据流量等基础参数,深入地进行了基站机房的能耗组成、变化规律及作用机制的研究分析。     

Cooperative communications with relay selection for wireless networks: design issues and applications

Relay selection schemes for cooperative communications to achieve full cooperative diversity gains while maintaining spectral and energy efficiency have been extensively studied in a recent research. These schemes select only the best relay from multiple relaying candidates to cooperate with a communication link. In the present paper, we reviewed recently proposed cooperative communication protocols that integrate with relay selection mechanisms. The key design issues for relay selection mechanisms, for example, relaying candidate selection, optimal relay assignment, and cooperative transmission, were identified. We further discussed the challenges of optimal relay assignment in multi‐hop wireless sensor networks and presented the potential applications of cooperative communications with a relay selection in such networks. Future research directions were outlined, for example, the issues of service differentiation and system fairness in cooperative communication systems and the joint use of game theory and adaptive learning techniques in relaying candidate selection and optimal‐relay assignment mechanisms for efficient allocation of network resources. Copyright © 2011 John Wiley & Sons, Ltd.     

无感知分组丢失下的无线传感器网络链路质量评估模型

针对现有链路质量评估方法没有考虑到不完整分组对链路产生的影响,将无线传感器网络的链路分组丢失分为感知分组丢失和无感知分组丢失,分析了无感知分组丢失产生的原因,在对无感知分组丢失进行度量的基础上,提出一种无感知分组丢失下的链路质量评估模型。该模型采用卡尔曼滤波对获取的CCI进行降噪处理,基于Cubic模型、最小二乘法拟合出CCI与无感知分组丢失率的关系模型。实验结果表明,无感知分组丢失下的链路质量评估模型是合理的,通过该模型求得的无感知分组丢失率与实测值接近。     

Handoff performance in wireless DS‐CDMA networks

This paper analyses the performance of DS‐CDMA networks in the presence of call handoffs. We show that a handoff may violate the SINR requirements for other users, and thus cause an outage in the target cell. We propose to use the probability of such events as a possible metric for quality of service in networks with multiple traffic types, and derive the corresponding QoS parameters. A two‐level admission policy is defined: in tier 1 policy, the network capacity is calculated on the basis of the bound on outage probability. However, this policy does not suffice to prevent outage events upon handoffs for various traffic types, and henceforth, we propose an extension that reserves extra bandwidth for handoff calls, thus ensuring that handoff calls will not violate the outage probability bound. The overhead imposed by the extension is negligible, as the complete two‐tier admission control algorithm is executed only when a call is admitted into the network. Once admitted, calls can freely execute handoffs using the reserved bandwidth. The modified second‐tier bandwidth reservation policy is adaptive with respect to the traffic intensity and user's mobility and we show that it can provide satisfactory call (flow) quality during its lifetime. Analytical results for the QoS have been verified by the simulations. Copyright © 2002 John Wiley & Sons, Ltd.     

A probabilistic approach for fair-efficient call admission control in wireless multiservice networks

The efficiency of call admission control (CAC) schemes in multiclass wireless networks should be evaluated not only with regard to the call blocking probability (CBP) achieved for every service class (SC) supported but also with regard to quality of service (QoS) and network efficiency criteria. In this article, four CAC schemes offering priority to SCs of advanced QoS requirements, based on guard channel policy, are studied and evaluated taking into account fairness and throughput criteria in addition to CBP. For the performance evaluation of the proposed CAC schemes and to examine fairness issues, two fairness indices are introduced along with a throughput metric. The analytical results, validated through extensive simulations, indicate that by appropriate selection of the CAC parameters satisfactory fairness and throughput are achieved while achieving low CBP.