基于信誉度的移动自组网入侵检测分簇算法

针对已有基于路由的分簇算法,不适用于移动自组网入侵检测的特性要求,文中提出了一种基于信誉度的入侵检测分簇算法(CIDS).该算法从簇结构安全、稳定的角度出发,采用信誉度的概念对网络节点属性进行数学抽象,定义了节点信誉度的数学表达式,选择综合信誉度高的节点收集网络教据、检测网络行为.为移动自组网入侵检测系统提供了稳定、安全的支持.     

无线传感器网络簇间节能路由算法

针对基于分簇网络的无线传感器网络簇间路由协议,让簇首和Sink节点直接通信或通过簇首节点转发数据造成能耗不均,节点过早死亡的缺陷。文中提出一种基于网关节点模型的无线传感器网络簇间路由算法,通过簇头与网关节点、网关节点自身建立虚电路,制定存储转发路由,将数据转发给Sink节点。并引入延时等待机制,增强了簇间信息的融合度,此算法适用于大规模无线传感器网络,有良好的可扩展性。仿真表明在能量节省等性能上与传统簇间路由算法相较有较大提高。     

智能交通自组网的设计与实现

提出了一种智能交通自组网的实现方案,该方案采用适应于车辆移动环境的IEEE 802.1 1p标准,改进车载自组网路由协议,并基于该网络架构实现车辆交通感知与全方位导航等应用.测试结果表明,基于该方案的智能交通自组网的网络性能满足车载通信的要求.     

VANET中基于分布式的分簇的路由机制

车载自组网(VANET)是一种将高速移动车辆作为通信节点的自组网,动态的拓扑结构致使传统的自组网路由机制不再适用。为此,提出基于分布式的分簇路由机制(DCRM)。DCRM首先引用RTB/CTB握手策略,源节点利用RTB/CTB数据包,获取其一跳邻居的信息,然后源节点根据每两个邻近节点间的距离小于门限值的原则,以分布式方式对这些邻居节点进行簇划分。随后,将每个簇中选择一个离源节点最远的节点作为簇头,源节点将消息传输至簇头。接收消息后,簇头成了源节点,重复此过程直至消息传输至目的节点。仿真结果表明,提出的DCRM提高了消息传输效率、降低了消息传输时延。     

高动态无线自组网路由协议设计

针对节点快速移动过程中网络建立时间较长,数据端到端传输时延无法得到可靠保 障,并且由于维护动态网络连接性造成网络开销较大等方面的问题,提出了一种无线自组网 路由协议,通过分簇算法快速将网络分为多个簇,每个簇包括簇首节点、成员节点和簇间网 关节点。该协议能够应用于快速移动节点构成的高动态无线自组织网络中,实现了先应式和 反应式路由算法进行了有机结合,能够在快速变化的拓扑结构中为未知路由提供优化的路由 结果,利用较小的网络开销实现网络快速构建和数据端到端的实时传输。     

一种WSN中分簇路由算法的改进

在无线传感器网络中,基于分簇的路由协议对提高网络的寿命有着重要作用,LEACH是一种应用比较广泛的层次路由协议。本文提出一种新的基于最优分簇的无线传感器网络分簇路由（LEACH-O）算法,在簇的形成过程考虑到节点的集中程度和节点的剩余能量,从而减少传感器节点的能量消耗,优化资源利用率。仿真实表明,与传统的LEACH算法相比,该算法配传感器节点间数据传输提供了高效路由,从而延长网络的生命周期。     

荒漠场景应用的车联网及其分簇路由算法

为了解决沙漠、戈壁等荒漠场景的车辆间及其与外界的通信,提出一种车辆自组织网络的体系结构并重点分析其分簇和路由算法。该算法根据网络中车辆所装备的通信终端类型和车辆定时发出的位置、速度和行驶方向等信息对车辆进行分簇。在簇内通信和簇间通信时,簇头车辆为簇成员车辆选择最合适的路由;在与外界通信时,簇头车辆为簇成员车辆选择最近的装备卫星或地面移动通信终端的车辆进行转发。仿真结果表明,该算法与传统的分簇路由算法相比具有更高的簇结构稳定性、更高的数据传输成功率以及更低的路由开销。     

基于国网规范的无线自组网路由算法改进

微功率无线自组网的研究主要专注于网络层的路由算法,目的是维护传输路径的连通性,保证节点间的高效通信,实现网络的快速组建。提出基于簇的多路径动态路由算法,可改善现国网规范中自组网路由构建缺陷,实现路由开销最小化,适应节点数量大、密度高的网络。     

基于动态分簇路由优化和分布式粒子滤波的传感器网络目标跟踪方法

针对无线传感器网络中节点通信能力及能量有限的情况,该文提出基于动态分簇路由优化和分布式粒子滤波的传感器网络目标跟踪方法。该方法以动态分簇的方式将监测区域内随机部署的传感器节点划分为若干个簇,并对簇内成员节点与簇首节点之间、簇首节点与基站之间的通信路由进行优化,确保网络能耗的均衡分布,在此基础上,被激活的簇内成员节点并行地执行分布式粒子滤波算法实现目标跟踪。仿真结果表明,该方法能有效地降低传感器网络中节点的总能耗,能在实现跟踪的同时保证目标跟踪的精度。     

基于遗传聚类的无线传感器负载均衡路由算法

通常的无线传感器分簇网络存在节点负载不均衡的问题。为均衡各节点能量消耗,延长网络生存周期,将K均值算法与遗传算法相结合,提出一种负载均衡的无线传感器网络路由算法,算法利用遗传算法的全局寻优能力以克服传统K均值算法的局部性和对初始中心的敏感性,实现了传感器网络节点自适应成簇与各节点负载均衡。仿真实验表明,该算法显著延长了网络寿命,相对于其他分簇路由算法,其网络生存时间延长了约43%。     

An efficient and intelligent routing strategy for vehicular delay tolerant networks

The vehicular delay-tolerant network is the real-life application based area of Delay tolerant network where communication takes place using vehicular nodes and roadside units. The topology used in vehicular networks is highly dynamic by architecture due to the use of moving vehicular nodes. It operates in such a scenario where a direct path between source and destination remains absent on the most piece of the time. In case of non-existence of connected path vehicular delay-tolerant network works opportunistically and uses the same store, carry, and forward paradigm as Delay Tolerant Network. However, the routing protocols designed for vehicular delay-tolerant network faces crucial challenges like inadequate relay node, incomplete data transfer, a large number of packet drop, and uncertain delivery time. In this research paper, we propose a novel routing strategy for the vehicular delay-tolerant network. The proposed routing strategy selects efficient vehicular relay node for complete packet transfer and intelligently reduces the packet drop for timely packet delivery. We implement the proposed routing strategy in the ONE simulator; the ONE simulator provides an opportunistic environment for nodes. We analyze the performance of the proposed strategy under various simulations results using different parameters. The results show that the proposed strategy outperforms standard routing protocols in terms of considered parameters and provide an efficient solution for the problem of disconnection.

     

基于OMAPLl38芯片的无线传感器网络节点设计

随着传感器技术、无线网络技术的迅速发展,无线传感器网络在军事和商业领域有着广泛的应用前景。无线传感器网络中的节点具有感知和路由的功能,是构成无线传感器网络的基本单元。针对传感器节点的特点,基于双核架构OMAPLl38为核心设计了一种低功耗高性能无线传感器节点。在介绍OMAPLl38的基础上,详细阐述了传感器节点设计及实现过程,包括硬件体系结构和软件开发流程,提出一种无线传感器网络节点设计方案。该方案可广泛应用于其他区域的无线传感器网络构建。     

车辆无线通信网络及其应用

文章介绍了车辆通信网的基本概念、网络架构、国际标准及关键技术,分析了其在物理层、媒体接入层、路由层、安全技术的研究热点问题,并讨论了其在智能交通、安全行车、导航和智能驾驶等方面的应用前景。     

Software agent-based directed diffusion in wireless sensor network

In an environment where node density is massive, placement is heterogeneous and redundant sensory traffic is produced; limited network resources such as bandwidth and energy are hastily consumed by individual sensor nodes. Equipped with only a limited battery power supply, this minimizes the lifetime of these sensor nodes. At the network layer, many researchers have tackled this issue by proposing several energy efficient routing schemes. All these schemes tend to save energy by elevating redundant data traffic via in-network processing and choosing empirically good and shortest routing paths for transfer of sensory data to a central location (sink) for further, application-specific processing. Seldom has an attempt been made to reduce network traffic by moving the application-specific code to the source nodes. We unmitigated our efforts to augment the node lifetime within a sensor network by introducing mobile agents. These mobile agents can be used to greatly reduce communication costs, especially over low bandwidth links, by moving the processing function to the data rather than bringing the data to a central processor. Toward this end, we propose an agent-based directed diffusion approach to increase sensor node efficiency and we present the experimental results.     

A Genetic‐Algorithm‐Based Optimized Clustering for Energy‐Efficient Routing in MWSN

With the increasing demands for mobile wireless sensor networks in recent years, designing an energy‐efficient clustering and routing protocol has become very important. This paper provides an analytical model to evaluate the power consumption of a mobile sensor node. Based on this, a clustering algorithm is designed to optimize the energy efficiency during cluster head formation. A genetic algorithm technique is employed to find the near‐optimal threshold for residual energy below which a node has to give up its role of being the cluster head. This clustering algorithm along with a hybrid routing concept is applied as the near‐optimal energy‐efficient routing technique to increase the overall efficiency of the network. Compared to the mobile low energy adaptive clustering hierarchy protocol, the simulation studies reveal that the energy‐efficient routing technique produces a longer network lifetime and achieves better energy efficiency.     

基于ZigBee的自愈组网与协议实现

ZigBee技术是一种低功耗、网络容量大、时延小且具有自组织自愈功能的无线通讯技术。利用ZigBee技术组建的网络是一种低数据传输速率的无线个域网。在简要阐述传感器网络节点的基本体系结构的基础上,介绍了基于CC2530的ZigBee传感器节点的硬件组成。主要是对多跳自组路由协议和网状网的自愈的研究,并在此硬件平台上进行组网,通过对生理信息数据的传递来进行检验。     

Increasing network lifetime by balancing node energy consumption in heterogeneous sensor networks

Sensor nodes are powered by battery and have severe energy constraints. The typical many‐to‐one traffic pattern causes uneven energy consumption among sensor nodes, that is, sensor nodes near the base station or a cluster head have much heavier traffic burden and run out of power much faster than other nodes. The uneven node energy dissipation dramatically reduces sensor network lifetime. In a previous work, we presented the chessboard clustering scheme to increase network lifetime by balancing node energy consumption. To achieve good performance and scalability, we propose to form a heterogeneous sensor network by deploying a few powerful high‐end sensors in addition to a large number of low‐end sensors. In this paper, we design an efficient routing protocol based on the chessboard clustering scheme, and we compute the minimum node density for satisfying a given lifetime constraint. Simulation experiments show that the chessboard clustering‐based routing protocol balances node energy consumption very well and dramatically increases network lifetime, and it performs much better than two other clustering‐based schemes. Copyright © 2006 John Wiley & Sons, Ltd.     

Optimal load balanced clustering in homogeneous wireless sensor networks

Balancing the load among sensor nodes is a major challenge for the long run operation of wireless sensor networks. When a sensor node becomes overloaded, the likelihood of higher latency, energy loss, and congestion becomes high. In this paper, we propose an optimal load balanced clustering for hierarchical cluster‐based wireless sensor networks. We formulate the network design problem as mixed‐integer linear programming. Our contribution is 3‐fold: First, we propose an energy aware cluster head selection model for optimal cluster head selection. Then we propose a delay and energy‐aware routing model for optimal inter‐cluster communication. Finally, we propose an equal traffic for energy efficient clustering for optimal load balanced clustering. We consider the worst case scenario, where all nodes have the same capability and where there are no ways to use mobile sinks or add some powerful nodes as gateways. Thus, our models perform load balancing and maximize network lifetime with no need for special node capabilities such as mobility or heterogeneity or pre‐deployment, which would greatly simplify the problem. We show that the proposed models not only increase network lifetime but also minimize latency between sensor nodes. Numerical results show that energy consumption can be effectively balanced among sensor nodes, and stability period can be greatly extended using our models.     

一种适用于唤醒机制的异构传感器网络节点协同唤醒路由算法

基于定向扩散算法,本文提出一种适用于唤醒机制的异构传感器网络节点协同唤醒路由算法(CWR,Cooperative Wake-up Ruting),就近选取低能耗节点代替高能耗节点进行多级扩散,增加路由替换和路由修补两个步骤建立低能耗节点到相应高能耗节点的路由信息,为异构传感器网络中唤醒实现提供必要的网络拓扑基础.仿真实验表明本文算法在支持唤醒机制实现过程中的节能特性.     

Topology control of tactical wireless sensor networks using energy efficient zone routing

The US Department of Defense (DoD) routinely uses wireless sensor networks (WSNs) for military tactical communications. Sensor node die-out has a significant impact on the topology of a tactical WSN. This is problematic for military applications where situational data is critical to tactical decision making. To increase the amount of time all sensor nodes remain active within the network and to control the network topology tactically, energy efficient routing mechanisms must be employed. In this paper, we aim to provide realistic insights on the practical advantages and disadvantages of using established routing techniques for tactical WSNs. We investigate the following established routing algorithms: direct routing, minimum transmission energy (MTE), Low Energy Adaptive Cluster Head routing (LEACH), and zone clustering. Based on the node die out statistics observed with these algorithms and the topological impact the node die outs have on the network, we develop a novel, energy efficient zone clustering algorithm called EZone. Via extensive simulations using MATLAB, we analyze the effectiveness of these algorithms on network performance for single and multiple gateway scenarios and show that the EZone algorithm tactically controls the topology of the network, thereby maintaining significant service area coverage when compared to the other routing algorithms.