Ding Hongwei

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.

The Analysis of the MAC Protocol of Two-Class Priority Station Polling System under Mixed Services Policy of Exhaustive and Two-Times Gated Services

AODV (Ad Hoc On-Demand Distance Vector) protocol is an on-demand protocol specialized for ad hoc network and it has been used as a mesh routing in 6LoWPAN (IPv6 over IEEE 802.15.4). In order to adapt to the hardware sources especially energy source restrictions of 6LoWPAN, we propose S-AODV (Sink Routing Table over AODV) routing, a new AODV implementation designed to provide benefits in terms of traffic reduction, power consumption and networks lifetime extension, for 6LoWPAN in this paper. In S-AODV, traffic of route discovery in original AODV is reduced by using SRT (Sink Routing Table). By the new mechanism, the delay and energy consumption of the connection between each internal common node and the sink are reduced.

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.

Design and Implementation of No-Persistent CSMA Based on FPGA

CSMA is carrier-sense multiple access and is one of the key protocols to ensure the efficient operation of the communication network. According to the characteristics of wireless sensor network nodes, the use of FPGA (field programmable array) for no-persistent CSMA access communication system provides a high-speed data transmission scheme to achieve gate. The design uses MATLAB and Quartus II as the experimental platform, which satisfies the Poisson distribution and the time slot length controllable source module for different events in the transmission process, using the method of hardware description language Verilog HDL and logic circuits to design the simulation, through calculation and analysis, the theory of throughput of the protocol are consistent with the simulation value, proved that the system has reliability design bureau, portability etc.

Research On Priority Differentiated Polling Mechanism with Limited Service in Wireless Sensor Networks: Extended Abstract

Polling system models have a wide range of important applications and plays an important role in Wireless Sensor Networks1 (WSN) due to limited bandwidth and battery. To provide a more efficient system, this paper presents a new priority differentiated polling mechanism with limited service in WSN. We use 1-limited, 2-limited, 3-limited, and 4-limited services to achieve the priority-based scheme. The paper describes the mechanism of the scheduling process and the scheme is analyzed and validated for performance through experiments. The numerical experiments results illustrate that the new model achieves a better performance than the existing protocols such as the single gated service.

Performance evaluation of polling scheme with different priority service

The main contribution of this paper is evaluation of polling scheme with different priority service, which consists of a hub station and N common stations. We consider the polling schemes which use the proposed mechanism with exhaustive + limited service (mixed I service) as well as exhaustive + gated service (mixed Π service) in discrete-time respectively. By the embedded Markov chain theory and the probability generating function methodology, we derive the characteristic parameters of both polling schemes. With the analytical results and computer simulations, their performances have been evaluated, and the concluding remarks are also presented.

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.

Message delay analysis of serial processing system with vacation in WSN

Many wireless sensor networks (WSN) application systems are composed of multiple sensor nodes serial processing system. This paper sets up the model for the serial processing system using gated service in wireless sensor networks, and studies it by the Markov chain theory and the probability generating function method, the calculating equation of the mean waiting time of message packet is obtained by every sensor node in the serial processing system. We obtain corresponding results under some especial cases. Finally, the simulation results are given.