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 applies the theory of Evolutionary Game to QoS routing algorithm for wireless mesh networks which can not only improve the performance of traditional QoS routing protocols but also be able to reduce the cost of the routing algorithm.
In this paper, we study an extension of atomic routing games for multi-class communication networks with quality of service requirements, which can be formulated as a network management scheme. Atomic routing games are non-cooperative games with multiple selfish players, where each player has to choose a path in a given graph to route his traffic, and then pays the corresponding cost. We develop a...
In this paper, we consider the inefficiency of distributed routing in a network of parallel links with class-based traffic. Network link behavior is modeled by the M/M/1-GPS queue (i.e. when links use General Processor Sharing(GPS) scheduling scheme to serve packets). Each traffic type is guaranteed a minimum capacity rate on each link using GPS scheduling. We show under specific demand conditions...
To ensure resilient and reliable meter data collection that is essential for the smart grid operation, we propose a QoS-oriented wireless routing scheme. Specifically tailored for the heterogeneity of the meter data traffic in the smart grid, we first design a novel utility function that not only jointly accounts for system throughput and transmission latency, but also allows for flexible tradeoff...
Achieving high Quality of Service (QoS) over wireless multihop networks calls for enhanced routing/scheduling algorithms. Towards this direction it has been shown in the literature that the Greedy Backpressure algorithm which combines routing based on greedy hyperbolic embedding with backpressure scheduling, achieves to improve delay while remains throughput optimal. However, the performance of such...
Wireless multimedia sensor networks (WMSNs) models emphasize QoS guarantee. We provide QoS guarantee to measure the qualitative performance of QoS routing model, such as bandwidth, delay and delay jitter. A path that satisfies with the QoS is found by the Directed Diffusion (DD) algorithm in this paper, and an incomplete information game routing model is presented under this condition. We show that...
Wireless multimedia sensor networks are often used to transfer large amount of data such as audio, video and image, and to process complicated tasks. In recent years, the interest in WMSNs are growing dramatically. An algorithm of multicast routing based on genetic algorithm(GA) is presented in this paper. This algorithm provides multiple QoS guarantee, such as bandwidth, delay and delay jitter. The...
In this paper, the optimized routing or relay selection is discussed for the Cooperative Communication wireless networks. The whole network system performance or Quality of Service (QoS) can not be achieved without the optimal selection of the relay nodes. For this paper, the network performance is analyzed for m number of relays for n number of source nodes. The simulation results are measured by...
To weaken the selfish behavior of nodes in mobile ad hoc networks, many payment-based incentive schemes have been proposed recently, yet it is still far from achieving the expected efficiency to encourage node cooperation. In these schemes, source node selects a Least Cost Routing (LCP) for data transmission according to the forwarding cost reported by intermediate nodes and rewards them with some...
We consider a geographic area covered by two wireless networks. Assuming delay-sensitive users, we study the loss of efficiency of the user equilibrium (the Price of Anarchy) in terms of total delay, with M/M/l delay functions on each network. The user equilibrium is proved to be less efficient when the network is very heterogeneous, i.e. the two networks have different capacities. In order to elicit...
The dynamic nature of mobile ad hoc networks (MANETs) is attributed to several inherent characteristics, such as variable link behavior, node movements and changing network topology. Providing quality of service (QoS) in such a dynamic environment is very difficult. QoS-aware routing is one of the QoS support that provides QoS at the network layer. In the presence of high mobility, this QoS solution...
Incentive models are becoming increasingly popular in mobile peer to peer networks (M-P2P) as these models entice node participation in return for a virtual currency to combat free riding and to effectively manage constraint resources in the network. Many routing protocols proposed are based on best effort data traffic policy, such as the shortest route selection (hop minimization). Using virtual...
The QoS routing problem of wireless multimedia sensor networks has great challenging. A notion using routing game and ant colony algorithm to solve this problem is proposed in this paper. A mixed strategy routing game model is proposed too, and proves the routing game has Nash equilibrium. In the routing game, we used the probabilities which are calculated on the basis of the pheromone trails left...
The multi-constrained QoS-based routing problem of wireless multimedia sensor networks is an NP hard problem. Genetic algorithms (GAs) have been used to handle these NP hard problems in wireless networks. Because the crossover probability is a key factor of GAs' action and performance, and affects the convergence of GAs, and the selection of crossover probability is very difficult, so we propose a...
This article proposes a new architecture for distributed data management and update massage exchange in massively multi-user virtual environments. The key points in the design of such environments are scalability and QoS-aware message delivery. Therefore it requires robust distributed algorithms in a dynamic peer-to-peer system with frequent node arrivals and departures. Our proposed approach is mainly...
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.