Least Distance Smart Neighboring Search (LDSNS) over Wireless Sensor Networks (WSNs)
Abdul Razaque, Khaled M. Elleithy · 2013
In this paper, we introduce a novel least distance smart neighboring search (LDSNS) to determine the mostefficient path at one-hop distance over WSNs. LDSNS helps to reduce the energy consumption and speeds up scheduling for delivery of data. It provides cross layering support and linking MAC layer with network layer to reduce the amount of control messages. LDSNS is a robust and efficient approach that is based on single-hop communication mechanism. To validate the strength of LDSNS, we incorporate LDSN in Boarder Node Medium Access Control (BN-MAC) protocol [15] to determine the list of neighboring sensor nodes and choosing best 1-hop efficient search to avoid collision and reducing energy consumption. Evaluation of LDSNS is conducted using network simulator-2 (ns2). The performance of LDSNS is compared with minimum energy accumulative routing problem (MEAR) [12], asynchronous quorum-based wakeup scheduling scheme (AQWSS) [14] and Minimum Energy Relay Routing (MERR) [13]. Simulation results show that LDSNS is highly energy efficient and faster as compared with MEAR, AQWSS andMERR. It saves 24% to 62% energy resources and improves12% to 21% search at 1-hop neighboring nodes.