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

Abstract

a b s t r a c tSecure 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.

A Lightweight Key Freshness Scheme for Wireless Sensor Networks

“…Queue type is set to Queue/DropTail/PriQue with a size of 50 packets as illustrated in table II. The performance of the proposed XKFS scheme is compared with the baseline approaches i.e., GKM [14], LNT [16], and RiSeG [17]. The number of nodes in the group affects the number of messages and hence, energy consumption.…”

“…Most of the existing group-based key freshness schemes [14][15][16][17] require message exchange within the group nodes every time a node join or leaves the group which causes significant communication overhead on nodes with limited energy resources. Communication is one of the major energy guzzler and therefore, must be made efficient to minimize energy consumption.…”

“…al. proposed logical Neighbor Tree (LNT) based scheme [16] that maintains a tree for all member nodes in a group and claims to exclude the use of multicast routing during key establishment. It maintains group key for sink node, tree key for neighbors of sink node where neighbor carries two sibling keys.…”

Secure clustering and routing for heterogeneous mobile wireless sensor networks with dynamic key management

“…A secure group communication scheme (Cheikhrouhou, Koubâa, Dini, Alzaid, & Abid, 2012) based on distributing the rekeying process among group members uses logical neighbour tree to deliver the rekeying messages inside the group. In this scheme, tree maintenance is an overhead when member leaves or joins the tree.…”

CHAT: Clustered hierarchical key management for wireless sensor networks using network topology

“…Topology-aware LKH key (TALK) 18 is an attempt to efficiently apply the LKH scheme on multihop networks in an efficient way, deciding on both the key server location and the hierarchical key structures, aiming to minimize network traffic. Another approach is by Cheikhrouhou et al, 19 where a topological approach is also followed; however, the focus is on relieving the group controller of costs by offloading key management responsibilities to almost the whole network, while also not taking advantage of multicast.…”