A Concept of Communication Distance and Its Application to Six Situations in Mobile Environments

Authors:
Jeffrey V. Nickerson
Affiliations:
IEEE
Venue:
IEEE Transactions on Mobile Computing
Year:
2005

Citing 9
Cited 1

Graphs and algorithms

Graphs and algorithms
Faster algorithms for the shortest path problem

Journal of the ACM (JACM)
Optimal paths in graphs with stochastic or multidimensional weights

Communications of the ACM
Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way)

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Message Relay in Disconnected Ad-Hoc Networks

MobiWac '02 Proceedings of the International Workshop on Mobility and Wireless Access
Using Peer-to-Peer Data Routing for Infrastructure-Based Wireless Networks

PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
The Challenge of Wi-Fi Roaming

Computer
Computer Networks: A Systems Approach, 3rd Edition

Computer Networks: A Systems Approach, 3rd Edition

A probabilistic model of integration

Decision Support Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless networks combined with location technology create new problems and call for new decision aids. As a precursor to the development of these decision aids, a concept of communication distance is developed and applied to six situations. This concept allows travel time and bandwidth to be combined in a single measure so that many problems can be mapped onto a weighted graph and solved through shortest path algorithms. The paper looks at the problem of intercepting an out-of-communication team member and describes ways of using planning to reduce communication distance in anticipation of a break in connection. The concept is also applied to ad hoc radio networks. A way of performing route planning using a bandwidth map is developed and analyzed. The general implications of the work to transportation planning are discussed.