Backup gateways for IoT mesh network using order-k hops Voronoi diagram

摘要

Mesh network is a common topology in deploying Edge/Fog computing in IoT due to its robustness, expandability and reliability. In the Mesh topology, gateways are the key role for the entire networks to communicate with the clouds. In order to ensure network availability in a failover scenario, a router must always have backup gateways to maintain mesh robustness during primary gateway failover. Order-k Voronoi diagram is known for its capability to identify k-nearest facilities and ensure that all objects will always have k-nearest backup facilities. In this paper, we utilize order-k Voronoi diagram with sink tree to produce order-k hops Voronoi diagram to identify k-gateways coverage with minimal hops for all routers as the backup gateways. Our experiment shows that order-k hops Voronoi diagram is more effective in ensuring that all routers have backup gateways with a minimum number of hops than an ordinary order-k network Voronoi diagram, hence reduce network latency for the entire mesh networks and maintain the robustness of the mesh network.