Trusted and secured routing in MANET: An improved approach

Ullah, Kefayat; Das, Rajib; Das, Prodipto; Roy, Ananya

doi:10.1109/isacc.2015.7377359

Cited by 10 publications

(14 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where H indicates whether the node has the capability of harvesting energy, as shown in Equation (6). H = 0, next node without harvesting 1, next node with harvesting…”

Section: Su-gpsrmentioning

confidence: 99%

“…Mobile ad-hoc networks complete the information transmission with multiple hops. With the rapid development of computing, sensor, communication and network technology, mobile ad-hoc networks will play a new role in military and civilian applications, such as search and rescue operations, target detection, prevention of attacks, wind speed estimation, etc [4][5][6][7][8].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Energy-Balanced Geographic Routing Algorithm for Mobile Ad Hoc Networks

Yang

Xia

et al. 2018

Energies

View full text Add to dashboard Cite

To mitigate the frequent link breakage and node death caused by node mobility and energy constraints in mobile ad-hoc networks, we propose an energy-balanced routing algorithm for energy and mobility greedy perimeter stateless routing (EM-GPSR) based on geographical location. In the proposed algorithm, the forward region is divided into four sub-regions. Then, according to the remaining lifetime of each node and the distance between the source node and the destination node, we select the next-hop node in the candidate sub-regions. Since the energy consumption rate of the node is taken into account, the next-hop selection favors the nodes with longer remaining lifetimes. Simulation results show that compared with conventional greedy perimeter stateless routing (GPSR) and speed up-greedy perimeter stateless routing (SU-GPSR) routing algorithms, the proposed algorithm can lead to a lower end-to-end delay, longer service time, and higher transmission efficiency for the network.

show abstract

“…where H indicates whether the node has the capability of harvesting energy, as shown in Equation (6). H = 0, next node without harvesting 1, next node with harvesting…”

Section: Su-gpsrmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An Energy-Balanced Geographic Routing Algorithm for Mobile Ad Hoc Networks

Yang

Xia

et al. 2018

Energies

View full text Add to dashboard Cite

show abstract

“…The stability of the network in the literature is presented in different viewpoints by different researchers [1,2,10,[12][13][14]. These define the network traffic dimension associated with traditional communication networks and the survival concept of the network based on services, all of which are the primary concern for network reliability and node resilience [15].…”

Section: Related Workmentioning

confidence: 99%

“…Several studies on the prediction of node behavior in literature have been discussed in [2,5,6,12]. Thus, malfunctions and multiple failures of wireless nodes are encouraging new challenges to the survival of ad hoc networks and releasing results and its effect.…”

Section: Role Of Node Behavior For Trust Changesmentioning

confidence: 99%

See 1 more Smart Citation

A Reliable Trustworthy Approach Based on Node Behavior Prediction for Secure Routing in MANET

Sridevi¹,

Mandapati²

2017

IJIES

View full text Add to dashboard Cite

An unstructured version of a traditional wireless network provides a mobile ad hoc network (MANET) that is well suited for emergencies. However, due to lack of infrastructure and resource limitations, many performance problems occur at the same time. High-security vulnerabilities are likely to arise, largely because of dynamic behavior, and the complete communication cycle dependent on unidentified nodes which join and leaves as they want. Several past security schemes studies suggested that reliable and trusted nodes can minimize communication overhead and achieve higher throughput. This kind of scheme affects the route chosen for communication because it cannot distinguish between intentional and unintentional errors at runtime. It is, therefore, important to categorize node activities and also provide a node recovery scheme to regain their original reliability for the genuine nodes. In this paper, we propose a Reliable Trustworthy Approach (RTA) based on node behavior prediction for secure routing. It presents a behavior prediction algorithm for recognizing node behavior by differentiating among the unintentional transient errors and intentional malicious behavior, and the RTA mechanism which provides a method for node trust computation and a method for trust recovery. Experiment results show throughput improvisation against the malicious node intrusion. With increasing, malicious nodes in network RTA mechanism effectively predicted with an optimal packet loss and delay it attained prove the effectiveness of the mechanism.

show abstract