Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

Cluster Based Task Scheduling in Wireless Sensor Network

Print
PDF
International Journal of Computer Applications
© 2011 by IJCA Journal
Volume 33 - Number 4
Year of Publication: 2011
Authors:
Siddhartha Chauhan
Lalit Kumar Awasthi
10.5120/4011-5697

Siddhartha Chauhan and Lalit Kumar Awasthi. Article: Cluster Based Task Scheduling in Wireless Sensor Network. International Journal of Computer Applications 33(4):38-43, November 2011. Full text available. BibTeX

@article{key:article,
	author = {Siddhartha Chauhan and Lalit Kumar Awasthi},
	title = {Article: Cluster Based Task Scheduling in Wireless Sensor Network},
	journal = {International Journal of Computer Applications},
	year = {2011},
	volume = {33},
	number = {4},
	pages = {38-43},
	month = {November},
	note = {Full text available}
}

Abstract

Data Aggregation techniques are used in wireless sensor networks (WSNs) to collect the data samples from sensor nodes (SNs). Data aggregation techniques for WSNs must address to the issues of WSNs like limited energy, fast and efficient query response, which are essential for network’s performance and maintenance. In this paper, we propose an energy-efficient cluster based task scheduling algorithm (CBTS) to reduce state transitions of cluster heads (CHs). Sensor nodes (SNs) consume different amount of energy in different radio states (transmitting, receiving, listening, sleeping and being idle).CBTS protocol reduces state transitions of radio, thereby reducing the energy consumption. CBTS schedules the CH activity so that when it is in wakeup state, all the reception and transmission activities are continuously performed before it goesinto sleep state. Wakeup time is reduced by CBTS Protocol. Simulation results show that CBTS reduces energy consumption and time delay for WSNs.

Reference

  • Rhee, I., Warrier, A., Aia, M., Min, J.,and Sichitiu, M.L. 2008. Z-MAC: A Hybrid MAC for Wireless Sensor Networks. IEEE/ACM Transactionson Networking.Vol. 16, No. 3. 511-524.
  • Demirkol, I., Ersoy, C., and Alagoz, F. 2006. MAC Protocols for Wireless Sensor Networks: A Survey. IEEE Communications Magazine.115-121.
  • Rhee, I., Warrier, A., Aia, M., Min, J.,and Sichitiu, M.L. 2008. Z-MAC: A Hybrid MAC for Wireless Sensor Networks. IEEE/ACM Transactionson Networking.Vol. 16, No. 3. 511-524. Demirkol, I., Ersoy, C., and Alagoz, F. 2006. MAC Protocols for Wireless Sensor Networks: A Survey. IEEE Communications Magazine.115-121. Yen, H.H.,and Lin, C.L. 2009. Integrated channel assignment and data aggregation routing problem in wireless sensor networks. IEEE, In Special Issue on Wireless Ad-Hoc Networks.
  • Khan, M., Pandurangan, G.,and Vullikanti, A. 2009. Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks. IEEE Transactions on Parallel and Distributed Systems. 20(1).124-139.
  • Lu, G., Krishnamachari, B.,and Raghavendra, C.S. 2004. An Adaptive Energy-Efficient and Low-Latency MAC for Data Gathering in Wireless Sensor Networks.In Proceedings of 18th International Parallel and Distributed Processing Symposium.
  • Rajendran, V., Obraczka, K.,and Aceves, J.J.G.L. 2003. Energy-Efficient, Collision-Free Medium Access Control for Wireless Sensor Networks.In Proceedings of ACM SenSys ’03.181–92.
  • Shi, L.,and Fapojuwo, A.O. 2009. TDMA Scheduling with Optimized Energy Efficiency and Minimum Delay in Clustered Wireless Sensor Networks. IEEE Transactions on Mobile Computing. Vol. 9, No. 7. 927-939.
  • Yu, B., Li, J.,and Li, Y. 2009. Distributed Data Aggregation Scheduling in Wireless Sensor Networks.In Proceedings of IEEE INFOCOM 2009. 2159-2161.
  • Wu, Y., Li, X.Y., Liu, Y.H.,and Lou, W. 2010. Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation. IEEE Transaction on Parallel and Distributed System. Vol. 21, No. 2. 275-287.
  • Keshavarzian, A., Lee, H., and Venkatraman, L. 2006. Wakeup Scheduling in Wireless Sensor Networks. In Proceedings of ACM MobiHoc. 322-333.
  • Wang, W., Wang, Y., Li, X.Y., Song, W.Z., and Frieder, O. 2006. Efficient Interference Aware TDMA Link Scheduling for Static Wireless Mesh Networks. In Proceedings of ACM MobiCom.
  • Djukic, P., and Valaee, S. 2007. Link Scheduling for Minimum Delay in Spatial Re-Use TDMA.In Proceedings of IEEE INFOCOM. 28-36.
  • Arikan, E. 1984. Some Complexity Results about Packet Radio Networks. IEEE Transactions on Information Theory.Vol. IT-30, No. 4. 681- 685.
  • Ephremedis, A., and Truong, T. 1990. Scheduling Broadcasts in Multihop Radio Networks. IEEE Transactions on Communications.Vol. 38, No. 4. 456- 460.
  • Sun, J.Z. 2009. QoS Compromise in Data Gathering for WSN, Mobile and Ubiquitous Systems: Networking & Services. In Proceedings of IEEE 6th Annual International conference MobiQuitous2009.1-2.
  • Miller, M.J., and Vaidya, N.H., 2004. Efficient Bounds for the Stable Set Vertex Cover, and Set Packing Problem.In Proceedings of Wireless Communication and Networking Conference. Vol. 4. 2335-2340.
  • Mainwaring, A., Culler, D., Polastre, J., Szewczyk, R.,and Anderson, J. 2002. Wireless Sensor Networks for Habitat Monitoring. In Proceedings of First ACM International Workshop on Wireless Sensor Networks and Applications (WSNA ’02). 88-97.
  • Bhattacharjee, D., Kumar, S., Kumar, A.,and Choudhury, S. 2010. Design and Development of Wireless Sensor Network. International Journal on Computer Science and Engineering.Vol. 02, No. 07. 2431-2438.
  • Ergen, S.C.,and Varaiya, P. 2005. TDMA Scheduling Algorithms for Sensor Networks. Technical report. University of California, Berkley.