Sleep Scheduling In Wireless Sensor Network (wsn) Research

With the development of electronic technology, communication technology,embedded technology and wireless network, Wireless sensor networks have beenwidely applied in many areas of military defense, tsunami detection, environmentaltesting and battlefield detection. Wireless sensor networks consists of sensor nodes, theenergy carried by sensor nodes is limited, so sensor node often use sleep-wakescheduling to work. In this paper, we focus on the sleep-wake scheduling in wirelesssensor network, propose algorithm based on sleep-wake scheduling. The maincontributions of this thesis are follows:1. Aiming at the problem that sensors use asynchronous sleep-wake schedulingto increase the communication delay, in this paper we propose regulating duty-cyclemechanism according to the excellence of parallel of Dual-Radio wireless sensornetworks. This mechanism makes the wake-up time of node earlier by regulating theduty-cycle of nodes dynamically, and predicts the conflict on the data transmission toreduce the interference of conflict. Simulation experiments and theoretical analysisshow that solution uses less energy and reduces the communication delay of wirelesssensor networks.2. Aiming at the problem that node which is moving discovers its neighbor nodesin mobile sensor network, in this paper we propose regulating the duty cycle ofdiscovery node mechanism dynamically. When discovery node is in the mobile process,node makes use of the boundary nodes of the former communication range to predictthe potential neighbor nodes, then it uses the feature of Poisson distribution to estimatenumber of neighbor nodes in the changing communication range, and use balls、boxesmodel to compute the discovery node’s duty cycle, dynamically regulate the duty cycleto discover the neighbor nodes, after regulating the duty cycle of node, node completes monitoring by scheduling the wake-time in the position of wake-cycle periodically.Simulation experiments and theoretical analysis show that solution proposed candiscover more neighbor nodes in the short period of time with less energy.