Multi Objective Concerned Network Coding Technique for Optimal Data Transmission
The Internet of Things (IoT) seems to developed in the real-world scenario due to increased utilization of sensor driven technologies. There are various research works has been proposed earlier for the network coding to ensure the reliable data transmission. However, existing research techniques doe...
Gespeichert in:
Veröffentlicht in: | Webology 2021-10, Vol.18 (5), p.1191-1203 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The Internet of Things (IoT) seems to developed in the real-world scenario due to increased utilization of sensor driven technologies. There are various research works has been proposed earlier for the network coding to ensure the reliable data transmission. However, existing research techniques doesn’t focus on the reliable route path selection which might affect the rate of data transmission. These issues are focused in the proposed research method by introducing the method namely Multi-Objective concerned Network Coding Technique (MO-NCT). In this work initially multicast tree construction is performed using Particle Swarm Optimization method. The main goal of this research work is ensuring the reliable and successful data transmission. Here the optimal network nodes will be chosen for constructing the multi cast tree. The multiple objectives considered in this work for the selection of the nodes are residual energy, remaining bandwidth level and throughput of nodes. To ensure the reliable data transmission even with the presence of larger coverage area, this work attempted to select the backup forwarder nodes which will act as intermediate hop relay nodes. The overall analysis of the research work is done in the NS2 simulation environment from which it is proved that the proposed method MO-MRP tends to achieve the optimal data transmission rate. |
---|---|
ISSN: | 1735-188X 1735-188X |
DOI: | 10.14704/WEB/V18SI05/WEB18300 |