scholarly journals Modeling and comparison of candidate selection algorithms in opportunistic routing

2011 ◽  
Vol 55 (13) ◽  
pp. 2886-2898 ◽  
Author(s):  
Amir Darehshoorzadeh ◽  
Llorenç Cerdà-Alabern ◽  
Vicent Pla
Keyword(s):  
Opportunistic Routing ◽  
Candidate Selection ◽  
Selection Algorithms

An Energy Efficient Trust Aware Opportunistic Routing Protocol for Wireless Sensor Network

2017 ◽  
Vol 8 (2) ◽  
pp. 30-44 ◽  
Author(s):  
Nagesh Kumar ◽  
Yashwant Singh ◽  
Pradeep Kumar Singh
Keyword(s):  
Routing Protocols ◽  
Energy Efficient ◽  
Relay Selection ◽  
Opportunistic Routing ◽  
Wireless Sensor ◽  
Malicious Nodes ◽  
Data Packets ◽  
New Energy ◽  
Selection Algorithms ◽  
Trust Metric

As the wireless sensor networks (WSN) are gaining popularity the need of reliable delivery of data packets becomes more important. The reliable delivery is only possible when the routing protocols are efficient and secure. Because of lack of resources it is not possible to use existing cryptosystems to provide security in WSN. But, trust aware routing can provide the security with lesser resources, which become popular in last three to four years. In this paper, a new energy efficient and trust aware reliable opportunistic routing (TAEROR) protocol is proposed. The protocol consists of a trust metric and also a relay selection algorithm. The trust aware metric detects the malicious nodes on the basis of forwarding sincerity, energy consumption and acknowledgement sincerity. Relay selection algorithms avoid these malicious nodes to get selected in the routing process. The protocol is simulated and compared to existing trust aware routing protocols. Proposed protocol TEAROR presents better results than the other compared protocols.

An Energy Efficient Trust Aware Opportunistic Routing Protocol for Wireless Sensor Network

2020 ◽  
pp. 628-643
Author(s):  
Nagesh Kumar ◽  
Yashwant Singh ◽  
Pradeep Kumar Singh
Keyword(s):  
Routing Protocols ◽  
Energy Efficient ◽  
Relay Selection ◽  
Opportunistic Routing ◽  
Wireless Sensor ◽  
Malicious Nodes ◽  
Data Packets ◽  
New Energy ◽  
Selection Algorithms ◽  
Trust Metric

As the wireless sensor networks (WSN) are gaining popularity the need of reliable delivery of data packets becomes more important. The reliable delivery is only possible when the routing protocols are efficient and secure. Because of lack of resources it is not possible to use existing cryptosystems to provide security in WSN. But, trust aware routing can provide the security with lesser resources, which become popular in last three to four years. In this paper, a new energy efficient and trust aware reliable opportunistic routing (TAEROR) protocol is proposed. The protocol consists of a trust metric and also a relay selection algorithm. The trust aware metric detects the malicious nodes on the basis of forwarding sincerity, energy consumption and acknowledgement sincerity. Relay selection algorithms avoid these malicious nodes to get selected in the routing process. The protocol is simulated and compared to existing trust aware routing protocols. Proposed protocol TEAROR presents better results than the other compared protocols.

scholarly journals Load Balancing Opportunistic Routing for Cognitive Radio Ad Hoc Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Wenxuan Duan ◽  
Xing Tang ◽  
Junwei Zhou ◽  
Jing Wang ◽  
Guosheng Zhou
Keyword(s):  
Cognitive Radio ◽  
Load Balancing ◽  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Opportunistic Routing ◽  
Research Activities ◽  
Priority Order ◽  
Hoc Networks ◽  
Selection Algorithms ◽  
Performance Gains

Recent research activities have shown that opportunistic routing can achieve considerable performance gains in Cognitive Radio Ad hoc Networks (CRAHNs). Most of these studies focused on designing appropriate metrics to select and prioritize the forwarding candidates. However, in multiple-flow networks, a small number of nodes may always be with the higher priority order for different flows. Thus, some nodes may easily become overloaded with too much traffic and be severely congested. To overcome this problem, we propose a load balancing opportunistic routing (LBOR) scheme to maximize the total throughput of the whole network. We first formulate the problem of maximizing the total throughput of the network as a linear programming problem. Then, we develop heuristic load balancing candidate forwarder sorting and selection algorithms. Simulation results and comparisons demonstrate that our proposed LBOR scheme outperforms existing opportunistic routing protocols with nonload balancing methods in CRAHNs.

An Enhancement of Feature Selection Algorithm for EDM: A Review

2018 ◽  
Vol 8 (5) ◽  
pp. 29
Author(s):  
Manpreet Kaur ◽  
Chamkaur Singh
Keyword(s):  
Feature Selection ◽  
Educational Data Mining ◽  
Problem Formulation ◽  
Research Area ◽  
Education Quality ◽  
Educational Institutions ◽  
Selection Algorithm ◽  
Positive Role ◽  
Data Set ◽  
Selection Algorithms

Educational Data Mining (EDM) is an emerging research area help the educational institutions to improve the performance of their students. Feature Selection (FS) algorithms remove irrelevant data from the educational dataset and hence increases the performance of classifiers used in EDM techniques. This paper present an analysis of the performance of feature selection algorithms on student data set. .In this papers the different problems that are defined in problem formulation. All these problems are resolved in future. Furthermore the paper is an attempt of playing a positive role in the improvement of education quality, as well as guides new researchers in making academic intervention.

Sign in / Sign up

Export Citation Format

Share Document