Communication-efficient Distributed Multi-resource Allocation

In several smart city applications, multiple resources must be allocated among competing agents that are coupled through such shared resources and are constrained --- either through limitations of communication infrastructure or privacy considerations. We propose a distributed algorithm to solve such distributed multi-resource allocation problems with no direct inter-agent communication. We do so by extending a recently introduced additive-increase multiplicative-decrease (AIMD) algorithm, which only uses very little communication between the system and agents. Namely, a control unit broadcasts a one-bit signal to agents whenever one of the allocated resources exceeds capacity. Agents then respond to this signal in a probabilistic manner. In the proposed algorithm, each agent makes decision of its resource demand locally and an agent is unaware of the resource allocation of other agents. In empirical results, we observe that the average allocations converge over time to optimal allocations.Comment: To appear in IEEE International Smart Cities Conference (ISC2 2018), Kansas City, USA, September, 2018. arXiv admin note: substantial text overlap with arXiv:1711.0197

Trajectory Design of Laser-Powered Multi-Drone Enabled Data Collection System for Smart Cities

This paper considers a multi-drone enabled data collection system for smart cities, where there are two kinds of drones, i.e., Low Altitude Platforms (LAPs) and a High Altitude Platform (HAP). In the proposed system, the LAPs perform data collection tasks for smart cities and the solar-powered HAP provides energy to the LAPs using wireless laser beams. We aim to minimize the total laser charging energy of the HAP, by jointly optimizing the LAPs’ trajectory and the laser charging duration for each LAP, subject to the energy capacity constraints of the LAPs. This problem is formulated as a mixed-integer and non-convex Drones Traveling Problem (DTP), which is a combinatorial optimization problem and NP-hard. We propose an efficient and novel search algorithm named DronesTraveling Algorithm (DTA) to obtain a near-optimal solution. Simulation results show that DTA can deal with the large scale DTP (i.e., more than 400 data collection points) efficiently. Moreover, the DTA only uses 5 iterations to obtain the nearoptimal solution whereas the normal Genetic Algorithm needs nearly 10000 iterations and still fails to obtain an acceptable solution

Performance Comparison of Contention- and Schedule-based MAC Protocols in Urban Parking Sensor Networks

Network traffic model is a critical problem for urban applications, mainly because of its diversity and node density. As wireless sensor network is highly concerned with the development of smart cities, careful consideration to traffic model helps choose appropriate protocols and adapt network parameters to reach best performances on energy-latency tradeoffs. In this paper, we compare the performance of two off-the-shelf medium access control protocols on two different kinds of traffic models, and then evaluate their application-end information delay and energy consumption while varying traffic parameters and network density. From the simulation results, we highlight some limits induced by network density and occurrence frequency of event-driven applications. When it comes to realtime urban services, a protocol selection shall be taken into account - even dynamically - with a special attention to energy-delay tradeoff. To this end, we provide several insights on parking sensor networks.Comment: ACM International Workshop on Wireless and Mobile Technologies for Smart Cities (WiMobCity) (2014

Adaptive fog service placement for real-time topology changes in Kubernetes clusters

Recent trends have caused a shift from services deployed solely in monolithic data centers in the cloud to services deployed in the fog (e.g. roadside units for smart highways, support services for IoT devices). Simultaneously, the variety and number of IoT devices has grown rapidly, along with their reliance on cloud services. Additionally, many of these devices are now themselves capable of running containers, allowing them to execute some services previously deployed in the fog. The combination of IoT devices and fog computing has many advantages in terms of efficiency and user experience, but the scale, volatile topology and heterogeneous network conditions of the fog and the edge also present problems for service deployment scheduling. Cloud service scheduling often takes a wide array of parameters into account to calculate optimal solutions. However, the algorithms used are not generally capable of handling the scale and volatility of the fog. This paper presents a scheduling algorithm, named "Swirly", for large scale fog and edge networks, which is capable of adapting to changes in network conditions and connected devices. The algorithm details are presented and implemented as a service using the Kubernetes API. This implementation is validated and benchmarked, showing that a single threaded Swirly service is easily capable of managing service meshes for at least 300.000 devices in soft real-time