This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Concept of Communication Distance and Its Application to Six Situations in Mobile Environments
September/October 2005 (vol. 4 no. 5)
pp. 409-419
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.

[1] L. Fu, “An Adaptive Routing Algorithm for In-Vehicle Route Guidance Systems with Real-Time Information,” Transportation Research, Part B: Methodological, vol. 35B, no. 8, pp. 749-765, 2001.
[2] L.L. Peterson and B.S. Davie, Computer Networks: A Systems Approach, third ed. Boston: Morgan Kaufmann, 2003.
[3] C.H. Cooley, The Theory of Transportation, pp. 70-71. Baltimore: Am. Economics Assoc., 1894.
[4] DOD, “US Army Survival Manual: FM 21-76,” US Dept. of Defense, 1992.
[5] F. Buckley and F. Harary, Distance in Graphs. Redwood City, Calif.: Addison-Wesley, 1990.
[6] R.F. Love, J.G. Morris, and G.O. Wesolowsky, Facilities Location: Models and Method. New York: North-Holland, 1988.
[7] S.J. Vaughan-Nichols, “The Challenge of Wi-Fi Roaming,” Computer, vol. 36, no. 7, pp. 17-19, July 2003.
[8] T. Kamakaris, “A Bandwidth Map for the Stevens Campus,” http://www.stevens.edu/winsec/resourcethroughput.jpg , 2003.
[9] E.W. Dijkstra, “A Note on Two Problems in Connection with Graphs,” Numeriche Mathematik 1, pp. 269-271, 1959.
[10] R.K. Ahuja, K. Mehlhorn, J.B. Orlin, and R.E. Tarjan, “Faster Algorithms for the Shortest Path Problem,” J. ACM, vol. 37, no. 2, pp. 213-223, 1990.
[11] M. Minoux, “Structures Algebriques Generalisees des Problemes de Cheminement dans les Graphes,” Recherche Operationnelle, vol. 10, no. 6, pp. 33-62, 1976.
[12] M. Gondran and M. Minoux, Graphs and Algorithms. Chichester (West Sussex); New York: Wiley, 1984.
[13] Y. Israeli and A. Ceder, “Multi-Objective Approach for Designing Transit Routes with Frequencies,” Advanced Methods in Transportation Analysis, L. Bianco and P. Toth, eds., pp. 157-182, Berlin: Springer, 1996.
[14] S. Pallottino and M.G. Scutellà, “Shortest Path Algorithms in Transportation Models: Classical and Innovative Aspects,” Equilibrium and Advanced Transportation Modelling, P. Marcotte and S. Nguyen, eds., 245-281, Boston: Kluwer, 1998.
[15] R.P. Loui, “Optimal Paths in Graphs with Stochastic or Multidimensional Weights,” Comm. ACM, vol. 26, no. 9, pp. 670-676, 1983.
[16] J. Pratt, “Risk Aversion in the Small and in the Large,” Econometrica, vol. 32, pp. 122-136, 1964.
[17] K.J. Arrow, Essays in the Theory of Risk-Bearing. Chicago: Markham, 1971.
[18] E. Miller-Hooks and H. Mahmassani, “Path Comparisons for A Priori and Time-Adaptive Decisions in Stochastic, Time-Varying Networks,” European J. Operational Research, vol. 146, no. 1, pp. 67-82, 2003.
[19] P. Jaillet, “Shortest Path Problems with Node Failures,” Networks, vol. 22, pp. 589-605, 1992.
[20] I. Murthy and S. Sarkar, “A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems,” Transportation Science, vol. 30, no. 3, pp. 220-236, 1996.
[21] R. Hall, “The Fastest Path through a Network with Random Time-Dependent Travel Time,” Transportation Science, vol. 20, no. 3, pp. 182-188, 1986.
[22] K. Nagel, “Multi-Agent Transportation Simulations,” http://www.sim.inf.ethz.ch/papersbook/, 2004.
[23] D. Park and R. Rilett, “Identifying Multiple and Reasonable Paths in Transportation Networks: A Heuristic Approach,” Transportation Research Records, vol. 1607, pp. 31-37, 1997.
[24] S. Handley, P. Langley, and F. Rauscher, “Learning to Predict the Duration of an Automobile Trip,” Proc. Int'l Conf. Knowledge Discovery and Data Mining, 1998.
[25] J. Sacks, N.M. Rouphail, B. Park, and P. Thakuriah, “Statistically-Based Validation of Computer Simulation Models in Traffic Operations and Management,” J. Transportation and Statistics, vol. 5, no. 1, 2002.
[26] C.H. Cooley, The Theory of Transportation, p. 103. Baltimore, Md.: Am. Economics Assoc., 1894.
[27] M. Abolhasan, T. Wysocki, and E. Dutkiewicz, “A Review of Routing Protocols for Mobile Ad Hoc Networks,” Ad Hoc Networks, vol. 2, pp. 1-22, 2004.
[28] I. Chatzigiannakis, S. Nikoletseas, N. Paspallis, P. Spirakis, and C. Zaroliagis, “An Experimental Study of Basic Communication Protocols in Ad-Hoc Mobile Networks,” Lecture Notes in Computer Science, vol. 2141, pp. 159-169, 2001.
[29] Q. Li and D. Rus, “Message Relay in Disconnected Ad-Hoc Networks,” Proc. IEEE MASCOTS Workshop Mobility and Wireless Access, 2002.
[30] D.J. Goodman, J. Borras, N.B. Mandayam, and R.D. Yates, “INFOSTATIONS: A New System Model for Data and Messaging Services,” Proc. Vehicular Technology Conf., 1997.
[31] S.B. Kodeswaran, O. Ratsimor, A. Joshi, T. Finin, and Y. Yesha, “Using Peer-to-Peer Data Routing for Infrastructure-Based Wireless Networks,” Proc. IEEE Int'l Conf. Pervasive Computing and Comm. (PerCom), 2003.
[32] T. Small and Z. Haas, “The Shared Wireless Infostation Model— A New Ad Hoc Networking Paradigm (or Where There Is a Whale, there is a Way),” Proc. ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, 2003.
[33] M. Papadopouli and H. Schulzrinne, “Effects of Power Conservation, Wireless Coverage and Cooperation on Data Dissemination among Mobile Devices,” Proc. Second ACM Int'l Symp. Mobile Ad Hoc Networking & Computing, 2001.
[34] M. Kreitz, K.W. Axhausen, K.J. Beckmann, and M.M. Friedrich, “Mobiplan: An Internet-Based Personal Mobility Advisor,” Transport Policy, vol. 9, no. 2, pp. 155-168, 2002.
[35] P. Jones, Developments in Dynamic and Activity-Based Approaches to Travel Analysis. Aldershot, England; Brookfield, Vt.: Avebury, 1990.
[36] T. Gèarling, T. Laitila, and K. Westin, Theoretical Foundations of Travel Choice Modeling, first ed. Amsterdam; New York: Elsevier, 1998.
[37] E. Nash, “GNER to Install WiFi on Trains,” http://www.itweek. co.uk/News1142986, 2003.
[38] V. Kaufmann, “Temps et Pratiques Modales. Le Plus Court Est-Il le Mieux? The Rationality of Perception and Modal Choice. Is Quickest Best?,” Recherche Transport Sécurité, vol. 75, pp. 131-143, 2002.

Index Terms:
Index Terms- Mobile computing, wireless communication, decision aids, transportation planning, emergency response, mobile ad hoc networks, route guidance, contingency planning.
Citation:
Jeffrey V. Nickerson, "A Concept of Communication Distance and Its Application to Six Situations in Mobile Environments," IEEE Transactions on Mobile Computing, vol. 4, no. 5, pp. 409-419, Sept.-Oct. 2005, doi:10.1109/TMC.2005.60
Usage of this product signifies your acceptance of the Terms of Use.