Congestion, Dilation, and Energy in Radio Networks

Heide, Friedhelm Meyer auf der; Schindelhauer, Christian; Volbert, Klaus; Grünewald, Matthias

doi:10.1007/s00224-004-1124-z

Cited by 37 publications

(36 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A notable exception to this is [16] defining an explicit notion of interference. Based on this interference model between edges, a time-step routing model and a concept of congestion is introduced.…”

Section: Interferencementioning

confidence: 99%

“…The interference model proposed in [16] is based on current network traffic. The amount and nature of network traffic however is highly dependent on the chosen application.…”

Section: Interferencementioning

confidence: 99%

“…Figure 4, proposed in [16]), whose large interference is caused as a consequence to the requirement that the resulting topology is to be connected. Every node ui (except for the leftmost) is required to have an incident edge to the left, which covers all nodes left of ui.…”

Section: Interference In Known Topolo-giesmentioning

confidence: 99%

See 2 more Smart Citations

Does topology control reduce interference?

Burkhart

Rickenbach

Wattenhofer

et al. 2004

Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing

356

270

View full text Add to dashboard Cite

Topology control in ad-hoc networks tries to lower node energy consumption by reducing transmission power and by confining interference, collisions and consequently retransmissions. Commonly low interference is claimed to be a consequence to sparseness of the resulting topology. In this paper we disprove this implication. In contrast to most of the related work-claiming to solve the interference issue by graph sparseness without providing clear argumentation or proofs-, we provide a concise and intuitive definition of interference. Based on this definition we show that most currently proposed topology control algorithms do not effectively constrain interference. Furthermore we propose connectivity-preserving and spanner constructions that are interference-minimal.

show abstract

Section: Interferencementioning

confidence: 99%

“…The interference model proposed in [16] is based on current network traffic. The amount and nature of network traffic however is highly dependent on the chosen application.…”

Section: Interferencementioning

confidence: 99%

See 1 more Smart Citation

Does topology control reduce interference?

Burkhart

Rickenbach

Wattenhofer

et al. 2004

Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing

356

270

View full text Add to dashboard Cite

show abstract

“…In addition, the standard theoretical model for energy consumption in mobile ad hoc networks considers the distances of communication partners and the amount of data transmission, namely the flow cost model of [5]. The quadratic increase of this model is motivated by the path loss in radio communications, which can be approximated for a fixed scenario by O(d α ), where d is the distance and α is the path loss exponent.…”

Section: Introductionmentioning

confidence: 99%

Minimal Energy Path Planning for Wireless Robots

Ooi¹,

Schindelhauer²

2009

Mobile Netw Appl

Self Cite

View full text Add to dashboard Cite

Abstract-For the first time, the problem of optimizing energy for communication and motion is investigated. We consider a single mobile robot with continuous high bandwidth wireless communication, e.g. caused by a multimedia application like video surveillance. This robot is connected to a radio base station and moves with constant speed from a given starting point on the plane to a target point. The task is to find the best path such that the energy consumption for mobility and the communication is optimized. This is motivated by the fact that the energy consumption of radio devices increases polynomially (at least to the power of two) with the transmission distance. We introduce efficient approximation algorithms finding the optimal path given the starting point, the target point and the position of the radio stations. We exemplify the influence of the communication cost by a starting scenario with one radio station. We study the performance of the proposed algorithm in simulation, compare it with the scenario without applying our approach, and present the results.

show abstract

“…The tradeoffs between congestion and stretch factor in wireless networks has been studied in [13] and [7]. For instance, for growth-bounded wireless networks, Gao and Zhang [7] show routing algorithms that simultaneously achieve a stretch factor of c and a load balancing ratio of O((n/c) 1−1/k ) where k is the growth rate.…”

Section: Related Workmentioning

confidence: 99%

Balancing Traffic Load Using One-Turn Rectilinear Routing

Durocher

Kranakis

Kriz̧anc

et al.

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We consider the problem of load-balanced routing, where a dense network is modelled by a continuous square region and origin and destination nodes correspond to pairs of points in that region. The objective is to define a routing policy that assigns a continuous path to each origin-destination pair while minimizing the traffic, or load, passing through any single point. While the average load is minimized by straight-line routing, such a routing policy distributes the load nonuniformly, resulting in higher load near the center of the region. We consider one-turn rectilinear routing policies that divert traffic away from regions of heavier load, resulting in up to a 33% reduction in the maximum load while simultaneously increasing the path lengths by an average of less than 28%. Our policies are simple to implement, being both local and oblivious. We provide a lower bound that shows that no one-turn rectilinear routing policy can reduce the maximum load by more than 39% and we give a polynomial-time procedure for approximating the optimal randomized policy.

show abstract

Congestion, Dilation, and Energy in Radio Networks

Cited by 37 publications

References 21 publications

Does topology control reduce interference?

Does topology control reduce interference?

Minimal Energy Path Planning for Wireless Robots

Balancing Traffic Load Using One-Turn Rectilinear Routing

Contact Info

Product

Resources

About