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.
Energy minimization is of great importance in wireless sensor networks in extending the battery lifetime. One of the key activities of nodes in a WSN is communication and the routing of their data to a centralized base-station or sink. Routing using the shortest path to the sink is not the best solution since it will cause nodes along this path to fail prematurely. We propose a cross-layer energy...
This paper focuses on data replication in structured peer-to-peer systems over highly dynamic networks. A Q-learning-based replication approach is proposed. Data availability is periodically computed using the Q-learning function. The reward/penalty property of this function attenuates the impact of the network dynamism on the replication overhead. Hence, the departure of a node does not necessarily...
Routing protocols for wireless mesh networks (WMN) are traditionally focused on finding paths with the minimum hop count. In WMN the main goal is to achieve as the best possible quality and efficiency of data transmission between source and destination nodes as possible. To achieve such transmission, different parameters (power consumption, packet loss, delay, etc.) influencing data transmission need...
Bamboo is one structured P2P overlay, that likes others (e.g. Chord, Kademlia, Pastry), organizes peers into a flat overlay network and offers distributed hash table (DHT) functionality. It is very promising for its efficient routing performance. However, one disadvantage impeding the DHT algorithm popularity is the routing information maintenance overhead; it generates considerable network traffic...
In wireless sensor networks, the data-centric sensing task focuses more on the data reliability. In this paper, a reliable clustering algorithm RCVC (reliable clustering using virtual cluster-head) is proposed. It provides multipath for nodes in the network by using a set of redundant cluster-heads which are marked with a unique virtual identification. When the active cluster-heads fail, according...
In this paper, a new routing protocol, called traffic-aware and low-overhead routing protocol (TALORP) is proposed. The TALORP protocol, which is an enhancements of the low-overhead routing protocol (LORP), uses backup routes to mitigate the flooding problem that is frequently used to repair link failures. It also takes into account the traffic flows on different paths toward the destination in order...
In this paper a BISR architecture for embedded memories is presented. The proposed scheme utilises a multiple bank cache-like memory for repairs. Statistical analysis is used for minimisation of the total resources required to achieve a very high fault coverage. Simulation results show that the proposed BISR scheme is characterised by high efficiency and low area overhead, even for high defect densities...
Networks on chips (NoCs) provide a mechanism for handling complex communications in the next generation of integrated circuits. At the same time, lower yield in nano-technology, makes self repair communication channels a necessity in design of digital systems. This paper proposes a reliable NoC architecture based on specific application mapped onto an NoC. This architecture is capable of recovering...
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.