期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2012
卷号：3
期号：4
页码：118-121
语种：English
出版社：Ayushmaan Technologies
摘要：Constraint programming is the study of system which is based on constraints. The solution of a constraint satisfaction problem is a set of variable value assignments, which satisfies all members of the set of constraints in the CSP. In this paper the application of constraint satisfaction programming is to be used in predicting the path loss of various indoor propagation models using Depth First Search Algorithm, which is basic algorithm of CSP. After predicting the path loss at different set of parameters such as frequencies , floor attenuation factor , path loss exponent , we find the optimum set of parameter frequency , floor attenuation factor , path loss exponent at which the path loss is minimum. For this optimization CSP provides an optimization algorithm called Branch and Bound Algorithm. Presents the additional path loss caused by the floors between transmitter and receiver by considering the average floor attenuation factors found for up to floors of the building. A comparative analysis has been done to validate the applicability of these three different indoor propagation models at various frequencies and distances.
