蒋耀平:五点建议加强网络安全应急工作

近年来,我国互联网蓬勃发展,到2006年底我国上网用户总数已经达到了1.37亿,其中宽带上网用户超过1亿户,互联网普及率达到了10.5%,CN域名总数超过180万个,上网计算机达到了5940万台.     

无线传感器网络节点自身定位算法

无线传感器网络(WSN)的许多应用都是基于节点的位置信息.本文从WSN的基于测距的定位算法和无需测距的定位算法对其定位算法进行详细的说明.并分析比较各定位算法的优缺点.最后还指出了WSN的自身定位问题的研究方向.     

无线传感器网络节点自身定位算法

无线传感器网络（WSN）的许多应用都是基于节点的位置信息．本文从WSN的基于测距的定位算法和无需测距的定位算法对其定位算法进行详细的说明．并分析比较各定位算法的优缺点．最后还指出了WSN的自身定位问题的研究方向。     

Ad hoc网络中的分簇算法

分簇算法是根据系统要求将节点组织成可管理的结构，它的好坏直接影响着Ad hoc网络的各种性能指标。本文阐述了Ad hoc网络的体系结构和存在的问题，介绍了与分簇算法相关的一些定义和分簇算法的目标。对Ad hoc网络中的分簇算法进行了详尽的分类和比较分析。     

无线自组网节点定位算法综述

节点移动性使无线自组网络在军事、医学、环境保护等领域展现出广阔的应用前景。然而随着人们对移动节点位置信息的需求,节点定位问题也成为一个研究的热点问题,到目前为止,己有许多有关无线自组网的自定位系统和算法。在对这些定位算法进行分类的基础上,把节点定位过程分为4个基本步骤,着重分析阐述各类申具有代表性的定位算法的原理和各自特点,并提出一个对定位算-法I陛能评价的标准。     

Improved Bio Inspired Energy Efficient Clustering Algorithm to Enhance QoS of WSNs

Wireless Personal Communications - In the growing world of technology, use of WSN is increasing at an exponential rate in many real time applications such as security, monitoring, tracking,...     

A Hybrid Clustering Approach Based Q-Leach in TDMA to Optimize QOS-Parameters

An Orthogonal frequency part multiplexing suffers from a considerable challenge due to a high peak to average power ratio (PAPR). Hence, an effective method such as partial transmits sequence (PTS) can avert this defiance by limit the design of PAPR. Therefore, an improving PAPR reduction performance via a novel approach is proposed by detaching each subblock into two parts furthermore exchanges the first sample with the final selection in each portion of the subblock to generate a new partitioning scheme. Several typical traditional segmentation schemes are used to analyze and apply the presented algorithm, such as adjacent, interleaving, and pseudo-random schemes. Besides, two scenarios are adopted based on simulation software in which the number of subcarriers is set to 128 and 256. Based on the results, a superior PAPR reduction performance is achieved based on the improved segmentation schemes regarding traditional strategies in both systems. Moreover, the enhanced adjusted PTS scheme poses a low computational complexity compared with that of the conventional schemes.

     

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

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

基于模糊聚类的传感网络失效节点检测

针对当无线传感网中的传感节点分配随机性较强,节点能量不能得到有效的补充,一旦节点能量耗尽,会造成节点失效.传统检测方法因为无法准确提取节点失效特征,造成失效节点检测的准确度不高.为了解决这一问题,提出一种基于模糊聚类失效节点搜索的检测算法,通过计算无线传感节点能量消耗的特征模糊聚类概率,运用模糊概率判定失效节点位置.实验证明,该方法能有效的对无线传感网络中失效节点进行检测,取得了不错的效果.     

主动节点代码动态下载机制的设计和实现

主动网络是近几年发展起来的新型Internet技术。对主动网络的起因、概念和实现的方式等方面进行了概述,然后对主动网络中主动节点上实现代码的动态下载机制进行了分析,并提出了用面向对象语言Java的动态下载功能实现代码分发下载的机制。     

Algorithms to Minimize Data Transfer for Code Update on Wireless Sensor Network

In Wireless Sensor Networks, the preloaded program code and data on sensor nodes often need to be updated due to changes in user requirements and environmental conditions. Sensor nodes are severely restricted by energy constraints. It is especially energy consuming for sensor nodes to transfer data through wireless radios. To efficiently reprogram sensor nodes through radio, we propose an algorithm, Minimum Data transferred by Copying and Downloading (MDCD) and its extension E-MDCD, to minimize the number of bytes needed to be transferred from the host machine to the sensor nodes. Experimental results show that the E-MDCD algorithm reduces the number of bytes transferred by 93.25 % for small code change compared with the Rsync based algorithm. In average, E-MDCD can reduce 59.82 % compared with the existing the Rsync based algorithm and 16.14 % compared with the Vdelta algorithm.     

Energy and Network Balanced Distributed Clustering in Wireless Sensor Network

Wireless Personal Communications - Balancing energy consumption of sensor nodes to extend the network lifetime is a major concern for the energy constrained wireless sensor network. Improper load...     

一种基于WSN的能源有效的被动聚类模式

在分析无线传感器网络（WSN）的能量消耗模型的基础上，提出了一种新的层次型、分布式的能源有效的被动聚类模式EEPCS。采用“智能延迟策略”和“智能启发式选择”产生类首和网关结点，改变了传统被动聚类模式中通信结点能源消耗过快、网络不连通等缺点。理论分析和实验结果表明，EEPCS不仅能够节省通信结点的能量消耗，而且使能量在节点间均衡消耗，延长了网络的生存周期。     

一种基于适应度和节点聚类的P2P拓扑建模方法

 通过对Gnutella网络拓扑实测数据的分析,得到了Gnutella网络的累积节点度分布、聚类系数、平均路径长度和rich-club系数等拓扑特征。在拓扑特征分析的基础上,通过引入适应度、邻居数限制和节点聚类等机制,提出了面向非结构化P2P网络拓扑的FCL(Fitness model with tunable Clustering and neighbours Limitation)模型,并给出了建模算法。通过实验分析,证明了该模型的有效性。     

Multiple Parameter Based Energy Balanced and Optimized Clustering for WSN to Enhance the Lifetime Using MADM Approaches

Wireless Personal Communications - Efficient utilization of power has recently emerged as a critical issue in sensor networks that is addressed by efficient clustering techniques. In WSN,...     

一种基于超节点和能量优先的无线传感器网络的高效查询算法

文中提出一种基于超节点和能量优先的无线传感器网络的高效查询算法.该算法包括传感器节点的层次聚类算法及基于能量代价模型等支撑技术,主要解决了以下两个问题:(1)数据如何从传感器节点传送到汇聚节点;(2)通过对传感器节点进行聚类,形成超节点,使得在查询过程中减少对无关节点的访问.实验表明该算法在提高无线传感器网络查询效率的情况下,延长网络的使用寿命.     

无线传感器网络中分布式空时分组码设计

从无线传感器网络（WSN）节点能耗的节省和传输数据的可靠性出发,研究和设计了基于4个协同节点和能量可补充节点（Sink）形成的分布式虚拟多天线空时分组码;同时考虑到节点的实际工作条件以及对能量的苛刻要求,提出并分析了其改进型算法,即从信道参数及协同节点能量剩余状况考虑重新选取协同节点,进一步提高系统性能。理论分析和仿真结果表明,该分布式空时分组码（D-STBC）在无线传感器网络中的应用是有效和可行的。     

A Survey of Evolutionary Algorithms for Clustering

This paper presents a survey of evolutionary algorithms designed for clustering tasks. It tries to reflect the profile of this area by focusing more on those subjects that have been given more importance in the literature. In this context, most of the paper is devoted to partitional algorithms that look for hard clusterings of data, though overlapping (i.e., soft and fuzzy) approaches are also covered in the paper. The paper is original in what concerns two main aspects. First, it provides an up-to-date overview that is fully devoted to evolutionary algorithms for clustering, is not limited to any particular kind of evolutionary approach, and comprises advanced topics like multiobjective and ensemble-based evolutionary clustering. Second, it provides a taxonomy that highlights some very important aspects in the context of evolutionary data clustering, namely, fixed or variable number of clusters, cluster-oriented or nonoriented operators, context-sensitive or context-insensitive operators, guided or unguided operators, binary, integer, or real encodings, centroid-based, medoid-based, label-based, tree-based, or graph-based representations, among others. A number of references are provided that describe applications of evolutionary algorithms for clustering in different domains, such as image processing, computer security, and bioinformatics. The paper ends by addressing some important issues and open questions that can be subject of future research.      

Adaptive Online Sensor Clustering and Routing Algorithms for QoS Provisioning and Energy Efficiency

Due to the limited energy supply, energy efficiency is the most important issue for wireless sensor networks. In addition, next generation networks are also expected to support QoS sensitive data services. In this paper, a new online sensor network management scheme is developed for energy efficiency and QoS provisioning. To satisfy these conflicting requirements, the proposed scheme consists of clustering and routing algorithms. Without global network information, the online control paradigm is realized in a distributed way. Therefore, the principle contributions of these algorithms are its scalability and responsiveness to current network situations. Simulation results indicate the superior performance of the proposed schemes, while other schemes cannot offer such an attractive performance balance.     

基于前向多层神经网络的分组码译码器设计

把最大相关译码与神经网络神经元的内积特性及吸引域有机地联系起来,连接权决定译码码字,阈值设定决定神经元的纠错范围,从而形成一种可用于硬判决及软判决译码的神经译码器,并在理论上证明了此译码器可在ＤＭＣ信道的纠错能力范围内实现零错误概率硬判决译码,也可实现与最小欧几里德距离译码相当的软判决译码,并能在检错范围内检错。