A Slot Scheduling Algorithm for Balancing Power Consumption in Tree-based Sensor Networks 


Vol. 36,  No. 5, pp. 502-510, May  2011


PDF
  Abstract

In this paper, we propose a slot scheduling algorithm for balancing power consumption in tree-based sensor networks. In this type of networks, nodes with lower depths tend to consume more energy than those with higher depths, thereby reducing the life time of the network. The proposed algorithm allocates a series of receiving slots first and then a series of sending slots. This way of slot allocation eases packet aggregation and filtering, and thus reduces traffic load on nodes near a sink. We compare the proposed algorithm and the frame-slot allocation algorithm employed in the TreeMAC by resorting to simulation. The simulation results showed that the proposed approach well achieves the balancing of power consumption.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Kim and H. Oh, "A Slot Scheduling Algorithm for Balancing Power Consumption in Tree-based Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 5, pp. 502-510, 2011. DOI: .

[ACM Style]

Je-Wook Kim and Hoon Oh. 2011. A Slot Scheduling Algorithm for Balancing Power Consumption in Tree-based Sensor Networks. The Journal of Korean Institute of Communications and Information Sciences, 36, 5, (2011), 502-510. DOI: .

[KICS Style]

Je-Wook Kim and Hoon Oh, "A Slot Scheduling Algorithm for Balancing Power Consumption in Tree-based Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 5, pp. 502-510, 5. 2011.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880