On approximating multifractal traffic burstiness with Markov modulated Poisson processes

We investigate the approximating capability of Markov modulated Poisson processes (MMPP) for modeling multifractal Internet traffic. The choice of MMPP is motivated by its ability to capture the variability and correlation in moderate time scales while being analytically tractable. Important statistics of traffic burstiness are described and a customized moment-based fitting procedure of MMPP to traffic traces is presented. Our methodology of doing this is to examine whether the MMPP can be used to predict the performance of a queue to which MMPP sample paths and measured traffic traces are fed for comparison respectively, in addition to the goodness-of-fit test of MMPP. Numerical results and simulations show that the fitted MMPP can approximate multifractal traffic quite well, i.e. accurately predict the queueing performance.

Design and performance analysis of wireless sensor network location node system for underground mine

Aiming at the application of a wireless sensor network to locating miners in underground mine,we design a wireless sensor network location node system,considering the communication performance and the intrinsic safety. The location node system consists of a mobile node,several fixed nodes,and a sink node,all of whose circuits were designed based on CC2430. A varistor and a RC circuit were used in the reset circuit of a sensor node to guarantee the intrinsic safety by reducing discharge energy,the theoretical analysis of the discharge energy shows that the reset circuit is an intrinsic safety one. The analysis and simulation about the performance of the location node system are discussed,such as network communication delay and packet loss rate,the results show that the highest network communication delay of the system is about 0.11 seconds,and the highest packet loss rate is about 0.13,which assures the location node system has a high reliability,and can locate miners in the underground mine.

Traffic Allocation Scheme with Cooperation of Multiple RANs in Universal Wireless Environments

This paper introduces an adaptive traffic allocation scheme with cooperation of multiple Radio Access Networks (RANs) in universal wireless environments.The different cooperation scenarios are studied,and based on the scenario of cooperation in both network layer and terminal layer,an open queuing system model,which is aiming to depict the characteristics of packet loss rate of wireless communication networks,is proposed to optimize the traffic allocation results.The analysis and numerical simulations indicate that the proposed scheme achieves inter-networking load balance tominimize the whole transmission delay and expands the communication ability of single-mode terminals to support high data rate traffics.

Reliability and Feedback of Multiple Hop Wireless Networks

This paper analyzes fault-tolerance over the entire design life of a class of multiple-hop wireless networks, where cooperative transmission schemes are used. The networks are subject to both node failure and random channel fading. A node lifetime distribution is modeled with an increasing failure rate, where the node power consumption level enters the parameters of the distribution. A method for assessing both link and network reliabilities projected at the network＇s design life is developed. Link reliability is enhanced through use of redundant nodes. The number of redundant nodes is restricted by the cooperative transmission scheme used. The link reliability is then used to establish a re-transmission control policy that minimizes an expected cost involving power, bandwidth expenditures, and packet loss. The benefit and cost of feedback in network operations are examined. The results of a simulation study under specific node processing times are presented. The study quantifies the effect of loop closure frequency, acknowledgment deadline, and nodes＇ storage capacity on the performance of the network in terms of network lifetime, packet loss rate, and false alarm rate. The study concludes that in a network where energy is severely constrained, feedback must be applied judiciously.

Spectrum-Efficient and Fair Resource Scheduling for MBMS in LTE Systems

An improved spectrum-efficient and fair resource scheduling algorithm for multimedia broadcast multicast service(MBMS)in long term evolution(LTE)systems is proposed in this paper.By jointly considering the channel conditions of all the users,the average packet loss rate,and the fairness of users in the MBMS group,the transmission data rate of the MBMS group is first selected according to the link adaptation and the average packet loss rate of users.Then,the resource blocks are allocated to MBMS groups according to the scheduling priority.Such a resource scheduling algorithm further balances the system throughput and user fairness.Theoretical analysis and simulation results show that the proposed algorithm can achieve a good tradeoff between system throughput and user fairness in comparison with traditional scheduling algorithms.

A Utility-Based Scheduling Scheme for MIMO-OFDMA Downlink Systems

In this paper,a utility-based feedback delay-aware and buffer status-aware( FABA) scheduling scheme is proposed for downlink multiuser multiple-input multiple-output orthogonal frequency-division multiple-access( MIMO-OFDMA) systems. The FABA scheme allocates subcarriers to multiusers with an objective of not only maximizing the total system capacity but reducing the system packet loss rate as well. We design a utility function which consists of a feedback estimate module,a proportional fairness module and a buffer monitoring module. The feedback estimate module is used to improve the system throughput by utilizing the Automatic Repeat-reQuest( ARQ) feedback information to combat the fast time-varying fading condition. The proportional fairness module can guarantee the scheduling fairness among users,and the buffer monitoring module can utilize the transmitting buffer status information to avoid high packet loss rate of the system caused by the system congestion. The FABA scheme then formulates the scheduling problem into a problem of overall system utility maximization. We solve the problem by using a heuristic algorithm with low computational complexity. The simulation results show that the proposed FABA scheme outperforms the existing algorithms in terms of the system throughput and the packet loss rate and can also guarantee the fairness demand among users.

A dynamic network Qo S control mechanism based on traffic prediction

A dynamic network Qo S control mechanism was proposed based on traffic prediction. It first predicts network traffic flow and then dynamically distributes network resources, which makes full use of network flow self-similarity and chaos. So it can meet changing network needs very well. The simulation results show that the dynamic Qo S control mechanism based on prediction has better network performance than that based on measurement.

Joint Optimization Strategy for Video Transmission over Distributed Cognitive Radio Networks

A novel joint optimization strategy for the secondary user( SU) was proposed to consider the short-term and long-term video transmissions over distributed cognitive radio networks( DCRNs).Since the long-term video transmission consisted of a series of shortterm transmissions, the optimization problem in the video transmission was a composite optimization process. Firstly,considering some factors like primary user's( PU's) collision limitations,non-synchronization between SU and PU,and SU's limited buffer size, the short-term optimization problem was formulated as a mixed integer non-linear program( MINLP) to minimize the block probability of video packets. Secondly,combining the minimum packet block probability obtained in shortterm optimization and SU's constraint on hardware complexity,the partially observable Markov decision process( POMDP) framework was proposed to learn PU's statistic information over DCRNs.Moreover,based on the proposed framework,joint optimization strategy was designed to obtain the minimum packet loss rate in long-term video transmission. Numerical simulation results were provided to demonstrate validity of our strategies.

Propagation model for 2.4 GHz wireless sensor network in four-year-old young apple orchard

Wireless sensor network(WSN)nodes exchange information via wireless signals,whose power can attenuate at different levels according to the propagation environment.The branches and leaves of young apple trees are much sparser than that of adult apple trees.Propagation rules such as propagation distance and attenuation rate are the parameters necessary to know before applying a WSN to a young apple orchard.Field tests were performed,and propagation distance and packet loss rate(PLR)were computed and compared under the two cases:a young apple orchard in fruit period and an open space to find the effect of the apple trees on radio propagation.A model of antenna height and propagation distance was created to forecast the extra path loss caused by the young trees.Validation experiments were performed in a different young apple orchard,and the validation results showed that 70% of R^(2) were higher than 0.7,while the smallest being 0.65;80% RMSE were smaller than 5.The new model was also compared with some classical models such as Cost 235,FITU,ITU-R,and Weissberger model,and the new model was proved to be the best.

Chanel Assignment Optimization Algorithm Based on Link Throughput and Node Priority

How to reduce interference among neighbor nodes in wireless mesh networks is still an important and key issue nowa- days. In this paper, an optimized channel assignment algorithm （OCA） is proposed to solve this problem based on link throughput and node priority. The effects of the numbers of network interface cards and channels on the network throughput are analyzed and evaluated, When there are seven of the numbers of both network interface cards and channels, the efficiency of utilizing network interface card and channel reaches highest. Compared with cen- tralized channel assignment algorithm （CCA）, the proposed algo- rithm has less packet loss rate and more network throughput sig- nificantly.