Abstract
We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evaluate a number of different techniques using realistic simulation models under the many-to-one communication paradigm known as convergecast. We first consider time scheduling on a single frequency channel with the aim of minimizing the number of time slots required (schedule length) to complete a convergecast. Next, we combine
scheduling with transmission power control to mitigate the effects of interference, and show that while power control helps in reducing the schedule length under a single frequency, scheduling transmissions using multiple frequencies is more efficient. We give lower bounds on the schedule length when interference is completely eliminated, and propose algorithms that achieve these bounds. We also evaluate the performance of various channel assignment methods and find empirically that for moderate size networks of about 100 nodes, the use of multifrequency scheduling can suffice to eliminate most of the interference. Then, the data collection rate no longer remains limited by interference but by the topology of the routing tree. To this end, we construct degree-constrained spanning trees and capacitated minimal spanning trees, and show significant improvement in scheduling performance over different deployment densities. Lastly, we evaluate the impact of different interference and channel models on the schedule length.
Existing System with Limitations
In wireless sensor networks (WSNs) organized as trees, the efficiency of data collection under the many-to-one communication paradigm, known as convergecast, is limited by several factors:
- Single Frequency Channel Scheduling: Traditional approaches often use time scheduling on a single frequency channel, which aims to minimize the number of time slots required to complete a convergecast. However, this method is constrained by interference and limited channel availability.
- Interference Mitigation: While transmission power control is used to mitigate interference, it is not sufficient to handle all interference issues, resulting in suboptimal schedule lengths.
- Inefficient Frequency Utilization: Scheduling transmissions using only a single frequency channel does not fully utilize the available spectrum, leading to longer schedule lengths and reduced data collection rates.
Proposed System with Advantages
The proposed system addresses the limitations of existing data collection methods in wireless sensor networks organized as trees by introducing several innovative techniques:
- Multi-Frequency Scheduling: By scheduling transmissions using multiple frequencies, the system efficiently utilizes the available spectrum, significantly reducing the schedule length compared to single frequency methods.
- Combined Scheduling and Power Control: The integration of scheduling with transmission power control helps mitigate interference more effectively, enhancing the efficiency of data collection.
- Lower Bounds on Schedule Length: The system provides lower bounds on the schedule length when interference is completely eliminated, ensuring that the proposed algorithms are both optimal and efficient.
SYSTEM REQUIREMENTS
SOFTWARE REQUIREMENTS:
• Web Technologies : HTML, CSS, JS. JSP
• Programming Language : Java and J2EE
• Database Connectivity : JDBC
• Backend Database : MySQL
• Operating System : Windows 08/10
HARDWARE REQUIREMENTS:
- Processor : Core I3
- RAM Capacity : 2 GB
- Hard Disk : 250 GB
- Monitor : 15″ Color
- Mouse : Two or Three Button Mouse
- Key Board : Windows 08/10
