A Framework for Trust-based Cluster Head Election in Wireless Sensor Networks

Crosby, Garth V.; Pissinou, Niki; Gadze, James Dzisi

doi:10.1109/dssns.2006.1

Cited by 106 publications

(82 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For example, in the LCC algorithm [10] re-clustering is initiated when two cluster heads come in range and in [11] lower overhead than LCC is demonstrated if the cluster head change is deferred for a period of time which depends on the speed of the two moving cluster heads that meet. We assume here that re-clustering is initiated by the current local CH when its energy drops below a specific threshold value [12]. In that case the following actions are taken place:…”

Section: B New Cluster Head Selection With Votingmentioning

confidence: 99%

SAnoVS: Secure anonymous voting scheme for clustered ad hoc networks

Komninos

Tselikis

Douligeris

2013

2013 IEEE Symposium on Computers and Communications (ISCC)

View full text Add to dashboard Cite

Abstract-In this paper we propose a secure anonymous voting scheme (SAnoVS) for re-clustering in the ad-hoc network. SAnoVS extends our previous work of degree-based clustering algorithms by achieving anonymity and confidentiality of the voting procedure applied to select new cluster heads. The security of SAnoVS is based on the difficulty of computing discrete logarithms over elliptic curves, the intractability of inverting a one-way hash function and the fact that only neighboring nodes contribute to the generation of a shared secret. Furthermore, we achieve anonymity since our scheme does not require any identification information as we make use of a polynomial equation system combined with pseudo-random coordinates. The security analysis of our scheme is demonstrated with several attacks scenarios.examined with several attack scenarios and experimental results.

show abstract

Section: B New Cluster Head Selection With Votingmentioning

confidence: 99%

SAnoVS: Secure anonymous voting scheme for clustered ad hoc networks

Komninos

Tselikis

Douligeris

2013

2013 IEEE Symposium on Computers and Communications (ISCC)

View full text Add to dashboard Cite

show abstract

“…One notable exception to date has been the inclusion of the "trustworthiness" of a public key infrastructure (PKI) schemebased certificate in MANET decision-making [4].…”

Section: Mobile Ad-hoc Network (Manets)mentioning

confidence: 99%

“…Networked devices must rely on their peers to pass messages and to gain services that the component devices require in the day-to-day operation of the MANET. Decisions made for the collective good of the network are made in areas such as network clustering (the grouping of nodes) [2,3,5], cluster-head selection [2,3,4], protocol selection [6,7,8], and security policy. MANET decision-making does not end with providing the network with its initial organization.…”

Section: Mobile Ad-hoc Network (Manets)mentioning

confidence: 99%

“…As a system for certificate management, work is ongoing on the use of Trust Authorities within the MANET [16]. The majority of the benefit functions that have been proposed for MANET decision-making center around metrics that reflect the "trust" of a node's performance, quantified as network events [3,4]. However, security factors are rarely present in the decisionmaking.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

An Ontological Approach to Secure MANET Management

Orwat

Levin

Irvine

2008

2008 Third International Conference on Availability, Reliability and Security

View full text Add to dashboard Cite

show abstract

“…In (Tanachaiwiwat, Dave, Bhindwale and Helmy, 2003;Yao, Kim, Lee, Kim and Jang, 2005) authors define reputation metrics related to cryptographic operation, availability of nodes to provide service, and nodes behaviour that can indicate malicious activity. In (Crosby, Pissinou and Gadze, 2006), authors follow a similar trust evaluation approach to aid the election of trustworthy cluster heads. Another approach is taken by (Liu, Abu-Ghazaleh and Kang, 2007) where they not only favour well behaving nodes for each successful packet forwarding, but also penalize suspicious nodes that lie about their contribution to routing.…”

Section: Reputation -Based Trust Managementmentioning

confidence: 99%

SECURITY IN FUTURE MOBILE SENSOR NETWORKS - Issues and Challenges

Stavrou

Pitsillides

Hadjichristofi

et al. 2010

Proceedings of the International Conference on Security and Cryptography

View full text Add to dashboard Cite

Abstract:Existing security research in wireless sensor networks is based on specific assumptions about the nodes and the network environment that are tied to specific usage scenarios. Typical scenarios consider sensor nodes that are immobile and have pre-defined communication patterns. We argue that node mobility is a realistic characteristic of sensor nodes that needs to be taken into consideration in future sensor networks. Mobility capabilities can address the objective challenges raised in mission-critical applications, such as in disaster relief, where their environment characteristics fluctuate over time. It is imperative to investigate the way security is affected in mobile sensor networks and identify the challenges that will need to be addressed in future security protocol design. We present our vision for future sensor networks through a realistic scenario and discuss security gaps that are present in existing research for next generation sensor networks.

show abstract

A Framework for Trust-based Cluster Head Election in Wireless Sensor Networks

Cited by 106 publications

References 23 publications

SAnoVS: Secure anonymous voting scheme for clustered ad hoc networks

SAnoVS: Secure anonymous voting scheme for clustered ad hoc networks

An Ontological Approach to Secure MANET Management

SECURITY IN FUTURE MOBILE SENSOR NETWORKS - Issues and Challenges

Contact Info

Product

Resources

About