Network calculus based QoS analysis of network coding in Cluster-tree wireless sensor network

Author(s):  
Lie Jiang ◽  
Li Yu ◽  
Zilong Chen
2013 ◽  
Vol 77 (1) ◽  
pp. 87-99 ◽  
Author(s):  
Baolin Sun ◽  
Chao Gui ◽  
Ying Song ◽  
Hua Chen

2015 ◽  
Vol 10 (1) ◽  
pp. 24-32 ◽  
Author(s):  
Xing Shao ◽  
Cui-Xiang Wang ◽  
Yuan Rao

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Prashant R. Dike ◽  
T.S. Vishwanath ◽  
Vandana Rohakale

PurposeSince communication usually accounts as the foremost problem for power consumption, there are some approaches, such as topology control and network coding (NC), for diminishing the activity of sensors’ transceivers. If such approaches are employed simultaneously, then the overall performance does raise as expected. In a wireless sensor network (WSN), the linear NC has been shown to enhance the performance of network throughput and reduce delay. However, the NC condition of existing NC-aware routings may experience the issue of false-coding effect in some scenarios and usually neglect node energy, which highly affects the energy efficiency performance. The purpose of this paper is to propose a new NC scheduling in a WSN with the intention of maximizing the throughput and minimizing the energy consumption of the network.Design/methodology/approachThe improved meta-heuristic algorithm called the improved mutation-based lion algorithm (IM-LA) is used to solve the problem of NC scheduling in a WSN. The main intention of implementing improved optimization is to maximize the throughput and minimize the energy consumption of the network during the transmission from the source to the destination node. The parameters like topology and time slots are taken for optimizing in order to obtain the concerned objective function. While solving the current optimization problem, it has considered a few constraints like timeshare constraint, data-flow constraint and domain constraint. Thus, the network performance is proved to be enhanced by the proposed model when compared to the conventional model.FindingsWhen 20 nodes are fixed for the convergence analysis, performed in terms of multi-objective function, it is noted that during the 400th iteration, the proposed IM-LA was 10.34, 13.91 and 50% better than gray wolf algorithm (GWO), firefly algorithm (FF) and particle swarm optimization (PSO), respectively, and same as LA. Therefore, it is concluded that the proposed IM-LA performs extremely better than other conventional methods in minimizing the cost function, and hence, the optimal scheduling of nodes in a WSN in terms of the multi-objective function, i.e. minimizing energy consumption and maximizing throughput using NC has been successfully done.Originality/valueThis paper adopts the latest optimization algorithm called IM-LA, which is used to solve the problem of network coding scheduling in a WSN. This is the first work that utilizes IM-LA for optimal network coding in a WSN.


Sign in / Sign up

Export Citation Format

Share Document