AN INTEGRATED MODEL OF WIRELESS AD HOC NETWORKS

T. Tyrakowski

References

  1. [1] T. Camp, J. Boleng, & V. Davies, A survey of mobility models for ad hoc network research, Wireless Communications & Mobile Computing: Special Issue on Mobile Ad Hoc Networking: Research, Trends and Applications, 2, 2002, 483–502.
  2. [2] I. Rubin & C.W. Choi, Impact of the location area structure on the performance of signalling channels in wireless cellular networks, IEEE Communications Magazine, 1997, 108–115. doi:10.1109/35.565672
  3. [3] G. Resta & P. Santi, An analysis of the node spatial distribution of the random waypoint mobility model for ad hoc networks, Proc. 2002 Workshop on Principles of Mobile Computing, Toulouse, France, 2002, 44–50. doi:10.1145/584490.584500
  4. [4] E. Royer, P.M. Melliar-Smith, & L. Moser, An analysis of the optimum node density for ad hoc mobile networks, Proc. IEEE Int. Conf. on Communications, 3, Helsinki, Finland, 2001, 857–861.
  5. [5] X. Hong, M. Gerla, G. Pei, & C. Chiang, A group mobility model for ad hoc wireless networks, Proc. ACM/IEEE MSWiM’99, Seattle, WA, 1999, 53–60. doi:10.1145/313237.313248
  6. [6] C. Bettstetter, Smooth is better than sharp: A random mobility model for simulation of wireless networks, Proc. 4th ACM Int. Workshop on Modelling, Analysis and Simulation of Wireless and Mobile Systems, Rome, Italy, 2001, 19–27. doi:10.1145/381591.381600
  7. [7] D. Yu, H. Li, & I. Gruber, Path availability in ad-hoc network, Proc. Int. Conf. on Telecommunications, Papeete, French Polynesia, 1, 2003, 383–387.
  8. [8] D. Yu & H. Li, A model for performance analysis of mobile ad hoc networks, Proc. Int. Conf. on Telecommunications, Beijing, China, 2002.
  9. [9] A.B. McDonald & T. Znati, A path availability model for wireless ad-hoc networks, Proc. IEEE Wireless Communications and Networking Conf., New Orleans, LA, 1999, 35–40.
  10. [10] F. Xue & P.R. Kumar, The number of neighbors needed for connectivity of wireless networks, Wireless Networks: The Journal of Mobile Communication, Computation and Information, 10(2), 2004, 169–181.
  11. [11] B.S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, & W. Rytter, Deterministic broadcasting in ad hoc radio networks, Proc. 11th Annual ACM-SIAM Symp. on Discrete Algorithms, San Francisco, CA, 2000, 861–870.
  12. [12] P. Gupta & P.R. Kumar, The capacity of wireless networks, technical report, University of Illinois, Urbana-Champaign, 1999, 104–126.
  13. [13] G. Stüber, Principles of mobile communication, 2nd Ed. (Boston: Kluwer, 2001).
  14. [14] R. Bar-Yehuda, O. Goldreich, & A. Itai, On the complexity of broadcast in radio networks: An exponential gap between determinism and randomization, Journal of Computer and System Sciences, 45, 1992, 104–126. doi:10.1016/0022-0000(92)90042-H
  15. [15] D.R. Kowalski & A. Pelc, Deterministic broadcasting time in radio networks of unknown topology, Proc. 43rd Symp. on Foundations of Computer Science, Vancouver, Canada, 2002, 63–72. doi:10.1109/SFCS.2002.1181883
  16. [16] B.P. Zeigler, Theory of modelling and simulation (Polish translation) (Warsaw: PWN, 1976).
  17. [17] M. Fisz, Probability theory and mathematical statistics (New York: John Wiley & Sons, 1963) (English translation; Polish edition: Warsaw: PWN, 1967).

Important Links:

Go Back