Novel Approach for Dynamic Data Collection in Tree Based Wireless Sensor Networks

摘要

In the wireless sensor networks the energy of the nodes present in the network is limited. Due to the low manufacturing costs of sensor nodes, they can be organized in large numbers and containing more challenges in routing, topology and data management protocols. These challenges are complicated by severe energy constraints and the inherently unreliable nature of wireless communicatio ns which have yielded work in increasing network efficiency. Our main objective is to increase the tolerance level and decrease the co mplexity of the wireless sensor network. In this primarily visualize time scheduling on a single frequency channel with the aim of reducing the number of time slots necessary to entire a convergecast. After we mingle scheduling with communication power control to moderate the effects of interference, and demo nstrate that while power control helps in reducing the schedule length under a on its own frequency, forecast transmissions using several frequencies is more capable. We present lower bounds on the schedule length when interference is completely removed , and recommend algorithms that achieve these bounds. We also estimate the performance of different channel assignment methods, the use of multi-frequency sched uling can sufficient to eliminate most o f the interference. After that the data collection rate increases by reducing the interference by the topology of the routing tree