无线传感器网络的位置隐私保护路由

当无线传感器网络用于监控敏感对象时,被监控对象的位置隐私成为一个关键问题。在传感节点发送的一连串信息,经过多跳,向基站报告一个监控对象时,敌手可以反向追踪信息源的位置。基于洪泛的幻影路由具有较小的安全期和较高的能耗。为了使敌手难于跳到跳地反向追踪传感节点通信的信号源,提出了基于定向随机步的幻影路由。在基于定向随机步的幻影路由中,每个消息都经历两个阶段：首先与基于洪泛的幻影路由一样,是一个随机步或定向步,随后是定向随机步直到基站。与基于洪泛的幻影路由相比,基于定向随机步的幻影路由明显具有较大的安全期和较低的能耗。     

FMSLPP: fake-message based sink location privacy preservation for WSNs against global eavesdroppers

Traditional encryption and authentication methods are not effective in preserving sink’s location privacy from a global adversary that could be monitoring the network’s traffic and time-of-arrival of traffic flows. In this paper, we present a novel method named fake-message based sink location privacy preservation (FMSLPP) to protect sink’s location privacy against global eavesdroppers. In this method, we let sensors generate fake messages with a probability before the sink sends a message, in order to confuse an adversary about the sink’s location. We also make each node have approximately the same traffic volume to protect the sink’s location privacy. Simulation results from two approaches of sensor deployment (random deployment or controlled deployment) indicate that FMSLPP makes it very difficult for the global adversary to identify the location of the sink; at the same time, transmission of fake messages does not impact significantly the network’s performance in terms of network life.     

无线传感器网络中的位置隐私保护

随着无线传感器网络的广泛应用,隐私成为无线传感器网络成功使用的主要障碍。当无线传感器网络用于监控敏感对象,被监控对象的位置隐私成为一个重要问题。在传感节点发送一系列分组,通过多跳,向基站报告监控对象时,敌手能够反向追踪分组到信息源位置。基于洪泛的幻影具有消息发送时间长且能量消耗过大的缺陷。为了保护能量受限的无线传感器网络中的位置隐私,提出了定向随机步。定向随机步使敌手难于跳到跳地反向追踪信息源。在定向随机步中,信源节点发出一个分组,此分组被单播给信源节点的父节点。当中介节点收到一个分组,它以等概率的方式转发给它的一个父节点。与基于洪泛的幻影相比,定向随机步具有较小的信息发送时间和较低的能量消耗。特别在中介节点具有多个父节点的情形下,定向随机步具有较大的安全期。     

Anti-localization anonymous routing for Delay Tolerant Network

This paper focuses on the problem of how to allow a source to send a message without revealing its physical location and proposes an anti-localization routing protocol, ALAR, to achieve anonymous delivery in Delay/Disruption Tolerant Networks. The objectives of ALAR are to minimize the probability of a data source being localized and to maximize the destination’s probability of receiving the message. ALAR can protect the sender’s location privacy through message fragmentation and forwarding each segment to different receivers. ALAR is validated on two real-world human mobility datasets. This study indicates that ALAR increases the sender’s anonymity performance by over 81% in different adversary densities with a 5% reduction in delivery ratio.     

Effective fault detection and routing scheme for wireless sensor networks

In a wireless sensor network (WSN), random occurrences of faulty nodes degrade the quality of service of the network. In this paper, we propose an efficient fault detection and routing (EFDR) scheme to manage a large size WSN. The faulty nodes are detected by neighbour node’s temporal and spatial correlation of sensing information and heart beat message passed by the cluster head. In EFDR scheme, three linear cellular automata (CA) are used to manage transmitter circuit/ battery condition/microcontroller fault, receiver circuit fault and sensor circuit fault representation. On the other hand, L-system rules based data routing scheme is proposed to determine optimal routing path between cluster head and base station. The proposed EFDR technique is capable of detecting and managing the faulty nodes in an efficient manner. The simulation results show 86% improvement in the rate of energy loss compared to an existing algorithm.     

Multi-constraint multi-objective QoS aware routing heuristics for query driven sensor networks using fuzzy soft sets

In this paper, a fuzzy based distributed power aware routing scheme considering both energy and bandwidth constraints, especially for query driven applications in the asynchronous duty-cycled wireless sensor networks are devised. The proposed multi-constraint, multi-objective routing optimization approach under strict resource constraints guarantees reliability and fast data delivery along with efficient power management in spite of unreliable wireless links and limited power supply. In query driven applications, the request from the sink to the individual sensor node will be a broadcast message, whereas the individual sensor nodes replies back to sink as unicast messages. In the proposed work, the fuzzy approach and “A Star” algorithm are utilized for satisfying energy and bandwidth constraints to route the broadcast messages of the sink while querying all the sensor nodes in the network. Every node will be provided with a guidance list, which is used to decide the next best neighbor node with good route quality for forwarding the received multi-hop broadcast messages. The route quality of the every node is estimated with fuzzy rules based on the network parameters such as maximum remaining energy, minimum traffic load and better link quality to increase the network lifetime. The provision of overhearing the broadcast messages and acknowledgements within the transmission range minimizes the effort to search for the active time of nodes while routing the broadcast messages with asynchronous scheduling. Further, in the proposed work only the time slot of its nearest neighbor relay node (to which packets are to be forwarded) is learnt to reduce the number of message transmissions in the network. For the unicast message replies, the fuzzy membership function is modified and devised based on the routing metrics such as higher residual energy, minimum traffic loads and minimum hop count under energy and bandwidth constraints. Also, the multi-hop heuristic routing algorithm called Nearest Neighbor Tree is effectively used to reduce the number of neighbors in the guidance list that are elected for forwarding. This helps to increase the individual sensor node’s lifetime, thereby maximizes the network lifetime and guarantees increased network throughput. The simulation results show that the proposed technique reduces repeated transmissions, decreases the number of transmissions, shortens the active time of the sensor nodes and increases the network lifetime for query driven sensor network applications invariant to total the number of sensor nodes and sinks in the network. The proposed algorithm is tested in a small test bed of sensor network with ten nodes that monitors the room temperature.     

WSN in cyber physical systems: Enhanced energy management routing approach using software agents

Recently, the cyber physical system has emerged as a promising direction to enrich the interactions between physical and virtual worlds. Meanwhile, a lot of research is dedicated to wireless sensor networks as an integral part of cyber physical systems. A wireless sensor network (WSN) is a wireless network consisting of spatially distributed autonomous devices that use sensors to monitor physical or environmental conditions. These autonomous devices, or nodes, combine with routers and a gateway to create a typical WSN system. Shrinking size and increasing deployment density of wireless sensor nodes implies the smaller equipped battery size. This means emerging wireless sensor nodes must compete for efficient energy utilization to increase the WSN lifetime. The network lifetime is defined as the time duration until the first sensor node in a network fails due to battery depletion. One solution for enhancing the lifetime of WSN is to utilize mobile agents. In this paper, we propose an agent-based approach that performs data processing and data aggregation decisions locally i.e., at nodes rather than bringing data back to a central processor (sink). Our proposed approach increases the network lifetime by generating an optimal routing path for mobile agents to transverse the network. The proposed approach consists of two phases. In the first phase, Dijkstra’s algorithm is used to generate a complete graph to connect all source nodes in a WSN. In the second phase, a genetic algorithm is used to generate the best-approximated route for mobile agents in a radio harsh environment to route the sensory data to the base-station. To demonstrate the feasibility of our approach, a formal analysis and experimental results are presented.     

一种新的确定性包标记IP追踪算法的研究

目前的IP追踪都是基于反向完整路径追踪,反向完整路径追踪需要ISP的配合,而要取得所有的ISP的配合是一件困难的事情,在这这里提出一种新的基于确定性包标记技术的IP追踪算法,这种实现需要很少的带宽和处理的花费,可以追踪由单个数据包产生的DOS攻击,而且不需揭示网络拓扑的内在结构。     

Reputation-based role assignment for role-based access control in wireless sensor networks

Wireless sensor networks (WSNs) typically consist of large number of sensor nodes, which, depending on the application, are mostly left unattended in open environments for moderately long periods of time. Due to the wireless nature of the medium, it is quite possible that a node can be captured by an adversary, which may lead to its non-cooperative behavior or misbehavior with the rest of the nodes in the network. So, it is necessary to provide a security mechanism in the network that mandates only the authorized nodes to be able to access information. Some of the recent literature suggest using multilevel hierarchical architectures (MHA) in WSN. In such an approach, each group is assigned a task and a different role or level is assigned to nodes within a group. There exists a need for multilevel access control in these types of networks, in order to give authorization based on a node’s role - this is also called role-based access control (RBAC). In this paper, we propose a reputation-based role assigning scheme for RBAC. The main objective of this scheme is to manage reputation locally with minimum communication and delay overhead and to assign appropriate role or level to the deserved nodes in order to increase the throughput of overall network. Other parameters used in our scheme are the bootstrap time and energy. In this paper, we describe our scheme and prove its theoretical correctness. Simulation results show that our scheme leads to an increase in throughput. This scheme leads to increase in throughput by around 32% at the consumption of little more energy.     

Maximizing network lifetime in wireless sensor networks with regular topologies

Limited energy supply (battery-powered) is a crucial problem in wireless sensor networks (WSNs). Sensor node placement schemes and routing protocols are mostly proposed to address this problem. In this paper, we first present how to place sensor nodes by use of a minimal number of them to maximize the coverage area when the communication radius of the sensor node is different from the sensing radius, which results in the application of regular topology to WSNs deployment. With nodes placed at an equal distance and equipped with an equal power supply, the problem of unbalanced energy consumption in 2-D regular topologies becomes more severe and much more difficult to tackle than that in 1-D chains, though the latter is known as an already quite hard problem. We address this problem and propose an adaptive data collection scheme by employing different communication radii for nodes in different locations to balance the energy consumption in WSNs. In order to achieve the ultimate goal of maximizing network lifetime in grid-based WSNs, we give a mathematical formulation, which shows the problem of maximizing network lifetime is a nonlinear programming problem and NP-hard even in the 1-D case. We discuss several heuristic solutions and show that the halving shift data collection scheme is the best solution among them. We also generalize the maximizing network lifetime problem to the randomly-deployed WSNs, which shows the significance of our mathematical formulation for this crucial problem in WSNs.     

Robust load-balanced backbone-based multicast routing in mobile opportunistic networks

Mobile opportunistic network (MON) is an efficient way of communication when there is no persistent connection between nodes. Multicast in MONs can be used to efficiently deliver messages to multiple destination nodes. However, because multiple destination nodes are involved, multicast routing is more complex than unicast and brings a higher communication cost. Backbone-based routing can effectively reduce the network overhead and the complexity of routing scheme. However, the load of backbone nodes is larger than that of regular nodes. If the backbone node’s buffer is exhausted, it will have a significant impact on the performance of the routing scheme. Load balancing can improve the ability of backbone to deal with the change of network load, and backbone maintenance algorithm can provide backbone robustness. In this paper, we propose a robust load-balanced backbone-based multicast routing scheme in MONs. In the backbone construction algorithm, we transform the problem of backbone construction into a multi-objective optimization problem, and propose a multi-objective evolutionary algorithm-based backbone construction algorithm, namely LBMBC-MOEA algorithm. In addition, in order to increase the robustness of the backbone-based routing scheme, we propose a localized multicast backbone maintenance algorithm (MBMA) to deal with the buffer exhaustion of backbone nodes. When a backbone node’s residual buffer is insufficient, MBMA algorithm selects other nodes to replace the backbone node. The results on extensive simulations show that when considering the node buffer size constraints, compared with previous backbone-based multicast routing schemes, our proposed algorithm has better performance, and when the node’s residual buffer is insufficient, MBMA algorithm can significantly improve the performance of the backbone-based multicast routing scheme.     

一种时延保证的QoS路由协议

针对无线传感器网络中多跳视频传输实时性难以保证以及节点失效造成的传输中断问题,本文在比较分析了考虑时延的路由协议基础上,提出并设计了一种保证时延QoS要求可自我修复的路由协议(Self Repaired and Delay Guarantee Routing Protocol)。该协议选择时延最短的节点作为路由节点,缩短了多跳传输时间;在路由表中增加备选路由节点,当某个路由节点失效时,自动启用备选节点修复路由,节省了路由重新建立的时间,保证了视频传输持续性。仿真结果表明该路由协议能够较好地满足无线传感器网络中多跳视频传输的时延要求。     

Impact of sensing coverage on greedy geographic routing algorithms

Greedy geographic routing is an attractive localized routing scheme for wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may fail due to routing voids on random network topologies. We study greedy geographic routing in an important class of wireless sensor networks (e.g., surveillance or object tracking systems) that provide sensing coverage over a geographic area. Our analysis and simulation results demonstrate that an existing geographic routing algorithm, greedy forwarding (GF), can successfully find short routing paths based on local states in sensing-covered networks. In particular, we derive theoretical upper bounds on the network dilation of sensing-covered networks under GF. We also propose a new greedy geographic routing algorithm called Bounded Voronoi Greedy Forwarding (BVGF) that achieves path dilation lower than 4.62 in sensing-covered networks as long as the communication range is at least twice the sensing range. Furthermore, we extend GF and BVGF to achieve provable performance bounds in terms of total number of transmissions and reliability in lossy networks.     

A destination-based approach for cut detection in wireless sensor networks

Wireless sensor networks often suffer from disrupted connectivity caused by its numerous aspects such as limited battery power of a node and unattended operation vulnerable to hostile tampering. The disruption of connectivity, often referred to as network cut, leads to ill-informed routing decisions, data loss and waste of energy. A number of protocols have been proposed to efficiently detect network cuts; they focus solely on a cut that disconnects nodes from the base station. However, a cut detection scheme is truly useful when a cut is defined with respect to multiple destinations (i.e. target nodes), rather than a single base station. Thus, we extend the existing notion of cut detection, and propose an algorithm that enables sensor nodes to autonomously monitor the connectivity to multiple target nodes. We introduce a novel reactive cut detection solution, the point-to-point cut detection, where given any pair of source and destination, a source is able to locally determine whether the destination is reachable or not. Furthermore, we propose a lightweight proactive cut detection algorithm specifically designed for a network scenario with a small set of target destinations. We prove the effectiveness of the proposed algorithms through extensive simulations; specifically, in our network configurations, proposed cut detection algorithms achieve more than an order of magnitude improvement in energy consumption, when coupled with an underlying routing protocol.     

改进的网络编码签名验证方案

在Zhao的网络编码签名验证方案中,攻击者可以使用合法的消息向量伪造消息,并能通过验证,实施污染攻击。针对该方案存在的漏洞,基于计算性Diffie-Hellman问题的难解性,通过在签名验证公式中增加计算元素 ,使攻击者无法伪造消息,从而抵抗污染攻击,提高方案的安全性。     

基于兴趣域的非结构化P2P模型

泛洪式路由（Flooding）是在非结构化对等网络中进行有效资源查找的主要方式,但其路由过程将产生大量冗余消息,因而严重制约了其可扩展性。随节点数增多,泛洪式路由的网络带宽消耗也变得异常严重。针对非结构化P2P网络拓扑的特点,结合对已有的非结构化P2P搜索算法的研究,文章提出了一种基于兴趣域的非结构化P2P搜索算法,使得节点能在短时间内查找到有效的资源,减少了查询信息量,缩短了路由路径,提高了搜索效率。     

数字签名技术在解决密钥泄露方面的发展

密钥泄露对数字签名的危害越来越成为人们关注的焦点，该问题很难找到完全彻底的解决办法，只能尽可能减少其危害。对此专家和学者提出了很多新的数字签名机制，这里详细介绍了其中的一些，并指出它们各自的优缺点。针对在SiBIR数字签名机制中由于网络拥塞或攻击者的恶意拦截使得更新信息丢失造成signer和home base不能保持同步的问题，我们提出了超时同步机制。     

Cost Optimized Switching of Routing Protocol Scheme for IoT Applications

In this work, we propose a context-aware switching of routing protocol scheme for specific application requirements of IoT in real-time using a software-defined networking controller in wireless sensor networks. The work planned has two stages i) Selection of suitable routing protocol (RP) for given IoT applications using higher cognitive process and ii) Deployment of the corresponding routing protocol. We use the supervised learning-regression method for classification of the routing protocol while considering the network parameters like stability, path delay, energy utilization, and throughput. The chosen routing protocol will be set in the sensor network using a software-defined networking controller in an exceedingly flexible manner during the second stage. Extensive simulation has been done and results are evaluated to point out the strength of the proposed work, while dynamically varying the specific requirements of IoT applications. We observe that the work proposed is path-breaking the prevailing methods, where a specific routing protocol is employed throughout the period of time. It’s clearly shown that the proposed, Low-cost Context-Aware Protocol Switching (LCAPS) scheme is efficient in improving the performance of the sensor network and also meets the specific application requirements of IoT by using Software-Defined Wireless Sensor Networks SDWSNs.     

A secure routing scheme based on social network analysis in wireless mesh networks无线网状网中一种基于社会网络分析的安全路由机制

As an extension of wireless ad hoc and sensor networks, wireless mesh networks (WMNs) are employed as an emerging key solution for wireless broadband connectivity improvement. Due to the lack of physical security guarantees, WMNs are susceptible to various kinds of attack. In this paper, we focus on node social selfish attack, which decreases network performance significantly. Since this type of attack is not obvious to detect, we propose a security routing scheme based on social network and reputation evaluation to solve this attack issue. First, we present a dynamic reputation model to evaluate a node’s routing behavior, from which we can identify selfish attacks and selfish nodes. Furthermore, a social characteristic evaluation model is studied to evaluate the social relationship among nodes. Groups are built based on the similarity of node social status and we can get a secure routing based on these social groups of nodes. In addition, in our scheme, nodes are encouraged to enter into multiple groups and friend nodes are recommended to join into groups to reduce the possibility of isolated nodes. Simulation results demonstrate that our scheme is able to reflect node security status, and routings are chosen and adjusted according to security status timely and accurately so that the safety and reliability of routing are improved.