NDLI: On local algorithms for topology control and routing in ad hoc networks

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

Optimal sharing of bags of tasks in heterogeneous clusters

A practical algorithm for constructing oblivious routing schemes

Optimal fault-tolerant linear arrays

I/O-efficient topological sorting of planar DAGs

A proportionate fair scheduling rule with good worst-case performance

Performance comparison of MPI and three openMP programming styles on shared memory multiprocessors

Designing overlay multicast networks for streaming

Compact routing with name independence

Analysis of link reversal routing algorithms for mobile ad hoc networks

High throughput, parallelized 128-bit AES encryption in a resource-limited FPGA

The load rebalancing problem

Polynomial time algorithms for network information flow

Toward a decidable notion of sequential consistency

Information gathering in adversarial systems: lines and cycles

Minimizing total flow time and total completion time with immediate dispatching

A polynomial-time tree decomposition to minimize congestion

The effect of communication costs in solid-state quantum computing architectures

MST construction in O(log log n) communication rounds

Integrated prefetching and caching in single and parallel disk systems

Quantifying instruction criticality for shared memory multiprocessors

Combining online algorithms for rejection and acceptance

Tree based MPLS routing

On local algorithms for topology control and routing in ad hoc networks

MAPO: using a committee of algorithm-experts for parallel optimization of costly functions

Load balancing of unit size tokens and expansion properties of graphs

Improved approximation algorithms for the freeze-tag problem

Nonblocking k-compare-single-swap

A near optimal scheduler for switch-memory-switch routers

Online deadline scheduling: multiple machines and randomization

Online oblivious routing

VLSI layout of trees into grids of minimum width

Asynchronous parallel disk sorting

Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging

Throughput-centric routing algorithm design

Worst case mobility in ad hoc networks

Buffer overflows of merging streams

Cycle stealing under immediate dispatch task assignment

Can we elect if we cannot compare?

Scheduling policies for CIOQ switches

Novel architectures for P2P applications: the continuous-discrete approach

TCP is competitive against a limited adversary

Short length menger's theorem and reliable optical routing

Randomized permutations in a coarse grained parallel environment

Relaxing the problem-size bound for out-of-core columnsort

Bicriteria approximation algorithms for scheduling problems with communications

The complexity of verifying memory coherence

Efficient galois field arithmetic on SIMD architectures

On local algorithms for topology control and routing in ad hoc networks

Content Provider	ACM Digital Library
Author	Jia, Lujun Rajaraman, Rajmohan Scheideler, Christian
Abstract	An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any fixed infrastructure. Indeed, an important task of an ad hoc network is to determine an appropriate topology over which high-level routing protocols are implemented. Furthermore, since the underlying topology may change with time, we need to design routing algorithms that effectively react to dynamically changing network conditions.The aim of this paper is to explore the limits of communication in wireless mobile networks, concentrating on local-control algorithms for topology control and routing. We analyze the performance of the algorithms under three measures: throughput, which is the rate at which packets can be delivered, space overhead, i.e. the space necessary to buffer packets, and the total energy consumed due to packet transmissions. Energy consumption is an important performance measure for ad hoc networks since the battery power of mobile nodes is usually limited.Towards topology control, we show that for any distribution of nodes in the 2-dimensional Euclidean plane, a simple local algorithm allows to establish and maintain a connected constant degree overlay network that contains energy-efficient paths between every pair of nodes. Towards routing, we present a local routing algorithm that works for arbitrary overlay networks without transmission interference. We show that for any sequence of network changes and packet injections the algorithm is within a constant factor of the optimal, with respect to both throughput and energy, when compared to what a best possible routing algorithm can achieve under the same sequence of network changes and injection. We then combine the topology control and routing algorithms to obtain competitive wireless communication algorithms that account for transmission interference, an important performance-limiting aspect of wireless communication.
Starting Page	220
Ending Page	229
Page Count	10
File Format	PDF
ISBN	1581136617
DOI	10.1145/777412.777447
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2003-06-07
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Spanners Competitive analysis Mobile computing and communication Routing Adversarial model Ad hoc wireless networks Distributed algorithms
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