Improvising Reliability and Security in Multiple Relay Network using Optimal Scheduling
S.J. Subhashini1, B. Stalin2, J. Vairamuthu3 

1Dr.S.J.Subhashini, Associate Professor, Department of Computer Science and Engineering, K.L.N. College of Information Technology, Pottapalayam, (Tamil Nadu), India.
2Dr.B.Stalin, Assistant Professor, Department of Mechanical Engineering, Anna University, Regional Campus Madurai, Madurai-625 019, (Tamil Nadu), India.
3Mr.J.Vairamuthu, Research Scholar, Department of Mechanical Engineering, Sethu Institute of Technology, Kariapatti, Virudhunagar Dist., (Tamil Nadu), India. 

Manuscript received on 15 March 2019 | Revised Manuscript received on 22 March 2019 | Manuscript published on 30 July 2019 | PP: 1243-1248 | Volume-8 Issue-2, July 2019 | Retrieval Number: B1786078219/19©BEIESP | DOI: 10.35940/ijrte.B1786.078219
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: In the real-time scenario involving wireless sensor networks, the data forwarding and data gathering procedures are taking place from the remote environment. With the involvement of heterogeneous architecture and multi-hop data transmission paths, there lies a serious threat for secured data communication. There may be chances of data attacks either from the inside intruder or from the external intruder. The problem of data flow attack by adding malicious information, viz. Data injection attack and outside arbitrary attack, viz. Byzantine attacks are found to be more dangerous and cause vulnerability for the wireless sensor network. So improving the reliability and security in multi-relay networks is very much essential. In this work, the practical approach of detecting data injection and Byzantine attacks using the proposed method of random network coding is performed. Then, as improvisation measure, the priority scheduling algorithm is implemented to effectively schedule the data transfer. Real-time packets with highest priority in the distribution queue are placed first in the processing mechanism. The remaining packets are arranged based on the position of the sensor nodes and are placed in separate queues. Least priority packets can obstruct the dispensation of their direct higher precedence packets after waitlisted for a certain number of time frames. Simulation results using the NS2 environment show that using the priority scheduling algorithm has good performance values in terms of the packet delivery ratio, throughput and delay. Also, the attack detection metrics such as false positive ratio and detection ratio are also improved when using the priority scheduling algorithm. Thus an improvised priority algorithm for an uplink scheduler in WSN is implemented to increase the performance and detection metrics.
Index Terms: Byzantine Attack, Data Injection Attacks, Intruder Attacks, Reliability, Scheduling, Security, Wireless Sensor Network.

Scope of the Article: Big Data Networking