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 chain-based relay distribution scheduling model is better than the tradition similar relay network methods, and the result is consistent with the theoretical analysis.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
