Opportunistic Protocols for People Counting in Dynamic Networks

被引:0
|
作者
Jung, Alexander [1 ]
Parzyjegla, Helge [1 ]
Danielis, Peter [1 ]
机构
[1] Univ Rostock, Inst Comp Sci, Rostock, Germany
关键词
Opportunistic protocols; people counting; dynamic networks; OMNeT plus;
D O I
10.1109/CCNC51664.2024.10454785
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the modern world, accurate crowd counting is integral to a multitude of applications, including urban planning, transportation management, and crowd control. The advent of opportunistic communication networks, which enable devices to sporadically exchange data in a decentralized fashion, has introduced a new set of challenges in crowd estimation. This paper delves into two opportunistic people counting protocols: UrbanCount and HeartBeatCount. UrbanCount, while a robust protocol in its own right, comes with certain limitations that hinder its real-world applicability. In response to these limitations, this paper introduces refinements to UrbanCount, making it more practical and effective. Additionally, a novel protocol called HeartBeatCount is presented, which significantly enhances crowd size estimation accuracy, particularly in sparse scenarios. Through an evaluation, we compare the performance of these protocols and conclude that HeartBeatCount offers a more resilient solution for opportunistic people counting in various real-world scenarios.
引用
收藏
页码:198 / 201
页数:4
相关论文
共 50 条
  • [41] On the Distributed Trigger Counting Problem for Dynamic Networks
    Chang, Che-Cheng
    Tsai, Jichiang
    Chang, Tien-Yu
    [J]. JOURNAL OF INTERNET TECHNOLOGY, 2021, 22 (04): : 855 - 866
  • [42] Naming and Counting in Anonymous Unknown Dynamic Networks
    Michail, Othon
    Chatzigiannakis, Ioannis
    Spirakis, Paul G.
    [J]. STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2013, 2013, 8255 : 281 - 295
  • [43] Conscious and Unconscious Counting on Anonymous Dynamic Networks
    Di Luna, Giuseppe Antonio
    Baldoni, Roberto
    Bonomi, Silvia
    Chatzigiannakis, Ioannis
    [J]. DISTRIBUTED COMPUTING AND NETWORKING, ICDCN 2014, 2014, 8314 : 257 - 271
  • [44] Counting in Practical Anonymous Dynamic Networks is Polynomial
    Chakraborty, Maitri
    Milani, Alessia
    Mosteiro, Miguel A.
    [J]. NETWORKED SYSTEMS, NETYS 2016, 2016, 9944 : 131 - 136
  • [45] Gossip-Based Counting in Dynamic Networks
    van de Bovenkamp, Ruud
    Kuipers, Fernando
    Van Mieghem, Piet
    [J]. NETWORKING 2012, PT II, 2012, 7290 : 404 - 417
  • [46] Offloading through Opportunistic Networks with Dynamic Content Requests
    Bruno, Raffaele
    Masaracchia, Antonino
    Passarella, Andrea
    [J]. 2014 IEEE 11TH INTERNATIONAL CONFERENCE ON MOBILE AD HOC AND SENSOR SYSTEMS (MASS), 2014, : 586 - 593
  • [47] Opportunistic Channel Sharing in Stochastic Networks With Dynamic Traffic
    Xia, Bin
    Liu, Yingbin
    Yang, Chenchen
    Chen, Zhiyong
    Xie, Weiliang
    Zhao, Yong
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2017, 66 (10) : 9587 - 9591
  • [48] Ensuring Privacy in Opportunistic Networks Using Dynamic Clustering
    Kaur, Prabhleen
    Singh, Jasvir
    [J]. 2015 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTER ENGINEERING AND APPLICATIONS (ICACEA), 2015, : 866 - 869
  • [49] Modeling Opportunistic Data Delivery in Dynamic Wireless Networks
    Schurgot, Mary R.
    Comaniciu, Cristina
    Jaffres-Runser, Katia
    [J]. 2012 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2012, : 5272 - 5278
  • [50] A Dynamic Trust Framework for Opportunistic Mobile Social Networks
    Wang, Eric Ke
    Li, Yueping
    Ye, Yunming
    Yiu, S. M.
    Hui, Lucas C. K.
    [J]. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2018, 15 (01): : 319 - 329