Fast and Secure Packet Scheduling with Packet Level Redundancy Elimination in Dynamic Mobile Networks
K.Soniya1, A. Senthil Kumar2
1K.Soniya, Research Scholar, Department of Computer Science, Sankara College of Science and Commerce, Coimbatore, India.
2Dr.A.Senthil Kumar, Associate Professor, Department of Computer Science, Sankara College of Science and Commerce, Coimbatore, India. 

Manuscript received on November 12, 2019. | Revised Manuscript received on November 25, 2019. | Manuscript published on 30 November, 2019. | PP: 5515-5519 | Volume-8 Issue-4, November 2019. | Retrieval Number: D8985118419/2019©BEIESP | DOI: 10.35940/ijrte.D8985.118419

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: Mobile networks are fast and flexible for effective communication, where it only needs a dynamic topology and unstructured network construction. Due to this flexible nature, the resource utilization and energy consumption is high when comparing to the other static networks. In this scenario, packet redundancy is major problem on mobile networks, which increases network traffic and energy. Currently redundancy elimination is performed using redundancy elimination (RE) solution, which affects the end-to-end privacy. To eliminate redundant packet transfers and provide fast and secure packet transfer in the dynamic mobile network, a new middle box framework is proposed in this paper. This framework is named as Sift Hub, which is a centre point to verify the packet redundancy and security violations. This includes four algorithms to perform packet redundancy elimination, packet scheduling and verification. The algorithms are One pass signature generation algorithm (OSGA) for packet security, Predictive encryption technique using enhanced hidden vector encryption algorithm for redundancy detection on encrypted traffic, Packet level data filtering algorithm (PLDF) for eliminating un-authenticated and redundant packets and RAPS-Redundancy aware packet scheduling algorithm for fast data scheduling over dynamic mobile networks. The Shift_Hub supports inter and intra packet level redundancy elimination and secure packet scheduling without affecting the end-to-end privacy. The Shift_Hub is implemented and the performance is evaluated on dynamic mobile network scenario created on NS2 simulator. The results shows, the proposed work gives better performance in finding and eliminating redundant packet in secure manner than the existing works.
Keywords: Mobile Networks, Middle Box, Packet Scheduling, Redundancy Elimination.
Scope of the Article: Mobile Networks & Wireless LAN.