Geographic Routing Protocols for Wireless Sensor Networks: Design and Security Perspectives

Adnan, Ali Idarous; Hanapi, Zurina Mohd

doi:10.15866/irecap.v5i4.6252

Cited by 5 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Security insurance [2]- [3] is a serious challenge, especially when nodes are made up of electronic devices [4] with limited material capacities. Two key management approaches are available: symmetric and asymmetric approach [5]- [6].…”

Section: Introductionmentioning

confidence: 99%

Powerful mobile nodes for enhancing wireless sensor networks' security and lifetime

et al. 2019

View full text Add to dashboard Cite

To maintain the proper functioning of critical applications based on Wireless Sensor Networks, we must provide an acceptable level of security while taking into account limited capabilities of the sensors. In this paper we proposed a mobile approach to secure data exchanged by structured nodes in cluster. The approach is based on mobile nodes with significant calculation and energy resources that allow cryptographic key management and periodic rekeying. However, mobility in wireless sensor networks aims to increase the security and lifetime of the entire network. The technical methods used in this paper are based on cryptography elliptic curves and key management through a balanced binary tree. To compare the performance of the proposed approach with other mobile algorithms, we focused on the following metrics: the energy consumed by normal sensors and cluster heads, the number of packets exchanged during key installation, time to generate and distribute cryptographic keys, and the memory used by the different sensors to store keys.

show abstract

Section: Introductionmentioning

confidence: 99%

Powerful mobile nodes for enhancing wireless sensor networks' security and lifetime

et al. 2019

View full text Add to dashboard Cite

show abstract

“…During normal operation of the network, data can be threatened by external events something that should not happen. Security insurance (Jain et al , 2012-Pandey and Tripathi, 2010) is a serious challenge, especially when nodes are made up of electronic devices (Adnan and Hanapi, 2015) with limited material capacities.…”

Section: Introductionmentioning

confidence: 99%

Mobile nodes for improving security and lifetime efficiency in wireless sensor networks

Salah

Maizate

Ouzzif

et al. 2019

IJPCC

View full text Add to dashboard Cite

Purpose This paper aims to provide an acceptable level of security while taking into account limited capabilities of the sensors. This paper proposes a mobile approach to securing data exchanged by structured nodes in a cluster. Design/methodology/approach The approach is based on mobile nodes with significant calculation and energy resources that allow cryptographic key management and periodic rekeying. However, mobility in wireless sensor networks aims to increase the security and lifetime of the entire network. The technical methods used in this paper are based on cryptography elliptic curves and key management through a balanced binary tree. Findings To maintain the effectiveness of critical applications based on wireless sensor networks, a good level of nodes security must be ensured, taking into account their limited energy and computing. Collaboration between powerful mobile nodes provides better coverage and a good key management. Owing to the significant capabilities of the mobile nodes, they can be used to secure critical applications at the same time if needed in applications requiring difficult operations. Originality/value To compare the performance of the proposed approach with other mobile algorithms, the following metrics are focused on: the energy consumed by normal sensors and cluster heads, the number of packets exchanged during key installation, time to generate and distribute cryptographic keys and the memory used by the different sensors to store keys.

show abstract

“…To select a route, a root (source) node should identify, recognize, and record the neighbor nodes as a reference to select appropriate nodes which could relay the packet data to the destination. Moreover, a routing protocol can identify and prevent the attacks [1], such as geographic routing approaches, which investigated the similarities and differences based on design attributes and attack protection [2].…”

Section: Introductionmentioning

confidence: 99%

Breadth Fixed Gossip: a Route Discovery Mechanism in Ad Hoc Network

Aini

Affandi

Setijadi

et al. 2016

IRECOS

View full text Add to dashboard Cite

The lack of information from a root node to neighbors becomes a particular constraint in a message delivery. While the transmission range of node needs to be considered also for ensuring a delivered packet message to them. Therefore, a route discovery mechanism is a good start to make a reliable path in an unknown environment. The objective of this study is to explore the implementation of Breadth First Search, fixed radius model, and gossip algorithms (Breadth Fixed Gossip) on the ad hoc network. Simulations were conducted to obtain the value of three metrics i.e. saved retransmission, transmission failure, and hop counts. These results were compared with Depth First Search and Gossip performance. It indicates that saved retransmission metric Breadth Fixed Gossip has a 58 times better performance, reduces transmission failure by 20%, and requires 50% more hops at transmission range below 15 than Depth First Search and Gossip.

show abstract

Geographic Routing Protocols for Wireless Sensor Networks: Design and Security Perspectives

Cited by 5 publications

References 0 publications

Powerful mobile nodes for enhancing wireless sensor networks' security and lifetime

Powerful mobile nodes for enhancing wireless sensor networks' security and lifetime

Mobile nodes for improving security and lifetime efficiency in wireless sensor networks

Breadth Fixed Gossip: a Route Discovery Mechanism in Ad Hoc Network

Contact Info

Product

Resources

About