Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
When shortest path routing is employed in large scale multi-hop wireless networks, nodes located near the center of the network have to perform disproportionate amount of relaying for others. To solve the problem, various divergent routing schemes are used which route the data on center-avoiding divergent routing paths. Though they achieve better load balancing, overall relaying is increased significantly...
Cognitive radio (CR) emerges as a key technology to enhance spectrum efficiency and thus creates opportunistic transmissions over links. Supporting the routing function on top of numerous opportunistic links is a must to route packets in a general cognitive radio network (CRN) consisting of multi-radio systems. However, there lacks complete understanding of these highly dynamic available links and...
The selection of routes is an important issue in wireless networks when network coding is used. Existing research formulate network-coding-aware routing as a linear optimization program. However, deploying such method in real wireless networks is impractical. To solve this issue, in this paper, a practical network-coding aware routing protocol is proposed for unicast sessions in wireless networks...
Intermittently Connected Wireless Networks (ICWN) or Delay/Disruption Tolerant Networks (DTN), have attracted attention from researchers because of their inherent characteristics, including long latency, low data rate, and intermittent connectivity. Extensive research has been conducted on ICWN, including the architecture, and routing. However, few researchers have investigated the performance of...
In this paper, we study the problem of transmission power control and its effects on the link-scheduling performance when a set of end-to-end flows established in the network are given. This problem is approached by means of the stability region of the link-scheduling policy. The stability region is defined for link-scheduling policies as the set of input-packet rates under which the queues in the...
Employing channel state information at the network layer, an effective routing metric is obtained that minimizes the end-to-end outage probability in amplify-and-forward multihop wireless networks. A disadvantage of the routing metric obtained is that it cannot be optimized in distributed manner, i.e., it does not converge onto optimal routes. The disadvantage cannot be remedied by exhaustive search...
In recent years, along with the increasing popularity of multi-hop wireless networks, there has been a growing demand in the coupling of these networks to external ones such as the Internet. As traffic destined for external networks increases, special attention is required not only in gateway selection, but also in optimized routing and scheduling in order to maximize the network performance. In this...
Opportunistic Routing (OR) has recently been proposed to improve the efficiency of unicast in multi-hop wireless networks. OR exploits the broadcast nature of wireless transmission medium and opportunistically selects a relay path to deliver a packet to its receiver. To adopt OR in wireless multicast, the main challenge is to efficiently share opportunistic relay paths between multiple receivers....
In multihop wireless networks, end-to-end throughput is often hard to predict and is even harder to optimize due to the effect of interference. To date there is no precise result other than asymptotic bounds for this question: if there is no routing information given, what is the maximum throughput of a network using uncoordinated transmission such as IEEE 802.11 MAC? This paper attempts to address...
We propose a new cross-layer approach to mitigate interference in multihop networks. Precisely, we cancel all adjacent node interference in a multihop path by MIMO two-way relay scheme and jointly optimize the routing and power allocation to mitigate the interference from far nodes. We model and efficiently solve this optimization problem using a geometric programming framework. Our simulation results...
As the wireless network scales up in size and complexity, the need to study the scalability and behaviors of these networks and their protocols becomes essential. Opportunistic routing utilizes broadcast nature of wireless network, and significantly increases the unicast throughput. However, all of the current opportunistic routing protocols have to rely on the whole topology information. This indeed...
A hierarchical routing concept with key enabling mechanisms: hierarchical neighbor and route discovery, network optimization and service discovery, are provided and evaluated in this paper. The hierarchical routing concept is novel in the sense that both physical neighbors and logical neighbors are discovered to optimize the route and service discovery process as well as enable optimization of the...
Mapping and dynamic routing in a wireless network are essential and basic operations that are the prerequisites for all higher order interactions between nodes on that network. The Intent of network mapping by multi mobile software agents is to obtain the topology of network in a distributed manner. In this paper we examine how software agents can wander in an unknown Ad hoc network with cooperation...
We consider the energy-efficient network resource allocation that minimizes a cost function of average user powers for multi-hop wireless networks. A class of fair cost functions is derived to balance the tradeoff between efficiency and fairness in energy-efficient designs. Based on such cost functions, optimal routing, scheduling and power control schemes are developed. Relying on stochastic optimization...
In order to improve transmission throughput of a multi-hop wireless network, many efforts have been made in recent years to reduce traffic and hence transmission collisions by constructing backbone networks with minimum size. However, many other important issues need to be considered. Instead of simply minimizing the number of backbone nodes or supporting some isolated network features, in this work,...
Network coding is known as a promising approach to improve wireless network throughput. However, it is only applicable when different flows are routed through a certain coding structure. One of the fundamental issues is to accurately identify the coding structures and optimally utilize the coding nodes. In this paper, we formally establish general coding conditions to identify multiple coding nodes...
Traffic overloading failures are infectious due to the correlations in their occurrence. When a node fails at excessive load, the re-routed traffic may fail other nodes in the network. We present in this paper a mathematical characterization of the resilience of large wireless networks to the traffic overloading failures. We show that as the number of failed nodes increases, the network transits from...
Fairness and system throughput, influenced by wireless interference, are major objectives of resource allocation in wireless networks. Whereas traditionally max-min fairness protocols have been developed for wired networks (where interference is not a factor for network performance), in this paper we investigate the problem of flow routing and fair bandwidth allocation under the constraints of the...
When designing distributed wireless networks utilizing shared bandwidth, a critical issue is allocating spatial and temporal resources to streaming information flows. We focus on large networks of half-duplex terminals sharing common bandwidth, and study methods for allocating resources on a fine-grained temporal basis, with specific emphasis on managing the interactions between streams of packets...
In this paper, a routing algorithm for Wireless Mesh Networks (WMNs) over Ultra Wide Band (UWB) is proposed for High Definition (HD) video transmission. In order to support multiple services smoothly over UWB, a new routing algorithm called Service Aided UWB Routing is developed. Unlike conventional routing algorithms, the proposed method is driven by application services' requirements, which determines...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.