Investigation of Adaptive Multi-Rate Link Adaptation of 3G System

In term of the features of 3G system, a novel AMR link adaptation strategy for 3G system is proposed. The impacts of AMR codec modes and power control on traffic quality of service are taken into account in the strategy at the same time. By synthetically comparing the signal-to-interference ratio value with the switching threshold and comparing the transmission power with its threshold, radio resource management can always keep each link on its proper codec mode with the corresponding optimal power level to achieve both robust speech quality and link capacity enhancement. Based on the WCDMA FDD uplink link-level simulation platform, AMR link adaptation platform is constructed. Simulation results show that the algorithm can track the fast change of channel conditions and select the most robust codec mode, thus the synthetic speech quality of AMR is better than that of signal mode during a wide range of channel conditions. The result will provide a reference strategy for AMR link adaptation of 3G system.

Video quality based link adaptation for low latency video transmission over WLANs

Wireless Local Area Networks (WLANs) such as IEEE 802.11a/g and Hiperlan/2 utilise numerous transmission modes, each providing different throughputs and reliability levels. Many link adaptation algorithms proposed in the literature either maximise the error-free data throughput based on channel conditions or are based on the number of failed transmissions. However, these algo- rithms do not take into account the content of the data stream and strongly rely on the use of Automatic Repeat Requests (ARQs). Low latency video applications such as real-time video transmission may require no retransmission, or only a limited number of retrans- missions. Moreover, completely error-free communication is not essential, especially if robust video compression techniques are applied. In such scenarios, improved decoded video quality can be obtained with a video stream transmitted at a higher bit rate using a higher link speed but with some degree of transmission error, rather than an error-free video stream at a lower bit rate using a lower link speed. In this work, we investigate a link adaptation scheme that improves the Quality of Service (QoS) for video transmission, based on the overall received video quality (Peak Signal to Noise Ratio, PSNR), rather than by maximising the error-free throughput. We also study a practical link adaptation approach that uses PER thresholds at the PHY layer. An empirical study showed that thresholds for switching from one mode to another are much lower (almost error free) than those currently used by throughput based schemes. We show that traditional link adaptation strategies are not appropriate for real-time video transmission with no retransmis- sion. Simulation results using the H.264 video compression standard over IEEE 802.11a are presented.

D2D communication in a cellular network based on link adaptation with truncated ARQ

A device-to-device （D2D） communication mode underlaying cellular network in a single- cell environment is introduced. A practical method based on link adaptation with automatic repeat request （ARQ） is presented. Link adaptation technique, which combines adaptive modulation and coding （ AMC ） with truncated ARQ, can maximize the cellular UEs＇ data rate under prescribed delay and performance constraints. The proposed method can maximize the total transmission rate when an outage probability is determined. Numerical results show that with proper power control, the in- terference between the two links can be coordinated to increase the sum rate without overwhelming the cellular service.

A NOVEL LINK ADAPTATION SCHEME TO ENHANCE PERFORMANCE OF IEEE 802.11G WIRELESS LAN

A novel link adaptation scheme using linear Auto Regressive （AR） model channel estimation algorithm to enhance the performance of auto rate selection mechanism in IEEE 802.11g is proposed. This scheme can overcome the low efficiency caused by time interval between the time when Received Signal Strength （RSS） is measured and the time when rate is selected. The best rate is selected based on data payload length, frame retry count and the estimated RSS, which is estimated from recorded RSSs. Simulation results show that the proposed scheme enhances mean throughput performance up to 7%, in saturation state, and up to 24% in finite load state compared with those non-estimation schemes, performance enhancements in average drop rate and average number of transmission attempts per data frame delivery also validate the effectiveness of the proposed schelne.

Reliability and reliability sensitivity analysis of structure by combining adaptive linked importance sampling and Kriging reliability method

The application of reliability analysis and reliability sensitivity analysis methods to complicated structures faces two main challenges:small failure probability(typical less than 10-5)and time-demanding mechanical models.This paper proposes an improved active learning surrogate model method,which combines the advantages of the classical Active Kriging–Monte Carlo Simulation(AK-MCS)procedure and the Adaptive Linked Importance Sampling(ALIS)procedure.The proposed procedure can,on the one hand,adaptively produce a series of intermediate sampling density approaching the quasi-optimal Importance Sampling(IS)density,on the other hand,adaptively generate a set of intermediate surrogate models approaching the true failure surface of the rare failure event.Then,the small failure probability and the corresponding reliability sensitivity indices are efficiently estimated by their IS estimators based on the quasi-optimal IS density and the surrogate models.Compared with the classical AK-MCS and Active Kriging–Importance Sampling(AK-IS)procedure,the proposed method neither need to build very large sample pool even when the failure probability is extremely small,nor need to estimate the Most Probable Points(MPPs),thus it is computationally more efficient and more applicable especially for problems with multiple MPPs.The effectiveness and engineering applicability of the proposed method are demonstrated by one numerical test example and two engineering applications.

SmartCrawler:A Three-Stage Ranking Based Web Crawler for Harvesting Hidden Web Sources

Web crawlers have evolved from performing a meagre task of collecting statistics,security testing,web indexing and numerous other examples.The size and dynamism of the web are making crawling an interesting and challenging task.Researchers have tackled various issues and challenges related to web crawling.One such issue is efficiently discovering hidden web data.Web crawler’s inability to work with form-based data,lack of benchmarks and standards for both performance measures and datasets for evaluation of the web crawlers make it still an immature research domain.The applications like vertical portals and data integration require hidden web crawling.Most of the existing methods are based on returning top k matches that makes exhaustive crawling difficult.The documents which are ranked high will be returned multiple times.The low ranked documents have slim chances of being retrieved.Discovering the hidden web sources and ranking them based on relevance is a core component of hidden web crawlers.The problem of ranking bias,heuristic approach and saturation of ranking algorithm led to low coverage.This research represents an enhanced ranking algorithm based on the triplet formula for prioritizing hidden websites to increase the coverage of the hidden web crawler.

A New Aggregation Based Scheduling Method for Rapidly Changing IEEE 802.11ac Wireless Channels

In this paper we suggest a novel idea to improve the Throughput of a rapidly changing WiFi channel by exploiting the standard aggregation schemes in IEEE 802.11ac networks. The idea is based on blindly transmitting several copies of the first 4 MAC Protocol Data Units (MPDU) in the Transmission Window. This increases the probability that the window moves forward, enabling the transmission of new MPDUs and resulting in increased Throughput. It turns out that transmitting 2 copies of each of the first 4 MPDUs yields the best Throughput gain, in the order of 50% - 60% in PHY rates of 1.3 - 3.5 Gbps and few hundreds of bytes MPDUs. The proposed idea has advantage over Link Adaptation since it reduces the actual PHY rate only for the transmission of few MPDUs while Link Adaptation reduces the PHY rate for all the transmissions.

Novel Link Adaptation Schemes for OFDM System

Orthogonal Frequency Division Multiplexing (OFDM) is the most promisingtechnique supporting the high data rate transmission. The combination of the link adaptation andOFDM can further increase the spectral efficiency. In this paper, we put forward two link adaptationschemes for OFDM system which have the advantages of both flexibility and practicability. Both ofthe two novel link adaptation schemes are based on the iterative mechanism to allocate the bit andpower to subcarriers according to their channel gains and noisy levels which are assumed to bealready known at the transmitter. The candidate modulation modes are determined freely before thelink adaptation schemes are performed. The distinction between the two novel link adaptation schemesis that in the novel scheme A, the modulation mode is upgraded to the neighboring higher-ordermode, while in the novel scheme B the modulation is upgraded to the genuine optimal mode. Therefore,the novel scheme A has the advantage of lower complexity and the novel scheme B has the advantageof higher spectral efficiency.

Fair and Bandwidth-Efficient Broadcast Link Rate Adaption in Wireless LANs

Broadcast delivery of bulk multimedia files is an important wireless LAN application for densely populated scenarios such as inside high-speed train carriages. However, it is a challenge to adapt the broadcast link rate due to heterogeneity and varying channel conditions of the broadcast receivers to achieve both high bandwidth efficiency and fairness. In this paper, the broadcast link rate adaption problem is formulated as a quadratic programming problem with a broadcast link rate adaption algorithm named FBB （Fair and Bandwidth-efficient Broadcast）. Simulation results show that the algorithm significantly outper- forms fixed rate broadcast with only a small loss compared to its theoretical performance. The algorithm has been successfully applied in a practical wireless LAN access point.

A Novel Channel Predictor Based on Constrained Hidden Markov Model

In order to realize the potential of link adaptation, reliable channel prediction is necessary. In this paper, we propose a novel channel predictor based on Constrained Hidden Markov Model (CHMM). By partitioning the range of the received signal envelope into several intervals, a CHMM can be constructed with the high efficiency algorithm. Then an improved prediction method is presented, which is more accurate than the simple prediction method of the largest transition probability. Finally, simulation results are given to show the effectiveness of the CHMM channel predictor.

Reliable and Energy Efficient Protocol for Wireless Sensor Network

Low-power design is one of the most important issues in wireless sensor networks (WSNs) , while reliable information transmitting should be ensured as well. Transmitting power (TP) control is a simple method to make the power consumption down, but excessive interferences from potential adjacent operating links and communication reliability between nodes should be considered. In this paper, a reliable and energy efficient protocol is presented, which adopts adaptive rate control based on an optimal TP. A mathematical model considering average interference and network connectivity was used to predict the optimal TP. Then for the optimal TP, active nodes adaptively chose the data rate with the change of bit-error–rate(BER) performance. The efficiency of the new strategy was validated by mathematical analysis and simulations. Compared with 802.11 DCF which uses maximum unified TP and BASIC protocol, it is shown that the higher average throughput can achieve while the energy consumption per useful bit can be reduced according to the results.