Geometric partitioning and robust ad-hoc network design

We present fast approximation algorithms for the problem of dividing a given convex geographic region into smaller sub-regions so as to distribute the workloads of a set of vehicles. Our objective is to partition the region in such a fashion as to ensure that vehicles are capable of communicating with one another under limited communication radii. We consider variations of this problem in which sub-regions are constrained to have equal area or be convex, and as a

• Type: Journal
• Year: 2016
• Where: ANOR
• Authors: John Gunnar Carlsson, Mehdi Behroozi, Xiang Li
• Keywords: ANOR 2016, Computer Networks