Abstract
This paper models an ad-hoc network as a continuum of nodes, ignoring edge effects, to find how the traffic scales with N, the number of nodes. We obtain expressions for the traffic due to application data, packet forwarding, mobility and routing, and we find the effects of the transmission range, R, and the bandwidth. The results indicate that the design of scalable adhoc networks should target small numbers of nodes (not over 1000) and short transmission ranges. The analysis produces three dimensionless parameters that characterize the nodes and the network: α, the walk/talk ratio, or the ratio of the link event rate to the application packet rate; β, the forwarding overhead, or the average number of hops required for a packet to travel from source to destination; and γ, the routing overhead. We find that the quantity αγ/β characterizes the relative importance of routing traffic and user data traffic. These quantities may be useful to compare the results of various simulation studies.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amin, K., Mayes, J., Mikler, A.: Agent-based Distance Vector Routing. In: IEEE/ACM MATA 2001: 3rd International Workshop on Mobile Agents for Telecommunications Application, Canada, (August 2001), from, http://students.csci.unt.edu/~amin/ retrieved
Braginsky, D., Estrin, D.: Rumor Routing Algorithm for Sensor Networks. In: WSNA 2002, Atlanta, Georgia, USA, September 28 (2002)
Celebi, E.: Master’s Thesis: Performance Evaluation of Wireless Mobile AdHoc Network Routing Protocols (2001), from http://cis.poly.edu/~ecelebi/ retrieved May 16 (2003)
Contla, P.A., Stojmenivoc, M.: Estimating Hop Counts in Position Based Routing Schemes for Ad Hoc Networks. Telecommunication Systems 22, 109–118 (2003)
Corson, S., Macker, J.: Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations. IETF RFC 2501 (1999) , from http://www.ietf.org/rfc/rfc2501.txt retrieved May 21 (2003)
Gupta, P., Kumar, P.R.: The Capacity of Wireless Networks. IEEE Transactions on Information Theory 46(2), 388–404 (2000)
Hong, X., Xu, K., Gerla, M.: Scalable Routing Protocols for Mobile Ad Hoc Networks. IEEE Network, 11–21 (July/August 2002)
Johansson, P., Larsson, T., Hedman, N., Mielczarek, B., Degermark, M.: Scenario-based Performance Analysis of Routing Protocols for Mobile Adhoc Networks. In: ACM Mobicom 1999, Seattle, Washington, USA (1999)
Liang, S., Zincir-Heywood, N., Heywood, M.: The Effect of Routing under Local Information Using a Social Insect Metaphor. In: IEEE 2002 World Congress on Computational Intelligence, Congress on Computation, pp. 1438-1443 (2002)
Minar, N., Kramer, K.H., Maes, P.: Cooperative Mobile Agents for Dynamic Network Routing. In: Software Agents for furutre Communications Systems. Springer, New York (1999)
Santiváñez, C., McDonald, B., Stavrakakis, I., Ramanathan, R.: On the Scalability of Ad Hoc Routing Protocols. In: Proc. IEEE INFOCOM, vol. 3, pp. 1688–1697 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grundke, E.W., Zincir-Heywood, A.N. (2003). A Uniform Continuum Model for Scaling of Ad Hoc Networks. In: Pierre, S., Barbeau, M., Kranakis, E. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2003. Lecture Notes in Computer Science, vol 2865. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39611-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-39611-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20260-8
Online ISBN: 978-3-540-39611-6
eBook Packages: Springer Book Archive