scispace - formally typeset
Proceedings ArticleDOI

RiSeG: A logical ring based secure group communication protocol for Wireless Sensor Networks

TLDR
This paper considers a group as being a set of nodes sensing the same type of data and proposes an efficient secure group communication scheme that enables group management and secure group key distribution based on a logical ring architecture.
Abstract
It is worth noting that securing group communication in Wireless Sensor Networks (WSNs) has recently been extensively investigated. Although many works have addressed this problem, they have considered the concept of grouping differently. In this paper, we consider a group as being a set of nodes sensing the same type of data and we alternatively propose an efficient secure group communication scheme that enables group management and secure group key distribution. The proposed scheme is based on a logical ring architecture, which permits to alleviate the task of the group controller in maintaining the group key. The proposed scheme also provides backward and forward secrecy, addresses the node compromise attack and gives solution to detect and eliminate the compromised nodes. Finally, our implementation shows that the proposed scheme is highly efficient and secure.

read more

Citations
More filters
Book

Secure Group communication in Wireless Sensor Networks

TL;DR: This paper presents an up-to-date survey of different Secure Group Communication (SGC) schemes in WSN, and examines both components of the existing SGC schemes, namely the group key management and the group membership management.
Journal ArticleDOI

RiSeG: a ring based secure group communication protocol for resource-constrained wireless sensor networks

TL;DR: This paper considers a group as being a set of nodes sensing the same data type, and proposes an efficient secure group communication scheme, RiSeG, based on a logical ring architecture, which permits to alleviate the group controller's task in updating the group key.
Journal ArticleDOI

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

TL;DR: This work proposes a new secure group communication with a lightweight rekeying process that can be applied to a homogeneous WSN with resource-constrained nodes with no need for a multicast routing support.
Journal ArticleDOI

Logical Tree Based Secure Rekeying Management for Smart Devices Groups in IoT Enabled WSN

TL;DR: A logical tree-based secure mobility management scheme (LT-SMM) using mobile service computing in IoT, which includes the group deployment phase where smart devices securely setup a group by registering with group heads for future secure information exchange.
References
More filters
Proceedings ArticleDOI

Ad-hoc on-demand distance vector routing

TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.

Dynamic Source Routing in Ad Hoc Wireless Networks.

TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Book ChapterDOI

Dynamic Source Routing in Ad Hoc Wireless Networks

TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Book ChapterDOI

Perfectly-Secure Key Distribution for Dynamic Conferences

TL;DR: This paper considers the model where interaction is allowed in the common key computation phase, and shows a gap between the models by exhibiting an interactive scheme in which the user's information is only k + t - 1 times the size of the commonKey.
Related Papers (5)