Multihop Trust Evaluation Using Memory Integrity in Wireless Sensor Networks

Summary In Sensor Networks (SNs), Network Lifetime (NL) enhancement using Data Aggregation Trees (DATs) is an extensively studied NP complete problem. The study in this paper investigates the existing DAT scheduling heuristics and proposes a metric termed as Brevis Factor ρ to evaluate the merit of the employed heuristics. Then, the ρ metric is applied to the state‐of‐art DAT scheduling heuristics which are typically based on Residual Energy (RE) parameter of the sensor nodes. Further, this paper proposes a new heuristics parameter for DAT scheduling based on the Number of Neighboring nodes (NN). Performance of NN‐based heuristics is evaluated with rigorous simulations, and the results demonstrate improvement in NL as compared with the state‐of‐art. The values of ρ are observed for the existing RE‐based heuristics as well as the proposed NN‐based heuristics. The results demonstrate how ρ metric values evaluate the DAT scheduling heuristics. In addition, the results facilitate to understand the trade‐off associated with the overheads to reconstruct DATs while improving NL.

show abstract

“…Further, DAT scheduling heuristics based on trust evaluation to provide security in WSNs impose challenges for future work. 43,44…”

Section: Discussionmentioning

confidence: 99%

Brevis factor ρ to evaluate data aggregation tree scheduling heuristics in sensor networks

Kale

Nene

2021

Int J Communication

Self Cite

View full text Add to dashboard Cite

show abstract

“…Current WSN node-level trust evaluations only take a single hop's worth of a node's reliability into account. Desai and Nene [6] proposed a trust assessment technique for multi-hop scenarios that makes use of a node's internal memory to determine the route's reliability. This work proposes a multihop trust evaluation technique that utilizes the TEAM and TEAP algorithms.…”

Section: Literature Surveymentioning

confidence: 99%

“…This is an exciting new direction to investigate since quantum computers employ the characteristics of quantum states to outperform classical computers in specific operations. In order to meet both the very demanding resources and the general goal of optimizing the use of network resources, the next generation of mobile networks, known as 6G, will implement on-demand self-reconfiguration [6]. With Software Defined Networking (SDN), which provides a bird's-eye view of the network, centralized control, and adjustable forwarding rules, this kind of dynamic and flexible network administration is made feasible.…”

Section: Introductionmentioning

confidence: 99%

Network Master Node Assessed Trust Factor with Arbitrary Neighbor Assessment for Secure Route Detection in 6G Enabled Wireless Sensor Networks

Movva,

Chintala

2024

IJSSE

View full text Add to dashboard Cite

The wireless research community has been concentrating on sixth-generation (6G) wireless technology. One of the new paradigms brought forward by 6G is its extensive global coverage, enormous spectrum consumption, sophisticated new applications, and tight security. Nevertheless, current classical computers may lack the computational capability necessary to fully realize such features. Already, major IT firms are investigating quantum computers, which might be used as 6G enablers. A growing number of people are opting for 6G enabled wireless sensor networks (WSNs) due to its potential low cost and broad use. Malicious or self-serving nodes, in addition to broken nodes, can significantly reduce a network's performance. Most trust management schemes come with a powerful tool that can detect unusual node behavior. This research goal is to secure WSNs against malicious attacks that take advantage of the replay of routing information, hence a strong trust based routing model has been devised and built to provide safe routing options for WSNs. This research proposes a Network Master Node assessed Trust Factor with Arbitrary Neighbor Assessment (NMN-TF-ANA) for Secure Route Detection in WSN. The proposed model considers nodes in routing based on trust factor and random neighbor evaluation to achieve secure data transmission. The proposed model when contrasted with existing model achieves better performance in route selection.

show abstract

“…27 To overcome this, a traditional multi-path routing system in which multiple routes are provided to ensure successful packet transmission with minimized energy consumption is required. 28 However, the existing multi routing systems are inefficient for diversified applications owing to improper planning and resource allocation schemes. 29 These drawbacks result in the maximization of energy consumption and a lack of resource optimisation.…”

Section: Proposed Multi-path Routing Protocolmentioning

confidence: 99%

“…Therefore, designing of a single routing system that stops the entire process in case of a link failure is inefficient for successful packet transmission with minimized energy consumption is extremely complex 27 . To overcome this, a traditional multi‐path routing system in which multiple routes are provided to ensure successful packet transmission with minimized energy consumption is required 28 . However, the existing multi routing systems are inefficient for diversified applications owing to improper planning and resource allocation schemes 29 .…”

Section: Proposed Multi‐path Routing Protocolmentioning

confidence: 99%

An optimized ticket manager based energy‐aware multipath routing protocol design for IoT based wireless sensor networks

Roberts¹,

Thangavel²

2022

Concurrency and Computation

View full text Add to dashboard Cite

Recently, wireless sensor networks (WSNs) and Internet of Things (IoTs) have emanated as an indispensable assets that play a critical role in revolutionizing the field of data communication. Owing to the evolution of communication standards, research trends in IoT based wireless sensor networks have been rapidly progressing toward achieving effective data routing with a prolonged network lifetime and minimized energy consumption. In this article, an optimized ticket manager based energy-aware multipath routing protocol (TMERP) is proposed. The proposed protocol design comprises three important functional entities: ticket manager (TM), routing planner (RP), and backup node (BN). The TM is responsible for controlling and monitoring all the constraints related to networking. Then, the RP minimizes the overall complexity of the optimal resource allocation by avoiding an end-to-end delay. Finally, the BN facilitates efficient data routing through the optimal selection of routing paths using the node trust evaluation and backup process to minimize data loss. Hence, the proposed multipath routing system has a distinct advantage in enhancing the network lifetime constraint with minimal energy consumption owing to the collective performance of its functional entities. The simulation results of the experimental studies show that the proposed protocol design achieved an improved performance in terms of network energy, throughput, and network operational lifetime by 39.3%, 47.9%, and 10.5%, respectively when compared with similar existing protocols.

show abstract

Multihop Trust Evaluation Using Memory Integrity in Wireless Sensor Networks

Cited by 13 publications

References 30 publications

Brevis factor ρ to evaluate data aggregation tree scheduling heuristics in sensor networks

Brevis factor ρ to evaluate data aggregation tree scheduling heuristics in sensor networks

Network Master Node Assessed Trust Factor with Arbitrary Neighbor Assessment for Secure Route Detection in 6G Enabled Wireless Sensor Networks

An optimized ticket manager based energy‐aware multipath routing protocol design for IoT based wireless sensor networks

Contact Info

Product

Resources

About