Augmented tree-based routing

Abstract: Node capture attacks are one prospective kind of attack on WSNs. To prevent node capture attacks, we have proposed secure decentralized data transfer against node capture attacks, previously. In this proposed method, the existence of multiple paths was assumed to be the case. In this paper, we have proposed taking into account the multipath routing of our previously proposed method. To make multiple paths fit our previously proposed method, we have modifed ATR (Augmented Tree Based Routing). We have implemented our proposed method in a network simulator. We have conducted simulation experiments. The results show that our previously proposed method is effective in both cases in which the network size is small or large.

Abstract: The development of smart cities and their fast-paced deployment leads to the creation of massive amount of data at exceptional rates. Due to the data gathering and tracking nature of wireless sensor networks (WSN), it finds applications in various domains. Presently, security is considered as an important design issue of developing multipath routing protocols in WSN. The existing routing techniques either concentrate on energy efficiency or security issues with maximum resource utilization. This paper focuses on the idea of incorporating encryption algorithms on multihop routing mechanism in WSN. Here, routing takes place by the Augmented Tree Based Routing (ATR) which is a tree-based multipath routing method. To attain higher level of security, two encryption algorithms namely lightweight encryption algorithm (LEA) and two phase hybrid cryptography algorithm (THCA) are employed based on the data dependability. The encryption algorithms are utilized based on data dependability where general data is encrypted by LEA and other confidential data are encrypted by THCA. i.e. the LEA is used to send proactive data and the important reactive data is encrypted by THCA. For routing purposes, Augmented Tree Based Routing (ATR) is used. From experimentation, it is evident that the presented method exhibits enhanced performance by means of throughput, control overhead and network lifetime even though there exist some misbehaving nodes in the network.

Abstract: In ad hoc networks scalability is a critical requirement if these technologies have to reach their full potential. Most of the proposed routing protocols do not operate efficiently with networks of more than a few hundred nodes. In this paper, we propose an augmented tree-based address space structure and a hierarchical multi-path routing protocol, referred to as augmented tree-based routing (ATR), which utilizes such a structure in order to solve the scalability problem and to gain good resilience against node failure/mobility and link congestion/instability. Simulation results and performance comparisons with existing protocols substantiate the effectiveness of the ATR.