Skip to main content

Advertisement

Log in

WEEP: weight based energy efficient priority scheduling of data packets in mobile ad-hoc networks

  • Original Research
  • Published:
International Journal of Information Technology Aims and scope Submit manuscript

Abstract

In order to build a mobile ad hoc network, only some battery powered nodes are required to be deployed; no additional infrastructure is necessary. Routing, scheduling etc. algorithms for this kind of networks have to be designed in such a manner that battery power in nodes can be saved, that is, algorithms should be energy efficient. In most cases, an external priority is assigned to data packets which we have to take care. Along with that, in WEEP, we consider residual lifetime of source and destination nodes to estimate whether the current packet can be sent to destination. Moreover, if possibility of completion of a communication session is less, then more weight is given to data packets belonging to those sessions. The present article aims at reducing the number of route discovery sessions through energy efficient scheduling policy. Therefore, packets travelling through paths consisting of delicate links, are blessed with more priority than those travelling through strong wireless links. Simulation results show that performance improvement produced by WEEP is very significant compared to other protocols used to scheduling in ad hoc networks. As far as the authors know, WEEP is a unique scheduling algorithm in ad hoc network that considers expected residual lifetime of destination along with performance and fragility of a path.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Chen TW, Gerla M (1998) Global state routing: a new routing scheme for wireless ad hoc networks”, In: Proceeding of IEEE conference on information, communication and control

  2. Chiang CC et.al. (1997) Routing in clustered multi-hop wireless networks with fading channel, In: Proceeding of IEEE conference on innovative systems

  3. Parasher R, Rathi Y (2015) A-AODV: a modern routing algorithm for mobile ad hoc networks, Int Res J Engg Technol, 2(1)

  4. http://www.isi.edu/nsnam/ns/tutorial/

  5. Sufian A, Banerjee A, Dutta P Survey of Various Real and Non-real-time Scheduling Algorithms in Mobile Ad hoc Networks, In: Proceedings of the international conference, I3SET 2016, Springer LNNS: Industry Interactive Innovations in Science, Engineering and Technology Vol. 11 chap. 13, pp 121–133

  6. Kodole A, Agarkar PM (2015) A survey of routing protocols in mobile ad hoc networks. Multi-Discip J Res Engg Tech 2(1):336–341

    Google Scholar 

  7. Perkins CE, Royer EM (1999) Ad hoc on-demand distance vector routing, In: Proceeding of IEEE workshop on mobile computing systems and applications

  8. Chao HL, Kuoand JC, Liao W (2002) Fair Scheduling with QoS Support in Ad Hoc Networks, In: Proceedings of the 27th annual IEEE conference on local computer networks

  9. Brown TX, Babow HN, Zhang Q (2001) Maximum flow life curve for wireless ad hoc networks, In: Proceeding of ACM symposium on mobile ad hoc networking and computing, USA

  10. Toh CK, Bhagwat P (1997) Associativity based routing for mobile ad hoc networks. Wireless Pers Commun 4(2):1–36

    Article  Google Scholar 

  11. Hasti A (2012) Study of impact of mobile ad hoc networking and its future applications. BVICAM’s Int J Inform Technol 4:439–444

    Google Scholar 

  12. Annadurai C (2014) Review of packet scheduling algorithms in mobile ad hoc networks. Int J Comput Appl 15(1):7–10

    Google Scholar 

  13. Banerjee A, Dutta P (2010) Fuzzy-controlled adaptive and intelligent route selection (FAIR) in ad hoc networks. Euro J Sci Res 45(3):367–382

    Google Scholar 

  14. Victoria DRS, Kumar SS (2012) Efficient bandwidth allocation for packet scheduling. Int J Future Comput Commun 1(4):381

    Article  Google Scholar 

  15. Banerjee A, Dutta P (2014) Delay-efficient energy and velocity conscious non-preemptive scheduler (DEV-NS) for mobile ad hoc networks. Int J Adv Netw Appl 5(4):2002

    Google Scholar 

  16. Kumar RA, Varshini KA (2014) Multilevel priority packet scheduling scheme for wireless networks, Int J Distrib Parallel Syst (IJDPS) 5(1)

  17. Banerjee A, Dutta P, Sufian A (2016) Fuzzy-controlled scheduling of real time data packets (FSRP) in mobile ad hoc networks. Int J Comput Sci Mob Comput 5(5):507–513

    Google Scholar 

  18. Ahmad K, Fathima M, Jain V, Fathima A (2017) FUZZY-PRoPHET: a novel routing protocol for opportunistic network. Int J Inf Technol 9(2):121–127

    Google Scholar 

  19. Kakarapathi R, Duggirala R, Agrawal DP (2000) “Efficient message scheduling in ad hoc networks”, In: Proceeding of wireless communications and networking conference, 2000, WCNC

  20. Murphy S, Garcia-Luna-Aceves JJ, An efficient routing protocol for wireless networks, ACM Mob Netw Appl J , pp 183–197, Nov. 1996. http://citeseer.nj.nec.com/10238.html

  21. Modiano E (1997) Scheduling Packet Transmissions in a Multi-hop Packet Switched Network Based On Message Length, In: Proceedings of 6th international conference on computer communications and networks

  22. Sufian A, Banerjee A, Dutta P (2016) Fuzzy-controlled scheduling of route-request packets (FSRR) in Mobile Ad Hoc Networks, Indian J Sci Technol 9(43), https://doi.org/10.17485/ijst/2016/v9i43/104384

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anuradha Banerjee.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Banerjee, A., Ghosh, S. WEEP: weight based energy efficient priority scheduling of data packets in mobile ad-hoc networks. Int. j. inf. tecnol. 11, 435–443 (2019). https://doi.org/10.1007/s41870-018-0246-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s41870-018-0246-5

Keywords

Navigation