A scheduling policy for dense and highly mobile ad hoc networks
| dc.contributor.author | Coupechoux, M. | |
| dc.contributor.author | Bonnet, C. | |
| dc.contributor.author | Kumar, V. | |
| dc.contributor.editor | Weber, Michael | |
| dc.contributor.editor | Kargl, Frank | |
| dc.date.accessioned | 2019-12-13T09:01:14Z | |
| dc.date.available | 2019-12-13T09:01:14Z | |
| dc.date.issued | 2002 | |
| dc.description.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 bene t of mobility on the network throughput and the optimal transmission range is derived from an analytical study. | en |
| dc.identifier.isbn | 3-88579-341-5 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/30674 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | Mobile Ad-Hoc Netzwerke, 1. Deutscher Workshop über Mobile Ad-Hoc Netzwerke WMAN 2002 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-11 | |
| dc.title | A scheduling policy for dense and highly mobile ad hoc networks | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 40 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 29 | |
| gi.conference.date | 25.-26. März 2002 | |
| gi.conference.location | Ulm | |
| gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1