Yazar "Kebe, Gaoussou Youssouf" seçeneğine göre listele

Listeleniyor 1 - 2 / 2
  • Küçük Resim Yok
    Öğe
    A New Approach to Simulating Node Deployment for Smart City Applications Using Geospatial Data
    (Ieee, 2019) Şentürk, İzzet Fatih; Kebe, Gaoussou Youssouf
    The rapid urbanization combined with the continuing growth of the world's overall population entails efficient provisioning of services and infrastructure in the cities. Some of the challenges of this gradual shift can be addressed by the global phenomenon of smart cities. Despite various definitions, the concept refers to data-driven solutions to operate cities more efficiently. As the infrastructure requires constant data collection, sensors and various wireless communication technologies are the building blocks of smart cities. In this paper, we consider a smart city application to monitor the road network obtained through one of the volunteered geographic information (VGI) systems. To analyze the impact of the employed wireless communication technology on the network connectivity, we have deployed sensors to the infrastructure according to the obtained geospatial data and varied the transmission range of the sensors. The results show considerable decline in the number of occurred partitions and the minimum number of relay nodes required to ensure network-wide connectivity when the transmission range is increased.
  • Küçük Resim Yok
    Öğe
    A Novel Shortest Path Routing Algorithm for Wireless Data Collection in Transportation Networks
    (Ieee, 2019) Şentürk, İzzet Fatih; Kebe, Gaoussou Youssouf
    This paper presents a heuristic solution to the shortest path routing problem in a road network where source and target locations are defined in a continuous plane. The problem arises when a wireless mobile entity is required to communicate with wireless nodes deployed apart from each other with a distance greater than their communication range and the mobility is limited with the transportation network layout. The goal is constructing a route which minimizes the mobility cost. Travelling salesman problem (TSP) is a classic discrete optimization problem to identify optimal routes between particular cities. Unlike TSP, our problem defines a neighborhood based on the node location and wireless communication range and seeks the optimal path between the neighborhoods. This paper defines mobility cost in terms of distance and delay separately. However, based on the defined cost function, the solution is applicable to other metrics as well including energy consumption.