The Mathematics of Routing in Massively Dense Ad-Hoc Networks

Authors:
Eitan Altman;Pierre Bernhard;Alonso Silva
Affiliations:
INRIA, Sophia Antipolis, France 06902;I3S, University of Nice-Sophia Antipolis and CNRS, France;INRIA, Sophia Antipolis, France 06902
Venue:
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Year:
2008

Citing 5
Cited 1

Variational Inequalities and Applications to a Continuum Model of Transportation Network with Capacity Constraints

Journal of Global Optimization
Geometry of information propagation in massively dense ad hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Optimal design and operation of massively dense wireless networks: or how to solve 21st century problems using 19th century mathematics

Interperf '06 Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems
Mother nature knows best: A survey of recent results on wireless networks based on analogies with physics

Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal deployment of large wireless sensor networks

IEEE Transactions on Information Theory

Gauss-seidel correction algorithm: A macroscopic model-derived routing algorithm for WSNs

ACM Transactions on Sensor Networks (TOSN)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computing optimal routes in massively dense adhoc networks becomes intractable as the number of nodes becomes very large. One recent approach to solve this problem is to use a fluid type approximation in which the whole network is replaced by a continuum plain. Various paradigms from physics have been used recently in order to solve the continuum model. We propose in this paper an alternative modeling and solution approach similar to a model by Beckmann [3] developed more than fifty years ago from the area of road traffic.