Ad hoc distributed mutual exclusion algorithm based on token-asking

The solution of distributed mutual exclusion is difficult in Ad hoc networks owing to dynamic topologies and mobility. Based on the analysis of the properties of Ad hoc networks and the disadvantages of the traditional algorithms, an improved Ad hoc system model was given and a novel algorithm was presented as AHDME (Ad Hoc Distributed Mutual Exclusion); it was based on the token-asking algorithms. It utilized broadcast to search for the token and to decrease the message complexity of multi-hop Ad hoc networks. Lamport's timestamp was improved to ensure the time sequence and to prevent nodes from starvation. When compared to traditional algorithms, AHDME does not require the fixed size of request queues and the global system information, which adapts itself to the frequent arrival/departures and the limited computing capability of nodes in Ad hoc networks. Performance analysis and simulation results show that the AHDME algorithm has low message complexity, small space complexity, and short response delay.     

Cluster Synchronization in a Complex Dynamical Network with Two Nonidentical Clusters

This paper further investigates cluster synchronization in a complex dynamical network with two-cluster. Each cluster contains a number of identical dynamical systems, however, the subsystems composing the two clusters can be different, i.e., the individual dynamical system in one cluster can differ from that in the other cluster. Complete synchronization within each cluster is possible only if each node from one cluster receives the same input from nodes in other cluster. In this case, the stability condition of one-cluster synchronization is known to contain two terms： the first accounts for the contribution of the inner-cluster coupling structure while the second is simply an extra linear term, which can be deduced by the ＂same-input＂ condition. Applying the connection graph stability method, the authors obtain an upper bound of input strength for one cluster if the first account is known, by which the synchronizability of cluster can be scaled. For different clusters, there are different upper bound of input strength by virtue of different dynamics and the corresponding cluster structure. Moreover, two illustrative examples are presented and the numerical simulations coincide with the theoretical analysis.     

一种新型Ad hoc网络分簇路由协议

分簇路由协议能够提高系统性能,但也存在不足之处,维护簇结构需要复杂的簇选择算法,带来簇结构维护开销。提出了一种新的Ad hoc网络分簇路由协议,该协议利用簇的层次结构,并采用基于异常度的簇结构调整方案提高簇结构稳定性,减小路由协议开销。分析和仿真表明该协议具有控制开销小、网络性能高的特点。

Abstract：

The clustering hierarchical routing protocol have been developed to increase the system performance.Hierarchical structure has inevitably brought some drawbacks,maintaining the hierarchical structure needs more complicated cluster heads selection algorithm,which may result in the cost of maintaining cluster structure.A novel clustering structure based routing Protocol for ad hoc network was explored.It could reduce the route cost by adopting the hierarchical structure and could improve ad hoc network stability by introducing a configuration strategy based on ＂Exception Degree＂.Analysis and simulation show that the protocol is characterized with its low maintenance costs of routing and high network performance.     

An Adaptive Replica Allocation Algorithm in Mobile Ad Hoc Networks

In mobile ad hoc networks (MANET), nodes move freely and the distribution of access requests changes dynamically. Replica allocation in such a dynamic environment is a significant challenge. In this paoer, a dynamic adaptive replica allocation algorithm that can adapt to the nodes motion is proposed to minimize the communication cost of object access. When changes occur in the access requests of the object or the network topology, each replica node collects access requests from its neighbors and makes decisions locally to expand replica to neighbors or to relinquish the replica. The algorithm dynamically adapts the replica allocation scheme to a local optimal one. Simulation results show that our algorithms efficiently reduce the communication cost of object access in MANET environment.     

Signed PageRank on Online Rating Systems

The ratings in many user-object online rating systems can reflect whether users like or dislike the objects, and in some online rating systems, users can directly choose whether to like an object. So these systems can be represented by signed bipartite networks, but the original unsigned node evaluation algorithm cannot be directly used on the signed networks. This paper proposes the Signed Page Rank algorithm for signed bipartite networks to evaluate the object and user nodes at the same time. ...     

Clustering routing algorithm of wireless sensor networks based on Bayesian game

To avoid uneven energy consuming in wireless sensor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.     

Capacitated stochastic coloured Petri net-based approach for computing two-terminal reliability of multi-state network

Classical network reliability problems assume both networks and components have only binary states,fully working or fully failed states.But many actual networks are multi-state,such as communication networks and transportation networks.The nodes and arcs in the networks may be in intermediate states which are not fully working either fully failed.A simulation approach for computing the two-terminal reliability of a multi-state network is described.Two-terminal reliability is defined as the probability that d units of demand can be supplied from the source to sink nodes under the time threshold T.The capacities of arcs may be in a stochastic state following any discrete or continuous distribution.The transmission time of each arc is also not a fixed number but stochastic according to its current capacity and demand.To solve this problem,a capacitated stochastic coloured Petri net is proposed for modelling the system behaviour.Places and transitions respectively stand for the nodes and arcs of a network.Capacitated transition and self-modified token colour with route information are defined to describe the multi-state network.By the simulation,the two-terminal reliability and node importance can be estimated and the optimal route whose reliability is highest can also be given.Finally,two examples of different kinds of multistate networks are given.     

Coordination game model of co-opetition relationship on cluster supply chains

The research of cluster supply chains is a new direction and a hotspot of the industrial cluster theory. On the condition of the coordination game, the enterprises may be stuck on the non-efficient equilibrium status, which becomes an important problem that must be considered on cluster supply chains. A symmetrical coordination game model is constituted to describe the competition and cooperation relationship of the same-quality manufacturers on cluster supply chains. The methods of the non-cooperation game theory and the evolutionary game theory are respectively used to analyze the model, whose parameters＇ influences under each method are then compared. It can be concluded that the analysis of the evolutionary game theory is more realistic and practical. Finally, three approaches are considered to break away from being path-dependence locked-in non-efficient status during this coordination game evolutionary process, which provide the development of cluster supply chains with an effective forecasting and Pareto optimizing method.     

基于协议同步水下传感器网络目标协同定位算法

为了解决水下目标的定位问题,讨论了一种基于水下传感器阵列网络的目标协同定位算法。该算法在实现水下节点同步的基础上,通过建立目标位置与距离差测量值的统计模型后依据最大似然准则完成目标定位。定位算法的实现采用分布-集中相结合的处理方法,在提高定位精度的同时大大节省了水下节点通信能耗。通过仿真实验验证了算法的有效性和可行性,实验结果表明该方法具有较好的同步及目标定位精度。

Abstract：

A collaborative target location algorithm for underwater acoustic sensor networks （UASN） was proposed. The algorithm was achieved based on time synchronization for high transmitting delay for UASN. Target location was estimated by maximum-likelihood methods based on proposed statistical model which was established by the relation between target position and measured range difference. The proposed algorithm adopts the distributed-centralized computation methods,which degrade the transmitting energy comparing with traditional centralized methods. The result of simulation shows the application validity and the more location performance of the algorithm.     

A CLUSTERING ALGORITHM FOR MIXED NUMERIC AND CATEGORICAL DATA

Most of the earlier work on clustering mainly focused on numeric data whose inherent geometric properties can be exploited to naturally define distance functions between data points. However, data mining applications frequently involve many datasets that also consists of mixed numeric and categorical attributes. In this paper we present a clustering algorithm which is based on the k-means algorithm. The algorithm clusters objects with numeric and categorical attributes in a way similar to k-means. The object similarity measure is derived from both numeric and categorical attributes. When applied to numeric data, the algorithm is identical to the k-means. The main result of this paper is to provide a method to update the “cluster centers“ of clustering objects described by mixed numeric and categorical attributes in the clustering process to minimise the clustering cost function. The clustering performance of the algorithm is demonstrated with the two well known data sets, namely credit approval and abalone databases.     

无线传感网多模簇维护机制与算法

无线传感网因节点众多、应用场景多样和资源约束严格而具有复杂的分布特征、组网灵活性和高度动态性,基于簇的网络管理模式面临着如何实现针对不同的簇受损情形的高效簇维护问题。建立了一种可以适应不同簇维护需要的多模簇维护机制,以自适应局域按需簇维护为目标,根据网络中簇的动态变化时间和空间进行分类簇维护,将簇维护转化为局部性和事件触发的操作,触发机制包括簇头剩余能量低于设定阈值、簇头负载不均、新节点加入或簇内节点失效退出等,基于单个簇或相邻簇的状态变化关系启动单簇(簇内)维护或多簇(簇间)维护方案。基于NS2的仿真结果表明:与传统周期性、全网重新成簇的维护模式相比,该机制能够明显降低网络维护开销,有效均衡网络节点能耗、增加传输的数据包总量、100%节点存活时网络的平均生命周期最高可延长1.8倍。     

相关邻近集合分布式多跳层次路由协议

提出了基于相关邻近集合的能耗均衡多跳分簇路由协议(relative neighborhood set based distributed multi hop clustering routing protocol, RNS-MCRP)。网络初始化阶段,基站计算若干个簇头节点以及所有节点的相关邻近集合,并广播簇头信息和所有节点的相关邻近集合。网络启动后,所有节点根据簇头节点的位置信息划分自己的邻居集合,并从邻居集合中选择剩余能量最大的节点作为下一跳节点。簇头节点推举本簇内部最大剩余能量的节点作为下一轮的簇头节点。实验结果显示,与LEACH (low energy adaptive clustering hierarchy)协议相比较,RNS MCRP具有更好的能耗均衡特性,提高了网络生命时间。     

高密度无线传感器网络分簇定位算法

节点自身定位是无线传感器网络应用的支撑技术之一。提出了一种适用于大规模高密度无线传感器网络的分簇定位算法。首先定义了节点的势作为簇首选举依据,网络中节点间的距离由接收信号强度和通信半径的关系间接计算得到,各簇内的拓扑信息由簇首保存,簇首利用线性规划法实现簇内相对定位;随后从sink节点开始逐步进行簇间位置融合,最终实现全网的绝对定位。相比集中式的凸规划定位算法,所提算法计算复杂度低、通信量小、定位精度高,且不需要预先知道环境中的信号衰减因子,有一定的抗噪声干扰能力。仿真结果显示,在节点按均匀网格分布和均匀随机分布两种情况下,所提算法能取得较好的定位效果。     

一种应用于二进制传感器网络的目标跟踪算法

针对采用集中式粒子滤波方法解决二进制传感器网络目标跟踪问题存在的实时性较差和网络能量消耗大的缺点，提出了一种基于动态分簇的分布式粒子滤波算法。以随着目标运动而动态变化的簇为信息处理结构，簇头节点收集簇成员的单跳测量信息，实时对目标状态进行估计，非簇内节点进入休眠状态以节省能量。仿真表明，合理设置簇转换距离和激活半径，算法的跟踪精度与集中式粒子滤波方法相当；在不影响跟踪效果的情况下，可适当减小簇转换距离和激活半径，从而节省网络能量。     

传感器网络中一种能量高效的数据收集算法

为了在无线传感器网络中降低能耗和最大化网络生存期,提出一种能量高效的数据收集算法(energy efficient data gathering algorithm, EEDGA)。该算法利用移动代理模型在网络中进行数据收集。首先,EEDGA根据监测精度的要求控制活动节点的数量;然后,通过求最小支配集得到具体的工作节点;最后,利用蚁群算法规划移动代理迁移的最优路线,移动代理以渐进方式收集活动节点的监测数据。仿真结果表明,与典型算法相比,该算法具有更低的能耗和更长的网络生存期。     

Comparing two clustering-based techniques to track mobile nodes in industrial wireless sensor networks

Tracking mobile nodes in dynamic and noisy conditions of industrial environments has provided a paradigm for many issues inherent in the area of distributed control systems in general and wireless sensor networks in particular. Due to the dynamic nature of the industrial environments, a practical tracking system is required that is adaptable to the changes in the environment. More specifically, given the limited resources of wireless nodes and the challenges created by harsh industrial environments there is a need for a technique that can modify the configuration of the system on the fly as new wireless nodes are added to the network and obsolete ones are removed. To address these issues, two cluster-based tracking systems, one static and the other dynamic, are proposed to organize the overall network field into a set of tracking zones, each composed of a sink node and a set of corresponding anchor nodes. To manage the wireless nodes activities and inter and intra cluster communications, an agent-based technique is employed. To compare the architectures, we report on a set of experiments performed in JADE (Java Agent Development Environment). In these experiments, we compare two agent-based approaches (dynamic and static) for managing clusters of wireless sensor nodes in a distributed tracking system. The experimental results corroborate the efficiency of the static clusters versus the robustness and effectiveness of the dynamic clusters.     

一种新的环型蓝牙网络拓扑形成协议及仿真

根据采用蓝牙技术的无线ad hoc网络的特点，提出了一种分布式的环型蓝牙网络拓扑形成协议。协议采用合并的思想，将节点快速姐奴成一个环型网络，且新节点可以随时加入网络．协议具有拓扑形成过程延迟低、控制开销小的特点，控制开销复杂度为O（N），且形成了平均微微网个数少、每节点度数低的蓝牙网络，网络中最多包含‘（N-2）／（k-1）’＋1个微微网，至少包含‘N/k’个微微网，节点最大度数为2。基于NS2的仿真实验评估了协议的性能，实验结果验证了协议形成了具较佳性能的环型蓝牙网络。     

延迟容忍网络中基于社会属性的负载感知路由

延迟容忍网络中采用中心性作为路由尺度会使部分节点承载过多的网络流量。针对这一问题,提出了一种基于社会属性的负载感知路由算法。使用节点的介数中心性（betweenness centrality, BC）和相似性两个社会属性指标以及节点的负载状况作为选择中继节点的依据,避免了消息传播能力强的节点产生严重的拥塞,均衡了网络流量。仿真结果表明,该算法能够提高网络的交付比率,减小网络的开销。     

New mixed broadcast scheduling approach using neural networks and graph coloring in wireless sensor network

Due to the mutual interference and sharing of wireless links in TDMA wireless sensor networks, conflicts will occur when data messages are transmitting between nodes. The broadcast scheduling problem (BSP) is aimed to schedule each node in different slot of fixed length frame at least once, and the objective of BSP is to seek for the optimal feasible solution, which has the shortest length of frame slots, as well as the maximum node transmission. A two-stage mixed algorithm based on a fuzzy Hopfield neural network is proposed to solve this BSP in wireless sensor network. In the first stage, a modified sequential vertex coloring algorithm is adopted to obtain a minimal TDMA frame length. In the second stage, the fuzzy Hopfield network is utilized to maximize the channel utilization ratio. Experimental results, obtained from the running on three benchmark graphs, show that the algorithm can achieve better performance with shorter frame length and higher channel utilizing ratio than other exiting BSP solutions.     

无线传感器网络的重叠分簇与边界搜索

无线传感器网络（wireless sensor networks, WSNs）由大量微小的传感器节点组成,分簇的网络架构能较好地处理大规模网络的自组织问题,因而成为WSNs提升性能和扩展性的标准方法。在拓扑发现、地理路由和目标追踪等应用中,重叠分簇能更好地满足要求,同时,辨别出WSNs的边界节点是重要的任务。与先前的基于节点的边界搜寻算法不同,提出了一种应对节点随机分布情况的自组织分簇算法。建立了重叠分簇,进而对重叠分簇进行分簇的边界融合,最后形成整个WSNs网络边界。仿真结果表明,该算法能够生成更为均衡的分簇,显著提高网络生存周期,并能有效的实现网络边界节点的搜索。