Neighbor Discovery Phase Research Articles

Least Mobility High Power (LMHP) Dynamic Routing for QoS Development in Manet

The problem of routing in mobile adhoc network has been approached in different methods. However, they suffer to achieve the required performance in quality of service. The mobile nodes spent most of the energy on routing because of cooperative transmission. To improve the performance of mobile adhoc network, an efficient LMHP routing algorithm is proposed in this paper. The source node discovers the route by sending LMHP route discovery (LMHP-RD) message to all its neighbors, identified in the neighbor discovery phase. The neighbors reply the LMHP-route request (RREQ) packet to the source node which contains power and displacement information about the intermediate nodes. The source node collects the information about the routes available along with power and displacement details. Using the identified information, the source node computes the transmission completeness weight for each route. Based on computed transmission completeness weight, the method selects a single route with maximum weight to perform data transmission. This method improves the throughput performance and increases the lifetime of the network. The proposed system is developed and simulated in NS2 and the performance has been analyzed based on three metrics Throughput, pocket delivery ratio and latency ratio. The simulated results show that the power consumption is relatively low in the proposed method, comparing the available techniques.

On Resilience and Connectivity of Secure Wireless Sensor Networks Under Node Capture Attacks

Despite much research on probabilistic key predistribution schemes for wireless sensor networks over the past decade, few formal analyses exist that define schemes' resilience to node-capture attacks precisely and under realistic conditions. In this paper, we analyze the resilience of the q-composite key predistribution scheme, which mitigates the node capture vulnerability of the Eschenauer-Gligor scheme in the neighbor discovery phase. We derive scheme parameters to have a desired level of resiliency, and obtain optimal parameters that defend against different adversaries as much as possible. We also show that this scheme can be easily enhanced to achieve the same “perfect resilience" property as in the random pairwise key predistribution for attacks launched after neighbor discovery. Despite considerable attention to this scheme, much prior work explicitly or implicitly uses an incorrect computation for the probability of link compromise under node-capture attacks and ignores the real-world transmission constraints of sensor nodes. Moreover, we derive the critical network parameters to ensure connectivity in both the absence and presence of node-capture attacks. We also investigate node replication attacks by analyzing the adversary's optimal strategy.

Efficient and Secure Routing Protocol Based on Encryption and Authentication for Wireless Sensor Networks

One concerned issue in the routing protocol for wireless sensor networks (WSNs) is how to provide with as much security to some special applications as possible. Another is how to make full use of the severely limited resource presented by WSNs. The existing routing protocols in the recent literatures focus either only on addressing security issues while expending much power or only on improving lifetime of network. None of them efficiently combine the above-mentioned two challenges to one integrated solutions. In this paper, we propose efficient and secure routing protocol based on encryption and authentication for WSNs: BEARP, which consists of three phases: neighbor discovery phase, routing discovery phase, and routing maintenance phase. BEARP encrypts all communication packets and authenticates the source nodes and the base station (BS), and it ensures the four security features including routing information confidentiality, authentication, integrity, and freshness. Furthermore, we still design routing path selection system, intrusion detection system, and the multiple-threaded process mechanism for BEARP. Thus, all the secure mechanisms are united together to effectively resist some typical attacks including selective forwarding attack, wormhole attacks, sinkhole attacks, and even a node captured. Our BEARP especially mitigates the loads of sensor nodes by transferring routing related tasks to BS, which not only maintains network wide energy equivalence and prolongs network lifetime but also improves our security mechanism performed uniquely by the secure BS. Simulation results show a favorable increase in performance for BEARP when compared with directed diffusion protocol and secure directed diffusion protocol in the presence of compromised nodes.

Partial Delaunay triangulation and degree limited localized Bluetooth scatternet formation

We address the problem of localized scatternet formation for multihop Bluetooth-based personal area ad hoc networks. Nodes are assumed to know their positions and are able to establish connections with any of their neighboring nodes, located within their transmission radius, in the neighbor discovery phase. The next phase of the proposed formation algorithm is optional and can be applied to construct a sparse geometric structure in a localized manner. We propose here a new sparse planar structure, namely, partial Delaunay triangulation (PDT), which can be constructed locally and is denser than other known localized planar structures. In the next mandatory phase, the degree of each node is limited to seven by applying the Yao structure, and the master-slave relations in piconets are formed in created subgraphs. This phase consists of several iterations. In each iteration, undecided nodes with higher keys than any of their undecided neighbors apply the Yao structure to bound the degrees, decide master-slave relations on the remaining edges, and inform all neighbors about either deleting edges or master-slave decisions. To the best of our knowledge, our schemes are the first schemes that construct degree limited (a node has at most seven slaves) and connected piconets in multihop networks, without parking any node. The creation and maintenance require small overhead in addition to maintaining accurate location information for one-hop neighbors. The experiments confirm good functionality of created Bluetooth networks in addition to their fast creation and straightforward maintenance.