László Blázovics

Learn More
In this paper we present a distributed algorithm, which enables to follow and surround moving objects by a swarm of homogenous robots that only use local sensing. We introduce the multi orbit surrounding problem and present a solution for it. We prove that our solution always guarantees that the robots enclose the target and circulate around them. We also(More)
We consider the focused coverage self-deployment problem in mobile sensor networks, where an area with maximum radius around a Point of Interest (POI) must be covered without sensing holes. Li et al. [9][10] described several algorithms solving this problem. They showed that their algorithms terminate in finite time. We present a modified version of the(More)
—In this paper we present a distributed localized algorithm for the problem, where a group of autonomous mobile robots have to capture a target by forming a circle around it. The robots do not have memory of the past (oblivious) and only use local sensing. Dedicated communication between the robots is not needed. We introduce the discrete multi-orbit target(More)
—In areas where Internet access is only sporadically available, or not available at all, delivering content (text, image, video, audio, application, etc.) to the people is not easy. In this paper, we introduce a novel method to spread content in such areas in a mobile peer-to-peer way. First we describe the architecture of the system along with the proposed(More)
This paper is looking into the possibility of multimedia content distribution over multiple mobile platforms forming wireless peer--to--peer networks. State of the art mobile networks are centralized and base station or access point oriented. Current developments break ground for device to device communication. In this paper we will introduce a mobile(More)
  • 1