Constructing a MANET Based on Clusters

This paper proposes a scheme for constructing a mobile ad hoc network (MANET) based on clusters. The proposed MANET architecture is made up of two hierarchies. One hierarchy is the backbone network which is made up of cluster heads and associate nodes, and the other hierarchy is the cluster which is made up of one cluster head and multiple cluster members. In the proposed cluster generation algorithm, the number of potential cluster members is used as a metric, and it is always the new node with the maximum number of potential cluster members that is elected as a cluster head. In this way, the number of cluster heads is minimized. In this scheme, only one associate node is used to achieve the communication between two cluster heads, so the number of nodes included in the backbone network is minimized. This scheme also proposes the cluster merging algorithm in order to maintain the minimum number of cluster heads. In the proposed cluster repair algorithm, if a cluster head fails/moves out of the cluster, then a new cluster head is elected to maintain the cluster stability. From the perspective of the cluster stability, this paper analyzes the performance parameters of the proposed scheme, and the data results show that the proposed scheme improves the MANET stability.     

Cluster‐Based Trust Evaluation Scheme in an Ad Hoc Network

This paper presents a new trust evaluation scheme in an ad hoc network. To overcome the limited information about unfamiliar nodes and to reduce the required memory space, we propose a cluster‐based trust evaluation scheme, in which neighboring nodes form a cluster and select one node as a cluster head. The head issues a trust value certificate that can be referred to by its non‐neighbor nodes. In this way, an evaluation of an unfamiliar node's trust can be done very efficiently and precisely. In this paper, we present a trust evaluation metric using this scheme and some operations for forming and managing a cluster. An analysis of the proposed scheme over some security problems is also presented.     

A hybrid elephant herding optimization and cultural algorithm for energy‐balanced cluster head selection scheme to extend the lifetime in WSNs

Clustering‐based optimal cluster head selection in wireless sensor networks (WSNs) is considered as the efficient technique essential for improving the network lifetime. But enforcing optimal cluster head selection based on energy stabilization, reduced delay, and minimized distance between sensor nodes always remain a crucial challenge for prolonging the network lifetime in WSNs. In this paper, a hybrid elephant herding optimization and cultural algorithm for optimal cluster head selection (HEHO‐CA‐OCHS) scheme is proposed to extend the lifetime. This proposed HEHO‐CA‐OCHS scheme utilizes the merits of belief space framed by the cultural algorithm for defining a separating operator that is potent in constructing new local optimal solutions in the search space. Further, the inclusion of belief space aids in maintaining the balance between an optimal exploitation and exploration process with enhanced search capabilities under optimal cluster head selection. This proposed HEHO‐CA‐OCHS scheme improves the characteristic properties of the algorithm by incorporating separating and clan updating operators for effective selection of cluster head with the view to increase the lifetime of the network. The simulation results of the proposed HEHO‐CA‐OCHS scheme were estimated to be superior in percentage of alive nodes by 11.21%, percentage of dead nodes by 13.84%, residual energy by 16.38%, throughput by 13.94%, and network lifetime by 19.42% compared to the benchmarked cluster head selection schemes.     

Dynamic and hierarchical IPv6 address configuration for a mobile ad hoc network

The paper proposes a dynamic and hierarchical IPv6 address configuration scheme for a mobile ad hoc network (MANET). The scheme proposes the hierarchical architecture and combines the distributed and centralized address configuration approaches. In the architecture, a central node assigns IPv6 addresses for cluster heads that are distributed around a MANET, and distributed cluster heads assign IPv6 addresses for cluster members. The generation algorithm of a cluster is proposed, and it uses the number of potential cluster members as a measurement unit and minimizes the number of cluster heads. Therefore, the address configuration cost for cluster heads is reduced. A central node/cluster head uses the unicast communication mode to achieve the real‐time address recovery in order to ensure that it has enough address resources for assignment. The paper also proposes the low‐cost MANET merging/partitioning algorithm that guarantees that no address collision happens during the MANET merging/partitioning process. This paper analyzes the performance parameters of the proposed scheme, including the address configuration cost, the address configuration delay, and the number of MANET merging. The analytical results show that the proposed scheme effectively reduces the address configuration cost, shortens the address configuration delay, and decreases the number of MANET merging. Copyright © 2013 John Wiley & Sons, Ltd.     

GSM-R应急自组网中的分簇路由算法研究

在采用分簇结构的GSM-R应急自组织网络中,簇头的选择将直接影响整个网络的性能,因此必须设计合理的分簇算法,综合考虑网络环境中的各种因素,使得形成的分簇结构具有很好的系统环境和应用需求的适应性。通过对Ad Hoc自组网中的加权分簇算法WCA（Weighted Clustering Algorithm）简单介绍,从算法的复杂度、负载均衡性和适用环境等方面对其性能进行比较和分析。本文改进一种基于组合加权思想的分簇算法,即基于簇稳定性的加权分簇算法,以下简称CSBWCA（Cluster-Stability Based Weighted Clustering Algorithm）。同时,介绍了此算法的设计思想,并仿真了加权分簇算法和基于稳定性的加权分簇算法的节点簇间转移次数R随GSM-R应急网络中参与应急通信的终端数目N和最大转移速度的变化情况以及两种分簇算法的簇头更新次数U随终端数目以及终端最大移动速度的变化情况。仿真结果表明,基于簇稳定性的加权分簇算法的性能明显优于加权分簇算法。     

An efficient routing protocol for the QoS support of large‐scale MANETs

The hierarchical routing algorithm is categorized as a kind of routing method using node clustering to create a hierarchical structure in large‐scale mobile ad hoc network (LMANET). In this paper, we proposed a new hierarchical clustering algorithm (HCAL) and a corresponded protocol for hierarchical routing in LMANET. The HCAL is designed based on a cost metric in the form of the link expiration time and node's relative degree. Correspondingly, the routing protocol for HCAL adopts a reactive protocol to control the existing cluster head (CH) nodes and handle proactive nodes to be considered as a cluster in LMANET. Hierarchical clustering algorithm jointly utilizes table‐driven and on‐demand routing by using a combined weight metric to search dominant set of nodes. This set is composed by link expiration time and node's relative degree to establish the intra/intercommunication paths in LMANET. The performance of the proposed algorithm and protocol is numerically evaluated in average end‐to‐end delay, number of CH per round, iteration count between the CHs, average CH keeping time, normalized routing overhead, and packet delivery ratio over a number of randomly generated benchmark scenarios. Furthermore, to corroborate the actual effectiveness of the HCAL algorithm, extensive performance comparisons are carried out with some state‐of‐the‐art routing algorithms, namely, Dynamic Doppler Velocity Clustering, Signal Characteristic‐Based Clustering, Dynamic Link Duration Clustering, and mobility‐based clustering algorithms.     

基于移动预测模型的ad hoc网络稳定链路度量

提出了一种基于移动预测模型的稳定链路度量算法，定义了稳定邻居度量和本地运动度量2种测度。根据这2种测度，移动预测模型利用LZ78算法对本地节点与其邻居的稳定性概率进行预测，从而找到其最稳定邻居，为选择稳定路由提供依据。仿真结果表明此算法明显优于直方图算法及最小ID算法，所选链路的稳定性能显著提高。     

基于节点信任值的安全层次路由协议

由于无线传感器网络容易受到攻击,所以保证无线传感器在网络数据传输过程中的路由安全是必要的,文中提出一种基于节点信任值、节点度和距离的簇头选举算法,进行路由主干节点的可信选举,建立安全可信的层次路由。仿真结果表明,该算法可有效评估节点的信任值,解决了节点失效或被俘获所导致的层次路由安全问题。     

Clustering routing protocol based on improved PSO algorithm in WSN

Aiming at the problem that the location distribution of cluster head nodes filtered by wireless sensor network clustering routing protocol was unbalanced and the data transmission path of forwarding nodes was unreasonable,which would increase the energy consumption of nodes and shorten the network life cycle,a clustering routing protocol based on improved particle swarm optimization algorithm was proposed.In the process of cluster head election,a new fitness function was established by defining the energy factor and position equalization factor of the node,the better candidate cluster head node was evaluated and selected,the position update speed of the candidate cluster head nodes was adjusted by the optimized update learning factor,the local search and speeded up the convergence of the global search was expanded.According to the distance between the forwarding node and the base station,the single-hop or multi-hop transmission mode was adopted,and a multi-hop method was designed based on the minimum spanning tree to select an optimal multi-hop path for the data transmission of the forwarding node.Simulation results show that the clustering routing protocol based on improved particle swarm optimization algorithm can elect cluster head nodes and forwarding nodes with more balanced energy and location,which shortened the communication distance of the network.The energy consumption of nodes is lower and more balanced,effectively extending the network life cycle.     

Hierarchical and low‐power IPv6 address configuration for wireless sensor networks

The paper proposes a hierarchical and low‐power IPv6‐address configuration scheme for wireless sensor networks based on the cluster‐tree architecture. In the scheme, a wireless sensor network is divided into multiple clusters and the generation algorithm of a cluster is proposed. A cluster‐tree architecture for wireless sensor networks is presented and a layered IPv6 address format for a cluster head and a cluster member is created. The stateless address configuration strategy and the stateful address configuration strategy are effectively combined to develop the IPv6 address configuration scheme. In the scheme, the duplicate address detection of the IPv6 address assigned for a cluster member is performed in the cluster where the cluster member locates, and the IPv6 address configuration for the cluster members in the different clusters can be carried out at the same time. The paper also addresses the mobility of sensor nodes and their failure. From the theoretical and simulative perspectives, the paper analyzes the performance parameters, including duplicate address detection cost, address configuration cost and address configuration delay time, of the proposed scheme, Strong DAD and MANETConf. Analytical and simulative results show that the performance of the proposed scheme is better. Copyright © 2011 John Wiley & Sons, Ltd.     

A new algorithm for cluster head selection in LEACH protocol for wireless sensor networks

In wireless sensor network, a large number of sensor nodes are distributed to cover a certain area. Sensor node is little in size with restricted processing power, memory, and limited battery life. Because of restricted battery power, wireless sensor network needs to broaden the system lifetime by reducing the energy consumption. A clustering‐based protocols adapt the use of energy by giving a balance to all nodes to become a cluster head. In this paper, we concentrate on a recent hierarchical routing protocols, which are depending on LEACH protocol to enhance its performance and increase the lifetime of wireless sensor network. So our enhanced protocol called Node Ranked–LEACH is proposed. Our proposed protocol improves the total network lifetime based on node rank algorithm. Node rank algorithm depends on both path cost and number of links between nodes to select the cluster head of each cluster. This enhancement reflects the real weight of specific node to success and can be represented as a cluster head. The proposed algorithm overcomes the random process selection, which leads to unexpected fail for some cluster heads in other LEACH versions, and it gives a good performance in the network lifetime and energy consumption comparing with previous version of LEACH protocols.     

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.     

Trust management-based and energy efficient hierarchical routing protocol in wireless sensor networks

The single planar routing protocol has a slow convergence rate in the large-scale Wireless Sensor Network (WSN). Although the hierarchical routing protocol can effectively cope with large-scale application scenarios, how to elect a secure cluster head and balance the network load becomes an enormous challenge. In this paper, a Trust Management-based and ​Low Energy Adaptive Clustering Hierarchy protocol (LEACH-TM) is proposed. In LEACH-TM, by using the number of dynamic decision cluster head nodes, residual energy and density of neighbor nodes, the size of the cluster can be better constrained to improve energy efficiency, and avoid excessive energy consumption of a node. Simultaneously, the trust management scheme is introduced into LEACH-TM to defend against internal attacks. The simulation results show that, compared with LEACH-SWDN protocol and LEACH protocol, LEACH-TM outperforms in prolonging the network lifetime and balancing the energy consumption, and can effectively mitigate the influence of malicious nodes on cluster head selection, which can greatly guarantee the security of the overall network.     

Hybrid Chameleon Search and Remora Optimization Algorithm-based Dynamic Heterogeneous load balancing clustering protocol for extending the lifetime of wireless sensor networks

Clustering is an indispensable strategy that helps towards the extension of lifetime of each sensor nodes with energy stability in wireless sensor networks (WSNs). This clustering process aids in sustaining energy efficiency and extended network lifetime in sensitive and critical real-life applications that include landslide monitoring and military applications. The dynamic characteristics of WSNs and several cluster configurations introduce challenge in the process of searching an ideal network structure, a herculean challenge. In this paper, Hybrid Chameleon Search and Remora Optimization Algorithm-based Dynamic Clustering Method (HCSROA) is proposed for dynamic optimization of wireless sensor node clusters. It utilized the global searching process of Chameleon Search Algorithm for selecting potential cluster head (CH) selection with balanced trade-off between intensification and extensification. It determines an ideal dynamic network structure based on factors that include quantity of nodes in the neighborhood, distance to sink, predictable energy utilization rate, and residual energy into account during the formulation of fitness function. It specifically achieved sink node mobility through the integration of the local searching capability of Improved Remora Optimization Algorithm for determining the optimal points of deployment over which the packets can be forwarded from the CH of the cluster to the sink node. This proposed HCSROA scheme compared in contrast to standard methods is identified to greatly prolong network lifetime by 29.21% and maintain energy stability by 25.64% in contrast to baseline protocols taken for investigation.     

低能耗节点位置未知无线传感器网络控制方案

介绍了一种低能耗节点位置未知的网络控制方案,根据不同的网络运行轮数设定网络节点的通信半径,使网络具有良好的能量有效性.网络中基站经过构建阶段的启动过程、节点信息收集过程和节点信息上报过程,获得了整个网络节点的相对位置分布,然后整合节点-节点信息支路,得到具有回路链接的簇首节点集,其他节点根据自己邻居信息选择簇首节点,实现网络近似最小能耗拓扑的构建.通过仿真与同类典型算法LEACH-C、MCLB进行比较,结果显示该方案应用于网络运行时具有更长的网络生命周期、更少的信息总数和更低的网络构建代价.     

基于稀疏密集阵传输机制的WSN数据传输汇聚算法

为了改善无线传感网(WSN)的数据传输汇聚能力,提出了基于稀疏密集阵传输机制的WSN数据传输汇聚算法。引入核生成函数,设计了一种新的传输矩阵,将簇头节点与sink节点之间连通程度及负载程度进行量化,以提升簇头节点传输效果的评估能力;采用特征向量按列排序并结合卷积算法降低簇头节点传输值,以有效减少簇头节点负载;采用树分解模式搜寻可用哈密尔顿回路,构建了基于路径分解优化机制的汇聚稳定方法;通过使用哈密尔顿寻址来优化叶子节点与根节点之间的数据链路,以增强簇头节点覆盖能力与提高数据传输过程的稳定性能。仿真实验表明,与当前常用的基于阈值筛选模糊分簇的WSN数据稳定汇聚算法和面向医疗应用的无线传感器网络多径数据传输方法相比,所提算法具有更为集中的传输报文集中度,以及更高的传输链路抖动控制能力和网络汇聚带宽。     

一种基于邻域信息的多信道自适应建网算法

为实现多信道无线自组网的高效建网,针对节点难以感知全网拓扑、其他所有节点的可用频谱以及无法获得同步信息的实际场景,提出了一种基于邻域信息的多信道自适应建网算法。该算法首先设计基于邻域信息的建网策略,使节点能够以自身信息为基础,充分利用可用信道情况、邻居簇首情况等有限的邻域信息进行自适应决策,以建立分簇结构的网络;然后提出基于最大熵原理的信道质量评价算法和基于多头绒泡菌模型的邻居簇首评价算法,分别对节点的可用信道和邻居簇首进行排序,指导节点在建网过程中选择合理的信道和簇首。仿真结果表明,所提建网算法能够使节点在实际场景通信受限的条件下以较小的通信开销完成建网,建立的网络在公共信道数量和簇规模方面也取得了较好的均衡。     

基于冗余节点的LEACH协议的改进

无线传感器网络中LEACH协议是一种典型的能有效延长网络生命周期的节能通信协议。因为其优秀的节能效果和其简单的规程得到了广泛的认可。但是LEACH簇头算法存在簇头开销大、簇头没有确定的数量和位置等不足。而在成簇后的稳定阶段,节点通过一跳通信将数据传送给簇头,簇头也通过一跳通信将聚合后的数据传送给基站,这样会造成簇头节点...     

一种基于演化博弈的分簇协作路由算法

现有的分簇协作路由没有依据协作通信的特点选择簇头,也没能根据簇头节点的服务能力均衡簇成员负载,因而不能充分发挥协作通信能量高效的优势.本文提出了一种基于演化博弈的分簇协作路由算法CCREG.算法首先定义虚节点剩余能量作为簇头确立的指标,然后通过动态演化博弈为簇联盟问题建立模型.簇成员节点选择不同簇头结成联盟,可获得不同的收益.收益由簇头的能力、簇成员节点个数等因素决定.簇成员节点都可以根据自身得到的信息有限理性的选择簇结成联盟,直到网络中所有节点改变簇联盟都不能获得更高的收益.实验结果表明,与协作多输入多输出路由算法CMIMO相比,CCREG算法的网络生存周期在两个簇头情况下延长14%到70%,三个簇头情况下延长5%到80%.     

DUCR: Distributed unequal cluster‐based routing algorithm for heterogeneous wireless sensor networks

Designing energy efficient communication protocols for wireless sensor networks (WSNs) to conserve the sensors' energy is one of the prime concerns. Clustering in WSNs significantly reduces the energy consumption in which the nodes are organized in clusters, each having a cluster head (CH). The CHs collect data from their cluster members and transmit it to the base station via a single or multihop communication. The main issue in such mechanism is how to associate the nodes to CHs and how to route the data of CHs so that the overall load on CHs are balanced. Since the sensor nodes operate autonomously, the methods designed for WSNs should be of distributed nature, i.e., each node should run it using its local information only. Considering these issues, we propose a distributed multiobjective‐based clustering method to assign a sensor node to appropriate CH so that the load is balanced. We also propose an energy‐efficient routing algorithm to balance the relay load among the CHs. In case any CH dies, we propose a recovery strategy for its cluster members. All our proposed methods are completely distributed in nature. Simulation results demonstrate the efficiency of the proposed algorithm in terms of energy consumption and hence prolonging the network lifetime. We compare the performance of the proposed algorithm with some existing algorithms in terms of number of alive nodes, network lifetime, energy efficiency, and energy population.