SECURE AND EFFICIENT HYBRID APPROACH FOR DATA TRANSMISSION IN ZIGBEE NETWORK

Transcription

1 SECURE AND EFFICIENT HYBRID APPROACH FOR DATA TRANSMISSION IN ZIGBEE NETWORK P.M.Shareefa Jareena *1, T.Samraj Lawrence #2, and V.Perathu Selvi #3 * Student, Dept of CSE (SNW), Francis Xavier Engineering College, Affiliated to Anna University, Tirunelveli # Assistant Professor, Dept of CSE, Francis Xavier Engineering College, Affiliated to Anna University, Tirunelveli # Assistant Professor, Dept of CSE, Francis Xavier Engineering College, Affiliated to Anna University, Tirunelveli Abstract ZigBee is a wireless network protocol designed for low data rate and control networks. ZigBee is a specification for a high-level communication protocols used to create personal area wireless networks built from small, low-power digital radios. In ZigBee the packets are sending between the source and destination they follow the tree topology because it does not require routing table and route discovery overhead. If the packet follows the tree topology, it cannot provide the optimal path. In this paper, we propose the shortest hop tree routing (SHTR) protocol that provides the optimal path but also maintain the route discovery overhead. In shortest hop tree routing the source give the hop distance. This distance store in ZigBee and apply the ZigBee routing. In this routing find the minimum hop and route for send the data. Then we propose the power balancing algorithm for maintenance the routing path. The parent node could maintain its child's links for loading the lower network and so it collect all the information from a neighbor table. We send the data in ZigBee secure by using game theory. This game theory used to check the path is normal or malicious. If the path is normal send the data. Otherwise again apply the routing procedure and game theory to find the normal path. This method is very secure and efficient. Index Terms cluster heads, Game theory, Neighbor table, Malicious Node. I. INTRODUCTION ZigBee is an upcoming standard for wireless personal area network. ZigBee is used to provide low cost and low power connectivity for battery long life. It does not need any data transfer rate. The transfer rate is as high as enabled by Bluetooth. Compared to Wifi, Bluetooth, the ZigBee wireless protocol offers low data rate, low complexity, decrease resource requirements and its specifications is standard. ZigBee specification means it explain the each layer of the ZigBee network such as physical layer, network layer, Mac layer as well as security services provide by the ZigBee network. ZigBee can be also implemented in mesh networks. ZigBee devices can transmit data over large distances by passing data through a mesh network of intermediate devices to reach more distant ones. In ZigBee network layer, the tree routing algorithm us very simple and also it provide reliable routing for any destination address. ZigBee device has no capability of routing table and route discovery table, so follows the hierarchical tree by comparing the destination address. In hierarchical tree routing, address of the destination node is known, then the node send packet to any one of node in the network. If the destination address is not known then the packet forward to the parent node. The next hop node receives the packet according to the destination address in the same manner. There are many routing protocols in ZigBee network. Reactive routing protocol is one of the fundamental routing protocols in ZigBee. It provides the optimal path but there is no route discovery and memory consumption. The next routing is ZigBee tree routing. Routing path is optimal in ZigBee tree routing but it does not provide route discovery. ZigBee security is noticed by government and security developer as well as the hacker. Everyone study the security availability of the protocol and the framework. By studying this, we have all learned, security is only effective if it is implemented properly. Our main objective is to provide the optimal routing path as well as send the data packet secure. We propose shortest hop tree routing and power balancing algorithm for optimal routing and game theory for security. In SHTR, a source or an intermediate ode selects the minimum hop distance to the destination. For security the malicious node is detected in the path. If any malicious node in the path it again find the other routing path which has low hop count. II. SYSTEM ANALYSIS 2.1 PROBLEM DEFINITION In the ZigBee protocols routing, it maintains the routing table. The problem of this routing table is size. In the resource-limited devices, routing paths store in the routing table but the size is too big. In tree routing main drawback is 24

2 the increased hop-counts in search protocols. The STR algorithm solves two problems of the ZTR by using 1-hop neighbor information. STR alleviates the traffic load concentrated on the tree links as well as provides an efficient routing path without loop. It consumes more power while transmitting the information over the networks. Shortcut tree routing causes high energy and routing overhead. It is also causing extra cost in the networks. Since, it is wireless it is vulnerable to hackers. The adaptive routing optimization is utilized to improve the routing performance To reduce the power consumption To provide security in the zigbee networks, the game theory concept is used. III. SYSTEM ARCHITECTURE 2.2 EXISTING SYSTEM Initialize network In the existing system the routing protocols of ZigBee are diverse. The users can choose the optimal routing path itself according to the applications. Another routing protocol is reactive routing protocol derived from AODVjr, which is one of the routing protocols in mobile ad hoc networks (MANET). Similar ZigBee reactive routing protocol provides the optimal routing path for the arbitrary source and destination pair through the on-demand route discovery. If the traffic session is increases proportionally route discovery overhead is also increased. Each communication pair require route discovery. Transmission packets are interfere when the route discovery packet flow into over all network. On the other hand, ZigBee tree routing (ZTR) prevents the route discovery overhead in both memory and bandwidth using the distributed block addressing scheme. Rejoining request Get the hop Path selected Node failure occurs Cluster Head selection Malicious node detection Using Neighbour table Disadvantages of System Shortcut tree routing causes high energy and routing overhead. It causes extra cost in the networks. Life time of the network is low Packet over heading Highly dynamic nature of the system can cause the protocol forced to select malicious path. The memory consumption proportionally increase with the number of traffic sessions. If (cluster head =malicious node) Packets delivery through cluster head Packet send between source and destination End process 2.3 PROPOSED SYSTEM To overcome the above problem, a proposed system is developed to find the shortest route, reduce power consumption, and to provide security. It uses the ZigBee Protocol to find the shortest route for information sending in the wireless networks. The system is also proposed with adaptive routing optimization. To improve the routing performance we need some of the requirement specified in ZigBee specification. The requirement for better routing are stored in the neighbour, thus the algorithm need any other communication. In ZigBee topology itself select or change the parent and the links if they have better choice. So, routing path select can be improved during the transmission. To reduce the power consumption and to provide security in the networks, the game theory concept is used Advantages of System IV. A. Get the Hop Distance: SYSTEM MODULES A hop is one of the important parts of the path between source and destination. Packets are sending through routers and gateways on the path. If data packets are passed to the next node, a hop occurs. Routing table is maintained during the packets sending. It contains the IP address of a destination network and the IP address of the next hop and also it has the path to the final destination. Next-hop forwarding means to find the next hop for each known destination by using the routing table. We can use the separate gateway for each transmits, so we cannot know the gateway for complete path to a destination. 25

3 B. Shortest hop Tree Routing: The main idea of SHTR is that we can compute the hops from an current source to a destination using ZigBee address hierarchy and tree structure. The hops distance can be calculated between each node. By using this distance we can find the ancestor for each node. The neighbor table contain the source node, destination node, common ancestor and decestor of each node. Then we find out the common ancestor for source and destination. If the source and destination having a common ancestor then trace the path. This path is the routing path. C. Power consumption algorithm: If any node in the path is fail. Then we calculated a new routing path for data transmission. Source node sends the rejoin request to every node in the path for reform the network. It is waiting for responses. It select the candidates having highest priority when it receives more than one rejoining request. ZigBee coordinator is required to announce the number of its children and maintain its children when it receiving a joining and rejoining request from the source node. In the power consumption algorithm, routing table contain the source node, destination node, common ancestor and decestor of each node, the availability of accepting new children, the number of its descendants and ZC. Now routing table is updates. Every node has its new ancestor and descentor. Then it follow the SHTR method, now the new routing path is established. D. Apply Game theory for check malicious path: Each network contain malicious node. Malicious node is one that randomly drops packets to conserve its power. For malicious In game theory, if a node is a malicious nodes, randomly decides whether or not it wants to not forward the packet. To reduce the power consumption, we select the cluster head for sending the packet. Weight of the each node is calculated. All non cluster-heads in the network send the data packets through this cluster head. Cluster heads is selected by using the weight of the each node. If the weight of the node is minimum then the node is declared as cluster head. We search the malicious node in the path. Malicious nodes randomly drop packets, reducing through the network. Source node maintains the reputation of every node in the network. In data transmission between the source and destination through cluster head so we check the cluster head is malicious or not. For this we calculated the reputation of the cluster head. If the reputation value is lower than the average minus the standard deviation, then the cluster head is considered as malicious. Then the packet is send between source and destination otherwise it sends through cluster head. V. PERFORMANCE ANALYSIS A. Packet Delivery Ratio: Packet delivery ratio is the ratio of the number of packet receives to the number of packet send. This illustrates the level of delivered data to the destination =!" #$" Table 1 Packet Delivery Ratio Packet Delivery Ratio Number of B. End-to-End Delay: Fig:1 Packet Deliver Ratio The end to end delay is defined as the average time to deliver the packet to the destination. The delay given by route discovery process and the queue in transmission of data packet is also including in this delay. The successfully delivery packet alone is considered in the count. %&' %&' () *+ -&' *+) = /+1 2 3&&&4 Table 2 End-to-End Delay

4 End-to-End Delay Number of C. Routing Overhead: Fig:2 End-to-End Delay ACKNOWLEDGMENT I thank the Lord Almighty who has been with me through every walk in my life, for guiding me and for the blessings showered on me to complete the project in successful manner. I convey my sincere thanks to my guide Mr.T.Samraj Lawrence., M.E. (Ph.D), Associate Professor, Department of Computer Science and Engineering, Francis Xavier Engineering College who inspired me and supported me throughout. I also thank Ms.V.Perathu Selvi M.E., Assistant Professor, Computer Science and Engineering for her valuable guidance throughout and it is great privilege to express my gratitude to her. REFERENCES To find a routing in the network path it needs some requirement such as time, memory, bandwidth and other resources. If any of the requirements is excess or indirect combination routing overhead is used. Table 3: Compare the Routing Overhead Routing Overhead VI Number of Fig:3 Routing Overhead comparisons CONCLUSION AND FUTURE WORK This project proposed the zigbee in wireless sensor networks. The shortcut hop tree routing is proposed. The data send from source to destination. First hop distance is finding and apply to the tree routing. Sending path to be selected. In addition, the game theory is applied to find the malicious node and power consumption. The proposed method is very secure and energy consumption. Several future research directions can be investigated. As the discovery and recovery of the routes is energy consuming, it can be considered in the future work. Many other routing protocols can also be considered, providing security may also be another consideration. In future, to improve the security. In security using any encryption and dynamic key distribution schemes. Altman E, Azouzi R, and Jiménez T (24), Slotted Aloha as a game with partial information, Comput. Netw., vol. 45, no. 6, pp Balasubramani S, Sabari A (28), A Cluster Based Optimization Technique with Adoptive Framework for ZigBee WSN, IEEE Comm. Surveys and Tutorials, vol. 9, No. 1, pp Chakeres I, AODVjr, AODV Simplified (2), ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 6, pp Chen et al., S (212), A Reliable Transmission Protocol for ZigBee-Based Wireless Patient Monitoring, IEEE Trans. Information Technology in Biomedicine, vol. 16, no. 1, pp Dae-Man Han and Jae-Hyun Lim (212), A Smart Home Energy Management System Using IEEE And Zigbee, IEEE Trans. Vehicular Technology, vol. 58, No. 6, pp Hua Liu and Bhaskar Krishnamachari (1997), Poster Abstract: A Game Theoretic Approach for Slotted Medium Access in Wireless Networks, Proc. IEEE INFOCOM 97. Huang et al. Y (212), Distributed Throughput Optimization for ZigBee Cluster-Tree Networks, IEEE Trans. Parallel and Distributed Systems, vol. 23, no. 3, pp Iwayemi A, Zhou (211), Developing ZigBee Deployment Guideline under WiFi Interference for Smart Grid Applications, IEEE Trans. Smart Grid, vol. 2, no. 1, pp Johnson D B and Maltz D A (1996), Dynamic Source Routing in Ad Hoc Wireless Networks, Mobile Computing, vol. 353, pp Kakkatil Binita Narayanan and Prof.Mrs.J.D.Bhosale (25), To improve the network lifetime using Distributed Throughput Optimization for Zigbee cluster tree networks,ieee Trans. Vehicular Technology, vol. 56, No. 5, pp. Kim T, Kim N, Park P (27), Shortcut Tree Routing in ZigBee Networks, Proc. Int l Symp. Wireless Pervasive Computing (ISWPC). Lu et al. H (27), A Distributed and Efficient Flooding Scheme Using1-Hop Information in Mobile Ad Hoc Networks, IEEE Trans.Parallel and Distributed Systems, vol. 18, no. 5, pp Merz P and Wolf S (27), TreeOpt: Self-Organizing, Evolving P2P Overlay Topologies Based on Spanning Trees, Proc. Comm. In Distributed Systems Conf. (KiVS). Pan M.S., Tsai C, and Tseng Y (29), The Orphan Problem in ZigBee Wireless Networks, IEEE Trans. Mobile Computing, vol. 8, no. 11, pp. Perkins C.E, Royer E.M (1999), Ad-Hoc On-Demand Distance Vector Routing, Proc. IEEE Workshop Mobile Computer Systems and Applications. Rajeshwari Uikey and Sanjeev Sharma (212), Zigbee Cluster Tree Performance Improvement Technique, IEEE Trans. Mobile Computing, vol. 8, No. 2, pp. 27

5 Wheeler A (27), Commercial Applications of Wireless Sensor Networks Using ZigBee, IEEE Comm. Magazine, vol. 45, no. 4, pp