{'fraction_non_alphanumeric': 0.021889400921658985, 'fraction_numerical': 0.0, 'mean_word_length': 5.583333333333333, '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}}
An Adaptive Agent-Based Partner Selection for Routing Packet in Distributed Wireless Sensor Network

In this paper, we present an adaptive agent-basedpartner selection mechanism for routing packet in distributedwireless sensor networks. A wireless sensor network is modelled as a multi-agent system by concretely regards each sensoras an agent. Agents in the proposed approach are competitivewhere they need to cope with limited resources (i.e. availableenergy) in the network. Auction-based scheme (First-price auction) is adopted in the proposed approach in determining thewinner, that is eligible to relay the packets. The performanceof the proposed approach is evaluated via simulations andcomparisons with some existing routing protocols includingSPIN and LEACH. Experimental results demonstrated thatthe proposed model can perform better in terms of packet loss.