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.
Knowledge of topology in wireless sensor networks is significant for network management and maintenance. In this paper, a conditional probability of data loss theorem is proposed for wireless sensor networks based on the data aggregation paradigm.al probability of data loss theorem. It reveals the relationship between conditional probabilities of sensor data loss given different conditions. Based...
The development of peer to peer overlay networks applications has attracted an immense interest from the research community in recent years. Several challenging issues have to be resolved in order to provide accessible, efficient and scalable inter-peer communication. Achieving resilience so as to reduce the disconnection probability, is among the most demanding issues to provide a robust and omnipresent...
In recent years, there are substantial demands to reduce packet loss in the Internet. Among the schemes proposed, finding backup paths in advance is considered to be an effective method to reduce the reaction time. Very commonly, a backup path is chosen to be a most disjoint path from the primary path, or in the network level, backup paths are computed for all links (e.g., IPRFF). The validity of...
We study the use of orthogonal codes as alternative to Bloom filters in content-based routing. In particular we explore the trade-off between centralized solutions using regular orthogonal codes and generating codes locally by hashing. We demonstrate that introduction of subpart orthogonal codes allows distributed operation while leading to shorter key lengths than Bloom filters with the same probability...
The topology of the Internet has been extensively studied in recent years, driving a need for increasingly complex measurement infrastructures. These measurements have produced detailed topologies with steadily increasing temporal resolution, but concerns exist about the ability of active measurement to measure the true Internet topology. Difficulties in ensuring the accuracy of every individual measurement...
We study secondary spectrum sharing in narrowband cellular networks in which calls in neighboring cells need to be assigned different channels. Analysis of such networks are in general difficult due to large state spaces and lack of closed form expressions. Here we consider linear topologies and show that they lend themselves to exact analysis. We analyze four sharing policies where equilibrium distribution...
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.