An improved security mechanism for high-throughput multicast routing in wireless mesh networks against Sybil attack

Anitha, P.; Pavithra, G; Periasamy, P. S.

doi:10.1109/icprime.2012.6208299

Cited by 5 publications

(6 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The SeGrOM [5] offers high delivery ratio with minor encryption overhead, but the security attack against the multicast protocol is not addressed. Finally, RKP [11] tries to overcome the drawbacks of S-ODMRP, but it fails to scale for many attackers.…”

Section: Performance Analysismentioning

confidence: 99%

Secure Multicasting Protocols in Wireless Mesh Networks—A Survey

Surlees

Francis

2013

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

Security is considered as one of the most significant constraint for the recognition of any wireless networking technology. However, security in wireless mesh networks (WMN) is still in its infancy as little attention has been given to this topic by the research society. WMN is a budding technology that provides low-cost high-quality service to users as the ''last mile'' of the Internet. Multicasting is one of the major communication technologies primarily designed for bandwidth (BW) conservation and an efficient way of transferring data to a group of receivers in wireless mesh network. The goal of secured group communication is to ensure the group secrecy property such that it is computationally infeasible for an unauthorized member node to discover the group data. In this article, the comparative study on existing approaches has been carried out; in addition to it, the fundamental security requirements and the various security attacks in the field of secure multicasting in WMN have also been discussed.

show abstract

Section: Performance Analysismentioning

confidence: 99%

Secure Multicasting Protocols in Wireless Mesh Networks—A Survey

Surlees

Francis

2013

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

show abstract

“…As the expansion and extension of the Internet, Wireless Mesh Networks (WMNs) have broad application prospects in many fields such as households, businesses and public places owing to the useful characteristics of self-organization, self-configuring, flexibility [1]. However, the characteristics of WMNs including the easy accessing, multi-hop without centricity and devices outside of wireless mesh networks bring a great challenge to the security of WMNs as well [2,3]. Therefore, comparing with the traditional wireless networks, the chance of being suffered and attacked is much greater in wireless mesh networks, which brings more security threats.…”

Section: Introductionmentioning

confidence: 99%

Monitor Node Selection Algorithm Based on Mutual Information in Wireless Mesh Networks

Yao

Wang

Zhang

et al. 2015

2015 IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity)

View full text Add to dashboard Cite

Intrusion Detection System is considered as one of the most effective security mechanisms in wireless networks. However, nodes employed to monitor the network abnormal behaviors would carry out amount of overhead and degrade network performance. In this paper, we propose a monitor node selection algorithm based on mutual information to solve the above issue. In the algorithm, we consider the importance of nodes and the influence between nodes. Moreover, we present the importance of nodes' topological position with bridge connection coefficient, and take degree of interaction between nodes into account. The mutual information value of node is determined and regarded as selection condition of monitor node. In order to allocate the range of monitor node effectively, we introduce a linear threshold model in the social network and consider node similarity as influence edge weight. Simulation results show that the proposed algorithm can effectively reduce system cost, ensure the accuracy of intrusion detection system and improve the network performance compared with the traditional node section schemes.

show abstract

“…(2) has got the difference information diff. If the number of the ring of chain keys conforms to (2), and according to the Lemma 2 when some nodes are captured, the probability that the adversary obtains the difference information of the indexes of two chain keys in any other uncaptured nodes is negligible. In conclusion, the mutual information of CK-AE protocol between the parties in the ideal model is computationally indistinguishable for the with the information in the real model.…”

Section: Theorem 1 Based On the Crs Model The Ck-ae Protocol Is Secmentioning

confidence: 99%

“…However, due to the openness of deployment, the limitation of resource and the Big Data environment, security emerges as a challenging issue in ubiquitous WSN. Sybil attack is a particularly harmful attack which can forge a large number of fake identities to disrupt the routing protocol, distributed storage, and malicious behavior detection [2]. Moreover, the entire communication of the network will even be destroyed.…”

Section: Introductionmentioning

confidence: 99%

An Approach Based on Chain Key Predistribution against Sybil Attack in Wireless Sensor Networks

Cheng

Qian

Zhang³

2013

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In wireless sensor networks (WSN), Sybil attack can destroy the routing and data distributed storage mechanisms through fabricating identity information of legitimate nodes. This paper presents a chain key predistribution based approach against Sybil attack. To enhance the security of common keys between neighboring nodes, during the chain key predistribution phase, our approach uses a lightweight hash function to generate several chain keys by hashing the unique identity information of every node sequentially in the trusted base station. These chain keys construct a pool of chain keys. During the pairwise key authentication establishment phase, a node-to-node chain key based authentication and exchange (CK-AE) protocol is proposed, by which each node can share the unique pairwise key with its neighboring node. The CK-AE protocol is provably secure in the universally composable security model (UCSM). Finally, we analyze our approach from the resilience of network and the performance overhead, and the results show that our approach can not only enhance the ability of resilience to Sybil attack, but also reduce the communication overhead significantly at the cost of a certain amount of computational overhead.

show abstract

An improved security mechanism for high-throughput multicast routing in wireless mesh networks against Sybil attack

Cited by 5 publications

References 16 publications

Secure Multicasting Protocols in Wireless Mesh Networks—A Survey

Secure Multicasting Protocols in Wireless Mesh Networks—A Survey

Monitor Node Selection Algorithm Based on Mutual Information in Wireless Mesh Networks

An Approach Based on Chain Key Predistribution against Sybil Attack in Wireless Sensor Networks

Contact Info

Product

Resources

About