Abstract—Constraint satisfaction programming (CSP) is an emergent software technology for declarative description and effective solving of large particularly combinational problem especially in term of planning and scheduling. 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 empirical propagation models using chronological backtrack algorithm, which is basic algorithm of CSP. After predicting the path loss at different set of parameter such as frequencies, height of base station antenna, range of cell etc, we find the optimum set of parameter (frequency (f), base station height (hb), mobile antenna height (hm), cell radius(r/d) at which path loss is minimum with the help of Branch and bound algorithms used to optimized the constraint satisfaction problems.

Index Terms—Path loss, prediction models constraint satisfaction programming, CSP Algorithms, Mobile Communication, Propagation, LOS and NLOS Conditions.

F. A. Prof.Nagendra Sah is with PEC University of Technology, Sector-12, Chandigarh, PIN-160012, India.Phone No. +911722749601, Mobile No. =919872560513
S. A. Amit Kumar is pursuing his master of Engg. Degree with PEC University of Technology, Sector-12, Chandigarh, PIN-160012, India.

Cite: Nagendra sah and Amit Kumar, "CSP Algorithm In Predicting And Optimizing The Path Loss Of Wireless Empirical Propagation Models," International Journal of Computer and Electrical Engineering vol. 1, no. 4, pp. 464-472, 2009.