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.
The growing popularity of Peer-to-Peer (P2P) technology in real applications in recent years has sparked increasing interest from both academia and industry in designing resilient P2P networks for these applications. Routing is a crucial technique to support successful P2P applications, and designing robust routing mechanisms is still a technical challenge for P2P systems and applications due to their...
The association policy in current IEEE 802.11 networks usually considers Received Signal Strength Indication (RSSI) to be the only metric to capture access link quality. However, when a Mesh Client (MC) in IEEE 802.11-based Wireless Mesh Network (WMN) needs to be associated with the most appropriate Mesh Access Point (MAP), the quality of both the access link and the routing path in mesh backhaul...
Online social networks (OSN) are developing rapidly. Most prior OSN researches have been focused on network application layer. However, the social relationships and topology characteristics of OSN can be utilized to enhance the function, performance and security of network protocols in every layer. This paper presents the concept of social-aware plane and designs a novel model (EPSP) to enhance network...
The tremendous growth of research in Peer-to-Peer (P2P) systems in recent years has initiated rising interests on how to design resilient networks for these systems. In this paper, we propose a novel query routing mechanism for improving query performance and a mobile agent based dynamic network reconfiguration mechanism for providing combined node and link failure diagnosis and restoration in unstructured...
Providing Internet access on buses allow people to read news, check emails, watch sport games, and hence can greatly improve the quality of people's life. This paper proposes an adaptive routing protocol, called R-BUS for a bus network. R-BUS selects a route based on the link's lifetime and its communication signal quality. The protocol takes the bus mobility and the radio propagation model into account...
The tremendous growth of public interest in peer-to-peer (P2P) networks in recent years has initiated a lot of research work on how to design efficient overlay structures for P2P systems. Structured overlay networks that based on various distributed hash tables (DHTs) provide no control over where data is stored and cannot support range queries directly. Ordered overlays such as skip graphs and SkipNet...
Distributed wireless sensor networks will play an important role in the future. In wireless sensor networks, observers are interested in spatio-temporal information monitored by sensors. It is crucial to design and employ energy-efficient query processing since nodes are battery-powered, and thus their lifetimes are limited. This paper proposed a query source sharing approach to optimizing query processing...
Alert fusion is a key problem in distributed intrusion detection system (DIDS). The paper proposes a distributed intrusion alert fusion scheme based on multiple keywords and routing infrastructure: distributed hash table (DHT). All the related alerts produced by local sensor can be routed and fused to their corresponding peers by multiple keywords, while evenly distributing unrelated alerts to different...
Global routing is an important and time-consuming step in the VLSI design cycle. The interconnection pattern for each set of pins (net) that must be connected is a Steiner tree, and the primary sub-problem in global routing is to find a pool of dissimilar, low-cost Steiner trees. In this paper, we propose a fast algorithm, called stochastic Shrubbery (SS), for constructing a diverse pool of Steiner...
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.