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

dc.creatorKhor,In
dc.creatorThomas,Johnson
dc.creatorJonyer,Istvan
dc.date2005
dc.date.accessioned2024-02-06T12:53:26Z
dc.date.available2024-02-06T12:53:26Z
dc.descriptionExisting 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.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-011-01-0037
dc.identifierhttps://lib.jucs.org/article/28336/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/8697
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 11(1): 37-55
dc.subjectAd Hoc Network
dc.subjectDSR Routing Protocol
dc.subjectRe-keying performance
dc.subjectSecure Group Communications
dc.titleSliding Window Protocol for Secure Group Communication in Ad-Hoc Networks
dc.typeResearch Article
Файлы
Коллекции