Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: secure routing

Sortuj według:

Ogranicz wyniki do:

Energy efficient and QOS awaretrustworthy routing protocol for manet using hybrid optimization algorithms.

Annamalai Veeramani R, Annamalai MadhanMohan R.

Computer Science

2025

T. 26 (1)

101--131

The security challenges in MANETs are particularly difficult to address. Toassess the reliability of each mobile node, factors such as location, mobility speed, energy usage, transmission count, and neighbor list are considered. This research proposes the Intelligent Dynamic Trust (IDT) paradigm to enhance security in wireless networks. For secure routing, IDT combines beta reputation trust with dynamic trust. Performance analysis was conducted using Network Simulator 3.36, with metrics such as through put, energy consumption, packet delivery ratio, jitter, end-to-end delay, packet loss rate, detection rate, and routing overhead. The results show that the proposed approach out performs existing methods.

Multiobjective Design of Wireless Ad Hoc Networks: Security, Real-Time and Lifetime

Zdravko K.

Journal of Telecommunications and Information Technology

2009

nr 2

13-21

This paper deals with the tradeoffs between security, real-time and lifetime performance. Due to the multihop nature of communication wireless ad hoc networks are very vulnerable to attacks. Malicious nodes included in a routing path may misbehave and organize attacks such as black holes. Scaling the number of hops for a packet delivery we trade off energy efficiency against security and real-time communication. To study the multihop communication we propose a hierarchical communication model. The REWARD (receive, watch, redirect) algorithm for secure routing is employed as a main example for corrective actions. Symmetrical routing is a distinguish feature of protocols such as REWARD and we outline the threshold of conflict between power-efficient partitioning of communication links and symmetrical routing.