EASND: Energy Adaptive Secure Neighbour Discovery Scheme for Wireless Sensor Networks

Wireless Sensor Network (WSN) is defined as a distributed system of networking, which is enabled with set of resource constrained sensors, thus attempt to providing a large set of capabilities and connectivity interferences. After deployment nodes in the network must automatically affected heterogeneity of framework and design framework steps, including obtaining knowledge of neighbor nodes for relaying information. The primary goal of the neighbor discovery process is reducing power consumption and enhancing the lifespan of sensor devices. The sensor devices incorporate with advanced multi-purpose protocols, and specifically communication models with the pre-eminent objective of WSN applications. This paper introduces the power and security aware neighbor discovery for WSNs in symmetric and asymmetric scenarios. We have used different of neighbor discovery protocols and security models to make the network as a realistic application dependent model. Finally, we conduct simulation to analyze the performance of the proposed EASND in terms of energy efficiency, collisions, and security. The node channel utilization is exceptionally elevated, and the energy consumption to the discovery of neighbor nodes will also be significantly minimized. Experimental results show that the proposed model has valid accomplishment

On the Energy Efficiency and Performance of Neighbor Discovery Schemes for Low Duty Cycle IoT Devices

International audienceMobile sensing and proximity-based applications require smart devices to find other nodes in vicinity, though it is challenging for a device to find neighbors in an energy eecient manner while running on low duty cycles. Neighbor discovery schemes allow nodes to follow a schedule to become active and send beacons or listen for other active nodes in order to discover each other with a bounded latency. However, a trade-off exists between the energy consumption and the time a node takes to discover neighbors using a given activity schedule. Moreover, energy consumption is not the only bottleneck, as theoretically perfect schedules can result in discovery failures in a real environment. In this paper, we provide an in-depth study on neighbor discovery, by first deening the relation between energy efficiency, discovery latency and the fraction of discovered neighbors. We evaluate existing mechanisms using extensive simulations for up to 100 nodes and testbed implementations for up to 15 nodes, with no synchronization between nodes and using duty cycles as low as 1% and 5%. Moreover, the literature assumes that multiple nodes active simultaneously always result in neighbor discovery, which is not true in practice as this can lead to collisions between the transmitted messages. Our findings reveal such scalability issues in existing schemes, where discovery fails because of collisions between beacons from multiple nodes active at the same time. Therefore, we show that energy efficient discovery schemes do not necessarily result in successful discovery of all neighbors, even when the activity schedules are computed in a deterministic manner