Skip to main content
Log in

Model T: A model for user registration patterns based on campus WLAN data

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

We discuss the derivation of an empirical model for spatial registration patterns of mobile users in a campus wireless local area network (WLAN). Such a model can be very useful in a variety of simulation studies of the performance of mobile wireless systems, such as that of resource management and mobility management protocols. We base the model on extensive experimental data from a campus WiFi LAN installation. We divide the empirical data available to us into training and test data sets, develop the model based on the training set, and evaluate it against the test set.

The model shows that user registration patterns exhibit a distinct hierarchy, and that WLAN access points (APs) can be clustered based on registration patterns. Cluster size distributions are highly skewed, as are intra-cluster transition probabilities and trace lengths, which can all be modeled well by the heavy-tailed Weibull distribution. The fraction of popular APs in a cluster, as a function of cluster size, can be modeled by exponential distributions. There is general similarity across hierarchies, in that inter-cluster registration patterns tend to have the same characteristics and distributions as intra-cluster patterns. In this context, we also introduce and discuss the modeling of the disconnected state as an integral part of real traffic characteristics.

We generate synthetic traffic traces based on the model we derive. We then compare these traces against the real traces from the test set using a set of metrics we define. We find that the synthetic traces agree very well with the test set in terms of the metrics. We compare the derived model to a simple modified random waypoint model, and show that the latter is not at all representative of the real data. We also show how the model parameters can be varied to allow designers to consider ‘what-if’ scenarios easily. Finally we develop an extended version of Model T that uses an alternative modeling of relative popularity of APs and clusters, with certain generalization advantages, and evaluate its fidelity to the real data also, with positive results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. M. Balazinska and P. Castro, Characterizing mobility and network usage in a corporate wireless local-area network, in: Proceedings of MobiSys (May 2003).

  2. T. Camp, J. Boleng and V. Davies, Mobility models for ad hoc network simulations, Wireless Communication and Mobile Computing 2(5) (2002) 483–502.

    Article  Google Scholar 

  3. F. Chinchilla, M. Lindsey and M. Papadopouli, Analysis of wireless information locality and association patterns in a campus, in: Proceedings of Infocom (2004).

  4. S. van Dongen, Graph clustering by flow simulation, Ph.D. dissertation, University of Utrecht (May 2000).

  5. R. Jain, A. Shivaprasad, D. Lelescu and X. He, Towards a model of user mobility and registration patterns, Mobile Computing and Communications Review, ACM SIGMOBILE 8(4) (2004) 59–62.

    Article  Google Scholar 

  6. R. Jain, Towards 4G: From Cathedral to Bazaar, Panel talk, IEEE Broadnets Symp. (Oct. 2004). See http://www.docomolabs-usa.com.

  7. A. Jardosh, E. Belding-Royer, K. Almeroth and S. Suri, Towards realistic mobility models for ad hoc networks, in: Proceedings of MobiCom (Sep. 2003).

  8. D. Kotz and K. Essien, Analysis of a campus-wide wireless network, in: Proceedings of MobiCom (Sep. 2002).

  9. L. Song, D. Kotz, R. Jain and X. He, Evaluating next-cell predictors with extensive Wi-Fi mobility data, in: Proceedings of Infocom (Mar. 2004).

  10. D. Tang and M. Baker, Analysis of a local-area wireless network, in: Proceedings of MobiCom (Aug. 2000).

  11. J. Yoon, M. Liu and B. Noble, Random waypoint considered harmful, in: Proceedings of Infocom (Mar. 2003).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ravi Jain.

Additional information

Ravi Jain is currently with Google, Mountain View, California, and until recently was Vice President and Director of the Network Services and Security Lab in DoCoMo USA Labs. At DoCoMo he led the US team designing DoCoMo’s 4th generation core network in three key areas: mobility management, QoS and security. He also led the development of techniques for location estimation, data mining for location prediction, as well as authenticated media delivery and WiFi VoIP. From 1992 to 2002, he worked for ten years on mobile wireless architectures, algorithms, protocols and middleware, as well as open programmable networks, in Applied Research, Telcordia Technologies (formerly Bellcore). Prior to that he worked for several years on systems and communications software development, performance modeling, and parallel programming.

Ravi Jain received the Ph.D. in Computer Science from the University of Texas at Austin in 1992. Ravi has numerous publications and patents in the wireless area. He is an Area Editor for IEEE Transactions on Mobile Computing and ACM WINET, and has been Guest Editor for Special Issues of several journals. He was the Program Co-Chair for the 2004 ACM MobiCom conference. He has served on the advisory boards of startup companies in the wireless area. Ravi was also the Specification Lead for the JAIN industry forum specification on Java Call Control (JCC) for Next Generation Networks, as well as the Parlay industry forum Parlay X working group; he is co-author of the book Programming Converged Networks (John Wiley, 2005). Ravi is a member of the Upsilon Pi Epsilon and Phi Kappa Phi honorary societies, a senior member of IEEE, and a member of the ACM.

Dan Lelescu has been a researcher with the Media Lab of NTT DoCoMo Communications Labs, San Jose, California since 2002. Prior to that he was a research engineer and later director of the Algorithms group with Compression Science, a start-up video coding company in Silicon Valley. His areas of interest include image and video signal processing, statistical signal processing, computer vision, and wireless communications and networking.

He received the Ph.D. in Electrical Engineering and Computer Science from the University of Illinois, Chicago in 2001. He has published in the areas of visual signal processing, content-based image and video retrieval, video coding, and wireless communications, and has six pending patents. He has also made contributions to MPEG video standards. He was a Session chair for the IEEE Communications and Networking (CCNC2006) conference, and is a Guest Editor for EURASIP Journal on Wireless Communications and Networking (2007) and for the Journal of Advances in Multimedia (2007). He is a member of IEEE.

Mahadevan Balakrishnan obtained his MS in Electrical engineering from Illinois Institute of Technology, Chicago. As a Research Engineer with DoCoMo Labs, Mahadevan was involved in developing a user mobility model from Wireless LAN user mobility traces obtained from real scenarios. His background includes signal processing, communication theory and networking.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jain, R., Lelescu, D. & Balakrishnan, M. Model T: A model for user registration patterns based on campus WLAN data. Wireless Netw 13, 711–735 (2007). https://doi.org/10.1007/s11276-006-9851-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-006-9851-5

Keywords

Navigation