NDLI: Energy, congestion and dilation in radio networks

Please wait, while we are loading the content...

Worst-case traffic for oblivious routing functions

Distributed caching independent of the network size

Distributed streams algorithms for sliding windows

Two techniques for reconciling algorithm parallelism with memory constraints

Scheduling reductions on realistic machines

The lazy adversary conjecture fails

Exploiting flexibly assignable work to improve load balance

Universal stability of undirected graphs in the adversarial queueing model

Capture of an intruder by mobile agents

Energy, congestion and dilation in radio networks

Nearest common ancestors: a survey and a new distributed algorithm

Locality-preserving randomized oblivious routing on torus networks

Distributed object location in a dynamic network

High performance dynamic lock-free hash tables and list-based sets

A general compiler framework for speculative multithreading

Two processor scheduling with real release times and deadlines

$AT^{2}L^{2}$ o $N^{2}/2$ for fast fourier transform in multilayer VLSI

New stability results for adversarial queuing

Tracking immediate predecessors in distributed computations

Parallel scheduling problems in next generation wireless networks

Algorithms for fault-tolerant routing in circuit switched networks

Õ(congestion + dilation) hot-potato routing on leveled networks

Compact, adaptive placement schemes for non-uniform requirements

Scalability and resource usage of an OLAP benchmark on clusters of PCs

Optimal organizations for pipelined hierarchical memories

Extra processors versus future information in optimal deadline scheduling

Rapid prototyping methodology for multi-DSP TI C6X platforms applied to an Mpeg-2 coding application

Optimal tiling for the RNA base pairing problem

Gossiping to reach consensus

A lightweight idempotent messaging protocol for faulty networks

Parallel dynamic programming for solving the string editing problem on a CGM/BSP

Energy estimation of nested loop programs

Heuristics for semi-external depth first search on directed graphs

Sequential consistency as lazy linearizability

Verifying sequential consistency using vector clocks

Energy, congestion and dilation in radio networks

Content Provider	ACM Digital Library
Author	Meyer auf de Heide, Friedhelm Grünewald, Matthias Volbert, Klaus Schindelhauer, Christian
Abstract	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.
Starting Page	230
Ending Page	237
Page Count	8
File Format	PDF
ISBN	1581135297
DOI	10.1145/564870.564910
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2002-08-10
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Wireless communication Routing Radio networks
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in