In applications like long range interpersonal communication administrations and internet diversions, numerous moving clients which structure a gathering may wish to be ceaselessly told about the best gathering point from their areas. To diminish the correspondence recurrence of the application server, a guaranteeing system is to tackle this issue is to utilize the idea of safe areas, which catch the legitimacy of question results as for the clients' areas. Shockingly, the safe districts in our issue display qualities such as sporadic shapes and between conditions, which render existing systems that process a solitary safe district inapplicable to our issue. To handle these difficulties, we first inspect the states of safe districts in our issue's setting and propose possible rough guesses for them. We plan proficient calculations for registering these safe districts. We likewise consider a variation of the issue called the aggregate ideal gathering point and expand our answers for fathom this variation. Tries different things with both genuine and manufactured information which shows the proposition regarding computational and correspondence costs.