Zhao Yifan

Performance analysis of wireless sensor networks of serial transmission mode with vacation on fire prevention

To discover firing case in time, the technique of wireless sensor networks is applied to fire early system. This paper establishes the early warning system applied to fire prevention model of serial transmission mode with vacation using exhaustive service for wireless sensor networks. We derive the calculating equation of information packet delay for each sensor node in the system by the Markov chain theory and the probability generating function method. Finally, the theoretical analysis results are confirmed through using simulation.

Analysis of Polling System with Multiple Vacations and Using Exhaustive Service

In this paper we consider the polling system with multiple vacations using exhaustive service. By the imbedded Markov chain theory, the generating functions of queue length at the station is obtained. Then computational equations are explicitly determined for the mean queue length and the mean waiting time of information packet. Especially we obtain some corresponding results under some especial cases. The results are verified through extensive simulations.

Packet delay analysis of continuous-time polling system with M-gated services

This paper proposed a novel analytical model of the polling MAC protocol using M-gated services in continuous time. By the imbedded Markov chain theory, the generating functions of queue length at server arrival epoch is obtained. Also, the Laplace-Stieltjes transform (LST) of packet delay distribution function is derived. Then computational equations are explicitl determined for the mean queue length and the mean packet delay. Through analysis of the mechanism of the polling model, its control values of the M-gated service and the related properties have been obtained. Meanwhile, the basic polling systems using gated service and exhaustive service have been improved. The polling MAC control protocol in the application is more effective.

An Improved Scheduling Algorithm for Multimedia Support in Web Cluster Servers

A solution is urgently expected to meet the higher-quality web service requirements of multimedia applications on the limited bandwidth of internet. Based on the ideas of priority-based service and dynamic load adaptation, this paper presents a new scheduling algorithm for multimedia support in web cluster servers , making possible the service of the two-class priority station polling system under the mixed policy of exhaustive and gated services, optimizing the services of the system in time of load change input via adjustment of the times of the access gated services, and strengthening the flexibility and fairness of multimedia transmissions in web service system. The theoretical model of this algorithm is established with Markov chain and probability generating function. Mathematical analysis is made on the mean queue length and the mean inquiry cyclic time of the common queue and the key station. It turns out that the findings from theoretical analysis correspond well with those from simulated experiments.

Approximate Performance Analysis for the Double Servers in the Asynchronous Schedule Mechanism of Polling

With the popularity of network, web is becoming one of the most effective ways in information sharing. However, with the increase of clicking index, a high-function server can hardly meet the increasing demand for service. This thesis provides the schedule strategy in the asynchronous mechanism of multiqueue double servers polling, which is conducted based on theory of polling multi-access and simulation experiments on computer, along with consideration to the load features of Web. It concludes that this strategy enables Web server to take on the features of good extendibility, utility and function.

A Dynamic Scheme Based on Clustering for Wireless Sensor Networks MAC Protocol

Wireless Sensor Networks(WSNs), as one of the most important techniques in the 21st century, receives a universal attention to the research on its key techniques. A solution is urgently expected to meet the higher-quality service requirements of various applications on the limited bandwidth of wireless networks. Based on the ideas of Priority-based polling transmission with high-efficiency, and dynamic self-adaptation to loading, this paper presents a new analysis model of MAC Scheme of wireless sensor networks, which has made possible the Cluster Header capable of differentiating the nodes of different priority levels under mixed services policy and which has improved the flexibility and adaptability of the system via adjustment of the switch-in service in three time of load change input. The theoretical model of this protocol is established with Markov chain and probability generating function. Mathematical analysis is made on the mean queue length and the mean inquiry cyclic time of the common queue and the key node. It turns out that the findings from theoretical analysis correspond well with those from simulated experiments.

Performance analysis of random access system with monitoring function

In the Internet of Things, the remote monitoring, network status tracking, fault alarm, automatic measurement and control functions of the random access system require the system has the function of the receiver to send client feedback monitoring information. For the network status monitoring requirements in the Internet of Things, this article proposes a monitoring function for random access system, and we get to the throughput, idle rate and information packet collision rate of the system with the average cycle analysis method, through computer simulations to verify the correctness of the analysis.

A dynamic scheme for multimedia support in IEEE802.11 wireless network

With the development of wireless network, a solution is urgently expected to meet the higher-quality QoS demands of multimedia traffics especially when the network is heavily loaded. This paper presents a new scheme of MAC protocol of wireless network, optimizing the services of the system in time of load change input via adjustment of the times of the access gated services. The scheme does not modify the current protocol infrastructure or add any overheads. The theoretical model is established with Markov chain and probability generating function. Mathematical analysis is made on the mean queue length and the mean cyclic time of the common queue and the key station. It turns out that the findings from theoretical analysis correspond well with those from simulated experiments and strengthen the flexibility and fairness of multimedia transmissions in wireless system.

A dynamic scheme based on load adapation for wireless network MAC protocol

A solution is urgently expected to meet the higher-quality service requirements of various applications on the limited bandwidth of wireless networks. Based on the ideas of dynamic load adaptation and priority-based service, this paper presents a new analysis model of MAC protocol of wireless communication network with reference to the solutions presented recently to IEEE 802.11 PCF, making possible the service of the two-class priority station polling system under the mixed policy of exhaustive and gated services, optimizing the services of the system in time of load change input via adjustment of the times of the access gated services, and strengthening the flexibility and fairness of multimedia transmissions in wireless system. The theoretical model of this protocol is established with Markov chain and probability generating function. Mathematical analysis is made on the mean queue length and the mean inquiry cyclic time of the common queue and the key station. It turns out that the findings from theoretical analysis correspond well with those from simulated experiments.

A priority-based polling scheduling algorithm in web cluster servers

A solution is urgently expected to meet the higher-quality web service requirements of various applications on the limited bandwidth of internet. This paper presents a new scheme of load balance of web cluster servers, making possible the service of the two-class priority station polling system under the mixed policy of exhaustive and gated services, optimizing the services of the system in time of load change input via adjustment of the times of the access gated services, and strengthening the flexibility and fairness of multimedia transmissions in web cluster system. The theoretical model of this scheme is established with Markov chain and probability generating function. Mathematical analysis is made on the mean queue length and the mean inquiry cyclic time of the common queue and the key station. It turns out that the findings from theoretical analysis correspond well with those from simulated experiments.