Blockchain-Based IoT Secured Energy-Efficient Collaborative Neighbor Discovery Protocol

This paper proposes an Energy-efficient Secured Distributed Collaborative Neighbor Discovery protocol for IoT mobile sensing applications to enhance on IoT capabilities and efficiencies. Maximum throughput access control model with ultra-low-power constraints is proposed for blockchain-based IoT framework. Simulation result demonstrates the proposed protocol can achieve better discovery performance with minimum discovery latency and maximum duty cycle. Analysis of the comparison results present best choice of primes and duty cycle in the designed low-complexity algorithm.

An asynchronous neighbor discovery protocol based on double tokens in directional ad hoc networks

Aiming at the problem of slow neighbor discovery speed of sector antenna neighbor discovery (SAND) protocol based single token, an asynchronous sector antenna neighbor discovery protocol based double tokens (D-SAND) is proposed. The double tokens include one master token and one slave token. The master token holder (MTH) starts its neighbor nodes discovery process by sending hone-in message through beam scanning, and ends this process when each neighbor node is discovered. Then, MTH passes the master token to the next hop master token holder (nMTH). At the same time, MTH sends the location information of the nMTH node to its parent master token holder (MTP) from which it obtains its token. MTP determines whether to generate a slave token according to that if there exists a neighbor node with a distance greater than 2R from nMTH, where R represents the communication distance. If there exists one such neighbor, MTP generates a slave token and passes it to that neighbor node, who can begin the neighbor discovering process. The time conditions are theoretically derived when these two tokens begin their neighbor discovering process respectively and without interference to each other. Simulation results show that compared to Q-SAND(quick-SAND), the proposed D-SAND protocol reduces the network-wide neighbor discovery time about by 10%.

Neighbor Discovery for IPv6 over BLE Mesh Networks

IPv6 over Bluetooth Low Energy (6LoBLE) can realize the seamless connection between Bluetooth Low Energy (BLE) devices and the Internet, solve the restrictions on Bluetooth applications as short distance communication solutions, and advance the development of applications of smart cities, such as smart buildings and smart city management. Since neighbor discovery is the first step for BLE devices to establish a connection with each other, this paper proposes a novel neighbor discovery protocol for IPv6 over BLE mesh networks, including the structure of IPv6 over BLE mesh networks, the networking solutions, and IPv6 address auto-configuration and update mechanism. Furthermore, we analyze and simulate the performance of the neighbor discovery protocol utilizing the Revierbed simulator, and the results show the effectiveness of the proposed neighbor discovery protocol even in a crowded environment.

Proposed an Algorithm for Preventing IP Spoofing DoS Attack on Neighbor Discovery Protocol of IPv6 in Link Local Network

Duplicate Address Detection (DAD) is one of the most interesting features in IPv6. It allows nodes to connect to a network by generating a unique IP address. It works on two Neighbor Discovery (ND) messages, namely, Neighbor Solicitation (NS) and Neighbor Advertisement (NA). To verify the uniqueness of generating IP, it sends that IP address via NS message to existing hosts. Any malicious node can receive NS message and can send a spoof reply, thereby initiates a DoS attack and prevents auto configuration process. In this manner, DAD is vulnerable to such DoS attack. This study aims to prevent those malicious nodes from sending spoof reply by securing both NS and NA messages. The proposed Advanced Bits Security (ABS) technique is based on Blake2 algorithm and introducing a creative option called ABS field that holds the hash value of tentative IP address and attached to both NA and NS message. We expect the ABS technique can prevent spoof reply during DAD procedure in link local network and can prevent DoS attack

VN-NDP: A Neighbor Discovery Protocol Based on Virtual Nodes in Mobile WSNs

As an indispensable part of Internet of Things (IoT), wireless sensor networks (WSNs) are more and more widely used with the rapid development of IoT. The neighbor discovery protocols are the premise of communication between nodes and networking in energy-limited self-organizing wireless networks, and play an important role in WSNs. Because the node energy is limited, neighbor discovery must operate in an energy-efficient manner, that is, under the condition of a given energy budget, the neighbor discovery performance should be as good as possible, such that the discovery latency would be as small as possible and the discovered neighbor percentage as large as possible. The indirect neighbor discovery mainly uses the information of the neighbors that have been found by a pairwise discovery method to more efficiently make a re-planning of the discovery wake-up schedules of the original pairwise neighbor discovery, thereby improving the discovery energy efficiency. The current indirect neighbor discovery methods are mainly divided into two categories: one involves removing the inefficient active slots in the original discovery wake-up schedules, and the other involves adding some efficient active slots. However, the two categories of methods have their own limitations. The former does not consider that this removal operation destroys the integrity of the original discovery wake-up schedules and hence the possibility of discovering new neighbors is reduced, which adversely affects the discovered neighbor percentage. For the latter category, there are still inefficient active slots that were not removed in the re-planned wake-up schedules. The motivation of this paper is to combine the advantages of these two types of indirect neighbor discovery methods, that is, to combine the addition of efficient active slots and the removal of inefficient active slots. To achieve this goal, this paper proposes, for the first time, the concept of virtual nodes in neighbor discovery to maximize the integrity of the original wake-up schedules and achieve the goals of adding efficient active slots and removing inefficient active slots. Specifically, a virtual node is a collaborative group that is formed by nodes within a small range. The nodes in a collaborative group share responsibility for the activating task of one member node, and the combination of these nodes’ wake-up schedules forms the full wake-up schedule of a node that only uses a pairwise method. In addition, this paper proposes a set of efficient group management mechanisms, and the key steps affecting energy efficiency are analyzed theoretically to obtain the energy-optimal parameters. The extended simulation experiments in multiple scenarios show that, compared with other methods, our neighbor discovery protocol based on virtual nodes (VN-NDP) has a significant improvement in average discovery delay and discovered neighbor percentage performance at a given energy budget. Compared with the typical indirect neighbor discovery algorithm EQS, a neighbor discovery with extended quorum system, our proposed VN-NDP method reduces the average discovery delay by up to 10 . 03 % and increases the discovered neighbor percentage by up to 18 . 35 % .