Joint multi-cost routing and power control in wireless ad hoc networks

Karagiorgas, Nikos; Kokkinos, Panagiotis; Papageorgiou, Christos; Varvarigos, Emmanouel

doi:10.1007/s11276-010-0257-z

Cited by 3 publications

(9 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For this, we define an optimization function ( ). As analyzed in [11], the optimization function may have various forms according to major application demands. In this paper, we use concave metrics, especially an available bandwidth, to define the optimization function.…”

Section: Basic Multi-constrained Routing Modelmentioning

confidence: 99%

An Efficient Local Repair‐Based Multi‐Constrained Routing for Congestion Control in Wireless Mesh Networks

Shin

Lee

2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Multi-constrained routing is a key driver to support quality-of-service (QoS) for real-time multimedia applications in wireless mesh networks (WMNs). Due to the difficulty of applying strict admission control into a public WMN, it is inevitable to accommodate multiple application flows with different QoS requirements exceeding the capacity of a certain link shared by multiple flows. However, existing multi-constrained routing protocols under such an environment find the QoS degradation based on end-to-end path quality probing and trigger flooding-based route discovery from a scratch for resolving the QoS degradation, which incurs a longer recovery time and much routing overhead. In this paper, we propose a novel multi-constrained routing protocol for WMNs that finds problematic links that may affect QoS degradation to end-to-end paths and replaces them with a detour path using a local repair principle. We model congestion threshold estimation for finding problematic links and design algorithms for quickly finding detour paths and selecting an optimal path by minimizing the negative effect on existing flows nearby the detour path. Simulation results show that the proposed routing protocol achieves up to 19.6% more goodput of live video streaming applications with up to 33% reduced routing overhead compared with an existing work.

show abstract

Section: Basic Multi-constrained Routing Modelmentioning

confidence: 99%

An Efficient Local Repair‐Based Multi‐Constrained Routing for Congestion Control in Wireless Mesh Networks

Shin

Lee

2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…(Ephremides, 2002) (Perkins and Bhagwat, 1994) (Perkins and Royer, 1999) presented certain distinguished routing algorithms for wireless ad hoc networks where the metric enhanced are the hop count or end to end delay. (Johnson and Maltz, 1996) used the link quality as the cost metric for routing, (Karagiorgas, et al, 2010) used the ETX as metric which integrates the link loss proportions and the interference between successive links of a network path. (Rodoplu and Meng, 1999) enormously work has been proposed and developed very first on energy aware routing for wireless ad hoc networks and vital role for develop the energy efficient routing.…”

Section: Previous Workmentioning

confidence: 99%

“…The idea of multicost routing was presented in (Papageorgiou et al, 2006) where it was implemented to wire line max-min fair share networks. (Gutierrez, et al, 2000) has investigated multicost routing in wireless ad-hoc networks, In (Karagiorgas et al, 2010) proposes the multicost routing with variable transmission power for enhancing wireless ad hoc network performance.…”

Section: Previous Workmentioning

confidence: 99%

“…In multicost routing, (Karagiorgas et al, 2010) a vector of cost parameters is consigned to each link and the cost vector of a path is well-defined based on the cost vectors of the links that combined it it by applying, component wise and uses a monotonic associative operator ʘ to all the cost vector parameter. Path cost vector is constructed on cost vectors of links on the network are included with the associative operator used for entire cost vector components and by condition applied to them (to maximize or minimize) for choose the optimum path.…”

Section: Multicost Routing Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

Multicost Routing Approach in Wireless Ad hoc Networks

Kamal¹

2012

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement:A Wireless ad hoc network is a collection of autonomous movable nodes that communicate with each other over wireless links without any static infrastructure. In these networks there is no fixed topology because of the mobility of nodes, interference, multipath propagation and path loss. A variety of routing protocols and algorithm with varying network settings are analyzed to link between the nodes and communicate packets to their destinations. Most of these algorithms are single cost, in the logic that they consign a scalar cost parameter to every link and compute the path that has minimum cost. Although multicost routing, a vector of cost parameters is consigned to each link and the cost vector of a path is well-defined based on the cost vectors of the links that embrace it. Adjustable transmission power control of the nodes with multi cost routing algorithm can support optimizeto acquire the reduced interference and improve the ad hoc network performance. Approach: The link and path of the wireless network is consigned with several cost parameters. Hop count, total interference, node link delay, residual energy of a node and the node transmission power are the cost parameters assigned for link and path of the ad hoc networks. Multicost parameters are combined in different optimization function with respect to various routing algorithm. Results: Simulation and optimization shows multicost SUM/MIN Energy-Interference algorithm with variable transmission power can lead to decrease the interference and improves the overall network performance. Conclusion: The function optimized for wireless ad hoc networks that the Multicost SUM/MIN Energy-Interference algorithm achieves improved performance over than the single cost algorithm.

show abstract

“…Joint booking, control and steering calculation for specially appointed remote systems were finished by Li, et al (2007). Joint multi-cost directing and control in remote specially appointed systems was finished by Nikos Karagiorgas, et al (2010). TCP: execution through reproduction and proving ground in multi-bounce versatile specially appointed system Chandra Kant Samal (2010).…”

Section: Introductionmentioning

confidence: 99%