Composite Interference Mapping Model to Determine Interference-Fault Free Schedule in WSN

The primary focus of most approaches that model interference in WSN is to understand the conditions under which the signals received by a destination node are interfered by the transmissions of other nodes. While these models support the basic understanding of interference phenomenon between two nod...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2022, Vol.10, p.107505-107525
Main Authors: Begum, Beneyaz Ara, Nandury, Satyanarayana V.
Format: Article
Language:English
Subjects:
Algorithms
Data aggregation
Interference
interference-faults
Mapping
Nodes
Performance measurement
Scheduling
Signal to noise ratio
Terminology
Topology
Wireless communication
Wireless sensor networks
WSN
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The primary focus of most approaches that model interference in WSN is to understand the conditions under which the signals received by a destination node are interfered by the transmissions of other nodes. While these models support the basic understanding of interference phenomenon between two nodes; models that attempt to map the nodes whose transmissions can potentially interfere with other nodes is highly desirable. To this end, we propose the Composite Interference Mapping (CIM) model that provides a holistic framework for determining a comprehensive map of all potential interferers for each and every active link in the WSN. Based on CIM model, we propose three Interference-Fault Free Transmission (IFFT) scheduling algorithms viz., (i) IFFT-STDMA and IFFT-ESTDMA for topology-free, and (ii) LL-IFFT-ESTDMA for tree-structured WSNs, which also addresses the Exposed Station (ES) and Hidden Terminal (HT) problems. We present the analytical studies to support the CIM model developed in the paper. The results of the simulation experiments have shown that the proposed CIM-based IFFT algorithms perform much better compared to some of the well-known algorithms in performance metrics such as: number of time slots, packet drop, number of dead nodes, honouring precedence relations, and addressing ES and HT problems.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2022.3211654