scholarly journals Evaluation of CupCarbon Network Simulator for Wireless Sensor Networks

2018 ◽  
Vol 10 (2) ◽  
pp. 1 ◽  
Author(s):  
Cristina Lopez-Pavon ◽  
Sandra Sendra ◽  
Juan F. Valenzuela-Valdes
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Algorithm ◽  
Life Time ◽  
Wireless Sensor ◽  
Network Simulator ◽  
Network Simulators ◽  
Theoretical Analyses ◽  
Free Code ◽  
Selection Of

Wireless sensor networks are a technology in full evolution with great future and a huge quantity of applications. This document lists some of the limitations existing in WSN networks. In addition, several existing techniques are collected to maximize the network's lifetime, demonstrating that efficient use of energy is very important to achieve this goal. Due to the importance of knowing the behaviour of this type of network before its launch, a comparative is established for the options offered by the WSN network simulators available in the market, compared to those offered by CupCarbon. The objective of this project is the evaluation of the CupCarbon simulator through the implementation of an algorithm that aims to maximize the life time of the network, as well as collecting the results offered by this algorithm. In this way, a Dijkstra routing algorithm is developed whose selection of routes depends on the battery level contained in the nodes that constitute the network. This algorithm is referred as dynamic Dijkstra in the present document. To achieve the objectives described, we pretend to simulate the dynamic Dijkstra in CupCarbon, for this aim, the source code is modified, since it is a free code tool. As a result, it is possible to create the original Dijkstra, but certain problems are presented, to develop the part that depends on the energy, related to the functionalities offered by CupCarbon. As an alternative to determine the results associated to the created algorithm, theoretical analyses are accomplished. Consequently, it is concluded that the evaluation of CupCarbon is not satisfactory enough, while the algorithm created maximizes the network's lifetime.

scholarly journals PCA-Guided Routing Algorithm for Wireless Sensor Networks

2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Gong Chen ◽  
Liansheng Tan ◽  
Yanlin Gong ◽  
Wei Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Principal Component ◽  
Wireless Sensor ◽  
Energy Dissipated ◽  
Sum Of Distances ◽  
Theoretical Analyses

An important performance concern for wireless sensor networks (WSNs) is the total energy dissipated by all the nodes in the network over the course of network lifetime. In this paper, we propose a routing algorithm termed as PCA-guided routing algorithm (PCA-RA) by exploring the principal component analysis (PCA) approach. Our algorithm remarkably reduces energy consumption and prolongs network lifetime by realizing the objective of minimizing the sum of distances between the nodes and the cluster centers in a WSN network. It is demonstrated that the PCA-RA can be efficiently implemented in WSNs by forming a nearly optimalK-means-like clustering structure. In addition, it can decrease the network load while maintaining the accuracy of the sensor measurements during data aggregating process. We validate the efficacy and efficiency of the proposed algorithm by simulations. Both theoretical analyses and simulation results demonstrate that this algorithm can perform significantly with less energy consumption and thus prolong the system lifetime for the networks.

scholarly journals A Research on Energy Efficient Cluster Routing for the Wireless Sensor Networks

2019 ◽  
Vol 8 (6S4) ◽  
pp. 1344-1347
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Search Algorithm ◽  
Routing Algorithm ◽  
Life Time ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Small Clusters

Clustering with energy efficient routing is the most important technique for the wireless sensor networks. Cluster converts group of sensor nodes into small clusters and electing the cluster heads with energy efficient cluster routing for all the clusters in the Wireless sensor networks. By selecting the proper energy efficient cluster routing algorithm we can increase the life time of the wireless sensor networks. Lot of techniques are used for energy efficient cluster routing for Wireless sensor networks like Particle Swarm Optimization, Artificial Bees Colony Optimization, Crow Search Algorithm, Energy-efficient Intracluster Routing (EIR) algorithm and Dolphin Echolocation Algorithm (DEA). In this paper we have given the comparative analysis report of energy efficient cluster routing algorithms for the wireless sensor networks in terms of energy efficiency and sensor node lifetime of the networks.

QoS Aware Multi-hop Multi-path Routing Approach in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 43-52
Author(s):  
Omkar Singh ◽  
Vinay Rishiwal
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Life Time ◽  
Base Station ◽  
Environmental Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
End To End

Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.

SPREAD - A Routing Protocol to Meet End-to-end Adjusted Deadline in Real Time Wireless Sensor Networks

2020 ◽  
Vol 10 (1) ◽  
pp. 63-78
Author(s):  
Neetika Jain ◽  
Sangeeta Mittal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Routing Protocol ◽  
Resource Constraints ◽  
Wireless Sensor ◽  
Network Simulator ◽  
Packet Delivery ◽  
High Data ◽  
Hard Real Time

Background: Real Time Wireless Sensor Networks (RT-WSN) have hard real time packet delivery requirements. Due to resource constraints of sensors, these networks need to trade-off energy and latency. Objective: In this paper, a routing protocol for RT-WSN named “SPREAD” has been proposed. The underlying idea is to reserve laxity by assuming tighter packet deadline than actual. This reserved laxity is used when no deadline-meeting next hop is available. Objective: As a result, if due to repeated transmissions, energy of nodes on shortest path is drained out, then time is still left to route the packet dynamically through other path without missing the deadline. Results: Congestion scenarios have been addressed by dynamically assessing 1-hop delays and avoiding traffic on congested paths. Conclusion: Through extensive simulations in Network Simulator NS2, it has been observed that SPREAD algorithm not only significantly reduces miss ratio as compared to other similar protocols but also keeps energy consumption under control. It also shows more resilience towards high data rate and tight deadlines than existing popular protocols.

Sign in / Sign up

Export Citation Format

Share Document