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.
Routing and Wavelength Assignment (RWA) is the most concern in wavelength routed optical networks. This paper proposes a novel dynamic RWA scheme inspired by the idea of binary quadratic programming (BQP) formulation for the static RWA problem. Subsequently, a heuristic algorithm namely QP routing and wavelength assignment (QP-RWA) is proposed. In this method, links wavelength occupancy information...
We study joint routing, scheduling, and physical network coding (PNC) in fixed wireless multihop networks under a physical interference model. The objective is to quantify the throughput gain provided by PNC in wireless mesh networks. We formulate a cross-layer optimization framework to determine the optimal max-min throughput of the flows and the optimal configuration of the routing and scheduling...
We propose a combined length-infix pipelined search (CLIPS) architecture for high-performance IP lookup on FPGA. By performing binary search in prefix length, CLIPS can find the longest prefix match in (log L-c) phases, where L is the IP address length (32 for IPv4) and c>;0 is a small design constant (c=2 in our prototype design). Each CLIPS phase matches one or more input infixes of the same...
In this paper, we present a low-complexity decoder architecture for WiMAX low-density parity-check (LDPC) codes based on a unified task processor. Memory access is accomplished through routing networks with fixed interconnections and memory address generators, which are quite simple due to the quasi-cyclic structure of the LDPC codes. In order to increase the decoding throughput, the check-node and...
The rationale of this work is that the incumbent primary user (PU) of a cognitive radio (CR) system relays its traffic through the secondary user (SU) network for an enhanced throughput. In return, it rewards the SUs with an incentive time during which they can use the complete licensed bandwidth to transmit their own data, without the need for spectrum sensing. With the objective of maximizing the...
Applying data-centric and cognitive techniques in the space communications infrastructure promises, by managing and even exploiting complexity, to enhance performance and operational efficiency and to enable future science and exploration operational concepts that require flexible and adaptive communications and networking not currently available.1 2 The paper presents a novel approach to decomposing...
In mobile ad hoc networks, the status of the network changes over time due to the movement of terminals, the battery level of terminals, and so on. To construct assurance networks, it is necessary to consider requirements such as dependability, security, and adaptability against changes in the network. We had proposed a routing method, which is referred to as RSR (Route-Split Routing) for mobile ad...
TCP does not perform well in networks with stochastic channels, with links that randomly drop packets or have long outages. Diversity routing has been proposed to improve TCP's performance in these networks. In diversity routing, a sublayer between TCP and the network replicates each transmitted packet and sends the multiple copies along parallel paths. As long as at least one of the copies reaches...
Network Coding is a new field that aims at, notably increasing the throughput in a network. ROCX [1] is an algorithm that makes routing with the awareness of network coding. However, its major limitation is that it does not take into account the bandwidth limitation and the interference impact. If the interference is not considered in a wireless network, a flow requiring a certain bandwidth might...
Traditional multicast routing algorithms such as shortest path tree (SPT) and Steiner tree (MST) do not consider the wireless broadcast advantage or the underlying channel assignments in a multi-channel multi-radio (MCMR) wireless mesh network (WMN). We propose multicast routing algorithms that take into account the above factors in order to minimize the amount of network bandwidth consumed by a routing...
Due to the significant growth of link speeds, amount of data that should be stored on router line cards are rapidly increasing. Therefore, a large number of memory modules are required for packet storage. In addition, a high performance interconnection network on line cards is strongly needed for inter-communication between processing elements and memory modules. In this paper we propose a new interconnection...
In multihop networks such as mobile ad hoc networks selfish or misbehaving nodes can degrade network performance. Reputation based models have been developed to enforce cooperation and to discourage node misbehaviour. These schemes detect and isolate selfish nodes and maintain network throughput by enabling nodes to construct paths that only include good nodes. In order to punish selfish nodes and...
The operation of Ad-hoc networks depends on the cooperation among nodes to provide connectivity and communication routes. However, such an ideal situation may not always be achievable in practice. Some nodes may behave maliciously, resulting in degradation of the performance of the network or even disruption of its operation altogether. To mitigate the effect of such nodes and to achieve higher levels...
Many dynamic metrics for wireless mesh networks (WMNs) to improve communication quality are proposed so far. However, all of them have possibility to create temporary routing loops which may cause severe congestion and disruption of communications. In order that WMNs are regarded as a reliable infrastructure of the next generation, such routing loops are strongly desired to be liminated since they...
Endowing mesh routers with multiple radios is a recent solution to improve the performance of wireless mesh networks. The approaches proposed in the literature to solve the problem how to assign channels to radio have mainly focused so far on reducing interference or maximizing the throughput. To the best of our knowledge, none of such approaches attempted to save network resources for the purpose...
Adhoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of existing network infrastructure or centralized administration. Each node acts as a router by itself and forwards all the packets which it receives. There is a frequent link failure in adhoc Networks, which causes packet to be lost or packets doubt to reach destination. In this scenario...
Vehicular Networks are more and more considerable recently. With the rapid advance of information technology, it becomes easy to support low cost inter-vehicle communication. In particular, the demand for delay sensitive applications, such as streaming media distribution, is increasing. However, due to the high mobility, links between roadside units and wireless nodes are intermittent, unreliable...
Multipath routing has been a promising solution to improving reliability and system throughput for wireless mesh networks. However, existing schemes designed for system throughput improvement suffer the route-coupling problem (i.e., the determined multiple paths originating from the same source node typically stay very close to the shortest path to the gateway) so that the improvement ratio may not...
Opportunistic routing is a well-known technique that exploits the broadcast nature of wireless transmissions and path diversity to form the route in an adaptive manner based on current channel conditions. This paper studies the throughput advantages of opportunistic routing over conventional multihop routing for linear multihop wireless networks with type-I Hybrid Automatic Repeat reQuest (HARQ) and...
Traditional multicast routing algorithms such as shortest path tree (SPT) and minimum Steiner tree (MST) do not consider the wireless broadcast advantage or the underlying channel assignments in a multi-channel multi-radio (MCMR) wireless mesh network (WMN). We propose a multicast routing algorithm for MCMR WMNs that takes into account the above factors in order to minimize the amount of network bandwidth...
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.