Designing Anonymity Server based on K Optimal Principle for Privacy Preserving Protocol

There is need to secure mobile phones locations by privacy frame work which utilizes K optimal principles. This improves the location position and tracking ability of Cell phones. Most of the time quality of service cannot be provided because K no. of users may not be available at the time of request. This motivates to create dummy requests at real time, to assure K principle. Another motivation is to split additional load that occurs on Location Based Services (LBS) for adding Anonymization Server (AS) in between Mobile Station (MS) and LBS. To find out nearby location like banks, hotels etc. An algorithm that process mobile request using K secrecy with variety of considerations and different parameters like real world traffic volume data and dummy mobile users generated practically by mobile objects generator to achieve K optimal principle. By this temporal clocking problem solved as there is no waiting request.