A Scheduling Policy for Dense and Highly Mobile Ad hoc Networks

M. Coupechoux, C. Bonnet, V. Kumar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Recent publications in information theory demonstrated that mobility can increase the capacity of wireless ad hoc networks. More precisely, the throughput per source-destination pair can be kept constant as the density of nodes increases. Considering an analytical study as a starting point, in this paper we propose and evaluate a distributed scheduling policy for dense and highly mobile ad hoc networks. This policy takes advantage of mobility in order to reduce the relaying traffic in such a network. Simulation results are provided to show the benefit of mobility on the network throughput and the optimal transmission range is derived from an analytical study.

Original languageEnglish
Title of host publicationMobile Ad-Hoc Netzwerke, 1.deutscher Workshop uber Mobile Ad-Hoc Netzwerke, WMAN 2002
EditorsMichael Weber, Frank Kargl
PublisherGesellschaft fur Informatik (GI)
Pages29-40
Number of pages12
ISBN (Electronic)3885793415
Publication statusPublished - 1 Jan 2002
Externally publishedYes
Event1.deutscher Workshop uber Mobile Ad-Hoc Netzwerke, WMAN 2002 - 1st German Workshop on Mobile Ad-Hoc Networks, WMAN 2002 - Ulm, Germany
Duration: 25 Mar 200226 Mar 2002

Publication series

NameLecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI)
VolumeP-11
ISSN (Print)1617-5468
ISSN (Electronic)2944-7682

Conference

Conference1.deutscher Workshop uber Mobile Ad-Hoc Netzwerke, WMAN 2002 - 1st German Workshop on Mobile Ad-Hoc Networks, WMAN 2002
Country/TerritoryGermany
CityUlm
Period25/03/0226/03/02

Fingerprint

Dive into the research topics of 'A Scheduling Policy for Dense and Highly Mobile Ad hoc Networks'. Together they form a unique fingerprint.

Cite this