Abstract
Constraint programming is the study of computational system based on constraints. The idea of constraint programming is to solve problem by stating constraints about the problem and consequently finding the solution satisfying all the constraints. In this paper the application of constraint satisfaction programming is used in predicting the path loss of various indoor propagation models using chronological backtrack algorithm, which is basic algorithm of CSP. After predicting the path loss at different set of parameters such as frequencies(f), floor attenuation factor(faf), path loss cofficient(n), penetration attenuation factor(paf), we find the optimum set of parameter (frequency (f), floor attenuation factor(faf), path loss cofficient(n), penetration attenuation factor(paf) at which path loss is minimum. The Branch and bound algorithm is used to optimized the constraint satisfaction problem. The comparison of the models are analysed with and without CSPs.
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.
