Group communications in wireless networks has been facilitating many emerging applications that require packet delivery
from one or more sender(s) to multiple receivers.. Due to insecure wireless channels, group communications are susceptible to various
kinds of attacks. Although a number of proposals have been reported to secure group communications using Group management key
(GMK), provisioning security in group communications in wireless networks remains a critical and challenging issue. This article
presents a survey of recent advances in security requirements and services in group communications in three types of wireless
networks, and discusses challenges in designing secure group communications in these networks: wireless infrastructure networks,
mobile ad hoc networks, and wireless sensor networks. This article presents a survey of recent advances in security requirements and
services in group communications in three types of wireless networks, and discusses challenges in designing secure group
communications in these networks: wireless infrastructure networks, mobile ad hoc networks, and wireless sensor networks.
Published In:IJCSN Journal Volume 6, Issue 4
Date of Publication : August 2017
Pages : 495-500
Figures :04
Tables : 01
Ramkumar Ramaswamy : Department of Computer science and Information Technology, DMI-St. John the Baptist University,
Mangochi, The Republic of Malawi.
WSN, Security Service
Nowadays, most of the network system is established in
the mobile environments. Every mobile ad hoc system
should be accessed with the better performance. In this
proposed system “Distributed Token Ring circulation in
mobile Ad-hoc Networks”, to measure the performance of
the local and global connectivity between the nodes. An
important application of such algorithms is to ensure total
order of message delivery in a group communication
service. If the algorithms are gives different performance
results for each group in the ad hoc network topology.
When using a token circulation algorithm, a round is said
to complete when every node has been visited at least
once. Criteria for comparing the algorithms include the
average time required to complete a round, number of
bytes sent per round, and number of nodes visited per
round.
[1] S. K. S. Gupta and S. Cherukuri, “An Adaptive
Protocol for Efficient and Secure Multicasting in
IEEE 802.11 Based Wireless LANs,” Proc. IEEE
WCNC 2003, vol. 3, Mar. 2003, pp. 2021–26.
[2] A. Wadaa et al., “On Providing Anonymity in
Wireless Sensor Networks,” Proc. 10th Int’l. Conf.
Parallel and Distrib. Syst., July 2004, pp. 411–18.
[3] C. Karlof and D. Wagner, “Secure Routing in
Wireless Sensor Networks: Attacks and
Countermeasures,” Elsevier’s Ad Hoc Networks J.,
Special ssueI on Sensor Network Applications
Protocols, vol. 1, no. 2–3, Sep. 2002, pp. 293–315.
[4] R. Maheshwari, J. Gao, and S. R. Das, “Detecting
Wormhole Attacks in Wireless Networks Using
Connectivity Information,” Proc. IEEE INFOCOM
’07, Mar.2007.
[5] B. Decleene et al., “Secure Group Communications
for Wireless Networks,” Proc. IEEE MILCOM 2001,
vol. 1, Oct. 2001, pp. 113–17.
[6] S. Zhu, S. Setia, and S. Jajodia, “LEAP: Efficient
Security Mechanisms for Large-Scale Distributed
Sensor Networks,” Proc. 10th ACM Conf. Computer
and Communication Security, Oct. 2003, pp. 62-72.
[7] Z. Yu and Y. Guan, “A Robust Group-Based Key
Management Scheme for Wireless Sensor Networks,”
Proc. IEEE WCNC ’05, vol. 4, Mar. 2005, pp. 1915–
20.
[8] W. Zhang and G. Cao, “Group Rekeying for Filtering
False Data in Sensor Networks: a Predistribution and
Local Collaboration-Based Approach,” Proc. IEEE
INFOCOM ’05, vol. 1, Mar. 2005, pp. 503–14.
[9] M. Striki and J. Baras, “Towards Integrating Key
Distribution with Entity Authentication for Efficient,
Scalable and Secure Group Communication in
MANETs,” Proc.IEEE ICC ’04, vol. 7, June 2004,
pp. 4377–81.
[10] R. K. Balachandran et al., “CRTDH: An Efficient Key
Agreement Scheme for Secure Group
Communications in Wireless Ad Hoc Networks,”
Proc. IEEE ICC ’05, vol. 2, May 2005, pp. 1123–27.
