LNT: a logical neighbor tree secure group communication scheme for wireless sensor networks

Cheikhrouhou, Omar; Koubâa, Anis; Dini, Gianluca; Alzaid, Hani; Abid, Mohamed

http://hdl.handle.net/10400.22/3691

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
ART_OmarCheikhrouhoua_2012_CISTER.pdf		1.38 MB	Adobe PDF	Download

Send Feedback

Authors

Abstract(s)

Secure group communication is a paradigm that primarily designates one-to-many communication security. The proposed works relevant to secure group communication have predominantly considered the whole network as being a single group managed by a central powerful node capable of supporting heavy communication, computation and storage cost. However, a typical Wireless Sensor Network (WSN) may contain several groups, and each one is maintained by a sensor node (the group controller) with constrained resources. Moreover, the previously proposed schemes require a multicast routing support to deliver the rekeying messages. Nevertheless, multicast routing can incur heavy storage and communication overheads in the case of a wireless sensor network. Due to these two major limitations, we have reckoned it necessary to propose a new secure group communication with a lightweight rekeying process. Our proposal overcomes the two limitations mentioned above, and can be applied to a homogeneous WSN with resource-constrained nodes with no need for a multicast routing support. Actually, the analysis and simulation results have clearly demonstrated that our scheme outperforms the previous well-known solutions.