Water Wave Optimization Algorithm based Congestion Control and Quality of Service Improvement in Wireless Sensor Networks
Journal Title: Transactions on Networks and Communications - Year 2017, Vol 5, Issue 4
Abstract
Many researchers have implemented various machine learning algorithms and verify their results with the existing algorithms to control congestion in Wireless Sensor Networks. The major challenge lies in developing an algorithm which optimizes the value of the objective function on the basis of parameters like network throughput, residual energy and packet loss rate of the nodes in the network. An objective function based on these parameters is proposed in the present work. Water wave optimization algorithm is applied on the objective function and an optimum solution is obtained. The proposed approach is compared with the Congestion Detection and Avoidance algorithm (CODA) and Particle Swarm Optimization Algorithm (PSO). The proposed solution outperforms both algorithms on the basis of various performance parameters.
Authors and Affiliations
Mukhdeep Singh Manshahia
Keywords
Related Articles
- EP ID EP301428
- DOI 10.14738/tnc.54.3567
- Views 57
- Downloads 0
TPC Together with Overlapped Time Domain Multiplexing System Based on Turbo Structure
Overlapped time domain multiplexing (OvTDM) is a novel technique for utilizing inter-symbol interference (ISI) to benefit a communication system. We implement the OvTDM technique based on turbo structure and associate a...
An IOT-enabled System for Marine Data Acquisition and Cartography
Current satellite communication remains very expensive and impractical for most small to mid-sized vessels, and at the same time marine wireless networking is lack of network coverage. To solve this problem, this paper p...
The Blockchain: Overview of “Past” and “Future”
Variety of network technologies deployed for ease of use and emerging technologies developed for better communication, enhanced security and faster delivery. The global financial crash of 2007-2008 created a lot of distr...
Searching Isomorphic Graphs
To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other....
Outlier Resistant Time Series Operations via Qualitative Robustness and Saddle‐Point Game Formalizations‐ A Review: Filtering and Smoothing
Time series operations are sought in numerous applications, while the observations used in such operations are generally contaminated by data outliers. The objective is thus to design outlier resistant or “robust” time s...