Task allocation and scheduling in wireless distributed computing networks

  • Dinesh Datla
  • Haris I. Volos
  • S. M. Hasan
  • Jeffrey H. Reed
  • Tamal Bose


Wireless distributed computing (WDC) is an enabling technology that allows radio nodes to cooperate in processing complex computational tasks of an application in a distributed manner. WDC research is being driven by the fact that mobile portable computing devices have limitations in executing complex mobile applications, mainly attributed to their limited resource and functionality. This article focuses on resource allocation in WDC networks, specifically on scheduling and task allocation. In WDC, it is important to schedule communications between the nodes in addition to the allocation of computational tasks to nodes. Communication scheduling and heterogeneity in the operating environment make the WDC resource allocation problem challenging to address. This article presents a task allocation and scheduling algorithm that optimizes both energy consumption and makespan in a heuristic manner. The proposed algorithm uses a comprehensive model of the energy consumption for the execution of tasks and communication between tasks assigned to different radio nodes. The algorithm is tested for three objectives, namely, minimization of makespan, minimization of energy consumption, and minimization of both makespan and energy consumption.


Distributed computing Power and energy consumption Task allocation Scheduling 

List of symbols




Set of unscheduled tasks

Pred {Fp}

Set of immediate predecessors of F p

Succ {Fp}

Set of immediate successors of F p


Takes value 1 iff F i is allocated to N j


Takes value 1 iff communication between F i to F j is allocated to channel k


Start time of F i


Stop time of F i


Start time of communication between F i and F j


Stop time of communication between F i and F j

Nicm (t)

Takes value 1 in communication time slot t when N i is engaged in communication

Nitx (t)

Takes value 1 in communication time slot t when N i is engaged in transmission

Nirx (t)

Takes value 1 in communication time slot t when N i is engaged in reception

Nicp (t)

Takes value 1 in computational time slot t when N i is engaged in computation


Takes value 1 in time slot t when channel k is engaged in communication


Communication resource time stamp of N i


Computational resource time stamp of N i


Time stamp of channel k


Ready time of F i when allocated to N j


Ready time of communication from F i


Transmission scheme rate of the communication between F i and F j


Energy consumption per data bit by n th transmission scheme


Time consumption per data bit by n th transmission scheme


Computational start and finish times of F i


When executed in N j

STijcm (k), 

Start and finish times of communication


Between F i and F j when F j is executed in N k



This study was supported by DARPA (NSWCDD contract number N00178-09-D-3017), ONR (Grant number N300014-07-01-0536), and NSF.


  1. 1.
    Jou, C. (2010). The decision model of task allocation for constrained stochastic distributed systems. Computers & Industrial Engineering, 58(3), 344–351.CrossRefGoogle Scholar
  2. 2.
    Vidyarthi, D. P., Sarker, B. K., Tripathi, A. K., & Yang, L. T. (2008). Scheduling in distributed computing systems: Analysis, design and models, 1 edn. New York: Springer.Google Scholar
  3. 3.
    Yu, Y., & Prasanna, V. K. (2005). Energy-balanced task allocation for collaborative processing in wireless sensor networks. Journal Mobile Networks and Applications, 10(1–2), 129–138.Google Scholar
  4. 4.
    Olsen, A. B., & Koch, P. (2006). Cooperation In wireless networks : Principles & applications. In Energy Aware Task Allocation In Cooperative Wireless Networks. New York: Springer.Google Scholar
  5. 5.
    Datla, D., Chen, X., Newman, T. R., Reed, J. H., & Bose, T. (2009). Power efficiency in wireless network distributed computing. In IEEE Vehicular Technology Conference. Anchorage: IEEE.Google Scholar
  6. 6.
    Datla, D., Chen, X., Tsou, T., Raghunandan, S., Hasan, S. M., & Reed,et al. (2010). Wireless distributed computing: A survey of research challenges. In IEEE Communications Magazine. Washington, DC: IEEE.Google Scholar
  7. 7.
    Perng-Yi, E. Y. S. L., Richard, M. A., & Tsuchiya, M. (1982). A task allocation model for distributed computing systems. IEEE Transactions on Computers, C-31(1), 41–47.CrossRefGoogle Scholar
  8. 8.
    Datla, D., Hasan, S. M., Reed, J. H., & Bose, T. (2010). Fundamental issues of wireless distributed computing in sdr networks. In SDR’10 Technical Conference and Product Exposition. Washington, DC: SDR’10 Technical Program Committee.Google Scholar
  9. 9.
    Datla, D., Volos, H. I., Hasan, S. M., Reed, J. H., & Bose, T. (2011). Wireless distributed computing in cognitive radio networks. Amsterdam: Ad-Hoc Networks (Elseiver).Google Scholar
  10. 10.
    Datla, D., Tsou, T., Newman, T. R., Reed, J. H., & Bose, T. (2009). Waveform level computational energy management in software defined radios. In SDR’09 Technical Conference and Product Exposition. Washington, DC: SDR’10 Technical Program Committee.Google Scholar
  11. 11.
    Cui, S. R. (2005). Cross-layer optimization in energy constrained networks. Ph.D. Dissertation. Stanford University, Stanford.Google Scholar
  12. 12.
    Cui, S., Goldsmith, A. J., & Bahai, A. (2004). Energy-efficiency of mimo and cooperative mimo techniques in sensor networks. IEEE Journal on Selected Areas in Communications, 22(6), 1089–1098.CrossRefGoogle Scholar
  13. 13.
    Min, R., & Chandrakasan, A. (2002). A framework for energy-scalable communication in high-density wireless networks. in Proceedings of International Symposium on Low Power Electronics and Design ISLPED ’02 (pp. 36–41). Monterey: ISLPED '02.Google Scholar
  14. 14.
    Sinha, A., & Chandrakasan, A. P. (2001). Jouletrack-a web based tool for software energy profiling. In Proceedings of Design Automation Conference (pp. 220– 225). Washington, DC: IEEE.Google Scholar
  15. 15.
    Sinha, A., & Chandrakasan, A. P. (2000). Energy aware software. In Thirteenth International Conference on VLSI Design (pp. 50–55). Calcutta: VLSID.Google Scholar
  16. 16.
    Uetz, M. (2001). Algorithms for deterministic and stochastic scheduling. Ph.D. Dissertation. Maastricht University, Berlin.Google Scholar
  17. 17.
    Alsalih, W., Akl, S., & Hassancin, H. (2005). Energy-aware task scheduling: Towards enabling mobile computing over MANETs. In Proceedings of 19th IEEE International Parallel and Distributed Processing Symposium. Washington, DC: IEEE.Google Scholar
  18. 18.
    Hu, T. (1961). Parallel sequencing and assembly line problems. Operations Research, 9, 841–848.MathSciNetCrossRefGoogle Scholar
  19. 19.
    Baldi, P., & Rosen-Zvi, M. (2005). On the relationship between deterministic and probabilistic directed graphical models: From bayesian networks to recursive neural networks (elsevier science ltd.). Neural Networks—Special Issue on Neural Networks and Kernel Methods for Structured Domains, 18(8), 1015–1018.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Dinesh Datla
    • 1
  • Haris I. Volos
    • 1
  • S. M. Hasan
    • 1
  • Jeffrey H. Reed
    • 1
  • Tamal Bose
    • 1
  1. 1.Bradley Department of Electrical and Computer Engineering, Wireless@Virginia Tech.Virginia Polytechnic Institute and State UniversityBlacksburgUSA

Personalised recommendations