JUCS - Journal of Universal Computer Science 11(1): 37-55, doi: 10.3217/jucs-011-01-0037
Sliding Window Protocol for Secure Group Communication in Ad-Hoc Networks
In Joe Khor‡, Johnson Thomas§, Istvan Jonyer‡‡ Oklahoma State University Tulsa, United States of America§ Oklahoma State University, Tulsa, United States of America
Corresponding author: In Khor © In Khor, Johnson Thomas, Istvan Jonyer. This article is freely available under the J.UCS Open Content License. Citation:
Khor IJ, Thomas J, Jonyer I (2005) Sliding Window Protocol for Secure Group Communication in Ad-Hoc Networks. JUCS - Journal of Universal Computer Science 11(1): 37-55. https://doi.org/10.3217/jucs-011-01-0037 |  |
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