The role of the RPL routing protocol for smart grid communications

Advanced communication/networking technologies should be integrated in next-generation power systems (a.k.a. smart grids) to improve their resilience, efficiency, adaptability, and sustainability. Many believe that the smart grid communication infrastructure will emerge from the interconnection of a large number of small-scale networks organized into a hierarchical architecture covering larger geographic areas. In this article, first we carry out a thorough analysis of the key components of the smart grid communication architecture, discussing the different network topologies and communication technologies that could be employed. Special emphasis is given to the advanced metering infrastructure, which will be used to interconnect the smart meters deployed at customers\u27 premises with data aggregators and control centers. The design of scalable, reliable, and efficient networking solutions for AMI systems is an important research problem because these networks are composed of thousands of resource-constrained embedded devices usually interconnected with communication technologies that can provide only low-bandwidth and unreliable links. The IPv6 Routing Protocol for Low Power and Lossy Networks was recently standardized by the IETF to specifically meet the requirements of typical AMI applications. In this article we present a thorough overview of the protocol, and we critically analyze its advantages and potential limits in AMI applications. We also conduct a performance evaluation of RPL using a Contiki-based prototype of the RPL standard and a network emulator. Our results indicate that although average performance may appear reasonable for AMI networks, a few RPL nodes may suffer from severe unreliability issues and experience high packet loss rates due to the selection of suboptimal paths with highly unreliable links

Robust geometric forest routing with tunable load balancing

Although geometric routing is proposed as a memory-efficient alternative to traditional lookup-based routing and forwarding algorithms, it still lacks: i) adequate mechanisms to trade stretch against load balancing, and ii) robustness to cope with network topology change. The main contribution of this paper involves the proposal of a family of routing schemes, called Forest Routing. These are based on the principles of geometric routing, adding flexibility in its load balancing characteristics. This is achieved by using an aggregation of greedy embeddings along with a configurable distance function. Incorporating link load information in the forwarding layer enables load balancing behavior while still attaining low path stretch. In addition, the proposed schemes are validated regarding their resilience towards network failures

Energy Efficient and Guaranteed Packet Delivery in Mobile Ad Hoc Networks

For Ad-hoc network routing protocols, high delivery ratio with low energy consumption is one of design challenges. This paper identifies the limitations of ad hoc routing scheme, in terms of guaranteed delivery with low energy consumption. Accordingly, this paper describe a scheme, in which data is forwarded along a pre-established lone path to save energy, and a high delivery ratio is completed by path repair whenever a break is detected. This paper propose a humble, quick, local path repairing method, whereby a malicious node can be tracked by low energy. This paper implement encoding and compression technique scheme and compare its performance with those of pure lone path without repair and multi-path routing schemes

Real-time Power Aware Routing in Wireless Sensor Networks

Many mission-critical wireless sensor network applications must resolve the inherent conflict between the tight resource constraints on each sensor node, particularly in terms of energy, with the need to achieve desired quality of service such as end-to-end real-time performance. To address this challenge we propose the Real-time Power-Aware Routing (RPAR) protocol. RPAR achieves required communication delays at minimum energy cost by dynamically adapting the transmission power and routing decisions based on packet deadlines. RPAR integrates a geographic forwarding policy cognizant of deadlines, power, and link quality with new algorithms for on-demand power adaptation and efficient neighborhood discovery. Simulations based on a realistic radio model of MICA2 motes show that RPAR significantly reduces the number of deadline misses and energy consumption when compared to existing real-time and energy-efficient routing protocols and beacon based neighborhood management schemes

LOCATION AWARE CLUSTER BASED ROUTING IN WIRELESS SENSOR NETWORKS

Wireless sensor nodes are usually embedded in the physical environment and report sensed data to a central base station. Clustering is one of the most challenging issues in wireless sensor networks. This paper proposes a new cluster scheme for wireless sensor network by modified the K means clustering algorithm. Sensor nodes are deployed in a harsh environment and randomly scattered in the region of interest and are deployed in a flat architecture. The transmission of packet will reduce the network lifetime. Thus, clustering scheme is required to avoid network traffic and increase overall network lifetime. In order to cluster the sensor nodes that are deployed in the sensor network, the location information of each sensor node should be known. By knowing the location of the each sensor node in the wireless sensor network, clustering is formed based on the highest residual energy and minimum distance from the base station. Among the group of nodes, one node is elected as a cluster head using centroid method. The minimum distance between the cluster node’s and the centroid point is elected as a cluster head. Clustering of nodes can minimize the residual energy and maximize the network performance. This improves the overall network lifetime and reduces network traffic