An Efficient Lifetime-Enhancing IDS Node Distribution Using Minimum Spanning Tree in Wireless Ad Hoc Networks

Abstract

Wireless ad-hoc networks communicate with other nodes using wireless interfaces. So the wireless ad-hoc networks don`t have any centralized infrastructure, then all nodes in a network only have local information and communicate with their 1 hop neighbors using peer to peer mode. There are a variety of researches on security problems in wireless ad hoc networks. The existing many researches try to make efficient security schemes to reduce the number of IDS nodes and network power consumption, enhance network lifetime, and so on. Because a new node can join the network at any time, the wireless ad hoc networks are exposed to various threats and can be destroyed by attacks. Resource consumption to secure networks is absolutely necessary, but resource wasting can be a critical problem to network lifetime. This paper focuses on efficient node distribution to enhance network lifetime in wireless ad hoc networks. Since the wireless ad hoc networks can’t use centralized infrastructure and security systems of wired networks, a new special IDS scheme is necessary. The scheme should not only cover all nodes in a network but also enhance the network lifetime. In this paper, we propose an efficient IDS node distribution scheme using minimum spanning tree (MST) method. The simulation results show that the proposed algorithm has landslide victory in comparison with existing algorithms.