Mobile IP Geolocation Based on District Anchor Without Cooperation of Users or Internet Service Providers

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Ruixiang Li;Xiaoyun Yuan;Meijuan Yin;Xiangyang Luo
{"title":"Mobile IP Geolocation Based on District Anchor Without Cooperation of Users or Internet Service Providers","authors":"Ruixiang Li;Xiaoyun Yuan;Meijuan Yin;Xiangyang Luo","doi":"10.1109/TNET.2024.3471335","DOIUrl":null,"url":null,"abstract":"Mobile IP geolocation aims to obtain a mobile device’s geographic location by IP. This technology is widely used in preventing financial risk, investigating cybercrime, and delivering targeted information. Currently, there are three types of IP geolocation: based on cooperation, querying in database, or network measurement. However, since restricted cooperation, low-reliability databases, and unresponsive mobile IPs, existing technologies are hard to geolocate fine-grained location of mobile IP. In this paper, we propose the concept of district anchor, and propose a non-cooperative mobile IP geolocation scheme, including three parts: acquiring district anchors by clustering, evaluating the reliability of district anchors, and geolocating mobile IPs. We also give implemented approach of this scheme. Instead of using existing clustering algorithms treating IPs and geolocations in no particular order, we propose two-stages clustering algorithm (IPG2C) to acquire district anchors, and establish reliability evaluation mechanism by IP distribution and spatial distribution of cluster. Eventually, using obtained reliable district anchors, we use “subnet geolocation” strategy to geolocate mobile IPs. The experimental results in 10 cities show that: 1) our scheme can be used to geolocate mobile IPs without cooperation; 2) the mean geolocation error is 12.47km, where precision of 56.67% of mobile IPs is street-level and minimum error is only 13m; 3) that the mean geolocation error of the anchor-based method is smaller than that of the landmark-based method; 4) compared with 13 clustering algorithms (e.g., K-Means++, Mean Shift, DBSCAN, and GMM), mean geolocation error using IPG2C’s district anchors is reduced by 26.62%~50.77%.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"5507-5523"},"PeriodicalIF":3.0000,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE/ACM Transactions on Networking","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10714500/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Mobile IP geolocation aims to obtain a mobile device’s geographic location by IP. This technology is widely used in preventing financial risk, investigating cybercrime, and delivering targeted information. Currently, there are three types of IP geolocation: based on cooperation, querying in database, or network measurement. However, since restricted cooperation, low-reliability databases, and unresponsive mobile IPs, existing technologies are hard to geolocate fine-grained location of mobile IP. In this paper, we propose the concept of district anchor, and propose a non-cooperative mobile IP geolocation scheme, including three parts: acquiring district anchors by clustering, evaluating the reliability of district anchors, and geolocating mobile IPs. We also give implemented approach of this scheme. Instead of using existing clustering algorithms treating IPs and geolocations in no particular order, we propose two-stages clustering algorithm (IPG2C) to acquire district anchors, and establish reliability evaluation mechanism by IP distribution and spatial distribution of cluster. Eventually, using obtained reliable district anchors, we use “subnet geolocation” strategy to geolocate mobile IPs. The experimental results in 10 cities show that: 1) our scheme can be used to geolocate mobile IPs without cooperation; 2) the mean geolocation error is 12.47km, where precision of 56.67% of mobile IPs is street-level and minimum error is only 13m; 3) that the mean geolocation error of the anchor-based method is smaller than that of the landmark-based method; 4) compared with 13 clustering algorithms (e.g., K-Means++, Mean Shift, DBSCAN, and GMM), mean geolocation error using IPG2C’s district anchors is reduced by 26.62%~50.77%.
基于区域锚的移动IP地理定位,无需用户或互联网服务提供商的合作
移动IP地理定位的目的是通过IP获取移动设备的地理位置。该技术广泛应用于防范金融风险、调查网络犯罪和提供有针对性的信息。目前,IP地理定位主要有三种类型:基于协作、数据库查询和网络测量。然而,由于合作受限、数据库可靠性低、移动IP响应缓慢等原因,现有技术难以实现移动IP的细粒度定位。本文提出了区域锚点的概念,并提出了一种非合作的移动IP地理定位方案,包括聚类获取区域锚点、区域锚点可靠性评估和移动IP地理定位三个部分。并给出了该方案的实现方法。针对现有聚类算法对IP和地理位置的无先后性处理,提出了两阶段聚类算法(IPG2C)获取区域锚点,并通过IP分布和聚类的空间分布建立可靠性评估机制。最后,利用获得的可靠区域锚点,采用“子网地理定位”策略对移动ip进行地理定位。在10个城市的实验结果表明:1)该方案可以实现无需合作的移动ip定位;2)平均地理定位误差为12.47km,其中56.67%的移动ip精度为街道级,最小误差仅为13m;3)基于锚点的方法平均地理定位误差小于基于地标的方法;4)与k - meme++、Mean Shift、DBSCAN、GMM等13种聚类算法相比,IPG2C区域锚点的平均地理定位误差降低了26.62%~50.77%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE/ACM Transactions on Networking
IEEE/ACM Transactions on Networking 工程技术-电信学
CiteScore
8.20
自引率
5.40%
发文量
246
审稿时长
4-8 weeks
期刊介绍: The IEEE/ACM Transactions on Networking’s high-level objective is to publish high-quality, original research results derived from theoretical or experimental exploration of the area of communication/computer networking, covering all sorts of information transport networks over all sorts of physical layer technologies, both wireline (all kinds of guided media: e.g., copper, optical) and wireless (e.g., radio-frequency, acoustic (e.g., underwater), infra-red), or hybrids of these. The journal welcomes applied contributions reporting on novel experiences and experiments with actual systems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信