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.
This paper proposes a geographic location-based distributed routing (GDR) system. GDR system is a structured distributed information lookup and routing (SDILR) system that provides information lookup, based on the geographic latitude and longitude coordinates, where each node is given the coordinates as an identifier (ID) and manages an overlay routing table. We generate an ID to reflect the geographical...
The tree representation of the MIMO detection problem is illuminating for the development, interpretation, and classification of various detection methods. One method, based on the Dijkstra's search algorithm, pursues tree exploration according to a bounded, sorted list of tree nodes. Since sorting directly affects tree exploration and truncation in this tree-search method, it is critical to the performance...
The Border Gateway Protocol (BGP) is the de facto interdomain routing protocol on the Internet which controls the packet forwarding behavior on the data plane. It has significant impact on the well-being of the global Internet. Over the past ten years, there has been a large body of studies conducted on evaluating and improving the BGP performance. These studies develop tools using BGP data for identifying...
Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In this paper, we study the problem of finding an anypath subject to multiple (K) constraints, which has been proved to be NP-hard. We present a polynomial distributed K-approximation routing algorithm. Our algorithm...
The problem of joint routing and power allocation optimization is addressed for decode-and-forward (DF) and amplify-and-forward (AF) multihop TDMA wireless networks. A distributed solution is proposed for power-optimized routing with desired end-to-end capacity constraint based on the local instantaneous channel state information measurement at the nodes of the network. The proposed distributed routing...
In this paper we study the connection availability of wireless networks from the perspective of end users with individual mobility, in contrast to existing studies mainly focusing on network-centric connectivity. Specifically, we evaluate the user connectivity by two metrics: neighbor connection time and neighbor isolation time. The former is the time for a node being connected with at least one neighbor;...
We present a link capacity estimation model and a hybrid routing scheme for wireless mesh networks which aims at improving throughput. The multi-source interference between links and frame capture behaviors of nodes are analyzed. Our model provides estimated values which can indicate the relative quality of wireless links. And we present a routing metric which combines multiple factors based on the...
Network security assessment is critical to the survivability and reliability of distributed systems. In this paper, we propose a novel assessment approach that supports automatic vulnerability assessment utilizing Bayesian attack graphs. We also integrate several major vulnerability database into a comprehensive database and build a customized vulnerability scanner to assist attack graph generation...
In this paper, we propose a security mechanisms for the Hybrid-Wireless-Mesh Protocol (HWMP). Our mechanisms is based on the Identity Based Crytography. The motivation behind using IBC is that it eliminates the need to verify the authenticity of public keys. We have implemented the IBC technique to secure control message in HWMP, namely RREQ and RREP. In these Control messages, we interested only...
Due to integrated high-speed networks accommodating various types of services and applications, the quality of service (QoS) requirements for those networks have also become diverse. The network resources are shared by the individual service traffic in the integrated network. Thus, the QoS of all the services may be degraded indiscriminately when the network becomes congested due to a sudden increase...
Most existing reputation systems designed to cope with selfish MANET nodes rely on heuristics and are studied via simulation, with a focus on the consistency of obtained reputation metrics and their effect on network performance given specific corrective actions. We present a novel data-centric reputation system and an analytic evaluation framework where the notion of effectiveness is internal to...
Many researchers have recently dealt with P2P traffic classification, mainly because P2P applications are continuously growing in number as well as in traffic volume. Additionally, in response to the shift of the operational community from packet-level to flow-level monitoring, witnessed by the widespread use of NetFlow, a number of behavioral classifiers have been proposed. These techniques, usually...
In this paper, we address a virtual network embedding problem. Indeed, our objective is to map virtual networks in the substrate network with minimum physical resources while satisfying its required QoS in terms of bandwidth, power processing and memory. In doing so, we minimize the reject rate of requests and maximize returns for the substrate network provider. Since the problem is NP-hard and to...
In this paper we address the problem of shared backup path protection (SBPP) against random failures of single links in connection-oriented communication networks. Most of recent works has been concentrated on protecting the unicast traffic. Our paper is also focused on shared protection of anycast (i.e. one-to-one-out-of-many) flows. Anycasting is frequently met in practice (e.g. in Content Delivery...
Connectivity k(G) of a network G is traditionally considered to be the primary metric for evaluation of its fault tolerance capability. However, connectivity as a metric has several limitations - e.g., it has no mechanism to distinguish between localized and random faults. Also it does not provide any information about the network state, if number of failures exceed k(G). The network state information...
Most of the routing and replication algorithms for Mobile Peer to Peer (M-P2P) networks assume the network to be large and therefore, the architecture and algorithms are designed to be scalable. These algorithms however may not perform well with limited number of nodes in a network such as of UAVs. Thus, it is better to design algorithms to increase the efficiency of a small network if scalability...
Despite the significative differences between ad hoc networks and Infrastructure Wireless Mesh Networks (iWMNs), the routing schemes designed specifically for the formers have been considered as a potential solution for the routing dilemma in the latter; however, the performance and effects of such approach have not been deeply studied. In this paper we extend some features of popular reactive (AODV)...
In areas where Internet access is only sporadically available, or not available at all, delivering content (text, image, video, audio, application, etc.) to the people is not easy. In this paper, we introduce a novel method to spread content in such areas in a mobile peer-to-peer way. First we describe the architecture of the system along with the proposed communication protocol among the nodes. Then...
Opportunistic networks use human mobility and consequent wireless contacts between mobile devices, to disseminate data in a peer-to-peer manner. To grasp the potential and limitations of such networks, as well as to design appropriate algorithms and protocols, it is key to understand the statistics of contacts. To date, contact analysis has mainly focused on statistics such as inter-contact and contact...
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.