Efficient communication strategies for ad-hoc wireless networks (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
PAMAS—power aware multi-access protocol with signalling for ad hoc networks
ACM SIGCOMM Computer Communication Review
Power consumption in packet radio networks
Theoretical Computer Science
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
An Efficient Communication Strategy for Ad-hoc Mobile Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Simple Routing Strategies for Adversarial Systems
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A simulation environment for ad hoc networks using sector subdivision
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
The capacity of wireless networks
IEEE Transactions on Information Theory
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
On local algorithms for topology control and routing in ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Worst case mobility in ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Proceedings of the 2004 joint workshop on Foundations of mobile computing
A Robust Interference Model for Wireless Ad-Hoc Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Algorithmic aspects of capacity in wireless networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Reducing interference in ad hoc networks through topology control
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Topology control with better radio models: implications for energy and multi-hop interference
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
The scheduling and energy complexity of strong connectivity in ultra-wideband networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
On constructing low interference topology in multihop wireless sensor networks
International Journal of Sensor Networks
Distributed construction of bounded-degree low-interference spanners of low weight
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
On the complexity of minimizing interference in ad-hoc and sensor networks
Theoretical Computer Science
Algorithmic models of interference in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Algorithms for ad hoc and sensor networks
Computer Communications
On service differentiation for multimedia traffic in multi-hop wireless networks
IEEE Transactions on Wireless Communications
Balancing traffic load using one-turn rectilinear routing
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Joint multi-cost routing and power control in wireless ad hoc networks
Wireless Networks
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Spanners, weak spanners, and power spanners for wireless networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Wireless networking: graph theory unplugged
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Distributed transactional memory for metric-space networks
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Performance analysis of the hierarchical layer graph for wireless networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
On the complexity of minimizing interference in ad-hoc and sensor networks
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Hi-index | 0.00 |
We investigate the problem of path selection in radio networks for a given set of sites in two-dimensional space. For some given static point-to-point communication demand we define measures for congestion, energy consumption and dilation that take interferences between communication links into account.We show that energy optimal path selection for radio networks can be computed in polynomial time. Then, we introduce the diversity $g(V)$ of a set $V\subseteq \REAL^2$. It can be used to upperbound the number of interfering edges. For real-world applications it can be regarded as $\Theta(\log n)$. A main result of the paper is that a weak $c$-spanner construction as a communication network allows to approximate the congestion-optimal communication network by a factor of $O(g(V)^2)$.Furthermore, we show that there are vertex sets where only one of the performance parameters congestion, energy, and dilation can be optimized at a time. We show trade-offs lower bounding congestion $\times$ dilation and dilation $\times$ energy. For congestion and energy the situation is even worse. It is only possible to find a reasonable approximation for either congestion or energy minimization, while the other parameter is at least a polynomial factor worse than in the optimal network.