Privacy-aware routing in sensor networks
Privacy-aware routing in sensor networks
复制标题
DOI：
10.1016/j.comnet.2009.02.002
复制
发表时间：
2009-06
期刊：
影响因子：
--
通讯作者：
Haodong Wang;Bo Sheng;Qun A. Li
中科院分区：
文献类型：
--
作者：
Haodong Wang;Bo Sheng;Qun A. Li
典型的传感器网络应用是监控对象，包括野生动物、车辆和事件，其中关于对象的信息定期发送回接收器。很多时候，出于安全原因，对象需要受到保护。但是，敌手可以检测消息流，并通过与消息流相反的方向移动将消息追溯到其来源。本文旨在通过设计将消息流分配到不同路径的路由协议来最大化源位置私密性，该私密性通过对手的回溯时间来评估。首先，我们给出了任意路由方案的性能界。然后，我们给出了我们的路由方案，在一定的能量约束下，最大化了对手的平均回溯时间，并实现了最大-最小回溯时间。然后，我们提出了一种次优但实用的隐私感知路由方案WRS，并给出了仿真结果。最后，我们将讨论扩展到一个极端对手模型，该模型允许对手部署一个对手传感器网络来监控消息路由活动。因此，我们提出了一种随机调度方案来迷惑对手。为了减少消息传递时间，我们给出了一种近似的消息路由算法。
A typical sensor network application is to monitor objects, including wildlife, vehicles and events, in which information about an object is periodically sent back to the sink. Many times, the object needs to be protected for security reasons. However, an adversary can detect message flows and trace the message back to its source by moving in the reverse direction of the flows. This paper aims to maximize source location privacy, which is evaluated by the adversary’s traceback time, by designing routing protocols that distribute message flows to different routes. First, we give the performance bound for any routing scheme. Then, we present our routing schemes, which maximize the adversary’s average traceback time and achieve max–min traceback time given certain energy constraints. We then propose WRS, a suboptimal but practical privacy-aware routing scheme, and provide simulation results. Finally, we extend the discussion to an extreme adversary model, which allows the adversary to deploy an adversary sensor network to monitor the message routing activities. Accordingly, we propose a random schedule scheme to confuse the adversary. To reduce the message delivery time, we give an approximation algorithm for message routing.