Space‐time diversity‐enhanced QoS provisioning for real‐time service over MC‐DS‐CDMA based wireless networks

In order to support the quality‐of‐service (QoS) requirements for real‐time traffic over broadband wireless networks, advanced techniques such as space‐time diversity (STD) and multicarrier direct‐sequence code division multiple access (MC‐DS‐CDMA) are implemented at the physical layer. However, the employment of such techniques evidently affects the QoS provisioning algorithms at the medium access control (MAC) layer. In this paper, we propose a space‐time infrastructure and develop a set of cross‐layer real‐time QoS‐provisioning algorithms for admission control, scheduling, and subchannel‐allocations. We analytically map the parameters characterizing the STD onto the admission‐control region guaranteeing the real‐time QoS. Our analytical analyses show that the proposed algorithms can effectively support real‐time QoS provisioning. Also presented are numerical solutions and simulation results showing that the STD can significantly improve the QoS provisioning for real‐time services over wireless networks. Copyright © 2007 John Wiley & Sons, Ltd.     

Power‐efficient routing for SDN with discrete link rates and size‐limited flow tables: A tree‐based particle swarm optimization approach

Software‐defined networking is a promising networking paradigm for achieving programmability and centralized control in communication networks. These features simplify network management and enable innovation in network applications and services such as routing, virtual machine migration, load balancing, security, access control, and traffic engineering. The routing application can be optimized for power efficiency by routing flows and coalescing them such that the least number of links is activated with the lowest link rates. However, in practice, flow coalescing can generally overflow the flow tables, which are implemented in a size‐limited and power‐hungry ternary content addressable memory (TCAM). In this paper, a set of practical constraints is imposed to the software‐defined networking routing problem, namely, size‐limited flow table and discrete link rate constraints, to ensure applicability in real networks. Because the problem is NP‐hard and difficult to approximate, a low‐complexity particle swarm optimization–based and power‐efficient routing (PSOPR) heuristic is proposed. Performance evaluation results revealed that PSOPR achieves more than 90% of the optimal network power consumption while requiring only 0.0045% to 0.9% of the optimal computation time in real‐network topologies. In addition, PSOPR generates shorter routes than the optimal routes generated by CPLEX.     

基于遗传_蚁群算法的多QoS约束组播路由优化算法

提出了一种将遗传算法与蚁群算法融合的新算法,用以满足多QoS约束的组播路由优化。算法首先利用遗传算法生成若干组优化解,将其转换成蚁群算法的信息素初值,然后利用蚁群算法来求取满足QoS约束的最优解。仿真结果表明此算法是有效的,其性能优于文献[6]中算法。     

Clustering healthcare big data using advanced and enhanced fuzzy C‐means algorithm

The procedure for revelation and extraction is known as the data mining (DM) where immense measure of information is included. The information mining along with the human services industry has developed solid frameworks and different social insurance that are related to the frameworks from the clinical and finding information. Numerous types of assistance have been offered by healthcare. This includes diagnosing, treatment, avoidance of maladies, sicknesses, wounds and other physical and mental issue. Enormous scopes that are appropriated for preparing applications in healthcare have essential idea that works on a lot of information. Large information application capacities are the primary piece of medicinal services activities. However, no far reaching and methodical review regarding the examining and assessing the significant systems in the field. The different researches associated with the field of healthcare are considered or different strategies, calculations and results. Enormous information object has countless traits, representing a wonderful test on fuzzy C‐means (FCM) for huge information constant grouping. An effective FCM depends on the tensor accepted polyadic deterioration for huge information clustering. The advanced and enhanced fuzzy C‐means algorithm for healthcare (AEFCH) calculation which is an introduced term is changed over to a high‐request tensor FCM calculation by means of a bijection work. Tensor authoritative polyadic deterioration is used to decrease qualities of the items for improving the grouping productivity. Outcomes obtained accomplish fundamentally higher productivity with a slight cluster exactness drop contrasted and the customary calculation, demonstrating the capability of plot that has been created for information of smart data from Internet of Things.     

The revisit of QoS routing based on non‐linear Lagrange relaxation

The development of efficient quality of service (QoS) routing algorithms in a high‐speed networking or the next generation IP networking environment is a very important and at the same time very difficult task due to the need to provide divergent services with multiple QoS requirements. Recently, a heuristic algorithm H_MCOP, which is based on a non‐linear Lagrange relaxation (NLR) technique, has been proposed to resolve the contradiction between the time complexity and the quality of solution. Even though H_MCOP has demonstrated outstanding capability of finding feasible solutions to the multi‐path constrained (MCP) problem, it has not exploited the full capability that an NLR‐based technique could offer. In this paper, we propose a new NLR‐based heuristic called NLR_MCP, in which the search process is interpreted from a probability's perspective. Simulation results indicate that NLR_MCP can achieve a higher probability of finding feasible solutions than H_MCOP. We also verify that the performance improvement of a MCP heuristic has a tremendous impact on the performance of a higher level heuristic that uses a MCP heuristic as the basic step. Copyright © 2006 John Wiley & Sons, Ltd.     

基于混沌优化的无线定位算法研究

本文提出一种抗NLOS干扰的TDOA定位算法。基于混沌优化算法对TDOA算法做了改进,采用混沌优化算法计算初值,再利用Taylor级数展开法进行定位。根据产生混沌序列的两种映射Logistic映射和Kent映射的特点,提出了Kent-Logistic模型修正Logistic映射用于定位。在移动台距服务基站较近时,直接采用该模型进行定位。通过和传统蜂窝定位算法的仿真结果进行比较,表明提出的算法能够提高NLOS传播环境下的定位精度。     

FPS‐MAC: Fuzzy priority scheduling‐based MAC protocol for intelligent monitoring systems

Recent advances in microelectronics have encouraged the implementation of a wireless sensor network (WSN) in intelligent monitoring systems (IMSs). The IMS for time‐critical applications requires timely and reliable data delivery without sacrificing the energy efficiency of the network. This paper proposes FPS‐MAC, a fuzzy priority scheduling‐based medium access control protocol, designed for event critical traffic in hierarchical WSN. The FPS‐MAC allows time‐critical event traffic to opportunistically steal the data slots allocated for periodic data traffic in event‐based situations. Additionally, a fuzzy logic‐based slot scheduling mechanism is introduced to provide guaranteed and timely medium access to emergency traffic load and ensures the quality‐of‐service (QoS) requirements of IMSs. Both analytical and simulation results for data throughput, energy consumption, and transmission delay of FPS‐MAC, TLHA, E‐BMA, and BMA‐RR have been analyzed to demonstrate the superiority of the proposed FPS‐MAC protocol.     

Opportunistic delay‐margin‐based resource allocation for next‐generation wireless networks

This paper studies and develops efficient traffic management techniques for downlink transmission at the base station (BS) of multi‐service IP‐based networks by combining quality‐of‐service (QoS) provision and opportunistic wireless resource allocation. A delay‐margin‐based scheduling (DMS) for downlink traffic flows based on the delays that each packet has experienced up to the BS is proposed. The instantaneous delay margin, represented by the difference between the required and instantaneous delays, quantifies how urgent the packet is, and thus it can determine the queuing priority that should be given to the packet. The proposed DMS is further integrated with the opportunistic scheduling (OPS) to develop various queueing architectures to increase the wireless channel bandwidth efficiency. Different proposed integration approaches are investigated and compared in terms of delay outage probability and wireless channel bandwidth efficiency by simulation. Copyright © 2010 John Wiley & Sons, Ltd.     

An optimal solution to resource allocation among soft QoS traffic in wireless network

Optimization theory and nonlinear programming method have successfully been applied into wire‐lined networks (e.g., the Internet) in developing efficient resource allocation and congestion control schemes. The resource (e.g., bandwidth) allocation in a communication network has been modeled into an optimization problem: the objective is to maximize the source aggregate utility subject to the network resource constraint. However, for wireless networks, how to allocate the resource among the soft quality of service (QoS) traffic remains an important design challenge. Mathematically, the most difficult comes from the non‐concave utility function of soft QoS traffic in the network utility maximization (NUM) problem. Previous result on this problem has only been able to find its sub‐optimal solution. Facing this challenge, this paper establishes some key theorems to find the optimal solution and then present a complete algorithm called utility‐based allocation for soft QoS to obtain the desired optimal solution. The proposed theorems and algorithm act as designing guidelines for resource allocation of soft QoS traffic in a wireless network, which take into account the total available resource of network, the users’ traffic characteristics, and the users’ channel qualities. By numerical examples, we illustrate the explicit solution procedures.Copyright © 2013 John Wiley & Sons, Ltd.     

Online CQI‐based optimization using k‐means and machine learning approach under sparse system knowledge

Modern cellular mobile networks are becoming more complicated and too expensive in terms of deployment, operation, and maintenance. Traffic demand in cellular networks typically experiences spatio‐temporal variations because of users' mobility and usage behaviour, which lead some of the cells to get overloaded without fully utilizing network capacity. To tackle these challenges, nowadays, self‐organizing networks (SONs) become an essential feature. This paper offers the development of an optimization framework for SONs based on channel quality indicator (CQI) and loading condition without detail knowledge of the network environment. Since the electrical tilt plays a key role in optimizing both coverage and capacity, the main motive is to ensure efficient network operation by electrical tilt‐based radio frequency (RF) performance optimization using a machine learning approach. This novel methodology shows two‐step optimization algorithms: (a) cluster formation based on handover success rate using k‐means algorithm and (b) reinforcement learning‐based optimization. Simulation and field trial shows that the proposed approach provides better results than the conventional method of prediction using genetic algorithm (GA) and other online approaches.     

Improving node behaviour in a QoS control environment by means of load‐dependent resource redistributions in LANs

An important means to guarantee an acceptable quality of service in networks with real‐time communication requirements is the reservation of resources at connection setup time. However, such reserved resources, e.g. transmission bandwidth, may be unused as a consequence of the variations in the actual resource demands. Therefore, a more efficient resource utilization is possible if communicating stations or end‐users dynamically hand over some of the free resources temporarily to the other communication partners, e.g. of a ‘broadcast network’. This paper concentrates on two fundamental problems of such a demand‐based sharing of resources: on the one hand, estimation of the current resource requirement on the basis of load measurements is investigated and, on the other hand, we elaborate efficient algorithms for resource sharing respecting real‐time requirements. The algorithms proposed for load estimation and for resource sharing are evaluated analytically with respect to their efficiency for worst‐case, average‐case and realistic load scenarios. Our approach suggested for resource and traffic management allows one to achieve significantly better utilization of network resources. Copyright © 2005 John Wiley & Sons, Ltd.     

Multiple access based on different lengths super orthogonal codes to support QoS of M2M communications in next generation networks

Global connectivity, low latency, and ready‐to‐use infrastructure of next generation wireless (NGW) networks provide a platform for machine‐to‐machine (M2M) communications on a large scale. However, M2M communications over NGW networks pose significant challenges because of different data rates, diverse applications, and a large number of connections. In this paper, we address M2M challenges over NGW networks, and in particular, we focus on random access overload issue and diverse quality‐of‐service (QoS) requirements to enable M2M communications in the context of NGW networks. To enable massive M2M access while QoS guarantees, we propose group‐based M2M communications on the basis of identical transmission protocols and QoS requirements. Furthermore, to guarantee low energy consumption for M2M devices in the same group, we propose a decentralized group‐head selection scheme. In addition, a solution is proposed by using an effective capacity concept to provide QoS guarantees for M2M devices with a strict time constraint. A new random access approach based on different lengths super orthogonal codes is proposed to ease massive random access challenges with provisioning diverse QoS requirements of M2M communications in heterogeneous NGW networks.     

基于FCM-KNN的相干光环形QAM系统符号判决优化

针对高阶环形正交幅度调制 (QAM)的相干光通信 系统,提出了一种模糊C均值算法和K 最近邻算法相结合的非线性均衡算法。对接收端经相位噪声补偿后的数据,先用FCM算法有 效剪裁训练数据,同时对测试数据进行分类判决,从而极大降低了后续KNN算法的计算复杂 度。即首先计算训练集的初始质心和各数据点的初始隶属度,经过迭代计算收敛后,得到最 终的质心和各数据点的隶属度。然后将质心隶属度大于某阈值的测试数据点作为训练数据, 计算各测试数据与各训练集质心的距离对其暂时分类,接下来进行KNN算法分类。同时对测 试集进行分类判决,即对距该质心距离低于阈值的测试数据根据欧式距离直接判决,大于阈 值的测试数据用以上KNN方法进行判决。该算法基于112 Gbit/s单载 波单偏振相干检测环形16QAM单载波系统传输距离为1040 km进行了非线 性均衡效果仿真验证。仿真结果表明,本文所 提出的FCM-KNN算法可取得和KNN算法几乎相同的非线性均衡效果,而其复杂度比后者可降 低近20倍,对高阶QAM相干光通信系统长距离传输具有重要意义。     

A study on a receiver‐based management scheme of access link resources for QoS‐controllable TCP connections

Although the bandwidth of access networks is rapidly increasing with the latest techniques such as DSL and FTTH, the access link bandwidth remains a bottleneck, especially when users activate multiple network applications simultaneously. Furthermore, since the throughput of a standard TCP connection is dependent on various network parameters, including round‐trip time and packet loss ratio, the access link bandwidth is not shared among the network applications according to the user's demands. In this thesis, we present a new management scheme of access link resources for effective utilization of the access link bandwidth and control of the TCP connection's throughput. Our proposed scheme adjusts the total amount of the receive socket buffer assigned to TCP connections to avoid congestion at the access network, and assigns it to each TCP connection according to characteristics in consideration of QoS. The control objectives of our scheme are (1) to protect short‐lived TCP connections from the bandwidth occupation by long‐lived TCP connections, and (2) to differentiate the throughput of the long‐lived TCP connections according to the upper‐layer application's demands. One of the results obtained from the simulation experiments is that our proposed scheme can reduce the delay of short‐lived document transfer perceived by the receiver host by up to about 90%, while a high utilization of access link bandwidth is maintained. Copyright © 2006 John Wiley & Sons, Ltd.     

Hybrid seagull and thermal exchange optimization algorithm‐based NLOS nodes detection technique for enhancing reliability under data dissemination in VANETs

The reliability of data dissemination in vehicular ad hoc network (VANET) necessitates maximized cooperation between the vehicular nodes and the least degree of congestion. However, non‐line of sight (NLOS) nodes prevent the establishment and sustenance of connectivity between the vehicular nodes. In this paper, a hybrid seagull and thermal exchange optimization (TEO) algorithm‐based NLOS node detection technique is proposed for enhancing cooperative data dissemination in VANETs. It inherits three different versions of the proposed hybridized algorithm; three different approaches for localization of NLOS nodes depending upon its distance from the reference nodes are incorporated. It is considered as a reliable attempt in effective NLOS node localization as it is predominant in maintaining the balancing the degree of exploration and exploitation in the search process. In the first variant, the method of the roulette wheel is utilized for selecting one among the two optimization algorithm. In the second adoption, this hybridization algorithm combines TEO algorithm only after the iteration of SEOA algorithm. In the final adoption, the predominance of the seagull attack mode is enhanced by including the heat exchange formula of TEO algorithms for improving exploitation capability. The simulation experiments of the proposed HS‐TEO‐NLOS‐ND scheme conducted using EstiNet 8.1 exhibited its reliability in improving the emergency message delivery rate by 14.86%, a neighborhood awareness rate by 13%, and the channel utilization rate by 11.24%, compared to the benchmarked techniques under the evaluation done with different number of vehicular nodes and NLOS nodes in the network.     

Efficient medium arbitration of FSAN‐compliant GPONs

The steadily rising demand for multimedia and data services, the falling cost and omnipresence of Ethernet and the maturity of passive optical networks (PON) technology, promise to radically change the landscape in the local loop. The heart of a gigabit PON system (recently standardized by FSAN/ITU) is the medium access controller (MAC), which arbitrates access to the upstream link among users with fluctuating traffic demands and effects the multiplexing and concentration policy. At the same time, it has to safeguard the service quality and enforce the parameters agreed in the service level agreements (SLAs) between the users and the service provider. In this paper, a MAC protocol designed to serve any mix of services according to their quality of service (QoS) needs, employing four priority levels along with a high number of logically separate data queues is presented. The architecture and implementation in hardware of a MAC algorithm capable of allocating bandwidth down to a resolution of a byte with QoS differentiation is the focus of this paper. It employs the bandwidth arbitration tools of the FSAN/ITU G.984.3 standard and maps SLA parameters to GPON service parameters to create an efficient, fair and flexible residential access system. Copyright © 2005 John Wiley & Sons, Ltd.     

Performance analysis of a channel allocation scheme for multi‐service mobile cellular networks

This paper presents a new channel allocation scheme, namely the dynamic partition with pre‐emptive priority (DPPP) scheme, for multi‐service mobile cellular networks. The system is modelled by a two‐dimensional Markov process and analysed by the matrix‐analytic method. A pre‐emptive priority (PP) mechanism is employed to guarantee the quality of service (QoS) requirement of the real‐time (RT) traffic at the expense of some degradation of non‐real‐time (NRT) traffic, while the victim buffer compensates the degradation and has no negative impact on the RT traffic. The complete service differentiation between new calls and handoff calls from different traffic classes is achieved by using the dynamic partition (DP) concept with the help of related design parameters. The performance analysis and numerical results show that the DPPP scheme, compared with the existing schemes, is effective and practical in multi‐service environments. Copyright © 2006 John Wiley & Sons, Ltd.     

Architecture design,performance analysis and VLSI implementation of a reconfigurable shared buffer for high‐speed switch/router

Modern switches and routers require massive storage space to buffer packets. This becomes more significant as link speed increases and switch size grows. From the memory technology perspective, while DRAM is a good choice to meet capacity requirement, the access time causes problems for high‐speed applications. On the other hand, though SRAM is faster, it is more costly and does not have high storage density. The SRAM/DRAM hybrid architecture provides a good solution to meet both capacity and speed requirements. From the switch design and network traffic perspective, to minimize packet loss, the buffering space allocated for each switch port is normally based on the worst‐case scenario, which is usually huge. However, under normal traffic load conditions, the buffer utilization for such configuration is very low. Therefore, we propose a reconfigurable buffer‐sharing scheme that can dynamically adjust the buffering space for each port according to the traffic patterns and buffer saturation status. The target is to achieve high performance and improve buffer utilization, while not posing much constraint on the buffer speed. In this paper, we study the performance of the proposed buffer‐sharing scheme by both a numerical model and extensive simulations under uniform and non‐uniform traffic conditions. We also present the architecture design and VLSI implementation of the proposed reconfigurable shared buffer using the 0.18 µm CMOS technology. Our results manifest that the proposed architecture can always achieve high performance and provide much flexibility for the high‐speed packet switches to adapt to various traffic patterns. Furthermore, it can be easily integrated into the functionality of port controllers of modern switches and routers. Copyright © 2008 John Wiley & Sons, Ltd.     

Research on application of variable coding modulation system based on Digital Video Broadcasting ‐ Satellite ‐ 2nd Generation in data transmission of near‐earth remote sensing satellite

In order to make full use of the link resources for data transmission from near‐earth remote sensing satellites, variable coding modulation (VCM) system is used to fully utilize the system link margin to improve the satellite data transmission performance. By analyzing the dynamic link under the VCM data transmission system, the contribution of the VCM system to the satellite data link optimization is studied from the perspective of engineering application, which can provide reference for the data link design of remote sensing satellites. Applying the flow design, for the currently adopted transmission system of X band, compared with traditional constant coding modulation (CCM) system, the average link performance of VCM system can be increased by 42.1% in single‐station transmission mode and 53.3% in dual‐station relay mode through the exampled analysis.