Sliding Window Protocol for Secure Group Communication in Ad-Hoc Networks

In Joe Khor (Oklahoma State University Tulsa, USA)

Johnson Thomas (Oklahoma State University Tulsa, USA)

Istvan Jonyer (Oklahoma State University Tulsa, USA)

Abstract: Existing ad hoc routing protocols are either unicast or multicast. In this paper we propose a simple extension to the Dynamic Source Routing Protocol (DSR) to cater for group communications where all node addresses are unicast addresses and there is no single multicast address. The proposed sliding window protocol for multiple communications results in significant improvement in total packet delivery. Due to the high frequency of mobility, attrition and reinforcement in ad hoc networks, in order to preserve confidentiality, it becomes necessary to rekey each time a member enters or leaves a logically defined group. We compare our group rekeying rate on sliding window protocol versus other kinds of Rekeying algorithms. The proposed sliding window protocol performs better. The proposed sliding window is therefore simple and improves both communications and security performance.

Keywords: Ad Hoc Network, DSR Routing Protocol, Re-keying performance, Secure Group Communications

Categories: C.2.0, D.4.6, I.6