Prioritized scheduling scheme for critical and non-critical information packets

  • Authors

    • K Aanandha Saravanan Veltech Dr.Rangarajan & Dr.Sakuthala R&D institute of science and Technology
    • Dr P. Suresh Veltech Dr.Rangarajan & Dr.Sakuthala R&D institute of science and Technology
    2018-08-10
    https://doi.org/10.14419/ijet.v7i3.13338
  • Cluster, Priority Scheduling, Critical, and Non-Critical

  • The process of energy saving mechanisms is been utilized by proper planning to transmit both critical clip and non-real infor-mation by reading overheads there by reducing throughput and bandwidth in large scale critical clip networks. The existing bundle sched-uling mythologies used   were based on the First -in First-out (FIFO) manner in such cases the critical information at particular instant cannot be processed quickly but proposed system is designed in such a way it consists of  three tier precedence structure .the critical in-formation  bundles are placed in the higher status prioritizing queue and processed immediately and sent to the destination node where oth-er information bundles are given less precedence on the basis of position for non critical information bundles. The proposed scheme, ener-gy efficient in reducing the number of transmission by using merger technique. The lowest precedence bundles are processed after the higher precedence bundles. The proposed algorithm proves its uniqueness based on end -to-end delay than Energy efficient wake up scheduling MAC (EEWS) and Traffic Adaptive MAC protocol (TAMAC)

     

     

  • References

    1. [1] I.Akyildiz, W.Su,Y.Sankarasubramaniam, and E.Cayirci,“A survey on sensor networks, â€IEEE Commun. Mag., vol.40, no.8, pp.102–114, Aug. 2002. https://doi.org/10.1109/MCOM.2002.1024422.

      [2] J.Yick,B.Mukherjee,and D.Ghosal, “Wirelesss ensor network survey,â€Comput.Netw., vol. 52 no. 12, pp. 2292–2330, 2008. https://doi.org/10.1016/j.comnet.2008.04.002.

      [3] B.-H. Liu, N.-T. Nguyen, V.-T. Pham and W.-S. Wang, “Constrained node-weighted steinertree based algorithms for constructing a wire- less sensor network to cover maximum weighted critical square grids,†Comput. Commun. vol. 81, pp. 52–60, 2016. https://doi.org/10.1016/j.comcom.2015.07.027.

      [4] X. Du and H.-H. Chen, “Security in wireless sensor networks,†IEEE Wireless Commun., vol. 15, no. 4, pp. 60–66, Aug.2008. https://doi.org/10.1109/MWC.2008.4599222.

      [5] S. Rajasegarar, C. Leckie, and M. Palaniswami, “Anomaly detection in wirelesss ensor networks,â€IEEE Wireless Commun., vol.15, no.4, pp.34– 40, Aug.2008. https://doi.org/10.1109/MWC.2008.4599219.

      [6] M. Chen, S. Gonzalez, and V. Leung, “Applications and design issues for mobile agents in wireless sensor networks,†IEEE Wireless Commun., vol. 14, no. 6, pp. 20–26, Dec.2007. https://doi.org/10.1109/MWC.2007.4407223.

      [7] N. T. Nguyen, B. H. Liu, V. T. Pham, and C. Y. Huang, “Network under limited mobile devices: A new technique for mobile chargingscheduling with multiple sinks,†IEEE Syst. J., to bepublished.

      [8] S. Wu, J. Niu, W.hou, and M. Guizani, “Delay-aware energy optimization for flooding induty-cycled wireless sensor networks,â€Trans.Wireless. Comm., vol. 15, no. 12, pp. 8449–8462, 2016.

      [9] C. Wang, S. Guo, and Y. Yang, “An optimization framework for mobile information collection in energy-harvesting wireless sensor networks,â€IEEE Trans. Mobile Comput., vol. 15, no. 12, pp. 2969–2986, Dec.2016. https://doi.org/10.1109/TMC.2016.2533390.

      [10] N.-T. Nguyen, B.-H. Liu, V.-T. Pham and Y.-S. Luo, “On maximizing the life time for information aggregation in wireless sensor networks using virtual information aggregation trees,†Comput. Netw. vol. 105, pp. 99–110, 2016. https://doi.org/10.1016/j.comnet.2016.05.022.

      [11] S. Huang, P. Wan, C. Vu, Y. Li, and F. Yao, “Nearly constant approximation for information aggregation scheduling in wireless sensor networks, “in Proc. IEEE Int. Conf. Comput. Commun. INFOCOM, 2007, pp. 366–372.

      [12] Joon-Woo Lee and Ju-Jang Lee, “Ant-Colo- ny-Based Scheduling Algorithm for Energy-Ef- ficient Coverage of WSNâ€, IEEE Sensors Journal, Vol.12 ,no.10, pp3036-3046,Oct,2012. https://doi.org/10.1109/JSEN.2012.2208742.

      [13] Bo Yu, Jianzhong Li and Ying shu Li,“Distributed Information Aggregation Scheduling in Wireless Sen sor Networksâ€, IEEE INFOCOM, pp 2159-2167, April, 2009.

      [14] Nidal Nasser, Lutful Karim and Tarik Taleb, “Dynamic Multilevel Precedence Bundle Scheduling Scheme for Wireless Sensor Networkâ€, IEEE Transactions on Wireless Communica- tions,Vol.12,no.4,pp 1448-1459,April,2013 https://doi.org/10.1109/TWC.2013.021213.111410.

      [15] Dimitris Tsitsipis, Sofia Maria Dima, AngelikiKritikakou, Christos Panagiotou and Stavros Koubias , “Segmentation and Reassembly Information Merge (SaRDaM) Technique for Wireless Sensor Networks†IEEE Conference on Industrial Tech- nology (ICIT), pp1014-1019,March,2012.

      Xiaohua Xu, Xiang-Yang Li and Min Song, “Efficient Aggregation Scheduling in Multi hop Wireless Sensor Networks with SINR Constraintsâ€, IEEE Transactions on Mobile Comput- ing, Vol.12, no.12,pp2518-2528,Dec,2013. https://doi.org/10.1109/TMC.2012.245

  • Downloads

  • How to Cite

    Aanandha Saravanan, K., & P. Suresh, D. (2018). Prioritized scheduling scheme for critical and non-critical information packets. International Journal of Engineering & Technology, 7(3), 1705-1708. https://doi.org/10.14419/ijet.v7i3.13338