A task scheduling strategy in heterogeneous multi-sinks wireless sensor networks

被引:1
|
作者
Dai L. [1 ]
Xu H. [1 ]
Chen T. [1 ]
机构
[1] School of Electronic and Control Engineering, Chang'an University
关键词
Divisible load theory; Heterogeneous; Multiple sinks; Task scheduling; Wireless sensor networks;
D O I
10.4304/jnw.6.11.1586-1593
中图分类号
学科分类号
摘要
Using multiple sinks in a wireless sensor network can significantly decrease the amount of energy spent on communication, so it has been paid much attention in recent years. In this paper, we introduce a new divisible load scheduling strategy to solve the problem how to complete the tasks within the possibly shortest time in multi-sinks wireless sensor network. In this strategy, the tasks are distributed to wireless sensor network based on the processing and communication capacity of each sensors by multiple sinks. After received the sub-tasks, the intra-cluster sensors perform its tasks simultaneously, and send its results to cluster head sequentially. By removing communications interference between each sensor, reduced makespan and improved network resource utilization achieved. Cluster heads send fused data to sinks sequentially after fused the data got from intra-cluster sensors, which could overlap the task-performing and communication phase much better. A unique scheduling strategy that allows one to obtain closed form solutions for the optimal finish time and load allocation for each node in heterogeneous clustered networks is presented. And solutions for an optimal allocation of fractions of task to sensors in the network are also obtained via bi-level programming. Finally, simulation results indicate this strategy reasonably distributes tasks to each node in multi-sinks wireless sensor networks, and effectively reduces the time-consuming of task completion. Compared to the traditional single-sink structure, makespan is reduced by 20%, and the energy consuming of sensors is more balanced. © 2011 ACADEMY PUBLISHER.
引用
收藏
页码:1586 / 1593
页数:7
相关论文
共 50 条
  • [41] A Location-Independent Node Scheduling for Heterogeneous Wireless Sensor Networks
    Wang, Huanzhao
    Meng, Fanzhi
    Luo, Hanmei
    Zhou, Ting
    2009 3RD INTERNATIONAL CONFERENCE ON SENSOR TECHNOLOGIES AND APPLICATIONS (SENSORCOMM 2009), 2009, : 539 - 544
  • [42] Proficient Node Scheduling Protocol for Homogeneous and Heterogeneous Wireless Sensor Networks
    Saravanakumar, R.
    Mohankumar, N.
    Raja, J.
    INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2013,
  • [43] Dense wireless sensor networks with mobile sinks
    Song, L
    Hatzinakos, D
    2005 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS 1-5: SPEECH PROCESSING, 2005, : 677 - 680
  • [44] PRIVACY PRESERVING AND ANONYMITY IN MULTI SINKS WIRELESS SENSOR NETWORKS WITH MASTER SINK
    Kazemi, Mina
    Azmi, Reza
    2014 INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION AND NETWORKING TECHNOLOGIES (ICCCNT, 2014,
  • [45] On the Reliability of Wireless Sensor Networks with Multiple Sinks
    Shakhov, Vladimir
    Migov, Denis
    SENSORS, 2024, 24 (17)
  • [46] Tracking Anonymous Sinks in Wireless Sensor Networks
    Shakshuki, Elhadi M.
    Sheltami, Tarek R.
    Kang, Nan
    Xing, Xinyu
    2009 INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS, 2009, : 510 - +
  • [47] On Placement of Multiple Sinks in Wireless Sensor Networks
    Harutyunyan, Louisa
    2014 IEEE 15TH INTERNATIONAL SYMPOSIUM ON A WORLD OF WIRELESS, MOBILE AND MULTIMEDIA NETWORKS (WOWMOM), 2014,
  • [48] Locators of mobile sinks for wireless sensor networks
    Shim, Gyudong
    Park, Daeyeon
    2006 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING WORKSHOPS, PROCEEDINGS, 2006, : 159 - +
  • [49] An Efficient Multi Channel Query Scheduling In Wireless Sensor Networks
    Saravanan, T.
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2014, 14 (02): : 71 - 77
  • [50] Multi-channel TDMA Scheduling in Wireless Sensor Networks
    Uyanik, Ozge
    Korpeoglu, Ibrahim
    AD HOC & SENSOR WIRELESS NETWORKS, 2019, 43 (1-2) : 109 - 138