Carlos Henrique Barriquello

An intelligent system for street lighting monitoring and control

One of the major challenges at the moment is the improvement of the present street lighting system. These systems are considered outdated due the lack of communication capabilities, not allowing system feedback. This work aims to add communication capabilities to the systems already in use, through the integration of an IEEE 802.15.4 compatible transceiver to the photoelectric relay used to turn the HPS lamps on/off. This change will turn each device into a node of a large wireless network across the city.

An Intelligent System for Street Lighting Control and Measurement

One of the major challenges at the moment is the improvement of the present street lighting system. These systems are considered outdated due the lack of communication capabilities, not allowing system feedback. This work aims to add communication capabilities to the systems already in use, through the integration of a ZigBee™ compatible transceiver to the photoelectric relay used to turn the HPS lamps on/off. This change will turn each device into a node of a large wireless network across the city.

A geographic routing hybrid approach for void resolution in wireless sensor networks

Abstract: Geographic routing is one of the most suitable routing strategies for large scale wireless sensor networks due to its low overhead and high scalability features. A geographic routing scheme usually combines a geographic greedy forwarding with a recovery mechanism to solve the local minima problem. Solutions proposed in the literature commonly combine greedy forwarding with the well known face routing for achieving this goal. However, the average path length in number of hops produced by face routing could be much worse than the optimal topological path in most realistic scenarios. In this paper, we propose a new intermediate procedure between the geographic greedy mode and the recovery mode in order to improve routing efficiency in number of hops, without network overhead. It exploits the optimal topological route to base stations, obtained by beacon messages, as a resource to find better routes than the ones created by face routing. We show by simulations that the proposed hybrid approach leads to a significant improvement of routing performance when applied to combined greedy-face routing algorithms.

Control network for modern street lighting systems

This paper proposes a control network for a LED street lighting system. The use of LEDs is being considered a promising solution to modern street lighting systems, due to their longer lifetime, higher luminous efficiency and higher CRI. The proposed control network enables disconnection of the street lighting system from the mains during peak load time, reducing its impact in the distributed power system automatically at overload conditions. It also allows to reduce the power consumption, decrease the management cost and monitor the status information of each street lighting unit. In order to meet the system requirements, a wireless sensor network based on IEEE 802.15.4™ standard is employed. Its network layer is implemented using geographic routing strategy, which provides low overhead and high scalability features. However, due to well known drawbacks of the existing techniques, a novel routing algorithm is proposed. Simulations show that this algorithm leads to a significant improvement of routing performance when applied to sparse large scale scenarios, which is the case of a street lighting system. Field tests have been performed on IEEE 802.15.4-compliant wireless control units. The obtained experimental results show that the proposed control network is able to meet the requirements of a LED street lighting system.

Game theoretic channel assignment for wireless sensor networks with geographic routing

Multi-channel wireless sensor networks exploit the capability of sensor nodes to tune its radio over different channels to communicate. The main goal of multi-channel communication is to achieve improved throughput, delivery ratio and cause/suffer less interference in the network. However, optimally assigning channels has been shown to be a hard problem. Thus, recently game theory has been used to design a protocol, termed GBCA (Game-Based Channel Allocation), that is able to exploit topology and routing information (TIRI) for assigning sub-optimally the channels to the nodes in a distributed way. However, GBCA only works with static routing. On the other hand, geographic routing, which is a popular well-studied routing technique in wireless sensor networks, is a dynamic routing algorithm. It uses the positions of nodes to find on demand the next hop for the packet. Therefore, GBCA can not be readily applied in networks that employ geographic routing. To address this issue, we propose a modification to GBCA, which we termed GBCA-G, that is suitable for wireless sensor networks that make use of geographic routing algorithms.

A geographic routing approach for IPv6 in large-scale low-power and lossy networks

Display Omitted We combine RPL and GOAFR protocols for IPv6-enabled large-scale wireless networks.Main drawbacks of the RPL protocol for P2P communication are discussed.A routing protocol (GeoRank) is proposed and its scalability is compared to RPL.Simulations were performed on networks extracted from real street maps.GeoRank is adaptive to variable link densities found in large-scale networks. In this paper, we propose GeoRank, a geographic routing approach for the IPv6-enabled large-scale low-power and lossy networks. We discuss the main drawbacks of the RPL (IPv6 Routing Protocol for Low-Power and Lossy Networks) for P2P (point-to-point) communication in large-scale 6LoWPAN networks. Then, we address such drawbacks by proposing a routing protocol, named GeoRank, which integrates RPL protocol with the position-based routing protocol GOAFR (Greedy Other Adaptive Face Routing). The results obtained with simulations show that GeoRank finds shorter routes than RPL in high link density conditions and than GOAFR in low link density conditions. Thus, GeoRank shows to be adaptive to variable link densities found in large-scale networks. Further, GeoRank avoids the use of DAO (Destination Advertisement Object) control messages required in RPL, while being more scalable in terms of memory usage than storing-mode RPL.

Corrections to “LED Driver Based on Input Current Shaper Without Electrolytic Capacitor”

In the above titled paper (DOI: 10.1109/TIE.2017.2652365), Figure 16 is incorrectly inserted two times, one in Figure 15 and another in Figure 16. The correct Figure 15 is the one uploaded in this letter.

A novel approach for home appliances identification using Vector Projection Length and Stockwell Transform

Identification of residential electrical appliances has been a highlight area of research in recent years due to increasing energy consumption in the residential sector around the world. This paper addressed a novel method for recognition of electrical appliances. Thus, it is proposed to apply the Stockwell Transform, a time-frequency domain transform, into current data collected from 17 commonly present electrical appliances in our houses. With these data, we applied an image pattern recognition technique, called Vector Projection Length. In this case, the idea is to recognize patterns in the appliances transformed into time-frequency domain. An extensive analysis technique simulation is presented here, showing the variation of the technical parameters and their influence on the results of identification.

Impact of lower layers for the development of routing protocols for large-scale wireless sensor networks

This paper presents an analysis of relevant aspects of the physical and media access control protocol layers for large scale wireless sensor networks compliant with the IEEE 802.15.4 standard. Based on this analysis we propose methodologies to be adopted for the development of routing protocols in these scenarios. It is verified through simulations that the proposed methods improve the performance of well known packet forwarding techniques, such as geographic and hierarchical routing protocols.

The Dispatch Problems in Power Distribution Systems

Planning the dispatch of distribution systems involves a variety of decision-making problems relating to the service crews and several equipment operations. These problems include the maintenance and repair of a service, through the routing, scheduling and assignment of vehicles and service orders. Also, in addition to the traditional offline dispatch, several technological advances have led to a renewed interest in online dispatch problems. This increases the opportunities for more optimized dispatch, but also raises the complexity of the problem. With a glance toward the power grid, the electric power distribution systems are being hugely transformed toward smart power distribution systems, integrating old and new energy players. In these systems, new energy transactions will become possible, bringing challenging problems to the system operators, in order to balance supply-demand-storage with the coordination among several players, such as smart controllable loads, distributed storage systems, intermittent power generators, reconfigurable networks, communication networks, and so on. Clearly, facing those problems will require a solid mathematical foundation for the understanding and solving of the problems at hand. Therefore, in this chapter, our goal is to introduce the reader to the study of an interesting problem that one could expect to face in the operation of a smart distribution system: the dispatch problem. To this end, along this chapter, we analyze the anatomy of the dispatch problem and study two instances which may be faced in the operation of the power distribution systems: (1) the economic dispatch problem, which deals with the (economic) dispatching of power generators and (2) the service dispatch problem, which deals with the dispatching of working personnel for attending customer, maintenance and emergency orders in the distribution system.