Performance Analysis of Mesh Based Enterprise Network Using RIP, EIGRP and OSPF Routing Protocols

2021 ◽  
Vol 10 (1) ◽  
pp. 47
Author(s):  
Md. Humayun Kabir ◽  
Md. Ahasan Kabir ◽  
Md. Saiful Islam ◽  
Mohammad Golam Mortuza ◽  
Mohammad Mohiuddin

Computer network communication is quickly growing in this pandemic situation. Phone conferencing, video streaming and sharing file/printing are all made easier with communications technologies. Data transmitted in time with little interruption become a significant achievement of wireless sensor networks (WSNs). A massive network is interconnection computer networks in the globe connected by the Internet, and the Internet plays a critical role in WSNs. Data access is a key element of any enterprise network, and the routing protocol is used to transmit data or access data. Due to the growing use of WSNs, it is essential to know about the network structure, the routing protocol. The routing protocols must be used to route all data sent over the Internet between the source and the destination. Which chooses the optimum routes between any two nodes in an enterprise network. This research focused on how the routing table will determine the optimum path/route of data packets to be transmitted from source to destination. The performance of three routing protocols, Routing Information Protocol (RIP), Enhanced Interior Gateway Routing Protocol (EIGRP) and Open Shortest Path First (OSPF), is investigated in this research for the massive mesh based enterprise wireless sensor network. We also investigated the behaviors of end-to-end packet latency, convergence time on flapping connections and average point-to-point throughput (bits/sec) between network links. Finally, the simulation results are compared to the efficacy and performance of these protocols implemented in the wireless LAN and internet-based wireless sensor network.

Author(s):  
Tanya Pathak ◽  
Vinay Kumar Singh ◽  
Anurag Sharma

In the recent years, an efficient design of a Wireless Sensor Network has become important in the area of research. The major challenges in the design of Wireless Sensor Network is to improve the network lifetime. The main difficulty for sensor node is to survive in that monitoring area for the longer time that means there is a need to increase the lifetime of the sensor nodes by optimizing the energy and distance. There are various existing routing protocols in which optimal routing can be achieved like Data-Centric, Hierarchical and Location-based routing protocols. In this paper, new power efficient routing protocol is being proposed that not only select the shortest path between the source node and sink node for data transmission but also maximizes the lifetime of the participating nodes by selecting the best path for sending the data packet across the network. The main objective of this research is to develop a faster algorithm to find the energy efficient route for Wireless Sensor Network. Simulation results shows that this strategy achieves long network lifetime when compared to the other standard protocols.


2021 ◽  
Author(s):  
R. Thiagarajan ◽  
V. Balajivijayan ◽  
R. Krishnamoorthy ◽  
I. Mohan

Abstract Underwater Wireless Sensor Network offers broad coverage of low data rate acoustic sensor networks, scalability and energy saving routing protocols. Moreover the major problem in underwater networks is energy consumption, which arises due to lower bandwidth and propagation delays. An underwater wireless sensor network frequently employs acoustic channel communications since radio signals not worked in deep water. The transmission of data packets and energy-efficient routing are constraints for the unique characteristics of underwater. The challenging issue is an efficient routing protocol for UWSNs. Routing protocols take advantage of localization sensor nodes. Many routing protocols have been proposed for sensing nodes through a localization process. Here we proposed a Novel vector-based forwarding and efficient depth-based routing protocol. The proposed novel vector-based forwarding provides robust, scalable, and energy-efficient routing. It easily transfers nodes from source to destination. It adopts the localized and distributed alternation that allows nodes to weigh transferring packets and decreases energy consumption and provides better optimal paths. Efficient depth-based routing is a stochastic model that will succeed in a high transmission loss of the acoustic channel. The simulation was used to compare the energy consumption, network lifetime in the form of depth-based routing, delivery ratio, and vector-based forwarding to prove the optimal route finding paths and data transmission propagation delay.


Author(s):  
Mukhtiar Ahmed ◽  
Mazleena Salleh ◽  
M.Ibrahim Channa ◽  
Mohd Foad Rohani

<span>Underwater Wireless Sensor Network (UWSN) can enable many scientific, military, safety, commercial and environmental applications. Majority of the network models has been introduced for the deployment of sensor nodes through routing schemes and methodologies along with different algorithms but still the design of routing protocol for underwater environment is a challenging issue due to distinctive characteristics of underwater medium. The majority of the issues are also needed to fulfill the appropriate approach for the underwater medium like limited bandwidth, high bit error rates, propagation delay, and 3D deployment. This paper focuses the comparative analysis of the localization based routing protocols for UWSN. This comparative analysis plays a significant attention to construct a reliable routing protocol, which provides the effectual discovery of the route between the source node and the sink node. In addition this comparative analysis also focuses the data packets forwarding mechanism, the deployment of sensor nodes and location based routing for UWSN in different conditions.</span>


Energies ◽  
2020 ◽  
Vol 13 (3) ◽  
pp. 728
Author(s):  
Carolina Del-Valle-Soto ◽  
Carlos Mex-Perera ◽  
Juan Arturo Nolazco-Flores ◽  
Ramiro Velázquez ◽  
Alberto Rossa-Sierra

In this study, a Wireless Sensor Network (WSN) energy model is proposed by defining the energy consumption at each node. Such a model calculates the energy at each node by estimating the energy of the main functions developed at sensing and transmitting data when running the routing protocol. These functions are related to wireless communications and measured and compared to the most relevant impact on an energy standpoint and performance metrics. The energy model is validated using a Texas Instruments CC2530 system-on-chip (SoC), as a proof-of-concept. The proposed energy model is then used to calculate the energy consumption of a Multi-Parent Hierarchical (MPH) routing protocol and five widely known network sensors routing protocols: Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR), ZigBee Tree Routing (ZTR), Low Energy Adaptive Clustering Hierarchy (LEACH), and Power Efficient Gathering in Sensor Information Systems (PEGASIS). Experimental test-bed simulations were performed on a random layout topology with two collector nodes. Each node was running under different wireless technologies: Zigbee, Bluetooth Low Energy, and LoRa by WiFi. The objective of this work is to analyze the performance of the proposed energy model in routing protocols of diverse nature: reactive, proactive, hybrid and energy-aware. Experimental results show that the MPH routing protocol consumes 16%, 13%, and 5% less energy when compared to AODV, DSR, and ZTR, respectively; and it presents only 2% and 3% of greater energy consumption with respect to the energy-aware PEGASIS and LEACH protocols, respectively. The proposed model achieves a 97% accuracy compared to the actual performance of a network. Tests are performed to analyze the consumption of the main tasks of a node in a network.


2012 ◽  
Vol 203 ◽  
pp. 243-246
Author(s):  
Fang Pei ◽  
Jie Zhang

Wireless sensor network (WSN) is one of the key technologies of the Internet, and the problem of load balancing is an important content of the wireless sensor network (WSN). First wireless sensor networks and their characteristics are introduced in this paper, and then bottleneck network problem which is caused by the wireless sensor networks due to the presence of physical obstructions or uneven energy consumption in a real environment is studied, and a solution to optimal routing protocols based on load balancing is proposed.


Author(s):  
Vaishali Thorat ◽  
Dr. Lalitkumar Wadhwa ◽  
Dr. Satish Kumar

As we know Wireless Sensor Network is the perfect solution for quick capturing, processing and transmission of critical data. Sensor nodes are often deployed in generous environment but nodes suffer from low battery power. So, energy efficiency and network life are main concerns in WSN. Zig Bee have low cost, low power consumption and is beneficial in wireless sensor networks by selecting adequate communication protocol. Routing protocols like AODV (Ad- hoc on demand distance vector routing), ZTR (Zig Bee tree routing), and STR (Shortcut tree routing) and ESTR (Extended Shortcut tree routing) are compared on the idea of various performance metrics like end to finish delay, routing overload, throughput, packet delivery ratio (PDR). The mathematical analysis and performance evaluation shows that ESTR achieves better performance as compared to other routing protocols. The overall evaluation shows that ESTR achieves better performance as compared to other routing protocols. But there are some limitations of ESTR method. Performance of packet delivery ratio of STR is less as compared to AODV. Performance of end to end delay of STR is poor as compared to AODV. Extended STR is proposed to represent new ZigBee network routing protocol with improved performance of Packet Delivery ratio (PDR) and delay against STR and AODV. We are introducing here Efficient Extended Shortcut Tree Routing method (ESTR) for further improvement of delays of ESTR method.


2019 ◽  
Vol 8 (2S3) ◽  
pp. 1072-1077

Routing in wireless sensor network environment plays a critical role where it might be affected by various factors which would lead to data transmission failure/corruption. Energy is the most concerned factor which affects the routing task mostly due to their limited availability. Thus routers require most efficient routing protocol which can perform data communication with less energy consumption. This routing protocol should be capable of adapting critical conditions happening on routers. Another problem that is mostly found on routing task is security. The security issues created by the hackers would corrupt/steal the data when it is being transmitted to the destination nodes. The routing protocol should also capable of tolerating the security issues and needs to ensure the successful data transmission. In this analysis work, various hierarchical clustering algorithms that are proposed for grouping the wireless sensor nodes those is present in the environment is discussed. The clustering that can be applied on both heterogeneous and homogeneous wireless network environment is discussed. The operation and functionality of each clustering algorithms are given in depth to understand the routing skill of each nodes. The merits and demerits that are present in the every clustering algorithm are presented to find the better clustering approach. The experimental analysis of every algorithm are done and compared in terms of various performance measures to find the better clustering approach that can be utilized for further scenario.


2018 ◽  
Vol 7 (2.8) ◽  
pp. 216 ◽  
Author(s):  
Humera Khan

Wireless Sensor Network is a widely growing field and it comprises of tiny sensor nodes. These sensor nodes are distributed in the environment spatially. They are capable of sensing the environment, gathering the information and processing it. Each sensor node collaborate with other sensor nodes for processing the information. Sensor nodes have very limited resources available for their operation. For the purpose of consuming resources in an efficient way several routing algorithms are employed. Here the focus is mainly on hierarchical cluster based routing techniques. In this paper we provide an introduction for wireless sensor network, the requirement for reduction in energy consumption of sensor nodes and some of the already existing energy efficient routing protocols of wireless sensor network.


Author(s):  
Ms Mamta

Wireless Sensor Network (WSN) has delivered the accessibility of small, tiny and low cost sensor nodes which are capable to sense various kinds of physical and environmental conditions, data processing, wireless communication and data gathering. In wireless sensor network routing protocols can be divided into two categories first is flat routing protocol and another is hierarchical routing protocol. In this paper flat and hierarchical routing protocols are evaluated and compared based on various performance parameters. In the last decade we have seen expanded enthusiasm for the potential utilization of remote wireless sensor systems (WSNs) in an extensive change of uses and it has turned into a unique research zone. So finally, in this research paper we are focusing on two different classes of routing protocols in WSN: flat routing and hierarchical or clustering routing.


Sign in / Sign up

Export Citation Format

Share Document