Abstract

With the advent of sensor nodes with higher communication and sensing capabilities, the challenge arises in forming a data gathering network to maximize the network capacity. The channel sharing for higher data transmission leads to interfering problems. The effects of interferences become increasingly important when simultaneous transmissions are done in order to increase wireless network capacity. In such cases, achieving a high throughput and low delay is difficult. We propose a new method that uses interference alignment (IA) technique to mitigate interference effects in Wireless Sensor Networks (WSNs). In IA technique, multiple transmitters jointly encode their signals to intended receivers such that interfering signals are separated and eliminated. Simulation results demonstrate that compared to TDMA algorithms, the proposed method significantly increases the performance of the network delay and throughput by reducing the delay and increasing throughput.

Highlights

  • A Wireless Sensor Networks (WSNs) consists of a group of sensor nodes, which are deployed in a region of interest

  • In interference alignment (IA) technique, multiple transmitters jointly encode their signals to intended receivers such that interfering signals are separated and eliminated

  • Simulation results demonstrate that compared to TDMA algorithms, the proposed method significantly increases the performance of the network delay and throughput by reducing the delay and increasing throughput

Read more

Summary

Introduction

A WSN consists of a group of sensor nodes, which are deployed in a region of interest. The primary conflict happens when a node receives more than one transmission or transmits and receives in one time slot. For reducing the interference effect and decreasing the transmission delay, in [5] using the graph coloring strategy, two centralized TDMA scheduling algorithms are developed, one node-based scheduling and the other level-based scheduling. The scheduling of the original network is obtained based on coloring of the linear network This scheduling algorithm schedules a nonconflicting set of nodes corresponding to levels of each color for the current slot and schedules additional nodes, if possible. Multiple sets of nodes are selected to use IA technique and the nodes of each set can transmit by using IA simultaneously.

Methods
Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.