The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
With the increasing penetration of renewable energy sources in the modern electric grid, it becomes more technically difficult and costly for system operators to balance generation and demand as traditional providers of flexibility (i.e., flexible generation) become uneconomic. Therefore new sources of flexibility are needed to maintain reliable operation. Flexible demand, including from electric...
This paper presents a new approach of clusteringmechanism in the wireless sensor networks. In our proposedapproach the selection of the cluster head is based on multiplecriteria by combining varieties of performance metrics. Therefore, the main aim of this paper is to enhance the election of themost performed node in order to be a cluster head. The proposedmechanism is evaluated by Matlab and was...
Improvements to sensor devices including micro-electro mechanical devices that are used for information collection and dissemination has led to the introduction of Wireless Sensor Networks (WSN). Sensor nodes in a WSN are deployed over an area to collect data from the surroundings and to perform additional actions including data aggregation and storage, computations and data transmission to gateway...
Fountain codes are a type of erasure codes which are characterized by their global acknowledgement and used as a solution to reduce the use of feedback channel as well as the number of transmissions and then minimize the energy consumption. With the multi-hop transmission, fountain codes raise the problem of overflow leading to a waste of energy, the most critical issue and the big challenge in the...
Cooperative localization has become a promising solution for location-enabled technologies in Wireless Sensor Networks (WSNs). However, it suffers from great energy consumption problem due to the energy-constrained characteristic of the networks. To alleviate this problem, we propose a cluster nodes selection strategy based on the Cramer-Rao lower bound (CRLB) for the cooperative localization algorithm...
In this paper we examine how to efficiently build a brokers overlay to implement publish/subscribe in a wireless sensor network, trying to reduce sensor nodes energy consumption, memory required for buffering packets and delivery time. We evaluate, on the connectivity graph that represents the network, the performance of various criteria that can be used to select brokers among the set of nodes. We...
How to measure and maintain connectivity is an important issue in ad hoc networks. A special case of such network is Wireless Sensor Networks (WSN), which are often deployed in harsh environments and also susceptible to a number of problems that may negatively affect the connectivity among the nodes. An additional factor that increases the cost of connectivity maintenance in ad hoc networks is when...
Recent experimental studies have revealed that a large percentage of wireless links are lossy and unreliable for data delivery in wireless sensor networks (WSNs). Such findings raise new challenges for the design of clustering algorithms in WSNs in terms of data reliability and energy efficiency. In this paper, we propose distributed clustering algorithms for WSNs by taking into account of the lossy...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.