CASER Protocol Using DCFN Mechanism in Wireless Sensor Network

Transcription

1 Volume 118 No , ISSN: (printed version); ISSN: (on-line version) url: ijpam.eu CASER Protocol Using DCFN Mechanism in Wireless Sensor Network A.Shirly Edward Department of ECE, SRM IST, Vadapalani, Chennai, India edward.s@vdp.srmuniv.ac.in M.S.Bhuvaneswari Department of ECE, SRM IST, Vadapalani, Chennai, India Bhuvaneswari.ms@vdp.srmuniv.ac.in S.G.Vijayakumari Department of ECE, SRM IST, Vadapalani, Chennai, India Vijayakumari.g@vdp.srmuniv.ac.in Abstract This paper proposes Cost Aware SEcure Routing Protocol using Denial Contradictions with Fictitious Node mechanism to address the two conflicting issues in Wireless Sensor Networks. They are energy consumption and security. Energy efficient transferring of packets is a major issue in a wireless sensor network. This is achieved by CASER which utilizes random walk strategy to balance the energy consumption in the network. Random walk strategy provides chance for every node to participate in the data transmission, thereby avoiding any node to completely drain out of energy which maximizes the network lifetime. For information collection and monitoring the critical infrastructure wireless sensor networks are widely used. Hence secured data transmission is achieved through DCFN mechanism which relays on internal knowledge of every node participating in the network. The results obtained from simulation demonstrate that the proposed scheme is very efficient in balancing the energy consumption of the network and can achieve a secured data transmission. Keywords Energy balance, Network Lifetime, Routing, Security, Sensor Networks I. INTRODUCTION In recent days, wireless sensor networks (WSNs) are extensively used in civilian and military applications, like monitoring of critical infrastructures, atmospheric conditions and precious species. The main features of those networks are that each of the networks consist of a large number of unthethered and unattended sensor nodes. Limited energy resources are often available in these nodes, which causes energy to be a vital design issue for these networks [1]. Another challenging main design issue for WSNs is security. Therefore, a precisely designed routing protocol must have low energy consumption for message delivery and high message delivery ratio, and also ensure security. The main contributions of this paper are as follows: They are a secure and energy efficient Cost-Aware SEcure Routing (CASER) protocol using DCFN mechanism for WSNs is proposed. A quantitative scheme to balance the energy consumption is suggested so that the sensor network lifetime can be maximized. Security is quantitatively analyzed for the proposed routing algorithm. Energy consumption is balanced by utilizing random walk strategy for available sensor networks. Security is achieved by utilizing Denial Contradictions with Fictitious Node mechanism. II. OVERVIEW OF THE EXISTING SCHEME A. Energy balancing Batteries employed in sensor nodes become a critical constraint on sensors networks. A second constraint is that a large number of sensors will be deployed unattended, and therefore it becomes difficult in the sensors to change or recharge batteries. In order to determine the life time of the battery, energy consumption of the active node must be measured in a network. Therefore power consumption must be minimized for all systems, processes in the system and communication protocols for sensors and sensor networks. The communications performed inside wireless sensor networks (WSNs) is controlled by limited energy capacity of sensor nodes. Finite-energy resources must be made use of properly by WSN protocols [2]. Typically, due to high transmission power required to achieve a reliable transmission, sensor nodes avoid direct communication with a far-off destination. Rather, sensor nodes send messages by creating a multi-hop network to forward messages to the collector node, which is additionally called the sink node. The network lifetime is assumed to be the first node in the network to fail and a good routing protocol will gradually and uniformly drain the energy across nodes, leading to the death of all nodes nearly at the same time. Phantom routing protocol is a representative example of a routing-based protocol which utilizes designed directed path to transmit the data. There are two phases in Phantom routing, they are random walk and subsequent flooding/single path routing. From the 501

2 real source the message is routed to a phantom source through a designed directed path or random path, in the random walking phase. And also from the real source the phantom source is expected to be remote, which leads to trace the real source s location to be hard by the adversaries. Anyway from the analysis it can be found that if the message is routed h hops randomly, then it is far fairly possible that the distance between the real source and phantom source is within h/5. To solve this problem, designed directed walk was proposed. First of all, the source node determines the direction of the message. The header stores the direction information of the message. The message will be forwarded on the path to its neighbor in the similar path dictated by the source node. Consequently, the directed walk determines the phantom source that is located away from the real source. Unfortunately, on the pre-determined walk path, once the message is captured, the opponents are able to retrieve the information about the direction stored in the header of the message [3]. Since transmission takes in a pre-determined path, we observe that energy of the nodes participating in the data transmission keeps draining fast while energy in other nodes still remains the same. Even if a single node is completely drained fully, it affects the sensor network s lifetime. Ideally a routing protocol should not drain the sensor node faster [4]. If routing happens through the same path energy will get depleted from the sensor nodes. Sensor Networks in future will be a combination of large number of densely deployed sensors. These networks have nodes that are untethered and unattended. Therefore, an important design consideration is the energy efficiency for these networks. In Wireless Sensor Networks (WSNs) node deployment is a basic issue which has to be solved. Reduction of the complexity of problems can be done with a proper node deployment scheme in WSNs, for example, data fusion, routing, communication, etc. Consequently, it extends the lifetime by minimizing energy consumption in WSNs. B. Security The main problem in wireless sensor network is that they are prone to vulnerable attacks. Delivering messages between nodes in a WSN is important and difficult. In literature routing algorithms can be grouped into two categories. They are Greedy algorithms that apply greedy path finding heuristic which does not guarantee that a whether the packet reaches all of its destinations. One such example is the geographic distance routing (GEDIR) algorithm. Flooding algorithms use controlled packet duplication mechanism to verify that at least one copy of the original packet is received at every destination. Location-aided routing (LAR) protocols are used to exemplify this algorithm. In order for flooding algorithms to terminate, the packets previously seen must be remembered by the network. Hence we have implemented DCFN mechanism in order to provide security to the network. III. PROPOSED CASER ROUTING PROTOCOL USING DCFN MECHANISM A. Random Walk Strategy In random walk strategy, source sensor node generates a packet and it performs random motion till it reaches a sink node where it is collected. Equal initial energy is allotted to each deployed sensor node. The CASER algorithm is designed in such a way it can balance the overall energy consumption of all nodes of the sensor network by controlling energy spending from the same sensor nodes with low energy levels. The life time of the sensor network can be extended by this way. When messages are forwarded by the sensor node the energy level decreases. CASER utilizes random walking strategy to forward a message from one node to another. The sender chooses a random path to forward the data to the destination. Utilization of random walking path provides every node a chance to participate in the data transmission, thereby every node consumes energy to some extent. During next data transmission, CASER utilizes another random node and hence we can prevent the same node consuming more energy which will increase the sensor s network lifetime. Wireless sensor networks (WSNs) need a good sensor deployment. In order to prolong network lifetime and to improve the initial deployment, the sensors are relocated in different densities which may vary with the distance to the sink. Sensors near the sink should have higher density because they are involved in more data forwarding. B. DCFN Mechanism Denial contradictions with Fictitious Node Mechanism (DCFN) depend on the application of a special type of node called fictitious nodes and the internal knowledge acquired by each node during routine routing. Any attack occurred in the network is detected and it finds such attacker node and completely eradicates from the network and a new path to the delivery of packets to the destination is found. From the source node to the destination node a data packet has to be transmitted successfully. All possible paths to reach the sink node from the source node are found. For prompt delivery of the packets a new node called MPR node is chosen. Among the one hop neighbors an MPR node is found through which all the two hop neighbors of the source node can be found.destination is reached earlier on transmission through MPR. Data packet will not reach the destination if there is an attack. It is confirmed that an attack has occurred after waiting for a timeout period,the attacker node is completely thrown out of the network. Initially, sender broadcasts HELLO message to all other nodes. The malicious node is detected and completely removed from the network if any contradictions are observed during transmission. The information about malicious node is also conveyed [5]. 502

3 IV. FLOW DIAGRAM FOR THE PROPOSED SCHEME Figure 1 shows the flow chart of the proposed scheme. Our proposed system can be simulated in NS2 by randomly deploying the nodes first in which a fictitious node is selected. Initially, sender is made to broadcast HELLO message to other nodes in the network. If there are any contradictions observed in any of the node, that node is considered to be the malicious node. There are various circumstances during which a node can become malicious. It might perform eavesdropping of data or provide wrong destination route or forward the data to already affected node. Once the malicious nodes are identified, fictitious nodes alert all other nodes in the network, thereby eliminating the malicious nodes during data transmission. Now the actual data transmission takes place in a random walk strategy, providing opportunity for all the nodes in the network to participate in the data transmission, thereby balancing the overall sensor network s lifetime. Start Nodes are randomly deployed in the sensor network Fictitious node is declared Figure 2 Energy consumption graph of the existing system B. Representation of Energy consumption in proposed system Sender node broadcasts HELLO messages to other nodes in the network Malicious nodes are detected Sender transmits data through random path eliminating malicious nodes Stop Figure 1. Flowchart of the proposed Scheme V. ANALYSIS A. Representation of Energy consumption in existing system Figure 2 shows that the energy consumption of the entire sensor network is very high in phantom routing as every data is transmitted in the same path, thereby reducing the sensor network s lifetime. Figure 3 Energy consumption of the proposed system Figure 3 shows that the energy consumption of the network is consistent as data is transmitted through random path which avoids any node to completely drain. This extends the lifetime of the network. 503

4 VI. CONCLUSION In this paper, we presented a secure and energy efficient Cost Aware SEcure Routing Protocol using Denial Contradictions with Fictitious Node Mechanism for Wireless Sensor Networks to balance the energy consumption and to provide security. Our proposed system extends the lifetime of the network while increasing routing security. Security in the network is achieved through a new solution to overcome the attacks called DCFN mechanism. This method differs from all the other methods in the manner that data in the network needed to be protected from attacks completely depend only on the internal knowledge of the nodes and does not need a third party for this purpose. The usage of fictitious node applies the basic knowledge of the network topology to suspect the attack nodes and evacuate those nodes for data transmission. REFERENCES.Di Tang, Tongtong Li, Jian Ren, Jie Wu, Cost-Aware SEcure Routing (CASER) Protocol Design for Wireless Sensor Networks, IEEE Transactions on Parallel and Distributed Systems, Vol.26, No.4, 2015, pp [1] F.Bouabdallah, N.Bouabdallah and R.Boutaba, On Balancing Energy Consumption in Wireless Sensor networks, IEEE Transactions on Vehicular Technology,Vol.58, Issue. 6, 2009,pp [2] Yun Li, Leron Lightfoot, Jian Ren, Routing-Based Source-Location Privacy Protection in Wireless Sensor Networks, IEEE International Conference on Electro/Information Technology, June [3] U.Datta, P.K. Sahu and S. Kundu, Lifetime of a CDMA wireless sensor network with route diversity, 2013 Annual IEEE India Conference(INDICON), December [4] R. Bama, K. Vigneshvarun, J. Jeyant and S. Rajasekar, Recovery from Attacks Involving Refusal of Service in Manets by DCFN Mechanism, Middle-East Journal of Scientific Research, Vol.24, No.4, 2016,pp

5 505

6 506