scholarly journals Smart City Taxi Trajectory Coverage and Capacity Evaluation Model for Vehicular Sensor Networks

2021 ◽  
Vol 13 (19) ◽  
pp. 10907
Author(s):  
Salman Naseer ◽  
William Liu ◽  
Nurul I. Sarkar ◽  
Muhammad Shafiq ◽  
Jin-Ghoo Choi

In a smart city, a large number of smart sensors are operating and creating a large amount of data for a large number of applications. Collecting data from these sensors poses some challenges, such as the connectivity of the sensors to the data center through the communication network, which in turn requires expensive infrastructure. The delay-tolerant networks are of interest to connect smart sensors at a large scale with their data centers through the smart vehicles (e.g., transport fleets or taxi cabs) due to a number of virtues such as data offloading, operations, and communication on asymmetric links. In this article, we analyze the coverage and capacity of vehicular sensor networks for data dissemination between smart sensors and their data centers using delay-tolerant networks. Therein, we observed the temporal and spatial movement of vehicles in a very large coverage area (25 × 25 km2) in Beijing. Our algorithm sorts the entire city into different rectangular grids of various sizes and calculates the possible chances of contact between smart sensors and taxis. We further calculate the vehicle density, coverage, and capacity of each grid through a real-time taxi trajectory. In our proposed study, numerical and spatial mining show that even with a relatively small subset of vehicles (100 to 400) in a smart city, the potential for data dissemination is as high as several petabytes. Our proposed network can use different cell sizes and various wireless technologies to achieve significant network area coverage. When the cell size is greater than 500 m2, we observe a coverage rate of 90% every day. Our findings prove that the proposed network model is suitable for those systems that can tolerate delays and have large data dissemination networks since the performance is insensitive to the delay with high data offloading capacity.

2020 ◽  
Vol 12 (8) ◽  
pp. 3140 ◽  
Author(s):  
Pei Pei ◽  
Zongjie Huo ◽  
Oscar Sanjuán Martínez ◽  
Rubén González Crespo

Presently, energy is considered a significant resource that grows scarce with high demand and population in the global market. Therefore, a survey suggested that renewable energy sources are required to avoid scarcity. Hence, in this paper, a smart, sustainable probability distribution hybridized genetic approach (SSPD-HG) has been proposed to decrease energy consumption and minimize the total completion time for a single machine in smart city machine interface platforms. Further, the estimated set of non-dominated alternative using a multi-objective genetic algorithm has been hybridized to address the problem, which is mathematically computed in this research. This paper discusses the need to promote the integration of green energy to reduce energy use costs by balancing regional loads. Further, the timely production of delay-tolerant working loads and the management of thermal storage at data centers has been analyzed in this research. In addition, differences in bandwidth rates between users and data centers are taken into account and analyzed at a lab scale using SSPD-HG for energy-saving costs and managing a balanced workload.


2016 ◽  
Vol 67 ◽  
pp. 128-146 ◽  
Author(s):  
Sobin CC ◽  
Vaskar Raychoudhury ◽  
Gustavo Marfia ◽  
Ankita Singla

2010 ◽  
Vol 171-172 ◽  
pp. 561-564
Author(s):  
Hui Ye ◽  
Zhi Gang Chen ◽  
Xiao Jian Shen

Recently, many researchers focus on delay tolerant networks (DTN). In DTN, the mobile characteristic of nodes is used to help transfer data. Therefore, how to use the cooperative relations and cache resource of nodes effectively to avoid network congestion and improve network performance is an important issue. In this paper, we proposed a cooperative caching policy based on human mobile patterns, which referred as HMP-Cache. The node movement characteristics are discussed in detail in HMP-Cache. HMP-Cache uses the standard of target address matching to choose cooperative caching nodes. In addition, the sharing caching information is done by synchronization of caching table in local region. Therefore, the impact of useless data dissemination of multiple hops is reduced. And the shortcoming of limited caching resources is compensated. The simulation results show that our policy can control the network cost effectively. Also, the remote data latency is reduced.


Sign in / Sign up

Export Citation Format

Share Document