版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Lafayette Coll Dept Comp Sci Easton PA 18042 USA Stevens Inst Technol Dept Elect & Comp Engn Hoboken NJ 07030 USA
出 版 物:《WIRELESS NETWORKS》 (无线网络)
年 卷 期:2012年第18卷第1期
页 面:45-58页
核心收录:
学科分类:0810[工学-信息与通信工程] 0808[工学-电气工程] 0809[工学-电子科学与技术(可授工学、理学学位)] 08[工学] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:National Science Foundation [CNS-0954020, CCF-1018270] Direct For Computer & Info Scie & Enginr Division Of Computer and Network Systems Funding Source: National Science Foundation Direct For Computer & Info Scie & Enginr Division of Computing and Communication Foundations Funding Source: National Science Foundation
主 题:Wireless localization Signal strength attacks Robust algorithms Design principle
摘 要:Received signal strength (RSS) based algorithms have been very attractive for localization since they allow the reuse of existing communication infrastructure and are applicable to many commodity radio technologies. Such algorithms, however, are sensitive to a set of non-cryptographic attacks, where the physical measurement process itself can be corrupted by adversaries. For example, the attacker can perform signal strength attacks by placing an absorbing or reflecting material around a wireless device to modify its RSS readings. In this work, we first formulate the all-around signal strength attacks, where similar attacks are launched towards all landmarks, and experimentally show the feasibility of launching such attacks. We then propose a general principle for designing RSS-based algorithms so that they are robust to all-around signal strength attacks. To evaluate our approach, we adapt a set of representative RSS-based localization algorithms according to our principle. We experiment with both simulated attacks and two sets of real attack scenarios. All the experiments show that our design principle can be applied to a wide spectrum of algorithms to achieve comparable performance with much better robustness.