scholarly journals Design Research on Algorithm of Processing Time, Data Aggregation Time, Packet Delivery Ratio and Energy Consumption

2019 ◽  
Vol 8 (2S3) ◽  
pp. 1041-1046
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Data Aggregation ◽  
Processing Time ◽  
Design Research ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Common Goal ◽  
Time Data ◽  
Packet Delivery

This paper presents the preliminary information of research that deals with communication protocol for Wireless Sensor Network (WSN) with retention of energy efficiency. The motive of this research is to accomplish a common goal of energy efficiency, using different forms of methodologies. Hence, the adoption of different methodologies and a common goal of energy efficiency in WSN are achieved. This paper explains the outcome accomplishment the proposed ENLPL Algorithm, Globular topology, load balancing technique of Processing Time, Data Aggregation Time, Packet Delivery Ratio and Energy Consumption pertaining to optimizing energy using probabilistic technique, and Dynamic Reconfiguration. . The work also explains about the comparative analysis among the models to showcase the best scenario of usage in sensorbased applications

scholarly journals Multi-Token Based MAC-Cum-Routing Protocol for WSN: A Distributed Approach

2019 ◽  
Vol 15 (3) ◽  
Author(s):  
Subhasis Dash ◽  
Saras Kumar ◽  
Manas Ranjan Lenka ◽  
Amulya Ratna Swain
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Data Transmission ◽  
Mac Protocol ◽  
Reliable Data ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Data Delivery ◽  
Packet Delivery ◽  
End To End

A wireless sensor network is a collection of batterypowered sensor nodes distributed in a geographical area. Inmany applications, such networks are left unattended for along period of time. These networks suffer from the problemslike high energy consumption, high latency time, and end- to-end low packet delivery ratio. To design a protocol that findsa trade-off between these problems is a challenging task. Inorder to mitigate energy consumption issue, different existingMedia Access Control (MAC) protocols such as S-MAC, RMAC,HEMAC, and Congestion-less Single Token MAC protocols havebeen proposed which ensure better packet delivery but fail toensure energy efficiency due to high end-to-end latency. Theproblem of high end-to-end latency is resolved with the existingrouting protocols such as Fault Tolerant Multilevel Routingprotocol (FMS)and Enhanced Tree Routing (ETR) protocol.AS2-MAC and Multi Token based MAC protocol are able toimprove the end-to-end packet delivery ratio. However, thehierarchical network structure used in these protocols increasestime and energy consumption during network reconstruction.This problem was further resolved in Distributed HierarchicalStructure Routing protocol by constructing the network structurein a distributed manner. In all these existing protocols, efficienttoken management and reliable data delivery ratio was notproperly addressed, which in turn consume more energy. So,it is clear that MAC and routing protocols both together cangive better results related to data transmission in WSN. Inorder to achieve the same, in this paper, we propose a reliabledata transmission algorithm that satisfies both routing and MACprotocol to improve the end-to-end data delivery. The proposedprotocol uses different control message exchange that ensures datapacket delivery in each individual levels and it ultimately uses oftokens to ensure reliable data transmission along with reducedtraffic congestion during end-to-end data delivery. The algorithmconsiderably improves the packet delivery ratio along with reduceenergy consumption of each sensor node. Simulation studies ofthe proposed approach have been carried out and its performancehas been compared with the Multi Token based MAC protocol,AS-MAC protocol and ETR routing protocol. The experimentalresults based on simulation confirms that the proposed approachhas a higher data packet delivery ratio.

A Voronoi- Ant Colony based Routing (VoR-Ant-R) Algorithm for WMSNs

2022 ◽  
Vol 13 (2) ◽  
pp. 0-0
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Ant Colony ◽  
Delivery Ratio ◽  
Wireless Multimedia ◽  
Energy Hole ◽  
Packet Delivery ◽  
Multimedia Sensor Networks ◽  
Increase Energy Efficiency ◽  
Simulation Results

Wireless Multimedia Sensor Networks (WMSNs) have been used in many applications and powerful distributed systems. But the performance of WMSNs is suffering from the occurrence of energy holes. To improve the performance of the network and packet delivery ratio, a Voronoi-Ant colony based Routing (VoR-Ant-R) algorithm is proposed for WMSNs to discover the energy holes and finds the shortest path from the source to destination in the WMSNs even though faces some obstacles. The WMSNs are constructed using the Voronoi structure to bypass energy holes. After bypassing the energy hole in the path; an ACO is introduced to select a neighborhood node for data forwarding. This ACO constructs the shortest optimized path to enhance the performance of the WMSNs. The proposed work is experimentally compared with other algorithms such as IEEABR, EEABR, SC, and BEES. The simulation results show that VoR-Ant-R can increase energy efficiency, success rate, reduces energy consumption, and latency.

Random Black Hole Attack Modelling and Mitigation Using Trust- Confidence Aware OLSR in MANETs for Private Data Communications

2020 ◽  
Vol 10 (2) ◽  
pp. 112-122
Author(s):  
Kirti A. Adoni ◽  
Anil S. Tavildar ◽  
Krishna K. Warhade
Keyword(s):  
Black Hole ◽  
Energy Consumption ◽  
Average Energy ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Black Hole Attack ◽  
Malicious Nodes ◽  
Packet Delivery ◽  
Routing Strategy ◽  
Average Energy Consumption

Background and Objective: Random Black Hole (BH) attack significantly degrades MANET’s performance. For strategic applications, the performance parameters like Packet Delivery Ratio, Routing Overheads, etc. are important. The objectives are: (a) To model random BH attack, (b) To propose a routing strategy for the protocol to mitigate random BH attack, (c) To evaluate and compare the network performance of modified protocol with the standard protocol. Methods: The random BH attack is modelled probabilistically. The analysis is carried out by varying Black Hole Attack (BHA) time as Early, Median, Late occurrences and mix of these three categories. The blocking performance is also analysed by varying the percentages of malicious presence in the network. Normal Optimized Link State Routing (OLSR) protocol is used to simulate the MANET performance using a typical medium size network. The protocol has then been modified using Trust- Confidence aware routing strategy, named as TCAOLSR, with a view to combat the degradations due to the random BH attack. Results: The random behavior of Black Hole attack is analyzed with all the possible random parameters, like deployment of mobile nodes, number of malicious nodes and timing instances at which these nodes change their state. From the results of individual type- Early, Median and Late, it is observed that the TCAOLSR protocol gives stable performance for Packet Delivery Ratio (PDR) and Routing Overheads (RO), whereas for OLSR protocol PDR gradually reduces and RO increases. For individual and mix type, Average Energy Consumption (AEC) per node increases marginally for TCAOLSR protocol. For the mix type, PDR for TCAOLSR is 40-60% better whereas RO for TCAOLSR is very less compared to OLSR protocol. The efficacy of the TCAOLSR protocol remains stable for different categories of BH attack with various percentages of malicious nodes compared to OLSR with the same environment. Conclusion: Simulations reveal that the modified protocol TCAOLSR, effectively mitigates the network degradation for Packet Delivery Ratio and Routing Overheads considerably, at the cost of a slight increase in Average Energy Consumption per node of the network. Efficacy of the OLSR and TCAOLSR protocols has also been defined and compared to prove robustness of the TCAOLSR protocol.

Optimization Based Sink Deployment Technique in WSN to Improve Network Performance

2020 ◽  
Vol 10 (2) ◽  
pp. 217-230
Author(s):  
Sonal Telang Chandel ◽  
Sanjay Sharma
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Network Performance ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Optimum Number ◽  
Packet Delivery ◽  
Multiple Sinks ◽  
The Impact ◽  
Deployment Cost

Background & Objective: Currently, WSN (Wireless Sensor Networks) provides a variety of services in industrial and commercial applications. WSN consists of nodes that are used to sense the environments like humidity, temperature, pressure, sound, etc. As the use of WSN grows there are some issues like coverage, fault tolerance, a deployment problem, localization, Quality of Service, etc. which needs to be resolved. Sink deployment is a very important problem because it is not the only impact on performance, but also influence on deployment cost. In traditional WSN, a single sink is deployed in the network, which aggregates all the data. Due to this, the whole network is suffering from some serious issues like delay, congestion, network failure that reduces network performance. Methods: One solution is to deploy multiple sinks instead of a single sink. Deploying multiple sinks can improve network performance, but increases sink deployment cost. In this paper, an ISDOA (Improved Sink Deployment Optimization Algorithm) is proposed to find the optimum number of sinks and their optimum location in ROI. Simulation is carried out in Matlab simulator. The impact of sensors and sinks on various network performance parameters like throughput, network lifetime, packet delivery ratio, energy consumption and cost of the network is analyzed. Results & Conclusion: It is shown by simulation results that the number of sinks varies inversely with energy consumption of the nodes; and it is linearly proportional to the network lifetime, throughput and packet delivery ratio. Furthermore, results show that the proposed approach outperforms random deployment with 25% higher throughput, 30% better network lifetime, 15% lesser energy consumption and 21% optimized cost of the network, respectively.

scholarly journals Game theory-based Routing for Wireless Sensor Networks: A Comparative Survey

2019 ◽  
Vol 9 (14) ◽  
pp. 2896 ◽  
Author(s):  
Md Arafat Habib ◽  
Sangman Moh
Keyword(s):  
Game Theory ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Packet Delivery Ratio ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Packet Delivery

Wireless sensor networks (WSNs) have become an important and promising technology owing to their wide range of applications in disaster response, battle field surveillance, wildfire monitoring, radioactivity monitoring, etc. In WSNs, routing plays a significant role in delivery latency, energy consumption, and packet delivery ratio. Furthermore, as these applications are used in critical operations with limited irreplaceable batteries, routing protocols are required to be flawless as well as energy efficient. The dynamic environment also requires intelligent and adaptive routing. Game theory is widely used for designing routing protocols in WSNs to achieve not only reduced energy consumption but also increased packet delivery ratio. The core features of efficiently designed game theory-based routing protocols include optimal cluster head selection in hierarchical routing, energy-efficient and delay-aware route discovery, fault-tolerant data delivery, and coalition forming and grouping among nodes for stringent data transfer. In this paper, different routing protocols based on various types of games are extensively reviewed, which have been reported so far for improving energy consumption, delay, route establishment time, packet delivery ratio, and network lifetime. The different game theory-based routing protocols are qualitatively compared with each other in terms of major features, advantages, limitations, and key characteristics. For each protocol, possible applications and future improvements are summarized. Certain important open concerns and challenges are also discussed, along with future research directions.

scholarly journals Data Transmission with Improving Lifetime of Cluster Network

2021 ◽  
Vol 12 (2) ◽  
pp. 420-428
Author(s):  
Anitha S, Et. al.
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Data Transmission ◽  
Cluster Head ◽  
Packet Delivery Ratio ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Cluster Network ◽  
Cryptographic Algorithm

The efficiency of selecting the cluster head plays a major role in resolving the complexities faced in network management aiming to improve the longevity of sensors in the network. The clustering process is followed by selecting proper cluster heads with the consideration of energy conservation among participant nodes. While coming to security concept on WSN, the trust based cluster head selection is significant with the assumption of cooperation of all sensor nodes. In view of this assumption, the traditional methods could not help in defining the ideal cluster head of the network. This work proposes Voronoi Clustered Secure Contextual Cryptographic Algorithm (VC-SCCA) by combining Voronoi method for clustering process and cryptographic algorithm for secure data transmission. This is considered as two-tier architecture whereas, clustering takes place in first tier and encryption along with decryption takes place in the second tier. The proposed algorithm is compared with two state-of-art methods such as, Secured WSN (SeC‐WSN) and Taylor based Cat Salp Swarm Algorithm (Taylor C-SSA) in terms of energy consumption, Packet Delivery Ratio (PDR), network lifetime, encryption time and decryption time. As a result, the proposed VC-SCCA achieves 53.2% of energy consumption, 98.6% of packet delivery ratio, 97.5% of network lifetime, 62.8sec of encryption time and 71.2sec decryption time.

scholarly journals LECAR: Location Estimation-Based Congestion-Aware Routing Protocol for Sparsely Deployed Energy-Efficient UAVs

Sensors ◽  
2021 ◽  
Vol 21 (21) ◽  
pp. 7192
Author(s):  
Imtiaz Mahmud ◽  
You-Ze Cho
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Packet Delivery Ratio ◽  
Location Estimation ◽  
Delay Tolerant Network ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Congestion Aware

Energy-efficient routing has become a critical issue for advanced energy-hungry unmanned aerial vehicles (UAVs). Routing in a flying ad hoc network is always challenging and becomes even more critical when a small number of UAVs must cover a large area. The routing protocols based on the delay-tolerant network (DTN) are best suited for such scenarios. However, traditional DTN-based routing protocols depend on data dissemination to offer a better packet delivery ratio, leading to congestion and excess transmissions, causing heavy and unnecessary energy consumption. We propose a location estimation-based congestion-aware routing protocol (LECAR) to balance these two issues. Considering outdated location information, LECAR takes advantage of the mobility model to estimate the current location of the destination. In addition, LECAR routes a packet by considering both the distance to destination and buffer occupancy of the neighboring UAVs. Simulation results show that LECAR could ensure both a high packet delivery ratio and low energy consumption. Moreover, LECAR could provide a minimal number of transmissions, while minimizing the number of copies per packet at a time.

Catechize Global Optimization through Leading Edge Firefly Based Zone Routing Protocol

2020 ◽  
Vol 13 (2) ◽  
pp. 147-157 ◽  
Author(s):  
Neha Sharma ◽  
Sherin Zafar ◽  
Usha Batra
Keyword(s):  
Global Optimization ◽  
Routing Protocol ◽  
Firefly Algorithm ◽  
Leading Edge ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Zone Routing Protocol ◽  
End To End Delay ◽  
End To End

Background: Zone Routing Protocol is evolving as an efficient hybrid routing protocol with an extremely high potentiality owing to the integration of two radically different schemes, proactive and reactive in such a way that a balance between control overhead and latency is achieved. Its performance is impacted by various network conditions such as zone radius, network size, mobility, etc. Objective: The research work described in this paper focuses on improving the performance of zone routing protocol by reducing the amount of reactive traffic which is primarily responsible for degraded network performance in case of large networks. The usage of route aggregation approach helps in reducing the routing overhead and also help achieve performance optimization. Methods: The performance of proposed protocol is assessed under varying node size and mobility. Further applied is the firefly algorithm which aims to achieve global optimization that is quite difficult to achieve due to non-linearity of functions and multimodality of algorithms. For performance evaluation a set of benchmark functions are being adopted like, packet delivery ratio and end-to-end delay to validate the proposed approach. Results: Simulation results depict better performance of leading edge firefly algorithm when compared to zone routing protocol and route aggregation based zone routing protocol. The proposed leading edge FRA-ZRP approach shows major improvement between ZRP and FRA-ZRP in Packet Delivery Ratio. FRA-ZRP outperforms traditional ZRP and RA-ZRP even in terms of End to End Delay by reducing the delay and gaining a substantial QOS improvement. Conclusion: The achievement of proposed approach can be credited to the formation on zone head and attainment of route from the head hence reduced queuing of data packets due to control packets, by adopting FRA-ZRP approach. The routing optimized zone routing protocol using Route aggregation approach and FRA augments the QoS, which is the most crucial parameter for routing performance enhancement of MANET.

Sign in / Sign up

Export Citation Format

Share Document