An Efficient Authentication Mechanism based on ZigBee for Smart Grid Wireless Communication

An Efficient Authentication Mechanism based on ZigBee for Smart Grid Wireless Communication

Remya M

1. Student, Department of IT

   Nehru College of Engineering and Research Centre Pampady, Thrissur, Kerala

   Naveen Raja S M

   Assistant Professor, Department of CSE Nehru College of Engineering and Research Centre

   Pampady, Thrissur, Kerala

   AbstractA modern electric power grid infrastructure for enhanced efficiency and reliability through automated control is called smart grid. A vision of smart grid realizing the integration of network information in power system. The critical issues related to the smart grid wireless applications are delivery of information to the destination. Various routing protocols addresses these issues and finds the shortest path. The Tree routing and table driven routing are the most predominant in various routing protocols. In this paper, a modified Short cut Tree routing based on tree routing is proposed. The optimal path discovery solves the limitations in existing methodologies. The proposed shortcut tree routing (STR) maintains the advantages of the existing ZigBee tree routing simulations carried out in network simulator to describe the various performance evaluations like effect of network density in two conditions such as many to one traffic and any to any traffic. The overall network performance reveals the efficient routing path and traffic load on the tree links. Traffic performance in various patterns and network configuration on the basis of STR are compared with the existing protocols.

   Index TermsBlock Address Allocation Scheme, Improved Tree Routing, Smart Grid Wireless Communication, Shortcut Tree Routing (STR), Tree Topology, ZigBee Tree Routing.

   S

   1. INTRODUCTION

      mart grid wireless communication is a biggest technology contribution to the mankind in which the integration of network information to the power system to satisfy the major requirements in wireless communication such as security, system reliability and availability. The primary concern for the smart grid is security problem. The control actions and information transmitted via network without the interaction of hacking and diversified information. The explosion in smart grid technology leads to creation of many emergence standards for transmitting information issues and opportunities for discovery of shortest paths.As a result, many companies were forged to create a standard which was acceptable in worldwide. One of the most worldwide

      acceptable standard created by ZigBee alliance was ZigBee.

      ZigBee is a low-cost, low-power, wireless mesh network standard which governs the wireless control and monitoring applications. ZigBee devices have low latency and low average current. The rate of 250 kbit/s suited for the data transmissions. Since ZigBee technology was simpler and less expensive compared Wireless Personal Area Networks

      (WPANs), it plays a vital role in data transmission. ZigBee network utilized three types of devices such as network coordinator which maintains overall network knowledge, full function device that supports all features described by the standard and reduced function device carries the limited functionality to lower cost and complexity. ZigBee network achieves longer battery life by either continuous network connection or intermittent connection. It also has maximum data rate, high throughput and low latency. The channel accessing technique used in ZigBee was Carrier Sense Multiple AccessCollision Avoidance (CSMA-CA). The ZigBee protocol is fully reliable handshake data transfer protocol employs three types of topologies. They are star, mesh and peer-peer.

      Various routing protocols are used in ZigBee network to identify the shortest path routing. The routing protocols of ZigBee diverse so that a system or users can choose the optimal routing strategy according to the applications. The reactive routing protocol in ZigBee was derived from Adhoc On-demand Distance Vector Junior (AODVjr) which is one of the representative routing protocols in Mobile Ad hoc Networks (MANET). Similar with other MANET routing protocols, ZigBee reactive routing protocol provides the optimal routing path for the arbitrary source and destination pair through the on-demand route discovery. When the number of traffic sessions increases, the route discovery and the memory conception is more. So communication pair formed between the traffic which leads to the route discovery process for each communication pair. The route discovery packets flooded to the overall network, which interfere with transmission of other packets even in the spatially uncorrelated area with the route discovery. On the other hand, ZigBee Tree Routing (ZTR) prevents the route discovery overhead in both memory and bandwidth using the distributed block addressing scheme. The optimal route discovery in many applications,resource limited devicescan be found byZTR.

      In this paper, the optimal route path can be founded by shortcut tree routing protocol and the advantages of ZTR can be maintained. The ZTR performance can be achieved across various network conditions.The network can be formed according to tree routing protocol. The selection of route process can be carried out using shortcut tree routing algorithm. The performance of the network can be evaluated and the effect of density can be measured upon many traffic

      patterns.The proposed method improves the lifetime, efficiency and yields lesser delay.

      The rest of the paper is organized as follows. Section II presents a description about the previous research which is relevant to the ZigBee network and the possible solutions. Section III involves the detailed description about the proposed method. Section IV presents the performance analysis. This paper concludes in Section V.

   2. RELATED WORK

      This section deals with the works related to the ZigBee network and the routing algorithms implemented to enhance the performance of ZigBee.Dae-Man et al proposed the design descriptions for smart home device and load management in smart energy applications. They also utilized the sensing device control for smart home interfaces in real time testbet implementation[1]. Shyr et al presented transmission protocol based on any cast routing for wireless patient monitoring. The latency of path recovery was reduced by using that protocol and also integration of next generation technologies carried out to achieve the real time patient monitoring [2]. Peizhong et al developed practical ZigBee deployment under the interference of WLAN. Two parameters such as safe distance and safe offset frequency were identified for comprehensive approach. They also proposed the frequency agility based interference algorithm for detection of interference and switching to safe node [3]. Ian et al examined the performance of AVOD and AVODVjr under various conditions sequence numbers, link layer feedback. The security added easily in AVODVjr since the control packets have no mutable field [4]. Kiess et al presented brief survey of real world experiments and the technology required for implementation. Experiments on MANET was carried out in static topologies and the node mobility involving scenario [5].

      Chen et al presented Adaptive Demand-Driven Multicast Routing(ADMR)protocol for MANET implementations. This was the first no-simulated ADMR implementation of MANET and real world impact path scenario was highlighted [6]. Wheeler described the ecosystem emerging ZigBee and the enabling trends [7].Gnawali et al presented and evaluated two principles such as data path validation and adaptive beaconing toreduce the rout repair latency [8]. Jeong et al presented the standards for research activities for influenzing their design for open source applications [9].Levis et al presented the flexible application specific operating system for sensor networks. Qualitative and quantitative measurement was carried out to meet the low memory requirements [10].

      Kim et al proposed the short cut tree routing protocol to reduce the routing cost of ZigBee routing using the neighbor table. Simulations were carried out and 30 percent of hop count compared with ZigBee routing [11]. Excessive redundancy of messages and the signal collision occurred in MANET. Some flooding algorithms were carried out for the removal of redundancy. But in that algorithm the difficulty was to maintain the neighbors information. Liu et al presented the condition flooding algorithm to perform the 100 percent deliverability based on only 1 hop information [12].The position information for flooding algorithm was

      required. Agbaria et al presented the dissemination protocol called loc cast which utilized positioning information to obtain efficient dissemination [13]. The suitable algorithm was required to handle the unannounced leaving and joining of nodes. Peter and Wolf presented a novel approach for self- organization peer-peer overlays and self-optimization of joining and leaving nodes in spanning trees [14]. The devices in ZigBee network cannot receive network addresses isolated from the network called orphan nodes. Pan et al showed that the orphan problem divided into Bounded-Degree-and-Depth Tree Formation (BDDTF) and End-Device Maximum Matching (EDMM) for efficient reduction of orphan devices in ZigBee network [15].

      ZigBee cluster-tree network was not able provide the sufficient bandwidth for increased traffic load.Huang et al presented an adaptive parent based framework for ZigBee clustering tree for efficient bandwidth utilization. They modeled the process as vertex constraint maximum flow problem compatible with ZigBee standard [16]. Jonathan et al derived the simple model to describe the limits of data propagation in wireless networks and the rates for dissemination was argued [17]. Khatiri et al addressed the two problems such as more hop count and hot spot problem and proposed a new routing algorithm called Energy Efficient Shortcut Tree Routing to reduce the hop counts and balance the energy [18].Harbawi et al presented the enhancement in tree routing Improved Tree Routing (ImpTR) which determines the shortest path to sink node from the neighbor table rather than tree topology [19]. Qiuet al proposed enhanced tree routing strategy which have structured node address assignment schemes. Simulations results revealed more energy efficient compared to Tree routing protocol [20].

   3. PROPOSED METHOD

      The main idea to implement STR in ZigBee network is that computing the remaining tree hops from the source to destination using ZigBee address hierarchy. The remaining tree hops can be calculated for three nodes source, destination and ancestor node. The block diagram of proposed method is shown in fig.1.

      Fig.1.Block diagram.

      The proposed method can be evaluated using various modules. The network for analysis formed and the shortest path can be obtained by using short cut tree routing algorithm through iteratively checking and updating process. The overall performance can also be evaluated over existing method. The flow for proposed method consists of successive steps. They are checking neighbor address from the routing table, updating the levels and finding of next hop address.

      The flow of proposed method of short cut tree routing as shown in fig.2.

      = 1+ . 1

      1

      Where, – Maximum children,

      – Maximum router,

      – Maximum depth.

      (1)

      The network address assigned to kth router and nth end device from size based on following equation:

      = + . 1 + 1 (1 )

      (2)

      = + . + (1 )

      (3)

      Device in ZigBee network with an address at dhas the destination address D only if the following condition was satisfied.

      < < + ( 1)

      (4)

      The device sends the data to the one of its children only if the condition was satisfied. Otherwise it send the data to parent. This type of tree routing performed between source and destination nodes rather than neighbor nodes hence packets routed through several hops to the destination within senders 1 hop transmission range.

      Fig.2.STR Data Flow

      1. Network formation

         The network formation is done according to the tree routing protocols. The ZigBee network layer, which is the core of the standard, provides dynamic network formation, addressing, routing, and network management functions. ZigBee supports up to 64,000 devices in a network with the multi-hop tree and mesh topologies as well as star topology. Every node is assigned a unique 16-bit short address dynamically using either distributed addressing or stochastic addressing scheme. The routing protocols of ZigBee are diverse so that a system or users can choose the optimal routing strategy according to the applications.

      2. Route Selection

         The selection of shortest route is done by two protocols such as tree routing and table driven routing.

         1. Tree Routing

            Tree routing in ZigBee network performed on the basis of Block Address Allocation Scheme known as C, in which the network address to its children assigned by finite subblock of address space associated with every potential parent.

            The size of addressing subblock distributed by each parent node at a depth of d using following equation:

         2. Neighbor Table

         Devices in ZigBee contain all information of neighbors in neighbor table. The new joining node received the response beacons from already joined node and also the neighbor entry was removed after the node leaves form the network. So the information in neighbor table called up-date in all time.

         This type of table driven provides optimal routes to destination. But the routing cost is high in this method.

      3. Effective Short Cut Tree Routing

      The short cut tree routing can be enhanced using two processes such as finding of address range and finding of next hop address.

      1. Calculation of address range

         The function addrrange()is the algorithm to find the address range and depth according to ZigBee address allocation scheme.

         The arguments for addrrange() function was Starting Address(SA) of ancestor node at current Depth (D) for a given destination address (DA). The output of this function was address space and depthof destination which are calculated by iterative processes.

         Initially the equality between SA and DA was checked if both are equal then the current depth can be regarded as depth of destination in line1-2. Otherwise the address range can be evaluated iteratively until maximum router reached using line 3-9.The depth to destination to be updated for maximum no of children in line 10-14.

         Algorithm to Find Address Range

         addr range(DA,SA,D)

         Input: DA,SA,D

         Output: d, addrrange(d)

         Begin

         1 if (DA=SA)

         2 return D

         3 else

         4 for i=1 to mR

         5 if(DA in address space of ith router )

         6 store the address space of ith router(d+1)

         7 return

         8 end if

         9 end for

         10 if ((mC-mR)>0)

         11 if(DA is end device of SA)

         12 store DA(D+1)

         13 end if

         14 end if

         End

      2. Calculation of next hop address for a given destination Address

      Next hop addr() function listed is the algorithm to find the intermediate or source node to select the next hop node with minimum hop count for given destination address.

      When selecting the neighbor node as the next hop node source or intermediate node check the remaining routing cost based on remaining hop count to the destination using line 1-

      1. The root of the common subtree can be founded by comparing the address of neighbor node which is contained in the address space. The reference point can be declared as the root of highest common level in sub tree using line 7-8. Then the remaining hop count can be calculated by using the equation (level of sourcenode-highest level of sub tree) + (level of destination node-highest level of subtree) using line 9-14.

         Next hop addr(DA)

         Input: DA

         Output: next hop address

         begin

         1 depth=addrrange(DA,0,0)

         2 Assign the next hop node to next hop address

         3 Assign remaining hop count to minroutecost

         4 for each neighbor from neighbor table

         5 i=0

         6 while (neighbor is in addr range(i+1) && i<depth)

         7 ++i

         8 routecost=(d-i)+(d(neighbor)-i)

         9 if (minroutecost>routecost)

         10 nexthopaddr=neighbor

         11 minroutecost=routecost

         12 store DA(D+1)

         13 endif

         14 endforeach

         End

         Algorithm to find Next Hop Address

   4. PERFORMANCE ANALYSIS

      This section presents the performance analysis of the proposed short cut tree routing in ZigBee network. The evaluation of the routing performance includes hop count, end-to-end latency, packet delivery ratio, and MAC level retransmissions, and the routing overhead is measured with the number of control packets and memory consumption for routing.

      The simulation is categorized into four subsections to analyze the effects of throughput, packet delivery ratio, packet sent and packet received.

      1. Network Throughput Analysis

         The network through put measurement is important to show the proposed algorithm is suitable for optimal path discovery compared to existing methodologies. The network throughput performance analyzed with two parameters such as amount of bandwidth and no of mobile stations used in the network.

         1. Amount of Bandwidth

            Network Throughput (Kbps)

            The network through put analyzed using NS simulator. The performance of network throughput plotted with various bandwidth constraints shown in Fig. 3.

            0.7

            0.6

            0.5

            0.4

            0.3

            0.2

            0.1

            TD Routing

            ESTR

            0

            10

            Amount of BW (KHz)

            50

            40

            30

            20

            Fig. 3 Network Throughput Vs. Amount of Bandwidth.

            Fig.3 describes the relationship between the amount of bandwidth and network throughput. The amount of bandwidth is varied and the network throughput is computed. The proposed ESTR algorithm provide better throughput than the existing approach.

         2. No.of Mobile stations

         When the no of mobile stations increased the network throughput performance measured and variation also plotted in the graph.

         Network Throughput (Kbps)

         0.025 TDRouting 0.02 ESTR 0.015 0.01 0.005 0 10 20 No 30MS 40 50 of

         Fig. 4 Network Throughput Vs.No of Mobile stations.

         Fig.4 describes the relationship between the no of MS and network throughput. The no of MS is varied and the network throughput is computed. The proposed ESTR algorithm provide better network throughput than the existing approach for no of mobile stations.

      2. Bandwidth Consumption Ratio

      BW Consumption Ratio

      An amount of the bit rate of available or consumed data communication resources stated in terms of Kb/s, Mb/s etc. called Network bandwidth.

      Fig. 4Bandwidth consumption ratioVs. Amount of Bandwidth.

      Fig.5 describes the relationship between the amount of bandwidth and bandwidth consumption ratio. The amount of bandwidth is varied and the bandwidth consumption ratio is computed. The proposed ESTR algorithm provide better bandwidth consumption ratio than the existing approach.

   5. CONCLUSION

In this paper, we have identified the detour path problem and traffic concentration problem of the ZTR. These are the fundamental problems of the general tree routing protocols, which cause the overall network performance degradation. To overcome these problems, we propose STR that uses the neighbor table, originally defined in the ZigBee standard. In STR, each node can find the optimal next hop node based on the remaining tree hops to the destination. The mathematical analyses prove that the 1-hop neighbor information in STR reduces the traffic load on the tree links as well as provides an efficient routing path. The network simulations show that STR provides the comparable routing performance to AODV as well as scalability respect to the network density and the network traffic volume by suppressing the additional route discovery process. The performance analysis proved STR to be utilized in many ZigBee applications in smart grid wireless communication such as minimum delay, maximum efficiency and lifetime.

REFERENCES

1. H. Dae-Man and L. Jae-Hyun, "Smart home energy management system using IEEE 802.15.4 and zigbee," IEEE Transactions on Consumer Electronics, vol. 56, pp. 1403-1410, 2010.

2. C. Shyr-Kuen, K. Tsair, C. Chia-Tai, H. Chih-Ning, C. Chih-Yen, L. Chin-Yu, et al., "A Reliable Transmission Protocol for ZigBee-Based Wireless Patient Monitoring," IEEE Transactions on Information Technology in Biomedicine, vol. 16, pp. 6-16, 2012.

3. Y. Peizhong, A. Iwayemi, and Z. Chi, "Developing ZigBee Deployment Guideline Under WiFi Interference for Smart Grid Applications," IEEE Transactions on Smart Grid, vol. 2, pp. 110-120, 2011.

4. I. D. Chakeres and L. Klein-Berndt, "AODVjr, AODV simplified,"

   SIGMOBILE Mob. Comput. Commun. Rev., vol. 6, pp. 100-101, 2002.

5. W. Kiess and M. Mauve, "A survey on real-world implementations of mobile ad-hoc networks," Ad Hoc Networks, vol. 5, pp. 324-339, 4// 2007.

6. B.-r. Chen, K.-K. Muniswamy-Reddy, and M. Welsh, "Ad-hoc multicast routing on resource-limited sensor nodes," presented at the Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality, Florence, Italy, 2006.

7. A. Wheeler, "Commercial Applications of Wireless Sensor Networks Using ZigBee," IEEE Communications Magazine, vol. 45, pp. 70-77, 2007.

8. O. Gnawali, R. Fonseca, K. Jamieson, D. Moss, and P. Levis, "Collection tree protocol," presented at the Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems, Berkeley, California, 2009.

9. K. JeongGil, A. Terzis, S. Dawson-Haggerty, D. E. Culler, J. W. Hui, and P. Levis, "Connecting low-power and lossy networks to the internet," IEEE Communications Magazine, vol. 49, pp. 96-101, 2011.

10. P. Levis, S. Madden, J. Polastre, R. Szewczyk, K. Whitehouse, A. Woo, et al., "TinyOS: An Operating System for Sensor Networks," in Ambient Intelligence, W. Weber, J. Rabaey, and E. Aarts, Eds., ed: Springer Berlin Heidelberg, 2005, pp. 115-148.

11. K. Taehong, K. Daeyoung, P. Noseong, Y. Seong-Eun, and T. S. Lopez, "Shortcut Tree Routing in ZigBee Networks," in 2nd International Symposium on Wireless Pervasive Computing, 2007. ISWPC '07. , 2007.

12. L. Hai, J. Xiaohua, W. Peng-Jun, L. Xinxin, and F. F. Yao, "A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 18, pp. 658-671, 2007.

13. A. Agbaria, M. Hugerat, and R. Friedman, "Efficient and reliable dissemination in mobile Ad Hoc networks by location extrapolation," Journal of Computer Networks and Communications, vol. 2011, 2011.

14. P. Merz and S. Wolf, "TreeOpt: Self-Organizing, Evolving P2P Overlay Topologies Based On Spanning Trees," in ITG-GI Conference on Communication in Distributed Systems (KiVS), 2007 2007, pp. 1-12.

15. P. Meng-Shiuan, T. Chia-Hung, and T. Yu-Chee, "The Orphan Problem in ZigBee Wireless Networks," IEEE Transactions on Mobile Computing, vol. 8, pp. 1573-1584, 2009.

16. H. Yu-Kai, P. Ai-Chun, H. Pi-Cheng, Z. Weihua, and L. Pangfeng, "Distributed Throughput Optimization for ZigBee Cluster-Tree Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 23, pp. 513-520, 2012.

17. J. W. Hui and D. Culler, "The dynamic behavior of a data dissemination protocol for network programming at scale," presented at the Proceedings of the 2nd international conference on Embedded networked sensor systems, Baltimore, MD, USA, 2004.

18. A. Khatiri, G. Mirjalily, and A. Khademzadeh, "Energy-Efficient Shortcut Tree Routing in ZigBee Networks," in Fourth International Conference on Computational Intelligence, Communication Systems and Networks (CICSyN), 2012 2012, pp. 117-122.

19. M. Al-Harbawi, M. Rasid, and N. Noordin, "Improved tree routing (ImpTR) protocol for ZigBee network," International Journal of Computer Science and Network Security, vol. 9, pp. 146-152, 2009.

20. W. Qiu, E. Skafidas, and P. Hao, "Enhanced tree routing for wireless sensor networks," Ad hoc networks, vol. 7, pp. 638-650, 2009.