Wireless Transmission of Big Data Using Novel Secure Algorithm
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 33093
Wireless Transmission of Big Data Using Novel Secure Algorithm

Authors: K. Thiagarajan, K. Saranya, A. Veeraiah, B. Sudha

Abstract:

This paper presents a novel algorithm for secure, reliable and flexible transmission of big data in two hop wireless networks using cooperative jamming scheme. Two hop wireless networks consist of source, relay and destination nodes. Big data has to transmit from source to relay and from relay to destination by deploying security in physical layer. Cooperative jamming scheme determines transmission of big data in more secure manner by protecting it from eavesdroppers and malicious nodes of unknown location. The novel algorithm that ensures secure and energy balance transmission of big data, includes selection of data transmitting region, segmenting the selected region, determining probability ratio for each node (capture node, non-capture and eavesdropper node) in every segment, evaluating the probability using binary based evaluation. If it is secure transmission resume with the two- hop transmission of big data, otherwise prevent the attackers by cooperative jamming scheme and transmit the data in two-hop transmission.

Keywords: Big data, cooperative jamming, energy balance, physical layer, two-hop transmission, wireless security.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1107027

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2180

References:


[1] Chip Craig J. Mathias Principal, Farpoint Group COMNET 2003 ―Wireless Security: Critical Issues and Solutions 29 January 2003.
[2] R. Schell, Security – a big question for big data, in: IEEE International Conference on Big Data, October 2013, pp. 5–5.
[3] S. Narayanan, P. University, Two-hop Forwarding in Wireless Networks, Polytechnic University, 2006.
[4] J. Talbot, D. Welsh, Complexity and Cryptography: An Introduction, Cambridge University Press, 2006.
[5] A.D. Wyner, The wire-tap channel, Bell Syst. Tech. J. 54 (8) (1975) 1355–1387.
[6] P. Popovski and O. Simeone, “Wireless secrecy in cellular systems with infrastructure-aided cooperation”, IEEE Trans. Inf. Forensics Security, vol. 4, no. 2, pp. 242–256, Jun. 2009.
[7] L. Dong, Z. Han, A. P. Petropulu, and H. V. Poor, “Secure wireless communications via cooperation”, in Proc. 46th Ann. Allerto Conf. Commun., Control, Comput., Champaign, IL, USA, Sep. 2008, pp. 1132–1138.
[8] Gaojie Chen, Member, IEEE, Zhao Tian, Student Member, IEEE, Yu Gong, Member, IEEE, Zhi Chen, Member, IEEE, and Jonathon A. Chambers, Fellow, Max-Ratio Relay Selection in Secure Buffer-Aided Cooperative Wireless Networks IEEE transactions on Information Forensics and Security, Vol.9,no.4, April 2014.
[9] R. Negi, S. Goel, Secret communication using artificial noise, in: IEEE Vehicular Technology Conference, 2005, pp. 1906–1910.
[10] S. Goel, R. Negi, Secret communication in presence of colluding eavesdroppers, in: IEEE Military Communications Conference, 2005, pp. 1501–1506.
[11] L. Dong, Z. Han, A. Petropulu, H.V. Poor, Improving wireless physical layer security via cooperating relays, IEEE Trans. Signal Process. 58 (2010) 1875–1888.
[12] Alvaro Araujo, Javier Blesa, Elena Romero, Octavio Nieto-Taladriz, Cooperative jam Technique to Increase Physical-layer Security in CWSN, in: COCORA 2012: The Second International Conference on Advances in Cognitive Radio.
[13] C.Capar, DGoeckel, B. Liu, D.Towsley, Secret communication in large wireless networks without eavesdropper location information in: Proceedings IEEE INFOCOM, 2012, pp. 1152–1160.
[14] Z. Ding, K. Leung, D. Goeckel, D. Towsley, Opportunistic relaying for secrecy communications: cooperative jamming vs. relay chatting, IEEE Trans. Wirel. Commun. 10 (6) (2011) 1725–1729.
[15] A. Sheikholeslami, D. Goeckel, H. Pishro-Nik, D. Towsley, Physical layer security from inter-session interference in large wireless networks, in: Proceeding of IEEE INFOCOM, 2012, pp. 1179–1187 .