Collecting sensed data with opportunistic networks: The case of contact information overhead

被引:1
|
作者
Amah T.E. [1 ]
Kamat M. [1 ]
Abu Bakar K. [1 ]
Rahman S.O.A. [1 ]
Mohammed M.H. [1 ]
Abali A.M. [1 ]
Moreira W. [2 ,3 ]
Oliveira A., Jr. [4 ]
机构
[1] Department of Computer Science, Faculty of Computing, Universiti Teknologi Malaysia (UTM), Skudai, Johor
[2] Fraunhofer-AICOS, Porto
[3] PPGMO, Federal University of Goiás, Catalão, GO
[4] INF, Federal University of Goiás, Goiânia, GO
来源
Amah, Tekenate E. (amatek008@gmail.com) | 1600年 / MDPI AG卷 / 08期
关键词
Delay tolerant data; Internet of things; Opportunistic networks; Routing; Sensed data collection; Smart City; Smartphones; Wireless sensors;
D O I
10.3390/info8030108
中图分类号
学科分类号
摘要
The rising human population in urban environments drives the mission towards smart cities, which envisions a wide deployment of sensors in order to improve the quality of living. In this regard, opportunistic networks (OppNets) present an economical means of collecting delay tolerant data from sensors to their respective gateways for providing various Smart City services. Due to the distributed nature of the network, encounter-based routing protocols achieve acceptable throughput by requiring nodes to exchange and update contact information on an encounter basis. Unfortunately, sufficient insight into the associated overhead is lacking in the literature. Hence, we contribute by modelling contact information overhead and investigating its impact on OppNet routing, particularly in terms of data exchange success and energy consumption on portable handheld devices. Our findings reveal that the expected contact information overhead in Smart City scenarios significantly reduces data exchange success and increases energy consumption on portable handheld devices, thereby threatening the feasibility of the technology. We address this issue by proposing an algorithm that can be incorporated into encounter-based routing protocols to reduce contact information overhead without compromising throughput. Simulation results show that our proposed algorithm reduces the average contact information overhead, increases throughput and reduces average energy consumption. © 2017 by the authors.
引用
收藏
相关论文
共 50 条
  • [1] Preparing opportunistic networks for smart cities: Collecting sensed data with minimal knowledge
    Amah, Tekenate E.
    Kamat, Maznah
    Abu Bakar, Kamalrulnizam
    Moreira, Waldir
    Oliveira, Antonio, Jr.
    Batista, Marcos A.
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2020, 135 : 21 - 55
  • [2] Information Epidemics Control for Data Delivery in Opportunistic Networks
    Aung, Cherry Ye
    Ali, G. G. Md. Nawaz
    Zhao, Ming
    Cai, Ruojun
    Chong, Peter Han Joo
    2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2016,
  • [3] Contact Surround in Opportunistic Networks
    Belblidia, Nadjet
    de Amorim, Marcelo Dias
    Leguay, Jeremie
    Conan, Vania
    Crowcroft, Jon
    Fdida, Serge
    2010 IEEE 21ST INTERNATIONAL SYMPOSIUM ON PERSONAL INDOOR AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2010, : 2499 - 2504
  • [4] Reducing Energy Consumption and Overhead Based on Mobile Health in Big Data Opportunistic Networks
    Wu, Jia
    Chen, Zhigang
    WIRELESS PERSONAL COMMUNICATIONS, 2017, 92 (04) : 1365 - 1385
  • [5] Reducing Energy Consumption and Overhead Based on Mobile Health in Big Data Opportunistic Networks
    Jia Wu
    Zhigang Chen
    Wireless Personal Communications, 2017, 92 : 1365 - 1385
  • [6] Overhead Reducing Information Dissemination Strategies for Opportunistic Communications
    Simon, V.
    Bacsardi, L.
    Varga, E.
    Csvorics, T.
    Berces, M.
    Szabo, S.
    Imre, S.
    MWCN 07: PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON MOBILE AND WIRELESS COMMUNICATION NETWORKS, 2007, : 171 - 175
  • [7] Information cache management and data transmission algorithm in opportunistic social networks
    Wu, Jia
    Chen, Zhigang
    Zhao, Ming
    WIRELESS NETWORKS, 2019, 25 (06) : 2977 - 2988
  • [8] Information cache management and data transmission algorithm in opportunistic social networks
    Jia Wu
    Zhigang Chen
    Ming Zhao
    Wireless Networks, 2019, 25 : 2977 - 2988
  • [9] Predicting Temporal Social Contact Patterns for Data Forwarding in Opportunistic Mobile Networks
    Zhou, Huan
    Leung, Victor C. M.
    Zhu, Chunsheng
    Xu, Shouzhi
    Fan, Jialu
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2017, 66 (11) : 10372 - 10383
  • [10] PCV: Predicting Contact Volume for Reliable and Efficient Data Transfers in Opportunistic Networks
    Qayyum, Shiraz
    Shahriar, Mehrab
    Kumar, Mohan
    Das, Sajal K.
    PROCEEDINGS OF THE 2013 38TH ANNUAL IEEE CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN 2013), 2013, : 801 - +