Skip to main content
SpringerLink
Log in
Book cover

Asian Simulation Conference

SCS Autumn Simulation Multi-Conference

AsiaSim 2016, SCS AutumnSim 2016: Theory, Methodology, Tools and Applications for Modeling and Simulation of Complex Systems pp 67–76Cite as

Markov Based Dynamic Slot Allocation Algorithm

  • Conference paper
  • First Online:

  • 1655 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 643))

Abstract

It is a vital method that slot allocation can improve the performance of Ad Hoc network. The time slot is divided into two parts in this paper, that is fixed slot time and dynamic slot time. ON/OFF model is used to describe data packet sending translation mode for each node based on fixed time slot allocation. It is realized by Markov one step transfer matrix. This paper also proposed a time division multiple access algorithm based on Markov ergodicity (MTDMA) simulated under OPNET platform. The experiment results show that MTDMA algorithm has better performance for the node owning different traffic than fixed TDMA under OPNET platform.

Supported by Industrial Science and Technology Research Project of Shaanxi Province of China (NO. 2015GY031).

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

References

  1. Rui, D., Long, Z., Yu-wen, W., Fan-ji, M.: Modeling of TDMA-based dynamic slot assignment algorithm for data link. Commun. Technol. 44(02), 105–107 (2011)

    Google Scholar 

  2. Ge-xin, P., Sheng-li, X., Cai-yun, C.: A collision-avoid dynamic slots assignment algorithm based on fixed TDMA. Acad. Res. 2(11), 115–200 (2005)

    Google Scholar 

  3. Jian-xun, L., Xiao-guang, F., Zhe, Z., Ming, W.: TDMA dynamic slot allocation algorithm based on priority. Comput. Eng. 37(14), 288–290 (2011)

    Google Scholar 

  4. Wilson J.W., Stein, J., Munjal, S., et al.: Capacity planning to meet QOS requirements of joint battle management and command and control application. In: Proceedings of IEEE Military Communications Conference, pp. 983–989 (2005)

    Google Scholar 

  5. Yong, Q., Jun, Z., Tao, Z.: Effect of TDMA timeslot assignment on traffic delay. Chin. J. Electron. 37(10), 2277–2283 (2009)

    Google Scholar 

  6. Liu, J., Sheng, M., Xu, Y., et al.: End-to-end delay modeling in buffer-limited MANETs: a general theoretical framework. IEEE Trans. Wireless Commun. 15(1), 498–511 (2015)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Engineering, Xian Technological University, Xi’an, China

    Rongrong Liu, Xiaofeng Rong, Shujuan Huang & Lianjong Zhong

Authors
  1. Rongrong Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaofeng Rong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shujuan Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lianjong Zhong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaofeng Rong .

Editor information

Editors and Affiliations

  1. Beihang University, Beijing, China

    Lin Zhang

  2. Beihang University, Beijing, China

    Xiao Song

  3. Beihang University, Beijing, China

    Yunjie Wu

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media Singapore

About this paper

Cite this paper

Liu, R., Rong, X., Huang, S., Zhong, L. (2016). Markov Based Dynamic Slot Allocation Algorithm. In: Zhang, L., Song, X., Wu, Y. (eds) Theory, Methodology, Tools and Applications for Modeling and Simulation of Complex Systems. AsiaSim SCS AutumnSim 2016 2016. Communications in Computer and Information Science, vol 643. Springer, Singapore. https://doi.org/10.1007/978-981-10-2663-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-2663-8_7

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-2662-1

  • Online ISBN: 978-981-10-2663-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation