Fast Data Collection in Tree Based Wireless Sensor Network

Abstract

We investigate the following fundamental question - how fast will data be collected from a wireless device network organized as tree? to deal with this, we explore and evaluate the variety of various techniques using realistic simulation models below many-to-one communication paradigm referred to as converge-cast. we tend to 1st consider time scheduling on one frequency channel with the aim of minimizing the number of time slots needed (schedule length) to finish a converge-cast. Next, we combine scheduling with transmission power control to mitigate the effects of interference and show that whereas power control helps in reducing the schedule length below one frequency, programming transmissions exploitation multiple frequencies are a lot of efficient. we offer lower bounds on the schedule length once interference is totally eliminated, and propose algorithms that deliver the goods these bounds. we tend to conjointly evaluate the performance of varied channel assignment strategies and notice empirically that for moderate size networks regarding 100 nodes, the employment of multi-frequency programming will suffice to eliminate most of the interference. Then, the info collection rate not remains restricted by interference however by the topology of the routing