Network selection policy in multi-radio access environment using stochastic control theory

Network selection is crucial in improving the performance of heterogeneous wireless access systems.Most of previous work on network selection or radio resource allocation concentrates on the capability of each available network and ignores the time-varying nature of wireless media due to channel fading.However,the channel condition determines the state of each wireless network and plays a vital role in ensuring quality of service in multi-radio access environment.In this article,we propose a network selection policy using stochastic control theory considering the time-varying and stochastic character of wireless channels.The proposed scheme selects one network among different alternatives in each decision epoch according to the channel state of each network,which is modeled as finite-state Markov channel,with the objectives of increasing the data-rate,decreasing the bit error rate and minishing the delay.The procedure of network selection is formulated as a stochastic control problem,which can be solved using linear programming and primal-dual index heuristic algorithm.Simulation results are presented to show that network selection has great impact on the system performance,and the proposed scheme can improve the performance significantly.     

Graph coloring based channel assignment framework for rural wireless mesh networks

IEEE 802.11 based wireless mesh networks with directional antennas are expected to be a new promising technology and an economic approach for providing wireless broadband services in rural areas. In this paper, we discuss interference models and address how they can affect the design of channel assignment in rural mesh networks. We present a new channel assignment framework based on graph coloring for rural wireless mesh networks. The goal of the framework is to allow synchronously transmitting or receiving data from multiple neighbor links at the same time, and continuously doing full-duplex data transfer on every link, creating an efficient rural mesh network without interference. Channel assignment is shown to be NP-hard. We frame this channel allocation problem in terms of Adjacent Vertex Distinguishing Edge Coloring （AVDEC）. Detailed assignment results on grid topology are presented and discussed. Furthermore, we design an algorithm. Finally, we evaluate the perform- ance of the proposed algorithm through extensive simulations and show the algorithm is effective to the regular grid topologies, and the number of colors used by the algorithm is upper bounded by A ~ 1. Hence the algorithm guarantees that the number of channels available in standards such as IEEE 802.11a is sufficient to have a valid AVDEC for many grid topologies. We also evaluate the proposed algorithm for arbitrary graphs. The algorithm provides a lower upper bound on the minimum number of channels to the AVDEC index channel assignment problem.     

Energy efficient fault-tolerant multipath routing scheme for wireless sensor networks

In wireless sensor network （MSN）, reliability is the main issue to design any routing technique. To design a comprehensive reliable wireless sensor network, it is essential to consider node failure and energy constrain as inevitable phenomena. In this paper we present energy efficient node fault diagnosis and recovery for wireless sensor networks referred as energy efficient fault tolerant multipath routing scheme for wireless sensor network. The scheme is based on multipath data routing. One shortest path is used for main data routing in our scheme and other two backup paths are used as alternative path for faulty network and to handle the overloaded traffic on main channel. Shortest pat data routing ensures energy efficient data routing. Extensive simulation results have revealed that the performance of the proposed scheme is energy efficient and can tolerates more than 60% of fault.     

Relay algorithm based on network coding in wireless local network

The network coding is a new technology in the field of information in 21st century. It could enhance the network throughput and save the energy consumption, and is mainly based on the single transmission rate. However, with the development of wireless network and equipment, wireless local network MAC protocols have already supported the multi-rate transmission. This paper investigates the optimal relay selection problem based on network coding. Firstly, the problem is formulated as an optimization problem. Moreover, a relay algorithm based on network coding is proposed and the transmission time gain of our algorithm over the traditional relay algorithm is analyzed. Lastly, we compare total transmission time and the energy consumption of our proposed algorithm, Network Coding with Relay Assistance (NCRA), Transmission Request (TR), and the Direct Transmission (DT) without relay algorithm by adopting IEEE 802.11b. The simulation results demonstrate that our algorithm that improves the coding opportunity by the cooperation of the relay nodes leads to the transmission time decrease of up to 17% over the traditional relay algorithms.     

基于动态定价的帧聚合策略(英文)

Frame aggregation is a wireless link optimization mechanism that aims to reduce transmission overheads by sending multiple frames as the payload of a single MAC frame. It is considered as one of the most efficient methods to improve the wireless channel utilization and the throughput of wireless networks.The static assignment of frame aggregation parameters can result in delay penalties due to variations in traffic type. We propose a frame aggregation scheme which is based on dynamic pricing and queue scheduling for a multitraffic scenario. The scheme adopts a dynamic differential pricing scheme for different types of traffic. Meanwhile, it polls buffer queues in accordance with the optimal aggregation weight factors to maximise the network revenue.Simulation results indicate that the proposed frame aggregation scheme can effectively improve the network revenue and the average throughput, while guaranteeing the delay requirements of all types of traffic.     

Energy Efficiency Maximization Strategy for Sink Node in SWIPT-Enabled Sensor-Cloud Based on Optimal Stopping Rules

Leveraging energy harvesting abilities in wireless network devices has emerged as an effective way to prolong the lifetime of energy constrained systems.The system gains are usually optimized by designing resource allocation algorithm appropriately.However,few works focus on the interaction that channel’s time-vary characters make the energy transfer inefficiently.To address this,we propose a novel system operation sequence for sensor-cloud system where the Sinks provide SWIPT for sensor nodes opportunistically during downlink phase and collect the data transmitted from sensor nodes in uplink phase.Then,the energy-efficiency maximization problem of the Sinks is presented by considering the time costs and energy consumption of channel detection.It is proved that the formulated problem is an optimal stopping process with optimal stopping rules.An optimal energy-efficiency(OEE)algorithm is designed to obtain the optimal stopping rules for SWIPT.Finally,the simulations are performed based on the OEE algorithm compared with the other two strategies to verify the effectiveness and gains in improving the system efficiency.     

Performance Analysis of a DS-CDMA Cellular System with Effects of Soft Handoff in Log-Normal Shadowing Channels

Next generation wireless communication is based on a global system of fixed and wireless mobile services thatare transportable across different network back-bones,network service providers and network geographical boundaries.This paper presents an approach to investigate the effects of soft handover and perfect power control on the forward link ina DS-CDMA cellular system.Especially,the relationships between the size ofhandover zone and the capacity gain are e-valuated under the log-normal shadow channel.Then the optimization of maximum forward capacity is very necessary tobe done with the maximum size of soft handover zone to the various system characteristics.     

Marine Mobile Wireless Channel Modeling Based on Improved Spatial Partitioning Ray Tracing

In 5G era,it is expected to achieve wireless network coverage including offshore areas.Modeling of marine wireless channels is the basis of constructing a marine communication system.In this paper,a communication scene between an unmanned aerial vehicle(UAV)and a boat is simulated to study the marine wireless channel.Firstly,an improved spatial partitioning ray tracing algorithm is proposed to track the propagation path of electromagnetic waves at sea surface.Secondly,a mobile channel is simulated and modeled based on the track results.Finally,a loss measurement is carried out in the coastal waters based on the simple wireless channel loss measuring platform,and a path loss propagation model is built.Then we compare the actual measurement data with the simulation results and find that the two are have good consistency,which further verifies the reliability of the simulation.     

joint target delay determination and rate control for real-time videos in heterogeneous wireless networks

In heterogeneous wireless networks with time-varying channels, the video rate is usually adjusted based on the network bandwidth to guarantee ultra-low latency video transmission under an end-to-end target delay constraint. However, the target delay with a fixed value according to historical experience cannot guarantee the quality of video continuously since wireless network bandwidth changes rapidly, especially when the network deteriorates. An alternative scheme is to dynamically set the target delay according to the network status within an acceptable delay range. However, this scheme cannot be ensured in heterogeneous wireless networks with time-varying channels. Thus, to address this issue, a multi-objective optimization algorithm for joint optimization of rate control and target delay is proposed, where the target delay and video rate are jointly adjusted dynamically. Second, to reduce the optimization complexity due to the multi-objective and multi-parameter characteristics, multi-objective optimization algorithm be decomposed and solved by optimizing each independent sub-problem. Finally, the proposed algorithm is verified on a semi-physical simulation platform. Experiments show that the frame loss rate is reduced from 6.65% to 2.06%, and a peak signal-to-noise ratio (PSNR) gain of 18.32% is obtained when the network performance is low.     

Impact of MAC frame length on energy efficiency in 6LowPAN

To reach necessary end-to-end connectivity between the Internet and wireless sensor networks （WSNs）, the Internet Engineering Task Force （IETF） IPv6 over low power wireless personal area network （6LowPAN） working group has been established and introduced an adaptation layer for integration of IEEE 802.15.4 physical layer/media access control （PHY/MAC） layers and the upper layers of any Intemet protocol （IP）-based networks, such as the Internet. The energy efficiency is one of the most important performance measures in WSNs because most sensor nodes are only battery powered so we should reduce the energy consumption to the lowest to extend the life of nodes. Therefore the determination of MAC frame length should be carefully considered since that the radio frequency （RF） module consumes most the energy of a sensor node meanwhile the MAC protocol is the direct controller of RF module. In this paper, we provide a star-shaped 6LowPAN non-beacon mode with unslotted carrier sense multiple access with collision avoidance （CSMA/CA） mechanism to access to the channel and model the stochastic behavior of a target end node as the M/G/1 queuing system. Analytical expressions for some parameters such as channel busy probability, packet loss probability and energy efficiency are obtained in this paper and our analytical results can clearly show the impact of MAC frame length on the energy efficiency of a target node in both ideal and lossy channel.     

Mobility-Aware and Load Balancing Based Clustering Algorithm for Energy Conservation in MANET

Mobile ad hoc network (MANET) is one of wireless communication network architecture that has received a lot of attention. MANET is characterized by dynamic network topology and limited energy. With mobility-aware and load balancing based clustering algorithm (MLCA), this paper proposes a new topology management strategy to conserve energy. Performance simulation results show that the proposed MLCA strategy can balances the traffic load inside the whole network, so as to prolong the network lifetime, meanly, at the same time, achieve higher throughput ratio and network stability.     

Performance Analysis of Wireless Network Coding via Percolation

In order to investigate the effect of net- work connectivity on the performance of wireless network coding, we introduce percolation theory to construct the system model of multi-hop wireless network for asymp- totic connectivity. Concretely, we proposed a normaliza- tion algorithm for random network to layer the nodes of the largest connected component in multi-hop wireless net- work, and derived the theoretical conditions of percola- tion occurrence for the normalized hierarchical network of the largest connected component. Furthermore, accord- ing to the critical threshold of percolation phenomenon, we derived the performance of wireless network coding for the largest connected component. The mean delay and throughput were quantified in terms of network coding parameters such as coding window size, transmission ra- dius, and node density. These conclusions clarify the ef- fective performance of wireless network coding for random network, and will contribute to the evaluation of optimal performance of wireless network coding.     

An Optimized Vertical Handoff Algorithm Based on Markov Process in Vehicle Heterogeneous Network

In order to solve the problem the existing vertical handoff algorithms of vehicle heterogeneous wireless network do not consider the diversification of network’s status, an optimized vertical handoff algorithm based on markov process is proposed and discussed in this paper. This algorithm takes into account that the status transformation of available network will affect the quality of service(Qo S) of vehicle terminal’s communication service. Firstly, Markov process is used to predict the transformation of wireless network’s status after the decision via transition probability. Then the weights of evaluating parameters will be determined by fuzzy logic method. Finally, by comparing the total incomes of each wireless network, including handoff decision incomes, handoff execution incomes and communication service incomes after handoff, the optimal network to handoff will be selected. Simulation results show that: the algorithm proposed, compared to the existing algorithm, is able to receive a higher level of load balancing and effectively improves the average blocking rate, packet loss rate and ping-pang effect.     

Node correlation clustering algorithm for wireless multimedia sensor networks based on overlapped FoVs

In this paper, a clustering algorithm is proposed based on the high correlation among the overlapped field of views for the wireless multimedia sensor networks. Firstly, by calculating the area of the overlapped field of views （FoVs） based on the gird method, node correlations have been obtained. Then, the algorithm utilizes the node correlations to partition the network region in which there are high correlation multimedia sensor nodes. Meanwhile, in order to minimize the energy consumption for transmitting images, the strategy of the cluster heads election is proposed based on the cost estimation, which consists of signal strength and residual energy as well as the node correlation. Simulation results show that the proposed algorithm can balance the energy consumption and extend the network lifetime effectively.     

Fairness-oriented routing algorithm joint with power control and channel assignment for multi-radio multi-channel wireless mesh networks

The multi-radio multi-channel wireless mesh network （MRMC-WMN） draws general attention because of its excellent throughput performance, robustness and relative low cost. The closed interactions among power control （PC）, channel assignment （CA） and routing is contributed to the performance of multi-radio multi-channel wireless mesh networks （MRMC-WMNs）. However, the joint PC, CA and routing （JPCR） design, desired to achieve a global optimization, was poor addressed. The authors present a routing algorithm joint with PC and CA （JPCRA） to seek the routing, power and channel scheme for each flow, which can improve the fairness performance. Firstly, considering available channels and power levels, the routing metric, called minimum flow rate, is designed based on the physical interference and Shannon channel models. The JPCRA is presented based on the genetic algorithm （GA） with simulated annealing to maximize the minimum flow rate, an non-deterministic polynomial-time hard （NP-Hard） problem. Simulations show the JPCRA obtains better fairness among different flows and higher network throughput.     

A Learning Automata Based Area Coverage Algorithm for Wireless Sensor Networks

One way to reduce energy consumption in wireless sensor networks is to reduce the number of active nodes in the network. When sensors are redundantly deployed, a subset of sensors should be selected to actively monitor the field （referred to as a ＂cover＂）, whereas the rest of the sensors should be put to sleep to conserve their batteries. In this paper, a learning automata based algorithm for energy-efficient monitoring in wireless sensor networks （EEMLA） is proposed. Each node in EEMLA algorithm is equipped with a learning automaton which decides for the node to be active or not at any time during the operation of the network. Using feedback received from neighboring nodes, each node gradually learns its proper state during the operation of the network. Experimental results have shown that the proposed monitoring algorithm in comparison to other existing methods such as Tian and LUC can better prolong the network lifetime.     

A Probability Driven Quadri-Stage Contention Protocol for Mobile Ad Hoc Networks

The paper proposes a new contention based Time division multiple access （TDMA） Medium access control （MAC） protocol in wireless ad hoc networks, which can be termed Quadri-stage contention protocol （QSCP）. The QSCP protocol is free of both the ＂hidden terminal＂ and the ＂exposed terminal＂ problems. It is distributive and arbitrarily scalable. In the dedicated contention stage, nodes exchange their ＂Normalized accumulation and dissipation rate of payload （NADROP）＂ messages in 2-hop neighborhood, and then run a contention probability calculation algorithm to decide the probability of sending a contention frame. The algorithm guaran- tees that the number of time slot reserved by a node is proportional to its NADROP value, which can remarkably improve the end-to-end throughput when network load is heavy, and is more efficient in energy consumption. The simulation results demonstrate that QSCP performs better than the existing protocols.     

Key Technologies of Wireless Mesh Network

The Wireless Mesh Network (WMN) is a special kind of Ad hoc network with a hierarchical network structure . Its backbone transmission network has such characteristics as multi- hop , topology stability, no electricity supply constraints , convergence of flows . Improving the spatial reuse of spectrum is an effective approach to increase network capacity. The linchpin of this approach is to effectively control the interference range between wireless links . The multi- channel networking technology is one of the key technologies of WMN, and its core is the channel allocation through which the channel utilization can be maximized . The mutual interference between multi- hop wireless links should be considered when choosing the routing metrics in WMN. Through the load - balancing routing method , the network capacity and throughput of nodes can be improved .     

Improved ant colony-based multi-constrained QoS energy-saving routing and throughput optimization in wireless Ad-hoc networks简

In order to establish a route supporting multi-constrained quality of service（QoS）, increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving routing algorithm（IAMQER） is proposed. The ant colony algorithm, as one of the available heuristic algorithms, is used to find the optimal route from source node to destination node. The proposed IAMQER algorithm, which is based on the analysis of local node information such as node queue length, node forwarding number of data packets and node residual energy, balances the relationship between the network throughput and the energy consumption, thus improving the performance of network in multi-constrained QoS routing. Simulation results show that this IAMQER algorithm can find the QoS route that reduce average energy consumption and improves network packet delivery ratio under the end-to-end delay and packet loss ratio constraints.     

Energy efficient power allocation strategy for downlink MU-MIMO with massive antennas

With the increasing energy consumption, energy efficiency （EE） has been considered as an important metric for wireless communication networks as spectrum efficiency （SE）. In this paper, EE optimization problem for downlink multi-user multiple-input multiple-output （MU-MIMO） system with massive antennas is investigated. According to the convex optimization theory, there exists a unique globally optimal power allocation achieving the optimal EE, and the closed-form of the optimal EE only related to channel state information is derived analytically. Then both the approximate and accurate power allocation algorithms with different complexity are proposed to achieve the optimal EE. Simulation results show that the optimal EE obtained by the approximate algorithm coincides to that achieved by the accurate algorithm within the controllable error limitation, and these proposed algorithms perform better than the existing equal power allocation algorithm. The optimal EE and corresponding SE increase with the number of antennas at base station, which is promising for the next generation wireless communication networks.