Heterogeneous Cooperative Localization for Social Networks
- PDF / 1,000,719 Bytes
- 12 Pages / 595.276 x 790.866 pts Page_size
- 17 Downloads / 246 Views
Heterogeneous Cooperative Localization for Social Networks Ruijun Fu • Guanqun Bao • Yunxing Ye Kaveh Pahlavan
•
Received: 18 March 2013 / Accepted: 19 August 2013 / Published online: 16 November 2013 Ó Springer Science+Business Media New York 2013
Abstract Location-aware techniques has become a hot research topic with great value in commercial and military applications. Cooperative localization, which utilizes multiple sensors in portable devices to estimate locations of the mobile users in the social networks, is one of the most promising solution for the indoor geo-location. Traditional cooperative localization methods are based on ranging techniques, they are highly dependent on the distance interpreted from the received signal strength (RSS) or time of arrival from anchors. However, a precise ranging procedure demands high performance hardware which would increase the cost to the current mobile platform. In this paper, we describes four ranging-free probabilistic cooperative localization algorithms: centroid scheme, nearest neighbor scheme, kernel scheme and AP density scheme to improve the accuracy for the indoor geo-location using current mobile devices. Since the GPS sensor embedded in the smart phone is able to provide accurate location information in the outdoor area, those mobile nodes can be used as calibrated anchors. The position of the indoor mobile node can be estimated by exchanging locations and RSSs from shared wireless access points information between the target node and anchor nodes. An empirical
R. Fu (&) G. Bao Y. Ye K. Pahlavan Center for Wireless Information Network Studies, Department of ECE, Worcester Polytechnic Institute, Worcester, MA, USA e-mail: [email protected] G. Bao e-mail: [email protected] Y. Ye e-mail: [email protected] K. Pahlavan e-mail: [email protected]
123
evaluation of the system is given to demonstrate the feasibility of these cooperative localization algorithms by reporting the results in a real-world environments, e.g. suburban area and city downtown. Moreover, we compared our results with the WiFi positioning system made by Skyhook Wireless to validate the accuracy of the proposed algorithms. Meanwhile, a Monte Carlo simulation is carried out to evaluate the performance of the cooperative algorithms under different scenarios. Results show that given the same scenario setting, the AP density scheme and kernel scheme outperform than other schemes. Keywords Cooperative localization Social networks Received signal strength Time of Arrival Centroid scheme 1 Introduction In recent years, there has been an emerging interest in location-aware computing [1, 2] for ubiquitous mobile computing networks. Mobile platforms such as smart phones and tablets are becoming the new trend in wireless networking devices. Popular smart phones use the GPS sensor and the WiFi sensor to provide the location estimates of these devices and tens of thousands of applications such as Yelp and Kayak are using the locations to support their applications. WiFi localization is the most domi
Data Loading...
