Abstract
Maintaining bonds of cohesion between members of small groups in densely populated venues (e.g., a family in an amusement park, or some friends in a stadium) is increasingly gaining interest, both as a safety measure against malicious activity and as a convenient tool to prevent group splitting. Note that the use of mobile phones is often ruled out in such scenarios, due to extreme network load. Current solutions are typically based on custom installations of antennas, centralized control, and user devices with high transmission power.
In this work we propose a novel method for anonymously spreading presence information among group members in dense environments, based on a completely decentralized mobile ad hoc network approach. Our system operates independently of any infrastructure and is targetted at resource constrained, inexpensive and expendable user devices. Quite importantly, our system protects the privacy of its users, both for their safety and for ethical reasons.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo random number generator. SIAM J. Comput. 15(2), 364–383 (1986)
Boyar, J.: Inferring sequences produced by pseudo-random number generators. J. ACM 36(1), 129–141 (1989)
Deng, J., Han, R., Mishra, S.: Countermeasures against traffic analysis attacks in wireless sensor networks. In: SECURECOMM 2005: Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks, Washington, DC, USA, pp. 113–126. IEEE Computer Society, Los Alamitos (2005)
Jian, Y., Chen, S., Zhang, Z., Zhang, L.: Protecting receiver-location privacy in wireless sensor networks. In: INFOCOM, pp. 1955–1963 (2007)
Kamat, P., Zhang, Y., Trappe, W., Ozturk, C.: Enhancing source-location privacy in sensor network routing. In: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems, June 2005, pp. 599–608 (2005)
Karp, B., Kung, H.T.: Gpsr: greedy perimeter stateless routing for wireless networks. In: MobiCom 2000: Proceedings of the 6th annual international conference on Mobile computing and networking, pp. 243–254. ACM, New York (2000)
Kong, J., Hong, X.: Anodr: anonymous on demand routing with untraceable routes for mobile ad-hoc networks. In: MobiHoc 2003: Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, pp. 291–302. ACM, New York (2003)
Kong, J., Hong, X., Sanadidi, M.Y., Gerla, M.: Mobility changes anonymity: Mobile ad hoc networks need efficient anonymous routing. In: IEEE Symposium on Computers and Communications, pp. 57–62 (2005)
Rahman, S.M.M., Nasser, N., Inomata, A., Okamoto, T., Mambo, M., Okamoto, E.: Anonymous authentication and secure communication protocol for wireless mobile ad hoc networks. John Wiley & Sons, Ltd., Chichester (2008)
Seys, S., Preneel, B.: Arm: Anonymous routing protocol for mobile ad hoc networks. In: AINA 2006: Proceedings of the 20th International Conference on Advanced Information Networking and Applications, Washington, DC, USA, pp. 133–137. IEEE Computer Society, Los Alamitos (2006)
Zhang, Y., Liu, W., Wenjing, L.: Anonymous communications in mobile ad hoc networks. In: INFOCOM 2005: 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Gaba, A., Voulgaris, S., van Steen, M. (2010). Group Monitoring in Mobile Ad-Hoc Networks. In: Sideridis, A.B., Patrikakis, C.Z. (eds) Next Generation Society. Technological and Legal Issues. e-Democracy 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11631-5_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-11631-5_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11629-2
Online ISBN: 978-3-642-11631-5
eBook Packages: Computer ScienceComputer Science (R0)