基于频率域多目标MANETs可信路由决策研究

移动Ad-hoc网络(MANETs)具有开放的媒质,动态的拓扑结构,分布式的合作和受限的网络能力等基本特点。网络中移动节点具有匿名性和高度自治的特点,网络通讯依靠在通信路径上的中间节点转发数据包,实现无线传输范围外节点间的正常通信。该文提出了一种独特的MANETs中基于频率下多目标可信路由决策算法,它和现在大多数路由算法都是在时间域下使用单一约束参数选择路由的方式截然不同。利用概率理论分析安全和可信路由,基于概率密度函数的时频相互转化,减小计算复杂度,解决MEANTs中节点间缺乏物理安全以及在低信任水平和节点相互勾结扰乱网络操作情况下,发现可信安全路由难的问题。实例分析证明了此算法的可行性。     

A distributed,multi‐hop,adaptive, tree‐based energy‐balanced routing approach

To accomplish the primary objective of data sensing and collection of wireless sensor networks (WSN), the design of an energy efficient routing algorithm is very important. However, the energy constrained sensing nodes along with the intrinsic properties of the (WSN) environment makes the routing a challenging task. To overcome this routing dilemma, an improved distributed, multi‐hop, adaptive, tree‐based energy‐balanced (DMATEB) routing scheme is proposed in this paper. In this scheme, a relay node is selected in view of minimum distance and high energy from a current sensing node. Further, the parent node is chosen among the selected relay nodes on the basis of high residual energy and less power consumption with due consideration of its associated child nodes. As each sensing node itself selects its parent among the available alternatives, the proposed scheme offers a distributive and adaptive approach. Moreover, the proposed system does not overload any selected parent of a particular branch as it starts acting as a child whenever its energy lowers among the other available relay nodes. This leads to uniform energy utilization of nodes that offers a better energy balance mechanism and improves the network lifespan by 20% to 30% as compared with its predecessors.     

A Privacy Protection Strategy for Source Location in WSN Based on Angle and Dynamical Adjustment of Node Emission Radius

We propose two novel methods to improve the source location privacy security protection and the node energy utilization in Wireless sensor networks (WSN).A privacy preservation protocol for source location in WSN based on angles(APS) and an Enhanced protocol for source location (EAPS),which dynamically adjusts emission radius during routing.The APS protocol produces geographically dispersed phantom source nodes and utilizes the energy from the energy-abundant regions to make the routing path versatile among the entire network.In the EAPS protocol,according to the number of its own adjacent nodes,residual energy and the distance to the base station,a node adjusts its radius adaptively.Experiments show that the two novel protocols can improve the security and take advantage of the residual energy in the network balance the network life and energy consumption in comparison with the existing routing protocols based on the phantom sources.     

Energy efficient secured routing protocol for MANETs

The design of routing protocol with energy efficiency and security is a challenging task. To overcome this challenge, we propose energy-efficient secured routing protocol. The objective of our work is to provide a secured routing protocol, which is energy efficient. To provide security for both link and message without relying on the third party, we provide security to the protocol by choosing a secure link for routing using Secure Optimized Link State Routing Protocol. Each node chooses multipoint relay nodes amongst the set of one-hop neighbors, so as to reach all two-hop neighbors. The access control entity authorizes nodes announcing the node identification to the network. In addition, the access control entity signs a public key Ki, a private key ki, and the certificate Ci required by an authorized node to obtain the group key. Each node maintains a route table with power status as one of its entry. After selecting the link, on requirement of a new route, we check nodes’ power status in its routing table and then accordingly arise a route. Then, we perform group key distribution using the generated keys using a small number of messages which helps reducing energy consumption. The group key can be altered periodically to avoid nonauthorized nodes and to avoid the use of the same group key in more than some amount of data. Then, we provide communication privacy for both message sender and message recipient using Secure Source Anonymous Message Authentication Scheme. Thereby, the message sender or the sending node generates a source anonymous message authentication for message for releasing each message based on the MES scheme. Hence, our approach will provide message content authenticity without relying on any trusted third parties.     

NHRPA: a novel hierarchical routing protocol algorithm for wireless sensor networks

Considering severe resources constraints and security threat hierarchical routing protocol algorithm. The proposed routing of wireless sensor networks （WSN）, the article proposed a novel protocol algorithm can adopt suitable routing technology for the nodes according to the distance of nodes to the base station, density of nodes distribution, and residual energy of nodes. Comparing the proposed routing protocol algorithm with simple direction diffusion routing technology, cluster-based routing mechanisms, and simple hierarchical routing protocol algorithm through comprehensive analysis and simulation in terms of the energy usage, packet latency, and security in the presence of node protocol algorithm is more efficient for wireless sensor networks. compromise attacks, the results show that the proposed routing     

Routing security in wireless ad hoc networks

A mobile ad hoc network consists of a collection of wireless mobile nodes that are capable of communicating with each other without the use of a network infrastructure or any centralized administration. MANET is an emerging research area with practical applications. However, wireless MANET is particularly vulnerable due to its fundamental characteristics, such as open medium, dynamic topology, distributed cooperation, and constrained capability. Routing plays an important role in the security of the entire network. In general, routing security in wireless MANETs appears to be a problem that is not trivial to solve. In this article we study the routing security issues of MANETs, and analyze in detail one type of attack-the "black hole" problem-that can easily be employed against the MANETs. We also propose a solution for the black hole problem for ad hoc on-demand distance vector routing protocol.     

DEED:一种无线传感器网络中高效节能的数据通信协议

无线传感器网络由许多具有低功率无线收发装置的传感器节点组成,能够有效地从不同环境监测收集周边环境信息并传送到远处的基站进行处理.由于传感器节点的电池能量极为有限,因此节点的通信应有效的利用能量,以延长网络的生命周期.LEACH^[4]协议是一种典型的能有效延长网络生命周期的节能通信协议.本文提出了一种分布的、高效节能的通信协议DEED,DEED利用了数据聚合技术,以聚类的方式组织节点,聚类首领在网络中均匀分布并组织成路由树,由根节点与基站直接通信.实验结果显示DEED性能远好于LEACH.     

基于CPK和能量的安全路由算法

无线传感网是由大量传感器节点组成的网络,具有无线通信、自组织、无中心的组网特性。针对无线传感器网络面临的众多安全问题,从组合公钥和节点能量入手,对LEACH进行改进,提出了一种基于CPK和能量的安全有效路由算法。通过仿真实验,改进的路由协议比LEACH具有更长的寿命,而且在安全性方面也进一步加强了。     

认知无线电网络诱骗攻击问题及安全解决方案

针对认知无线电网络可用频谱动态变化的特点,提出一种特有的诱骗攻击问题,即在分布式认知无线电网络中,当认知节点采用按需路由协议建立路由链接时,恶意节点向路由请求数据包中加入虚假频谱信息,诱使其他节点建立路由链接,随后丢弃需其转发的数据包.为了解决这个问题,将认知无线电网络分成单跳有簇头结构,通过簇头检测恶意节点.为便于检验方案的可行性,结合簇头检测结果设计了一种路由协议.理论分析和仿真实验表明该安全问题会显著降低网络通信性能,本文提出的解决方案是有效和可行的.     

Trading latency for energy in densely deployed wireless ad hoc networks using message ferrying

Wireless mobile ad hoc networks (MANETs) have the potential for use in important application environments, such as remote environmental monitoring, where energy resources are limited. Efficient power management is necessary to allow these networks to operate over a long period of time. One of the key factors affecting the design of power management mechanisms is the routing protocol in use within the network. In this paper, we investigate the Message ferrying (MF) routing paradigm as a means to save energy while trading off data delivery delay. In MF, special nodes called ferries move around the deployment area to deliver messages for nodes. While this routing paradigm has been developed mainly to deliver messages in partitioned networks, here we explore its use in a connected MANET. The reliance on the movement of ferries to deliver messages increases the delivery delay if a network is not partitioned. However, delegating message delivery to ferries provides the opportunity for nodes to save energy by aggressively disabling their radios when ferries are far away. To exploit this feature, we present a power management framework, in which nodes switch their power management modes based on knowledge of ferry location. We evaluate the performance of our scheme using ns-2 simulations and compare it with a multihop routing protocol, dynamic source routing (DSR). Our simulation results show that MF achieves energy savings as high as 95% compared to DSR without power management and still delivers more than 98% of messages. In contrast, a power-managed DSR delivers many fewer messages than MF to achieve similar energy savings. In the scenario of heavy traffic load, the power-managed DSR delivers less than 20% of messages. MF also shows robust performance for highly mobile nodes, while the performance of DSR suffers significantly. Thus, delay tolerant applications can use MF rather than a multihop routing protocol to save energy efficiently when both routing approaches are available.     

A Secure Routing Protocol with Trust and Energy Awareness for Wireless Sensor Network

Nodes in most of the deployments of Wireless Sensor Networks (WSNs) remain un-administered and exposed to variety of security attacks. Characterized by constrained resources and dynamically changing behavior of sensor nodes, reliable data delivery in WSNs is nontrivial. To counter node misbehavior attacks, traditional cryptographic and authentication based solutions have proved to be inappropriate due to high cost and incapability factors. Recently, trust based solutions have appeared to be viable solutions to address nodes’ misbehavior attacks. However, the existing trust based solutions incur high cost in trust estimation and network-wide dissemination which significantly increases traffic congestion and undermines network lifetime. This paper presents a Trust and Energy aware Secure Routing Protocol (TESRP) for WSN that exploits a distributed trust model for discovering and isolating misbehaving nodes. TESRP employs a multi-facet routing strategy that takes into consideration the trust level, residual energy, and hop-counts of neighboring nodes while making routing decisions. This strategy not only ensures data dissemination via trusted nodes but also balances out energy consumption among trusted nodes while traversing through shorter paths. Demonstrated by simulation results in NS-2, TESRP achieves improved performance in terms of energy consumption, throughput and network lifetime as compared to existing solutions.     

面向SDWSN的分布式高效熵节能分簇路由算法

为提高软件定义无线传感器网络（software defined wireless sensor network,SDWSN）的寿命并降低数据传输能耗,设计一种基于萤火虫算法（fireflyalgorithm,FA）和生物地理学优化（biogeography-based optimization,BBO）的混合优化算法,并基于该混合优化算法,设计一种分布式高效熵节能分簇路由算法（distributed high-efficiency entropy energy-saving cluster routing algorithm,DHEEC）,将能量熵和混合优化算法用于簇头选择。仿真结果表明,混合优化算法在标准函数上的表现优于其他算法,DHEEC的10%节点死亡轮数比IFCEER提高了约41.05%,比DEEC-FA提高了约13.89%,并提高了能量利用率。     

A grid based clustering and routing algorithm for solving hot spot problem in wireless sensor networks

Energy conservation of the sensor nodes is the most important issue that has been studied extensively in the design of wireless sensor networks (WSNs). In many applications, the nodes closer to the sink are overburdened with huge traffic load as the data from the entire region are forwarded through them to reach the sink. As a result, their energy gets exhausted quickly and the network is partitioned. This is commonly known as hot spot problem. Moreover, sensor nodes are prone to failure due to several factors such as environmental hazards, battery exhaustion, hardware damage and so on. However, failure of cluster heads (CHs) in a two tire WSN is more perilous. Therefore, apart from energy efficiency, any clustering or routing algorithm has to cope with fault tolerance of CHs. In this paper, we address the hot spot problem and propose grid based clustering and routing algorithms, combinedly called GFTCRA (grid based fault tolerant clustering and routing algorithms) which takes care the failure of the CHs. The algorithms follow distributed approach. We also present a distributed run time management for all member sensor nodes of any cluster in case of failure of their CHs. The routing algorithm is also shown to tolerate the sudden failure of the CHs. The algorithms are tested through simulation with various scenarios of WSN and the simulation results show that the proposed method performs better than two other grid based algorithms in terms of network lifetime, energy consumption and number of dead sensor nodes.     

Fuzzy-Based Secure Authentication and Clustering Algorithm for Improving the Energy Efficiency in Wireless Sensor Networks

Wireless Sensor Networks are categorized by the improved energy consumption parameters. The nodes are deployed in challenging surroundings and they are not communicated for a long time with lacking of energy level. These kinds of nodes will be the victim of security attacks, the conciliation nodes are guided all the data packets send to the base station of the network. In this paper proposes, The Fuzzy-based Secured Authentication and Clustering (FSAC) Algorithm observes the different kinds of the data packets transmitted within the sensors to avoid the attacks. The FSAC is implemented to use the proficient routing path to diminish the energy consumption. This method finds the adjacent transmitting node to improve the proficient path setup for the data packet routing using the fuzzy logic method. The simulation results specify that the proposed method increases the energy up to 12% compared to the related methods.

     

Energy-balanced cooperative routing in multihop wireless networks

Cooperative communication (CC) allows multiple nodes to simultaneously transmit the same packet to the receiver so that the combined signal at the receiver can be correctly decoded. Since the CC can reduce the transmission power and extend the transmission coverage, it has been considered in minimum energy routing protocols to reduce the total energy consumption. However, previous research on cooperative routing only focuses on minimizing the total energy consumption from the source node to the destination node, which may lead to the unbalanced energy distribution among nodes. In this paper, we aim to study the impact of cooperative routing on balancing the energy distribution among nodes. By introducing a new routing scheme which carefully selects cooperative relay nodes and assigns their transmission power, our cooperative routing method can balance the remaining energy among neighboring nodes to maximize the lifetime of the network. Simulation results demonstrate that the proposed cooperative routing algorithm significantly balances the energy distribution and prolongs the lifetime of the network.     

Implementation of depth‐based routing and its enhancement in AquaSim–Next Generation for underwater wireless sensor networks

In the last decade, underwater wireless sensor networks have been widely studied because of their peculiar aspects that distinguish them from common terrestrial wireless networks. Their applications range from environmental monitoring to military defense. The definition of efficient routing protocols in underwater sensor networks is a challenging topic of research because of the intrinsic characteristics of these networks, such as the need of handling the node mobility and the difficulty in balancing the energy consumed by the nodes. Depth‐based routing protocol is an opportunistic routing protocol for underwater sensor networks, which provides good performance both under high and low node mobility scenarios. The main contribution of our work is presenting a novel simulator for studying depth‐based routing protocol and its variants as well as novel routing protocols. Our simulator is based on AquaSim–Next Generation, which is a specialized tool for studying underwater networks. With our work, we improve the state of the art of underwater routing protocol simulators by implementing, among other features, a detailed cross‐layer communication and an accurate model of the operational modes of acoustic modem and their energy consumption. The simulator is open source and freely downloadable. Moreover, we propose a novel and completely distributed routing protocol, named residual energy–depth‐based routing. It takes into account the residual energy at the nodes' batteries to select the forwarder nodes and improve the network lifetime by providing a more uniform energy consumption among them. We compare its performance with that of depth‐based routing protocol and a receiver‐based routing protocol implementing a probabilistic opportunistic forwarding scheme.     

Information theoretic framework of trust modeling and evaluation for ad hoc networks

The performance of ad hoc networks depends on cooperation and trust among distributed nodes. To enhance security in ad hoc networks, it is important to evaluate trustworthiness of other nodes without centralized authorities. In this paper, we present an information theoretic framework to quantitatively measure trust and model trust propagation in ad hoc networks. In the proposed framework, trust is a measure of uncertainty with its value represented by entropy. We develop four Axioms that address the basic understanding of trust and the rules for trust propagation. Based on these axioms, we present two trust models: entropy-based model and probability-based model, which satisfy all the axioms. Techniques of trust establishment and trust update are presented to obtain trust values from observation. The proposed trust evaluation method and trust models are employed in ad hoc networks for secure ad hoc routing and malicious node detection. A distributed scheme is designed to acquire, maintain, and update trust records associated with the behaviors of nodes' forwarding packets and the behaviors of making recommendations about other nodes. Simulations show that the proposed trust evaluation system can significantly improve the network throughput as well as effectively detect malicious behaviors in ad hoc networks.     

基于Beta分布的无线传感器网络分簇路由信任管理机制研究

信任管理机制为保障无线传感器网络安全提供了一种有效方案,通过对节点的行为进行评价,建立整个网络的信任管理机制,对判断的恶意节点采用相应的限制措施来保障安全。文章以Beta概率密度分布函数的期望值作为信任值,优化网络分簇路由协议,可在保障网络能量高效利用的同时,有效提升整个网络的安全性。     

An Energy-Efficient Routing Algorithm Based on Relative Identification and Direction for Wireless Sensor Networks

In studies of wireless sensor networks (WSNs), routing protocols in network layer is an important topic. To date, many routing algorithms of WSNs have been developed such as relative direction-based sensor routing (RDSR). The WSNs in such algorithm are divided into many sectors for routing. RDSR could simply reduce the number of routes as compared to the convention routing algorithm, but it has routing loop problem. In this paper, a less complex, more efficient routing algorithm named as relative identification and direction-based sensor routing (RIDSR) algorithm is proposed. RIDSR makes sensor nodes establish more reliable and energy-efficient routing path for data transmission. This algorithm not only solves the routing loop problem within the RDSR algorithm but also facilitates the direct selection of a shorter distance for routing by the sensor node. Furthermore, it saves energy and extends the lifetime of the sensor nodes. We also propose a new energy-efficient algorithm named as enhanced relative identification and direction-based sensor routing (ERIDSR) algorithm. ERISDR combines triangle routing algorithm with RIDSR. Triangle routing algorithm exploits a simple triangle rule to determine a sensor node that can save more energy while relaying data between the transmitter and the receiver. This algorithm could effectively economize the use of energy in near-sensor nodes to further extend the lifetime of the sensor nodes. Simulation results show that ERIDSR get better performance than RDSR, and RIDSR algorithms. In addition, ERIDSR algorithm could save the total energy in near-sensor nodes more effectively.     

Multi-factor and Distributed Clustering Routing Protocol in Wireless Sensor Networks

One of important issues in wireless sensor networks is how to effectively use the limited node energy to prolong the lifetime of the networks. Clustering is a promising approach in wireless sensor networks, which can increase the network lifetime and scalability. However, in existing clustering algorithms, too heavy burden of cluster heads may lead to rapid death of the sensor nodes. The location of function nodes and the number of the neighbor nodes are also not carefully considered during clustering. In this paper, a multi-factor and distributed clustering routing protocol MFDCRP based on communication nodes is proposed by combining cluster-based routing protocol and multi-hop transmission. Communication nodes are introduced to relay the multi-hop transmission and elect cluster heads in order to ease the overload of cluster heads. The protocol optimizes the election of cluster nodes by combining various factors such as the residual energy of nodes, the distance between cluster heads and the base station, and the number of the neighbor nodes. The local optimal path construction algorithm for multi-hop transmission is also improved. Simulation results show that MFDCRP can effectively save the energy of sensor nodes, balance the network energy distribution, and greatly prolong the network lifetime, compared with the existing protocols.