{'fraction_non_alphanumeric': 0.02059308072487644, 'fraction_numerical': 0.0032948929159802307, 'mean_word_length': 5.5675675675675675, '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}}
Task coalition formation and self‐adjustment in the wireless sensor networks

Coalition is an essential mechanism in the multi‐agent systems in the research of task‐oriented area. Self‐interested agents coordinate their behaviors in a coalition to pursue a common goal and obtain payoffs. We propose the clustering‐based coalition formation and self‐adjustment mechanisms for tasks in the wireless sensor network. Before coalition formation, the management center clusters attributes of sensors to reduce the scale of searching space during coalition formation. And then an improved MAX–MIN ant colony optimization algorithm is adopted to resolve the problem of coalition formation. If a coalition member fails to fulfill a task, it can sponsor a negotiation with some noncoalition nodes to execute coalition self‐repairing autonomously. The stimulus‐response mechanism of wasp colony is introduced to determine the probability of response to the task invitation to avoid consuming extra energy. Simulation results show that our model efficiently reduces energy consumption and network traffic, decreases the number of dead nodes, and prolongs the lifetime of the networks. Copyright © 2012 John Wiley & Sons, Ltd.