Collecting sensed data with opportunistic networks: The case of contact information overhead
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 senso...
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2017
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/76290/1/MaznahKamat_CollectingSensedDatawithOpportunisticNetworks.pdf http://eprints.utm.my/id/eprint/76290/ https://www.scopus.com/inward/record.uri?eid=2-s2.0-85030153236&doi=10.3390%2finfo8030108&partnerID=40&md5=e54c885ae3b18948e1770a036bfa8f0e |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|