{'fraction_non_alphanumeric': 0.01665034280117532, 'fraction_numerical': 0.0, 'mean_word_length': 5.905405405405405, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Collaborative Localization Algorithm based on Constraint Programming

The majority of applications in wireless sensor networks use a random deployment; this has made the localization in wireless sensor networks an interesting research problem. Some algorithms use basic techniques, as trilateration or triangulation. Nodes promotion algorithms present good results using multilateration. However, these techniques depend on the number and positions of the anchor nodes. In this paper, we introduce a new approach, we propose an algorithm called CLACP (Collaborative Localization Algorithm based on Constraint Programming) using the CSP formalism (Constraint Satisfaction Program) to modelize the problem of localization, in order to increase the number of localized nodes with the collaboration between them. Our algorithm allows integrating to the localization service some specifications as quality of service and security. Simulation results show that CLACP gives better results compared to the techniques cited above.