A Security Routing Protocol Based on Convergence Degree and Trust

2014 ◽  
Vol 519-520 ◽  
pp. 155-159
Author(s):  
Zhen Zhen Su ◽  
Er Kun Sun ◽  
Xiao Gang Qi ◽  
Ying Nie ◽  
Wei Hong Lin ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Algorithm Design ◽  
Cluster Head ◽  
Work Process ◽  
Malicious Nodes ◽  
Design Algorithm ◽  
Trust Value ◽  
Malicious Behavior ◽  
Simulation Results ◽  
Security Routing Protocol

Based on previous research, this paper puts forward a kind of routing protocol based on node convergence degree and the trust value which named BCDTV. We focus on algorithm design and work process, including the election of cluster head and the establishment of cluster, the collection and transmission of the information. We use the gradational design algorithm when calculation the trust of every nodes. Simulation results show that the protocol can prevent some malicious behavior of malicious nodes effectively.

Research and Improvement about LEACH Routing Protocol for Wireless Sensor Networks

2012 ◽  
Vol 241-244 ◽  
pp. 1028-1032
Author(s):  
Li Wang ◽  
Qi Lin Zhu
Keyword(s):  
Routing Protocol ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Selection Algorithm ◽  
Energy Factor ◽  
Random Cluster ◽  
Simulation Results ◽  
Node Energy

In recent years, as the development of wireless sensor network, people do some deep researches on cluster-based protocol, most around the prolongation of the lifetime of WSN and decline of energy consumed by the sensors. This paper analyses of classical clustering routing protocol based on LEACH, aiming at the node energy foot presents energy improved clustering routing algorithm, the random cluster head selection algorithm of threshold to be changed, lowering the threshold, in the original threshold increases the node's remaining energy factor, reduces the communication load of cluster nodes, and simulation. The simulation results show that the LEACH-E improved algorithm, energy saving, reducing balance node energy consumption, effectively prolongs the network lifetime.

scholarly journals R-bUCRP: A Novel Reputation-Based Uneven Clustering Routing Protocol for Cognitive Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-9
Author(s):  
Mingchuan Zhang ◽  
Ruijuan Zheng ◽  
Ying Li ◽  
Qingtao Wu ◽  
Liang Song
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Selfish Nodes ◽  
Simulation Results ◽  
Establishment Phase ◽  
Optimal Cluster

Energy of nodes is an important factor that affects the performance of Wireless Sensor Networks (WSNs), especially in the case of existing selfish nodes, which attracted many researchers’ attention recently. In this paper, we present a reputation-based uneven clustering routing protocol (R-bUCRP) considering both energy saving and reputation assessment. In the cluster establishment phase, we adopt an uneven clustering mechanism which controls the competitive scope of cluster head candidates to save the energy of WSNs. In the cluster heads election phase, the residual energy and reputation value are used as the indexes to select the optimal cluster head, where the reputation mechanism is introduced to support reputation assessment. Simulation results show that the proposed R-bUCRP can save node energy consumption, balance network energy distribution, and prolong network lifetime.

Energy-Efficient Routing Protocol on Mobile Sink in Wireless Sensor Network

2013 ◽  
Vol 787 ◽  
pp. 1050-1055 ◽  
Author(s):  
Zhi Gui Lin ◽  
Hui Qi Zhang ◽  
Xu Yang Wang ◽  
Fang Qin Yao ◽  
Zhen Xing Chen
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Model Simulation ◽  
Cluster Head ◽  
Mobile Sink ◽  
High Energy ◽  
Residual Energy ◽  
Energy Efficient Routing ◽  
Simulation Results

To the disadvantages, such as high energy consumption and the energy consumption imbalance, we proposed an energy-efficient routing protocol on mobile sink (MSEERP) in this paper. In the MSEERP, the network is divided into several square virtual grids based on GAF, each grid is called a cluster, and the cluster head election method of GAF is improved. In addition, the MSEERP introduces a mobile sink in the network, the sink radios in limited number of hops and uses control moving strategy, namely the sink does not collect the information until it moves to a cluster with highest residual energy. We applied NS2 to evaluate its performance and analyze the simulation results by the energy model. Simulation results show that the MSEERP balances the energy consumption of the network, saves nodes energy and extends the network lifetime.

scholarly journals A trust-based authentication framework for security of WPAN using network slicing

2021 ◽  
Vol 11 (2) ◽  
pp. 1375
Author(s):  
Sazia Parvin ◽  
Amjad Gawanmeh ◽  
Sitalakshmi Venkatraman ◽  
Ali Alwadi ◽  
Jamal N. Al-Karaki ◽  
...  
Keyword(s):  
New Technologies ◽  
Security And Privacy ◽  
Personal Area Networks ◽  
Wireless Personal Area Networks ◽  
Malicious Nodes ◽  
Network Slicing ◽  
Trust Value ◽  
Malicious Behavior ◽  
Mandatory Requirement ◽  
Novel Method

New technologies bring along many challenges including security and privacy. Wireless personal area networks (WPANs) are characterized by limited energy resources and computing power that calls for lightweight security mechanisms in these networks as a mandatory requirement. In this paper, a lightweight trust-based framework for node authentication in WPAN is proposed. Our main objective is to minimise the effort in distinguishing valid requests of trustworthy nodes from invalid requests of malicious nodes that can result in network compromises. We achieve this through network slicing which divides the network into virtually primary and secondary networks. The proposed framework has three-fold benefits. First, it authenticates nodes’ requests based on a novel method of trust value calculation. Second, the framework maintains energy efficiency while authenticating nodes’ requests to access WPAN resources. Finally, the framework provides a solution for biasing problem that can arise due to unexpected behaviour of malicious users in WPANs. The framework efficacy is illustrated on a case study to shown how it can accurately capture trust relations among nodes while preventing malicious behavior.

Certain Investigation on Secured Data Transmission in Wireless Sensor Networks

2020 ◽  
pp. 1372-1385
Author(s):  
P. Padmaja ◽  
G.V. Marutheswar
Keyword(s):  
Data Aggregation ◽  
Energy Efficient ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Trust Value ◽  
Security Issues ◽  
Deviation Factor ◽  
Simulation Results ◽  
Secured Data

Wireless Sensor Network (WSN) need to be more secure while transmitting data as well as should be deployed properly to reduce redundancy and energy consumption. WSNs suffer from many constraints, including low computation capability, small memory, limited energy resources, susceptibility to physical capture and the use of insecure wireless communication channels. These constraints make security in WSNs a challenge. In this paper, a survey of security issues in WSNs is presented and a new algorithm TESDA is proposed, which is an optimized energy efficient secured data aggregation technic. The cluster head is rotated based on residual energy after each round of aggregation so that network lifetime increases. Based on deviation factor calculated, the trust weight is assigned, if more deviation, then the trust value is less. Simulation results observed by using NS-2. From network animator and x-graphs the result are analyzed. Among all protocols tesda is an energy efficient secured data aggregation method.

A Novel Cluster Based Survivable Routing Protocol for Wireless Sensor Network

2014 ◽  
Vol 556-562 ◽  
pp. 5577-5581
Author(s):  
Hai Tao Wang ◽  
Hui Chen ◽  
Xue Ping Zhang ◽  
Li Yan
Keyword(s):  
Routing Protocol ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Malicious Nodes ◽  
Authentication Mechanism ◽  
Main Cluster ◽  
Communication Ability ◽  
Battlefield Environment ◽  
Route Protocol

Sensor nodes easily suffer from failure, attack or capture because of the limited energy, storage, communication ability, complex and severe network environment when WSN is applied to emergency or battlefield environment. Thus, the basic scout mission is influenced. In this paper, a survivability route protocol named SRPC in cluster-based WSN is put forward. The protocol uses key negotiation and identity authentication mechanism to resist the attacks of malicious nodes; when the main cluster head is destroyed, monitoring data will be transmitted to the base station by the backup cluster head chain. The simulation results show that, SRPC protocol can not only resist the attacks of the enemy malicious nodes based on energy balance, but also assure reliable delivery of the packets after the cluster head is attacked or destroyed. As a result, the survivable ability of WSN in battlefield is improved.

An Improved Algorithm of LEACH Routing Protocol Based on Energy-Balancing

2012 ◽  
Vol 263-266 ◽  
pp. 948-953
Author(s):  
Guang Cong Liu ◽  
Cong Li ◽  
Yuan Jie Shi
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Cluster Head ◽  
Base Station ◽  
Energy Balancing ◽  
Starting Point ◽  
Leach Protocol ◽  
Balance Energy ◽  
Simulation Results ◽  
Save Energy

In order to balance energy consumption and save energy as the starting point, an algorithm of LEACH–GAE protocol based on energy balance is put forward for LEACH protocol improvement ,which combined with genetic algorithm and ant colony in view of the problem of LEACH in choosing its cluster head selection,cluster heads and base station communication deficiencies. The simulation results show that LEACH-GAE protocol can effectively balance the energy consumption and prolong the network life cycle.

RSRP: A Robust Secure Routing Protocol in MANET

2014 ◽  
Vol 39 (2) ◽  
pp. 129-154 ◽  
Author(s):  
Ditipriya Sinha ◽  
Uma Bhattacharya ◽  
Rituparna Chaki
Keyword(s):  
Routing Protocol ◽  
Secret Sharing ◽  
Routing Protocols ◽  
Computational Cost ◽  
Secure Routing ◽  
Key Generation ◽  
Malicious Nodes ◽  
Trust Value ◽  
Secure Routing Protocol ◽  
Secure Routing Protocols

Abstract In this paper, we propose a novel algorithm RSRP to build a robust secure routing protocol in mobile ad-hoc networks (MANETs). This algorithm is based on some basic schemes such as RSA_CRT for encryption and decryption of messages; CRT for safety key generation, Shamir’s secret sharing principle for generation of secure routes. Those routes which are free from any malicious node and which belong to the set of disjoint routes between a source-destination pair are considered as probable routes. Shamir’s secret sharing principle is applied on those probable routes to obtain secure routes. Finally, most trustworthy and stable route is selected among those secure routes. Selection of the final route depends on some criteria of the nodes present in a route e.g.: battery power, mobility and trust value. In addition, complexity of key generation is reduced to a large extent by using RSA-CRT instead of RSA. In turn, the routing becomes less expensive and most secure and robust one. Performance of this routing protocol is then compared with non-secure routing protocols (AODV and DSR), secure routing scheme using secret sharing, security routing protocol using ZRP and SEAD depending on basic characteristics of these protocols. All such comparisons show that RSRP shows better performance in terms of computational cost, end-to-end delay and packet dropping in presence of malicious nodes in the MANET, keeping the overhead in terms of control packets same as other secure routing protocols.

Reliable Cluster-Based Routing Algorithms in Wireless Sensor Networks

2013 ◽  
Vol 284-287 ◽  
pp. 2147-2151 ◽  
Author(s):  
Si Gwan Kim
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Low Cost ◽  
Cluster Head ◽  
Routing Algorithms ◽  
Wireless Sensor ◽  
Sink Node ◽  
Wireless Link ◽  
Simulation Results

With advanced micro-electromechanical technology, the development of small-size, low-cost, and low-power sensors that possess sensing, signal processing and wireless communication capabilities is becoming popular than ever. To achieve the energy efficiency in the wireless sensor networks, LEACH has been proposed as a routing protocol, composing of a few clusters, each of which consists of member nodes that sense the data, and head nodes that deliver the collected data from member nodes to a sink node. When wireless link error occurs, LEACH may miss some messages because of only one cluster head. As our proposed scheme manages two cluster heads for each cluster, there should be higher probabilities for messages to reach the sink node. Simulation results show that our proposed algorithm provides more robust than LEACH when wireless link error occurs.

Research of Low-Energy Routing on Single-Lamp Monitoring of Airfield Lighting

2013 ◽  
Vol 427-429 ◽  
pp. 2813-2817
Author(s):  
Bing Yuan Wang ◽  
Jie Gao ◽  
Mei Gao
Keyword(s):  
Routing Protocol ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Network Routing ◽  
Wireless Sensor ◽  
Relay Nodes ◽  
Election Algorithm ◽  
Simulation Results ◽  
Elliptical Area ◽  
Monitoring Area

A WSN (Wireless Sensor Network) routing protocol AL-CADE (Airfield Lighting-Clustering Algorithm based on Distance and Energy) based on logic zones was developed to monitor the airfield lighting in approach zone. In the protocol, the monitoring area was set several small logic zones according to the geography location of the nodes, and there were some advanced nodes placed in the logic zones as relay nodes. The cluster-head number of the nodes was optimized in the elliptical area, and the cluster-head election algorithm based on energy and distribution of the nodes was put forward. The simulation results show that the protocol is effective in reducing the node energy consumption and prolonging the network lifetime.

Sign in / Sign up

Export Citation Format

Share Document