JCP 2014 Vol.9(6): 1391-1396 ISSN: 1796-203X
doi: 10.4304/jcp.9.6.1391-1396
doi: 10.4304/jcp.9.6.1391-1396
Relay Node Scheduling Model Based on Improved Discrete Markov Chain
Chaoyi Zhang, Yandong Zhao and Junguo Zhang
School of Science and Technology, Beijing Forestry University, Beijing 100083, China
Abstract—This paper focuses on relay node scheduling method which is based on an improved discrete Markov chain. It presents a single relay node’s existing state, analyzes its access behavior, and summarizes various linear system design, according to our present balanced equations and form state transition probability, nodes are scheduled in relay network, the improved discrete time Markov chain is used to reduce destination noise, improve channel’s SNRs performance. The simulation shows that the Markov chainbased relay distribution scheduling model is better than the tradition similar relay network methods, and the result is consistent with the theoretical analysis.
Index Terms—relay system, node scheduling, Markov chain, state transition, balance equations
Abstract—This paper focuses on relay node scheduling method which is based on an improved discrete Markov chain. It presents a single relay node’s existing state, analyzes its access behavior, and summarizes various linear system design, according to our present balanced equations and form state transition probability, nodes are scheduled in relay network, the improved discrete time Markov chain is used to reduce destination noise, improve channel’s SNRs performance. The simulation shows that the Markov chainbased relay distribution scheduling model is better than the tradition similar relay network methods, and the result is consistent with the theoretical analysis.
Index Terms—relay system, node scheduling, Markov chain, state transition, balance equations
Cite: Chaoyi Zhang, Yandong Zhao and Junguo Zhang, "Relay Node Scheduling Model Based on Improved Discrete Markov Chain," Journal of Computers vol. 9, no. 6, pp. 1391-1396, 2014.
General Information
ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO, ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
-
Nov 14, 2019 News!
Vol 14, No 11 has been published with online version [Click]
-
Mar 20, 2020 News!
Vol 15, No 2 has been published with online version [Click]
-
Dec 16, 2019 News!
Vol 14, No 12 has been published with online version [Click]
-
Sep 16, 2019 News!
Vol 14, No 9 has been published with online version [Click]
-
Aug 16, 2019 News!
Vol 14, No 8 has been published with online version [Click]
- Read more>>