Open Access   Article Go Back

Edge Node Detection For Better Data Transmission Under The Queuing Network Using Pipelining In Mobile AD HOC Network

G.K. Vijaya1 , S. Bharathidass2

Section:Research Paper, Product Type: Journal Paper
Volume-6 , Issue-8 , Page no. 652-659, Aug-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i8.652659

Online published on Aug 31, 2018

Copyright © G.K. Vijaya, S. Bharathidass . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: G.K. Vijaya, S. Bharathidass, “Edge Node Detection For Better Data Transmission Under The Queuing Network Using Pipelining In Mobile AD HOC Network,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.8, pp.652-659, 2018.

MLA Style Citation: G.K. Vijaya, S. Bharathidass "Edge Node Detection For Better Data Transmission Under The Queuing Network Using Pipelining In Mobile AD HOC Network." International Journal of Computer Sciences and Engineering 6.8 (2018): 652-659.

APA Style Citation: G.K. Vijaya, S. Bharathidass, (2018). Edge Node Detection For Better Data Transmission Under The Queuing Network Using Pipelining In Mobile AD HOC Network. International Journal of Computer Sciences and Engineering, 6(8), 652-659.

BibTex Style Citation:
@article{Vijaya_2018,
author = {G.K. Vijaya, S. Bharathidass},
title = {Edge Node Detection For Better Data Transmission Under The Queuing Network Using Pipelining In Mobile AD HOC Network},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {8 2018},
volume = {6},
Issue = {8},
month = {8},
year = {2018},
issn = {2347-2693},
pages = {652-659},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=2750},
doi = {https://doi.org/10.26438/ijcse/v6i8.652659}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i8.652659}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=2750
TI - Edge Node Detection For Better Data Transmission Under The Queuing Network Using Pipelining In Mobile AD HOC Network
T2 - International Journal of Computer Sciences and Engineering
AU - G.K. Vijaya, S. Bharathidass
PY - 2018
DA - 2018/08/31
PB - IJCSE, Indore, INDIA
SP - 652-659
IS - 8
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
301 205 downloads 193 downloads
  
  
           

Abstract

Mobile Ad-hoc Networks (MANETs) is an autonomous system of mobile nodes connected by wireless links; the mobile nodes are available to run in any direction. MANETs are usually formed without any significant infrastructure also its depended on opened queuing network. As a result, they are almost exposed to the traffic observer that target damage, who try to block the data packets by compromising nodes and trace the data transmission direction. Therefore, detecting the edge node is an essential part in MANETs. It is easy to observe a node that induces edge node activity in other nodes, but very difficult to identify a node which is passively observing and misusing network data. In this work, we propose stack optimization based on Edge Node Detecting through Piping Queue (ENDPQ) for Secure Data Transmission in MANETs. Also, a novel approach using node duplication method and two hop neighbor discovery method using which the location of the node can be verified. The source node performs two-hop neighbor discovery to collect the neighbor nodes and perform node duplication method to ascertain the location of the node being selected to route the packet. The proposed plan reduces the overhead introduced by verification procedure and increases the network performance.

Key-Words / Index Term

Piping, Traffic Analysis, Edge node, Neighbor Node, Queuing Network

References

[1]. Adams, ‘Active Queue Management: A Survey,` IEEE Communications Surveys & Tutorials, third Quarter, vol. 15, no. 3, pp. 1425-76, 2013.
[2]. Ahammed & Banu, R, ‘Analyzing the Performance of Active Queue Management Algorithm,` International Journal of Computer Networks and Communications (IJCNC), vol. 2, no. 2, 2010.
[3]. Dana & Malekloo, A, ‘Performance comparison between active and passive queue management,` International Journal of Computer Science Issues, vol. 7, issue. 3, no. 5, pp. 13 – 17, 2010.
[4]. Ganesh Sally, McClean, Gaurav & Raina, ‘Drop Tail and RED Queue Management with Small Buffers: Stability and HOPF Bifurcation,` ICTACT Journal on Communication Technology, vol. 2, no. 2, pp. 339-344, 2011.
[5]. Wang, Wang, X. Chen, S. Ci, "Stochastic queue modeling and key design metrics analysis for solar energy powered cellular networks," Proc. ICNC, pp. 472-477, Feb. 2014.
[6]. Yoshigoe, "Threshold-based exhaustive round-robin for the cicq switch with virtual crosspoint queues," IEEE International Conference on Communications, pp. 6325-6329, June 2007.
[7]. Kiruthiga, Raj & EGDP, ‘Survey on AQM Congestion Control Algorithm,` International Journal of Computer Science and Mobile Applications, vol. 2, no. 2, pp. 38-44, 2014.
[8]. Tamir, Frazier, "Dynamically-Allocated Multi-Queue Buffers for VLSI Communication Switches," IEEE Trans. Computers, vol. 41, pp. 725-737, June 1992.
[9]. Li, Wang, H, ‘Study of Active Queue Management Algorithms Towards stabilize and high link utilization,` communication magazine IEEE, 2002.
[10]. Saleh, Dong, "Comparing FCFS & EDF scheduling algorithms for real-time packet switching networks," International Conference on Networking Sensing and Control IEEE, pp. 698-703, 2010.
[11]. Aggeliki Sgora, Student Member, IEEE, and Dimitrios D. Vergados, Member, ‘Handoff Prioritization and Decision Schemes in Wireless Cellular Networks’: Quarter 2009.
[12]. Fei Yu; Leung, V.C.M., "A framework of combining mobility management and connection admission control in wireless cellular networks," in the Proc. of IEEE International Conference on Communications, (ICC 2001), Vol.7, pp.lI-14, June 2017.
[13]. Huang, Generalized Pollaczek-chinchin Formula for Queueing Systems with Markov Modulated Services Rates: diss, The Chinese University of Hong Kong, 2013.
[14]. Geoffrey, Hoefler, "Adaptive routing strategies for modern high-performance networks," 16th Annual IEEE Symposium on High Performance Interconnects, pp. 165-172, 26-28 August 2008.
[15]. Indurkar, Kulkarni, "Congestion control in wireless sensor networks: A survey," International Journal of Engineering Research and Applications, vol. 1, no. 4, pp. 109-113, 2014.
[16]. Ramos, "Stochastic Models in Queueing Theory: J. Medhi Academic Press New York 1991", Applied Mathematical Modelling, vol. 17, no. 5, pp. 280, 1993.
[17]. Huang, Lee, "Generalized Pollaczek-Khinchin formula for Markov channels," IEEE Transactions on Communications, vol. 61, no. 8, pp. 3530-3540, 2013.
[18]. QoS Scheduling and Queueing on Catalyst 3550 Switches, [online] Available: http: //www.cisco.com/c/enlus/support/docs/lan-switching/lan-quality-of-service/24057- 2006.
[19]. Guay, Bogdanski, “vFtree - A Fat-Tree Routing Algorithm Using Virtual Lanes to Alleviate Congestion," IEEE International Symposium on Parallel and Distributed Processing, pp. 197-208, 16-20 May 2011.
[20]. Dhillon, Ganti, F. Baccelli, Andrews, "Modeling and analysis of K-tier downlink heterogeneous cellular networks," IEEE J. Sel. Areas Commun., vol. 30, no. 3, pp. 550-560, 2012.