Mill: Scalable area management for P2P network based on geographical location

With the rapid rise in the demand for location related service, communication devices such as PDAs or cellar phones must be able to search and manage information related to the geographical location. To leverage location-related information is useful to get an in-depth perspective on environmental circumstances, traffic situations and/or other problems. To handle the large number of information and queries communication devices create in the current ubiquitous environment, some scalable mechanism must be required. In this paper, we propose a peer-to-peer network system called "Mill" which can efficiently handle information related to the geographical location. To simplify the management of the location related information, we convert two dimensional coordinates into one dimensional circumference. Using this technique, Mill can search information by (9(log N). Mill does not adopt any flooding method, and it reduces the amount of search queries compared with other P2P networks using flooding. DHT networks also do not leverage flooding and have good features. Simulation results show that the performance of Mill is good as well as other DHT networks. DHTs support only exact match lookups. The exact match is not suitable for searching information of a particular region. Mill provides an effective region search, by which users can search flexibly location-related information from small regions to large regions.