{'fraction_non_alphanumeric': 0.028838659392049885, 'fraction_numerical': 0.003897116134060795, 'mean_word_length': 5.143540669856459, '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}}
Sink placement without location information in large-scale wireless sensor networks

Wireless Sensor Networks (WSN) comprise a large number of sensor nodes that possess scarce energy supplies. To minimize energy consumption and to consequently extend the lifetime of WSNs, we propose a local search technique for sink placement in WSNs. In addition, a proper sink placement plays a vital role in performance-sensitive WSN applications. Since it is not feasible for a sink to use global information, especially for large-scale WSNs, we introduce a self-organized sink placement (SOSP) strategy that combines the advantages of our previous works [7] and [8]. Besides, this paper is a substantial extension of [9]. The goal of this research is to provide a better sink placement strategy with a lower communication overhead. Avoiding the costly design of using the nodes' location information, each sink sets up its own group by communicating to its n-hop distance neighbors. While keeping the locally optimal placement, SOSP exhibits a better solution quality with respect to communication overhead and computational effort than previous solutions. To analyze performance issues, especially the worst-case delay of a given WSN, we use a methodology called sensor network calculus [10].