• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.655-667
• /
• 2006

Due to the rapid development in mobile communication technologies, the usage of mobile devices such as cellular phones and PDAs becomes increasingly popular. One of the best ways to maximize the usability of mobile devices is to make them aware of their current locations and the locations of other fixed and mobile objects. In this paper, we propose a cost-effective Bus Information System, ACE-BIS, which utilizes a mobile device to retrieve the bus routes to reach a destination from the current location. To accomplish this task, ACE-BIS maintains a small amount of information on bus stops and bus routes in a mobile device and runs a heuristic routing algorithm based on such information. When a user asks more accurate route information or calls for a 'leave later query', ACE-BIS entrusts the task to a server into which real-time traffic and bus location information is being collected. By separating the roles into a mobile device and a server, ACE-BIS is able to provide bus routes at the lowest cost for wireless communications, without imposing much burden to a server. The results of extensive experiments revealed that ACE-BIS is effective and scalable in most experimental settings.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.99-110
• /
• 2009

Currently, there are many applications being developed based on sensor network technology. A tracking method for moving objects in sensor network is one of the main issue of this field. There is a little research on this issue, but most of the existing work has two problems. The first problem is a communication overhead for visiting sensor nodes many times to track a moving object. The second problem is an disability for dealing with many moving objects at a time. To resolve the problems, we, in this paper, propose a signature-based tracking method using efficient data aggregation for moving objects, called SigMO-TRK. For this, we first design a local routing hierarchy tree to aggregate moving objects' trajectories efficiently by using a space filtering technique. Secondly, we do the tracking of all trajectories of moving objects by using signature in a efficient way, our approach generates signatures to method. In addition, by extending the SigMO-TRK, we can retrieve the similar trajectories of moving objects for given a query. Finally, by using the TOSSIM simulator, we show that our signature-based tracking method outperforms the existing tracking method in terms of energy efficiency.

• Journal of Advanced Navigation Technology
• /
• v.15 no.6
• /
• pp.1015-1024
• /
• 2011

Mobile P2P protocols in ad-hoc networks have gained large attention recently. Although there has been much research on P2P algorithms for wired networks, existing P2P protocols are not suitable for mobile ad-hoc networks because they do not consider mobility of peers. This study proposes a new cluster-based P2P protocol for ad hoc networks which utilizes peer mobility. In typical cluster-based P2P algorithms, each cluster has a super peer and other peers of the cluster register their file list to the super peer. High mobility peers would cause a lot of file list registration traffic because they hand-off between clusters frequently. In the proposed scheme, while peers with low mobility behave in the same way as the peers of the typical cluster-based P2P schemes, peers with high mobility behave differently. They inform their entrance to the cluster region to the super peer but they do not register their file list to the super peer. When a peer wishes to find a file, it first searches the registered file list of the super peer and if fails, query message is broadcasted. We perform mathematical modeling, analysis and optimization of the proposed scheme regarding P2P traffic and associated routing traffic. Numerical results show that the proposed scheme performs much better than or similar to the typical cluster-based P2P scheme and flooding based Gnutella.