NODIC: a novel distributed clustering routing protocol in WSNs by using a time-sharing approach for CH election

Wireless Networks - Due to the battery limitations, energy-efficient routing is one of the most important issues in WSNs. In this paper, a novel distributed clustering routing protocol (NODIC) is...     

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

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

A game theory based energy efficient clustering routing protocol for WSNs

The energy constraint is one of the inherent defects of the Wireless Sensor Networks (WSNs). How to prolong the lifespan of the network has attracted more and more attention. Numerous achievements have emerged successively recently. Among these mechanisms designing routing protocols is one of the most promising ones owing to the large amount of energy consumed for data transmission. The background and related works are described firstly in detail in this paper. Then a game model for selecting the Cluster Head is presented. Subsequently, a novel routing protocol named Game theory based Energy Efficient Clustering routing protocol (GEEC) is proposed. GEEC, which belongs to a kind of clustering routing protocols, adopts evolutionary game theory mechanism to achieve energy exhaust equilibrium as well as lifetime extension at the same time. Finally, extensive simulation experiments are conducted. The experimental results indicate that a significant improvement in energy balance as well as in energy conservation compared with other two kinds of well-known clustering routing protocols is achieved.     

Load balancing routing with queue overflow prediction for WSNs

The ease of deployment of Wireless Sensor Networks (WSNs) makes them very popular and useful for data collection applications. Nodes often use multihop communication to transmit data to a collector node. The next hop selection in order to reach the final destination is done following a routing policy based on a routing metric. The routing metric value is exchanged via control messages. Control messages transmission frequency can reduce the network bandwidth and affect data transmission. Some approaches like trickle algorithm have been proposed to optimize the network control messages transmission. In this paper, we propose a collaborative load balancing algorithm (CoLBA) with a prediction approach to reduce network overhead. CoLBA is a queuing delay based routing protocol that avoids packet queue overflow and uses a prediction approach to optimize control messages transmission. Simulation results on Cooja simulator show that CoLBA outperforms other existing protocols in terms of delivery ratio and queue overflow while maintaining a similar end-to-end delay.

     

静态分簇下的大规模分布式天线系统用户调度算法

在大规模分布式天线系统中,静态分簇和用户调度带来的簇间干扰问题会导致系统和速率下降。针对这个问题,提出了一种两阶段贪婪用户调度算法。首先,每个簇内并行实施贪婪用户调度;然后,从全局上再次利用贪婪算法来剔除簇间干扰较大、服务质量较差的用户,使得系统和速率进一步提升。仿真结果表明,随着不同系统参数的改变,两阶段贪婪用户调度算法可有效提高系统和速率。     

An energy-efficient overlapping clustering protocol in WSNs

Wireless Networks - The limited battery power supply system makes energy efficiency a major concern in WSNs. An effective method is to organize the sensors into clusters to avoid redundancy and...     

An energy-efficient distributed node clustering routing protocol with mobility pattern support for underwater wireless sensor networks

Wireless Networks - Underwater Wireless Sensor Networks (UWSN) has received more attention in exploring promising technologies for scientific data collection of underwater natural resources with...     

Performance enhancement routing protocols for heterogeneous WSNs

One of the main constraints in wireless sensor networks (WSNs) is the energy consumption. To mitigate this limitation and to prolong network life‐time, stability period and throughput, this paper proposes new cluster‐heads selection protocols, they based on Stable Election Protocol (SEP) and Distributed Energy‐Efficient Clustering (DEEC). We first propose Enhanced Zonal‐SEP (EZSEP) and Zonal Threshold‐DEEC (ZTDEEC) protocols, the proposed protocols are based on dividing the network field into certain zones, this will improve the connectivity of the far normal nodes with the base station (BS). Several evaluation metrics are used to compare between the proposed protocols and the conventional ZSEP and TDEEC protocols such as: network stability, instability period, life‐time and throughput. Considering the same total initial energy, the obtained results show that the proposed EZSEP slightly outperforms the conventional ZSEP in terms of network stability, instability period and life‐time, it achieves enormous improvements in terms of throughput as more nodes can transmit direct to BS. On the other hand, the proposed ZTDEEC provides huge improvements in terms of all the evaluation metrics mentioned above. To further improve the network life‐time and network throughput, we propose Threshold‐based EZSEP (TE‐ZSEP) and Enhanced‐ZTDEEC (EZ‐TDEEC) protocols, in these two new protocols we redefine the threshold formula used in EZSEP and ZTDEEC to consider both weighted energy and weighted distance parameters. By combining the idea of dividing the network field into certain zones and the new threshold formula, the proposed TE‐ZSEP and EZ‐TDEEC protocols can effectively improve the energy consumption in heterogeneous WSN and prolong its life‐time as proved by the obtained results.     

WSNs中基于数据匹配的分布式故障节点检测算法

针对无线传感网络的节点故障问题,提出一种新的分布式故障节点检测算法(DFDA).DFDA算法利用节点度信息估计节点对网络的重要性,并尽可能将节点度高的节点保存到网络中.通过比较节点间感测的数据,检测故障节点.为了增强检测的准确性,采用双重测定策略.仿真结果表明,相比于同类算法,DFDA算法提高了检测故障节点的精确度,并...     

Dynamic clustering approach with ACO-based mobile sink for data collection in WSNs

Enhancing the network lifetime of wireless sensor networks is an essential task. It involves sensor deployment, cluster formation, routing, and effective utilization of battery units. Clustering and routing are important techniques for adequate enhancement of the network lifetime. Since the existing clustering and routing approaches have high message overhead due to forwarding collected data to sinks or the base station, it creates premature death of sensors and hot-spot issues. The objective of this study is to design a dynamic clustering and optimal routing mechanism for data collection in order to enhance the network lifetime. A new dynamic clustering approach is proposed to prevent premature sensor death and avoid the hot spot problem. In addition, an Ant Colony Optimization (ACO) technique is adopted for effective path selection of mobile sinks. The proposed algorithm is compared with existing routing methodologies, such as LEACH, GA, and PSO. The simulation results show that the proposed cluster head selection algorithm with ACO-based MDC enhances the sensor network lifetime significantly.

     

基于网格的无线传感器网络非均匀分簇算法

在无线传感器网络中,首先要考虑的是如何解决能耗问题.针对无线传感器网络现有算法存在的节点能耗不均匀及节点部署密集造成的数据冗余和能量浪费,提出了一种节能路由算法UECG.通过设定虚拟网格以及非均匀分簇来实现网络能量的均衡消耗.仿真结果表明,与LEACH协议及其改进协议EEUC相比,UECG算法能够有效减少冗余数据,平衡簇群间的能量消耗,达到延长网络寿命的目的.     

Multihop lightwave networks: a comparison of store-and-forward andhot-potato routing

The achievable aggregate capacity for a variant of the basic multihop approach in which minimum distance store-and-forward routing is replaced by a hot-potato routing algorithm is determined. With hot-potato routing, all packets simultaneously arriving at a given node and not intended for reception at that node are immediately placed onto the outbound links leaving that node; if two or more packets contend for the same outgoing link to achieve a minimum distance routing, then all but one will be misrouted to links which produce longer paths to the eventual destination. Attention is confined to the development of an analytical methodology for finding the probability distribution of the number of hops with hot potato routing for symmetric networks under uniform traffic load. Results show that the maximum throughput achievable with hot-potato routing can be as low as 25% of that for store-and-forward routing, and that the relative degradation increases as the number of nodes grows larger. This implies that the link speed up needed to produce a significant overall capacity advantage with hot potato should be at least a factor of 10     

Energy aware hierarchical cluster-based routing protocol for WSNs

Wireless sensor networks(WSNs) are emerging as essential and popular ways of providing pervasive computing environments for various applications. Unbalanced energy consumption is an inherent problem in WSNs, characterized by multi-hop routing and a many-to-one traffic pattern. This uneven energy dissipation can significantly reduce network lifetime. In multi-hop sensor networks, information obtained by the monitoring nodes need to be routed to the sinks, the energy consumption rate per unit information transmission depends on the choice of the next hop node. In an energy-aware routing approach, most proposed algorithms aim at minimizing the total energy consumption or maximizing network lifetime. In this paper, we propose a novel energy aware hierarchical cluster-based(NEAHC) routing protocol with two goals: minimizing the total energy consumption and ensuring fairness of energy consumption between nodes. We model the relay node choosing problem as a nonlinear programming problem and use the property of convex function to find the optimal solution. We also evaluate the proposed algorithm via simulations at the end of this paper.     

流量工程中静态路由算法的研究

该文提出了一种应用于流量工程环境中的静态路由算法。考虑当前的网络资源情况,分优先级别在网络中计算并配置标记交换路径(Label Switched Path,LSP),当某一优先级有多条 LSP需要并行配置时,利用遗传算法搜索最优或较优的配置方案,使得网络的链路带宽使用率低于管理员定义的某个限定值,达到合理分布资源的目的。此外,提出了一种改进的 Dijkstra 算法计算 LSP的最短路径。     

一种分布式延迟受限路由算法

本文提出了一种分布式点到延迟受限路由算法（UDCR）在满足给定时延要求的路径存在的条件下，该算法总能找到满足边界限制条件的优化路径。对于每一个网络节点，算法只需要存储有限的网络状态信息和运算量。文中证明了算法的正确性，给出了量坏情况下的消息复杂性是O（|V|^2)其中|V|是顶点的数量。仿真结果显示，与其它延迟受限的启发式算法相比，本文提出的算法在适中的消息复杂性下取得了最好的代价性能。     

An optimal distributed routing algorithm

A distributed optimal one-level routing algorithm is presented. The algorithm is based on Newton's method. Using the variable reduction method, the Hessian matrix becomes diagonal. An example shows that the algorithm has a much faster convergence rate, more accurate results, and better transient behavior than previous work. The algorithm is shown to be convergent, stable, robust, and loop free     

Information routing and reliability issues in distributed sensornetworks

Communication issues and problems in information routing in distributed sensor networks (DSNs) are considered. Two important communication constraints, viz., the delay constraint and the reliability constraint, are identified, and their impact on information routing is discussed. It is shown that the maximum end-to-end delay in a network depends on the diameter of the network, and efficient distributed algorithms are presented to determine the diameter of asynchronous networks. A distributed algorithm that determines the diameter of an asynchronous tree network when an arbitrary node in the network initiates the algorithm is introduced. An efficient algorithm for determining the diameter when multiple nodes initiate the algorithm is presented. An algorithm to determine the diameter of arbitrary networks is presented, and its message complexity is shown. Effects of link/node failures on network delay are studied, and important network structure design criterion are discussed. The distributed, dynamic routing algorithms are reviewed, and their adaptation to DSN environments is discussed     

Multi-hop Communication based optimal clustering in hexagon and voronoi cell structured WSNs

Energy saving is always an important issue as most of the Wireless Sensor Networks (WSNs) work in an unattended geographical environment where human access and monitoring are practically impossible. One of the existing ways of saving energy in WSNs is clustering of sensor nodes. Furthermore, the clustering process can be made more effective by optimizing the number of clusters. Cluster shape, Intra-cluster and Inter cluster topologies are some of the impacting factors for energy conservation in WSNs. In this paper, for the purpose of further saving the energy consumption, we considered a network with multi-hop communication. An analytical expression is developed for finding optimal clusters particularly, when the sensing field is split into hexagonal and voronoi clusters. Besides, the effect of data aggregation ratio, position of base station on the overall energy consumption is analysed through different case studies. The obtained results are compared with the single-hop counterparts. A significant reduction in the energy consumption can be observed from the results. Thus, multi-hop based optimal clustering results in a substantial reduction of energy consumption in WSN.