{'fraction_non_alphanumeric': 0.031746031746031744, 'fraction_numerical': 0.0, 'mean_word_length': 4.9125, '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}}
A Novel Multi-Hop Distance-Bounding Protocol Used in Wireless Sensor Networks

Distance bounding(DB) protocol is a critical solution to preventing distance attacks. Since the traditional DB protocols can only estimate the upper-bound within its communication range, it fails to work once the distance exceeds its coverage. Currently, the DB protocol is difficult to apply to wireless sensor networks(WSN) to prevent relay attacks, such as wormhole attack which is one of the most serious threats in WSN's routing. In this paper, a multi-hop DB protocol is proposed to estimate the upper- bound with multi-hop nodes, which can help a Central Node(CN) or Cluster Head(CH) node estimate the communication distance upper-bound of all the nodes in a sub-group, even if the nodes don't lie in its direct communication coverage. The proposed scheme not only ensures the safety of the communication, but also optimizes the routing and networking in WSN.