A Power Efficient Path Key Establishment Algorithm for Wireless Sensor Networks

Mehallegue, Noureddine; Garcia, E.; Bouridane, Ahmed; Qu, Gang

doi:10.1109/ahs.2008.10

Cited by 2 publications

(6 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The main differences with LEACH and other algorithms lie in two facts: first radio range is considered in advance so nodes do not attempt communications with nodes that are out of reach. Secondly, in the case that nodes need intermediate nodes to communicate to the cluster head, the multi-hop routes can be known in advance and have been secured using secure path establishment mechanisms [25]. The salient features of SEC-CH-E are described in the section below:…”

Section: A Secure Cluster Head Election Algorithmmentioning

confidence: 99%

“…In our algorithm, nodes know in advance which nodes are within their radio range while in LEACH some nodes are out of radio range and will result in packets being lost with the consequent impact on energy. Secure links are also set up at the end of the key discovery phase [25]. Establishing a secure path is important because some nodes may be out of reach of the Cluster Head (CH) for direct communication and therefore will communicate with the CH via intermediate nodes using a multi-hop route.…”

Section: A Secure Cluster Head Election Algorithmmentioning

confidence: 99%

“…Establishing a secure path is important because some nodes may be out of reach of the Cluster Head (CH) for direct communication and therefore will communicate with the CH via intermediate nodes using a multi-hop route. To do this in a secure manner, a multi-hop secure path need to be established [15], [25].…”

Section: A Secure Cluster Head Election Algorithmmentioning

confidence: 99%

“…-The cluster-heads are elected during the setup phase (See Figure 1) based on: The number of keys stored in the sensor nodes' memory [15]; The secured links set after the deployment [25]; and the LEACH protocol principles for energy conservation. -All the sensor nodes are homogenous and start with an equal amount of energy, and it is assumed that all nodes have data to send during each round.…”

Section: A Secure Cluster Head Election Algorithmmentioning

confidence: 99%

“…a sensor node in LEACH in theory can reach all the sensor nodes in the network but in fact a secure link exists only if there is a shared key space). Therefore in our simulations LEACH dissipates more energy trying to establish paths with sensors that share a key even if they are distant ones, while our algorithm can make use of key path establishment as in [25]. Table I also shows the number of rounds to dissipate 80% of the energy for a probability of sharing one key space of 60% ( Pactual=60 %).…”

Section: B Energy Remaining Vs Number Of Roundsmentioning

confidence: 99%

See 4 more Smart Citations

Providing security and energy efficiency in wireless ad-hoc sensor networks through Secure Cluster-Head Election (SEC-CH-E)

Garcia-Palacios¹,

Mehallegue²,

Safdar

2012

2012 35th International Conference on Telecommunications and Signal Processing (TSP)

Self Cite

View full text Add to dashboard Cite

Data sensed and transferred between sensor nodes should be secure and preserve battery life. Some algorithms, such as LEACH (Low Energy Adaptive Clustering Hierarchy), have been proposed to efficiently organize sensor nodes into clusters, where a cluster-head, is elected to represent that cluster. To save energy, the cluster-head coordinates the cluster and forwards data generated within the cluster. Despite preserving energy, in practice LEACH lacks security features. A Secure Cluster Head Election algorithm (SEC-CH-E) that improves the original LEACH algorithm by adding security features as well as bringing increasing energy savings is proposed. The algorithm takes into account wireless sensor networks constraints such as the limited radio range and power limitations when electing secure cluster-head nodes, which are factors unaccounted for in LEACH. It is shown that these factors have profound energy implications. The superiority of Sec-CH-E performance is assessed by looking at the energy remaining in the network and the fraction of dead nodes.

show abstract

Section: A Secure Cluster Head Election Algorithmmentioning

confidence: 99%

Section: A Secure Cluster Head Election Algorithmmentioning

confidence: 99%

Section: A Secure Cluster Head Election Algorithmmentioning

confidence: 99%

Section: A Secure Cluster Head Election Algorithmmentioning

confidence: 99%

Section: B Energy Remaining Vs Number Of Roundsmentioning

confidence: 99%

See 3 more Smart Citations

Providing security and energy efficiency in wireless ad-hoc sensor networks through Secure Cluster-Head Election (SEC-CH-E)

Garcia-Palacios¹,

Mehallegue²,

Safdar

2012

2012 35th International Conference on Telecommunications and Signal Processing (TSP)

Self Cite

View full text Add to dashboard Cite

show abstract

Cluster-Based Information-Centric Wireless Sensor Networks Management for Enhanced User Security Satisfaction in the Internet of Things

Gharib¹

View full text Add to dashboard Cite

Many Internet of Things applications, such as smart cities and intelligent transportation, require accessible data to users (i.e., data consumers). To address users' timely data access needs, Information-Centric Wireless Sensor Networks (ICWSNs) were proposed that allow users to access data directly from cache nodes. Particularly, ICWSNs are clustered, and Cluster Heads (CHs) are selected to collect data from basic sensing nodes and act as cache nodes. Nevertheless, clustering and ensuring data security in ICWSNs is challenging. This is because sensor nodes are often resource-constrained, heterogeneous (i.e., perform different sensing tasks), and/or mobile.Driven by users' security and timely data access needs, in this thesis, cluster-based ICWSNs' management for enhanced user security satisfaction is investigated. First, a security-aware CHs selection algorithm is proposed to optimize network coverage that is subject to security and energy constraints. Then, cluster-based ICWSNs with heterogeneous communities are modeled analytically and compared to conventional cluster-based ICWSNs with heterogeneous sensor nodes. To overcome the identified energy-latency and security trade-off, a Security Level Aware algorithm for Clusterbased ICWSNs with Heterogeneous communities (SLAC-H) is proposed. In SLAC-H, community leaders collect and forward application-domain-specific data to CHs. Next, Node Embedding with Security Resource Allocation (NESRA) clustering algorithm for mobile ICWSNs is proposed. To improve user security satisfaction, NESRA allocates security resources to sensor nodes based on their location, mobility, and energy resources. Still, when security is set as a priority, many times, more energy is spent on security than is actually required. Therefore, along with the mobility-aware NESRA, User-aware clustering with Security Resource Allocation (USRA) algorithm is proposed. In USRA, a sink node determines which security resource each sensor node will be using for the next round to avoid over-utilization of network resources while satisfying user security needs. A summary of the proposed algorithms and some highlights for future work conclude this thesis. List of Publications List of References viii List of Tables 4.1 Security levels mapping based on the security mechanism used [65]. .

show abstract

A Power Efficient Path Key Establishment Algorithm for Wireless Sensor Networks

Cited by 2 publications

References 12 publications

Providing security and energy efficiency in wireless ad-hoc sensor networks through Secure Cluster-Head Election (SEC-CH-E)

Providing security and energy efficiency in wireless ad-hoc sensor networks through Secure Cluster-Head Election (SEC-CH-E)

Cluster-Based Information-Centric Wireless Sensor Networks Management for Enhanced User Security Satisfaction in the Internet of Things

Contact Info

Product

Resources

About