Abstract
Throughput is a basic measure for communication efficiency. It is defined as the average fraction of time that the channel is employed for useful data propagation. This work considers the problem of analytically estimating the throughput of protocols for media access control (MAC) in mobile ad hoc networks (MANETs). The dynamic and difficult to predict nature of MANETs complicates the analysis of MAC algorithms. We use simple extensions to the interleaving model and evolving graphs, for defining the settings that model the location of mobile nodes.
This work improves the understanding on impossibility results, the possible trade-offs and the analysis of fault-tolerant algorithms in MANETs. As the first result in the paper and as motivation for the ones that follow, we show that there is no efficient deterministic MAC algorithm for MANETs. Moreover, we prove a lower bound of the throughput in the radical settings of complete random relocation between every two steps of the algorithm. The lower bound matches the throughput of a strategy that is oblivious to the history of wireless broadcasts.
Subsequently, we focus on the analysis of non-oblivious strategies and assume a bound on the rate by which mobile nodes relocate, i.e., randomly changing their neighborhoods. Our analysis is the first to demonstrate a novel throughput-related trade-off between oblivious and non-oblivious strategies of MAC algorithms that depends on the relocation rate of mobile nodes. We present a non-oblivious strategy that yields a randomized, fault-tolerant algorithm that can balance between the trade-offs. The studied algorithm is the first of is kind because it is a “stateful” one that quickly converges to a guaranteed throughput.
Partially supported by the ICT Programme of the European Union under contract number ICT-2008-215270 (FRONT’S).
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
Abramson, N.: Development of the ALOHANET. IEEE Information Theory 31(2), 119–123 (1985)
Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. ACM Transactions on Autonomous and Adaptive Systems (TAAS) 3(4) (2008)
Avin, C., Koucký, M., Lotker, Z.: How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 121–132. Springer, Heidelberg (2008)
Bettstetter, C.: Smooth is better than sharp: a random mobility model for simulation of wireless networks. In: Meo, M., Dahlberg, T.A., Donatiello, L. (eds.) MSWiM, pp. 19–27. ACM, New York (2001)
Díaz, J., Mitsche, D., Pérez-Giménez, X.: On the connectivity of dynamic random geometric graphs. In: SODA 2008, pp. 601–610 (2008)
Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
Efraimidis, P., Spirakis, P.G.: Weighted random sampling with a reservoir. Inf. Process. Lett. 97(5), 181–185 (2006)
Ferreira, A.: Building a reference combinatorial model for MANETs. Network 18(5), 24–29 (2004)
Fullmer, C.L., Garcia-Luna-Aceves, J.J.: Solutions to hidden terminal problems in wireless networks. In: SIGCOMM, pp. 39–49 (1997)
Haas, Z.J., Deng, J.: Dual busy tone multiple access (DBTMA)-a multiple access controlscheme for ad hoc networks. IEEE Transactions on Communications 50(6), 975–985 (2002)
Herman, T., Tixeuil, S.: A distributed TDMA slot assignment algorithm for wireless sensor networks. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2004. LNCS, vol. 3121, pp. 45–58. Springer, Heidelberg (2004)
Jarry, A., Lotker, Z.: Connectivity in evolving graph with geometric properties. In: Basagni, S., Phillips, C.A. (eds.) DIALM-POMC, pp. 24–30. ACM, New York (2004)
Jhumka, A., Kulkarni, S.S.: On the design of mobility-tolerant TDMA-based media access control (MAC) protocol for mobile sensor networks. In: Janowski, T., Mohanty, H. (eds.) ICDCIT 2007. LNCS, vol. 4882, pp. 42–53. Springer, Heidelberg (2007)
Leone, P., Papatriantafilou, M., Schiller, E.M.: Relocation adaptive and stable MAC algorithm for large-scale and highly mobile ad hoc networks. Technical Report 2008:23, Department of Computer Science, and Engineering, Chalmers University of Technology (Sweden) (September 2008)
Luby, M.: Removing randomness in parallel computation without a processor penalty. J. Comput. Syst. Sci. 47(2), 250–286 (1993)
Penrose, M.D.: Random Geometric Graphs. Oxford University Press, Oxford (2003)
Schmidt, W.G.: Satellite time-division multiple access systems: Past, present and future. Telecommunications 7, 21–24 (1974)
Schneider, J., Wattenhofer, R.: Coloring Unstructured Wireless Multi-Hop Networks. In: 28th ACM Symposium on Principles of Distributed Computing (PODC), Calgary, Canada (August 2009)
Takagi, H., Kleinrock, L.: Throughput analysis for persistent CSMA systems. IEEE Transactions on Communications 33(7), 627–638 (1985)
Tobagi, F.A., Kleinrock, L.: Packet Switching in Radio Channels: Part II–The Hidden Terminal Problem in CSMA and the Busy-Tone Solution. IEEE Transactions on Communications 23(12), 1417–1433 (1975)
Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz 3(7), 25–30 (1964)
Wattenhofer, R.: Ad hoc and sensor networks (hs 2008). Lecture notes/slides (October 2008), http://www.dcg.ethz.ch/lectures/hs08/asn/lecture/6/chapter06mediaaccess.ppt
Yuichi Sudo, J.N., Yamauchi, Y., Ooshita, F., Kakugawa, H., Masuzawa, T.: Loosely-stabilizing Leader Election in Population Protocol Model. In: SIROCCO (to appear, 2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leone, P., Papatriantafilou, M., Schiller, E.M. (2009). Relocation Analysis of Stabilizing MAC Algorithms for Large-Scale Mobile Ad Hoc Networks. In: Dolev, S. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2009. Lecture Notes in Computer Science, vol 5804. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05434-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-05434-1_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05433-4
Online ISBN: 978-3-642-05434-1
eBook Packages: Computer ScienceComputer Science (R0)