An efficient clusterhead election algorithm based on maximum weight for MANET

Sivaprakasam, P.; Gunavathi, R.

doi:10.1109/icoac.2011.6165195

Cited by 4 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Efficient Cluster-head Election Algorithm (ECAM) includes two stages of clustering and maintenance. There are two parameters that are checked during maintenance stage [17].…”

Section: Efficient Cluster-head Election Algorithm Based On Maximum Wmentioning

confidence: 99%

Life Time Sensitive Weighted Clustering on Wireless Sensor Networks

Jarchlo

Bazlamaçcı

2014

Proceedings of the 3rd International Conference on Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Efficient Cluster-head Election Algorithm (ECAM) includes two stages of clustering and maintenance. There are two parameters that are checked during maintenance stage [17].…”

Section: Efficient Cluster-head Election Algorithm Based On Maximum Wmentioning

confidence: 99%

Life Time Sensitive Weighted Clustering on Wireless Sensor Networks

Jarchlo

Bazlamaçcı

2014

Proceedings of the 3rd International Conference on Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Group members compute the group key in a distributed manner. This hierarchical contains two levels only, first level for all coordinators of the clusters as a main group's members; it is called cluster head (CH) that is selected by the algorithms shown in [12], [13], [14], the second level for the members in a cluster with its cluster head. Then there are two secret keys obtained in a distributed manner, the first key among all the CHs and the second key among cluster's members and its CH.…”

Section: Introductionmentioning

confidence: 99%

A new Hierarchical Group Key Management based on Clustering Scheme for Mobile Ad Hoc Networks

El‐Sayed

2014

IJACSA

View full text Add to dashboard Cite

Abstract-The migration from wired network to wireless network has been a global trend in the past few decades because they provide anytime-anywhere networking services. The wireless networks are rapidly deployed in the future, secure wireless environment will be mandatory. As well, The mobility and scalability brought by wireless network made it possible in many applications. Among all the contemporary wireless networks,Mobile Ad hoc Networks (MANET) is one of the most important and unique applications. MANET is a collection of autonomous nodes or terminals which communicate with each other by forming a multihop radio network and maintaining connectivity in a decentralized manner. Due to the nature of unreliable wireless medium data transfer is a major problem in MANET and it lacks security and reliability of data. The most suitable solution to provide the expected level of security to these services is the provision of a key management protocol. A Key management is vital part of security. This issue is even bigger in wireless network compared to wired network. The distribution of keys in an authenticated manner is a difficult task in MANET. When a member leaves or joins the group, it needs to generate a new key to maintain forward and backward secrecy. In this paper, we propose a new group key management schemes namely a Hierarchical, Simple, Efficient and Scalable Group Key (HSESGK) based on clustering management scheme for MANETs and different other schemes are classified. Group members deduce the group key in a distributed manner.

show abstract