Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/41247
DC FieldValue
dc.titleEfficient key tree construction for group key agreement in ad hoc networks
dc.contributor.authorWan, Z.
dc.contributor.authorZhu, B.
dc.contributor.authorDeng, R.H.
dc.contributor.authorBao, F.
dc.contributor.authorAnanda, A.L.
dc.date.accessioned2013-07-04T08:23:02Z
dc.date.available2013-07-04T08:23:02Z
dc.date.issued2006
dc.identifier.citationWan, Z.,Zhu, B.,Deng, R.H.,Bao, F.,Ananda, A.L. (2006). Efficient key tree construction for group key agreement in ad hoc networks. IEEE Wireless Communications and Networking Conference, WCNC 2 : 652-658. ScholarBank@NUS Repository.
dc.identifier.isbn1424402700
dc.identifier.issn15253511
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/41247
dc.description.abstractIn this paper, we propose a highly efficient group key agreement scheme based on a novel key tree construction for ad hoc networks. The key tree is constructed taking into consideration of the multicast tree which represents the underlying network topology. Our scheme greatly reduces the communications and computation cost for group key agreement and has high flexibility in handling dynamic group members hips. We implement our scheme in ns-2 and evaluate its performance in terms of overhead and communication cost. The simulation results show that our scheme enjoys great advantages over other schemes in the literature. © 2006 IEEE.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleIEEE Wireless Communications and Networking Conference, WCNC
dc.description.volume2
dc.description.page652-658
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.