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.
Wireless Sensor Networks (WSNs) operate in hostile environments under resource-constrained conditions. Power conservation is a primary factor that drives the design of these networks. Therefore, WSNs should not utilize complex algorithms that are power-hungry. The IEEE 802.15.4 standard is the appropriate suite of specifications that conforms to the distinguished characteristics of WSNs. This standard...
Aiming at addressing disaster recovery issues in current Soft switch network, this paper proposed a novel method using P2P technologies, referred to as Remote Backup and Recovery based on Segmentation strategy (RBRS), which puts forwards a method of data segmentation and recovery dividing the backup data into equal parts and order stored in the extra-area. With the advent of a failure in a node, data...
In this work, we study the problems of finding the path of maximum survivability between two end nodes. Multiple network devices and connections may fail simultaneously due to either deliberate attacks or components failures. The problem is NP-hard and we propose a novel algorithm to find the optimal paths with semi-polynomial running time and prove its correctness.
The goal of our research is to improve data availability in large-scale wireless networks in a disaster scenario, where spatially correlated group of nodes may fail. In this paper, we analytically evaluate the efficacy of existing replication schemes from structured overlay networks under relaxed system constraints. The analysis shows that these schemes do not guarantee data survivability under the...
As a research challenge we have sought to create and solve p-cycle network design problems involving 200 or more nodes. At such problems sizes, the space of all simple cycle structures on the network graph cannot even be known in practice, let alone put into a conventional ILP problem instance. The approach being taken is a combination of GA methods with ILP; GA is guided by a subsidiary ILP surrogate...
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.