Hierarchical geographic multicast routing for wireless sensor networks

Wireless sensor networks comprise typically dense deployments of large networks of small wireless capable sensor devices. In such networks, multicast is a fundamental routing service for efficient data dissemination required for activities such as code updates, task assignment and targeted queries. In particular, efficient multicast for sensor networks is critical due to the limited energy availability in such networks. Multicast protocols that exploit location information available from GPS or localization algorithms are more efficient and robust than other stateful protocols as they avoid the difficulty of maintaining distributed state (multicast tree). Since localization is typically already required for sensing applications, this location information can simply be reused for optimizing multicast performance at no extra cost. Recently, two protocols were proposed to optimize two orthogonal aspects of location-based multicast protocols: GMR (Sanchez et al. GMR: Geographic multicast routing for wireless sensor networks. In Proceedings of the IEEE SECON, 2006) improves the forwarding efficiency by exploiting the wireless multicast advantage but it suffers from scalability issues when dealing with large sensor networks. On the other hand, HRPM (Das et al. Distributed hashing for scalable multicast in wireless ad hoc networks. IEEE TPDS 47(4):445–487, 2007) reduces the encoding overhead by constructing a hierarchy at virtually no maintenance cost via the use of geographic hashing but it is energy-inefficient due to inefficacies in forwarding data packets. In this paper, we present HGMR (hierarchical geographic multicast routing), a new location-based multicast protocol that seamlessly incorporates the key design concepts of GMR and HRPM and optimizes them for wireless sensor networks by providing both forwarding efficiency (energy efficiency) as well as scalability to large networks. Our simulation studies show that: (i) In an ideal environment, HGMR incurs a number of transmissions either very close to or lower than GMR, and, at the same time, an encoding overhead very close to HRPM, as the group size or the network size increases. (ii) In a realistic environment, HGMR, like HRPM, achieves a Packet Delivery Ratio (PDR) that is close to perfect and much higher than GMR. Further, HGMR has the lowest packet delivery latency among the three protocols, while incurring much fewer packet transmissions than HRPM. (iii) HGMR is equally efficient with both uniform and non-uniform group member distributions.     

基于簇结构的无线传感器网络路由研究综述

介绍了典型分簇无线传感器网络路由协议的分类,总结了分簇路由协议的研究进展。针对无线传感器网络从同构型网络向异构型网络发展的趋势和特点,指出了路由协议向节点间相互协作的发展方向,并且在设计路由协作算法时可采用与无线传感器网络极为相似的多Agent系统模型。     

链路可靠的无线传感器网络组播路由协议

在无线传感器网络实际应用中,组播正在发挥着越来越重要的作用.但由于能量等多方面的因素,使得为无线传感器网络设计一个有效的组播路由是非常困难的.针对无线传感器网络中节点的能量限制,通过寻求节点间最短路径,提出一种能量有效的链路可靠组播路由协议(RLMR).该协议充分考虑到网络中节点的能耗因素和两节点间的链路可靠性等,通过对这两个因素的综合考虑,让能量较多并且以发送节点更靠近的节点承担更多传输任务的方式,为数据流优化路由选择,均衡无线传感器网络节点的能量消耗,以延长网络的生存时间.仿真结果证明了RLMR的有效性和可靠性.     

Safari: A self-organizing, hierarchical architecture for scalable ad hoc networking

As wireless devices become more pervasive, mobile ad hoc networks are gaining importance, motivating the development of highly scalable ad hoc networking techniques. In this paper, we give an overview of the Safari architecture for highly scalable ad hoc network routing, and we present the design and evaluation of a specific realization of the Safari architecture, which we call Masai. We focus in this work on the scalability of learning and maintaining the routing state necessary for a large ad hoc network. The Safari architecture provides scalable ad hoc network routing, the seamless integration of infrastructure networks when and where they are available, and the support of self-organizing, decentralized network applications. Safari’s architecture is based on (1) a self-organizing network hierarchy that recursively groups participating nodes into an adaptive, locality-based hierarchy of cells; (2) a routing protocol that uses a hybrid of proactive and reactive routing information in the cells and scales to much larger numbers of nodes than previous ad hoc network routing protocols; and (3) a distributed hash table grounded in the network hierarchy, which supports decentralized network services on top of Safari. We evaluate the Masai realization of the Safari architecture through analysis and simulations, under varying network sizes, fraction of mobile nodes, and offered traffic loads. Compared to both the DSR and the L+ routing protocols, our results show that the Masai realization of the Safari architecture is significantly more scalable, with much higher packet delivery ratio and lower overhead.     

基于灰狼算法的无线网络组播路由优化

针对无线网络中资源受限的组播路由问题,考虑网络节点的节点度限制和网络链路的带宽约束,以最小化组播路由开销为目标,提出了一种二进制编码方式的基于灰狼优化算法的组播路由策略.在给定的网络拓扑下,基于灰狼优化算法的组播路由策略可以迅速找到一棵包含源和目的节点的最小开销组播树.仿真结果表明,相比于遗传算法,所提出的基于灰狼优化算法的组播路由策略可以得到一棵开销更小的组播树,并且在相同的时间复杂下具有更强的算法稳定性.     

Secure multicast routing protocols in mobile ad‐hoc networks

A mobile ad‐hoc network (MANET) is a collection of autonomous nodes that communicate with each other by forming a multi‐hop radio network. Routing protocols in MANETs define how routes between source and destination nodes are established and maintained. Multicast routing provides a bandwidth‐efficient means for supporting group‐oriented applications. The increasing demand for such applications coupled with the inherent characteristics of MANETs (e.g., lack of infrastructure and node mobility) have made secure multicast routing a crucial yet challenging issue. Recently, several multicast routing protocols (MRP) have been proposed in MANETs. Depending on whether security is built‐in or added, MRP can be classified into two types: secure and security‐enhanced routing protocols, respectively. This paper presents a survey on secure and security‐enhanced MRP along with their security techniques and the types of attacks they can confront. A detailed comparison for the capability of the various routing protocols against some known attacks is also presented and analyzed. Copyright © 2013 John Wiley & Sons, Ltd.     

Power aware scalable multicast routing protocol for MANETs

Multicasting is an effective way to provide group communication. In mobile ad hoc networks (MANETs), multicasting can support a wide variety of applications that are characterized by a close degree of collaboration. Since MANETs exhibit severe resource constraints such as battery power, limited bandwidth, dynamic network topology and lack of centralized administration, multicasting in MANETs become complex. The existing multicast routing protocols concentrate more on quality of service parameters like end‐to‐end delay, jitter, bandwidth and power. They do not stress on the scalability factor of the multicast. In this paper, we address the problem of multicast scalability and propose an efficient scalable multicast routing protocol called ‘Power Aware Scalable Multicast Routing Protocol (PASMRP)’ for MANETs. PASMRP uses the concept of class of service with three priority levels and local re‐routing to provide scalability. The protocol also ensures fair utilization of the resources among the nodes through re‐routing and hence the lifetime of the network is increased. The protocol has been simulated and the results show that PASMRP has better scalability and enhanced lifetime than the existing multicast routing protocols. Copyright © 2005 John Wiley & Sons, Ltd.     

The Impact of Deployment Pattern and Routing Scheme on the Lifetime in Multi-Sink Wireless Sensor Network

Extensive use of sensor and actuator networks in many real-life applications introduced several new performance metrics at the node and network level. Since wireless sensor nodes have significant battery constraints, therefore, energy efficiency, as well as network lifetime, are among the most significant performance metrics to measure the effectiveness of given network architecture. This work investigates the performance of an event-based data delivery model using a multipath routing scheme for a wireless sensor network with multiple sink nodes. This routing algorithm follows a sink initiated route discovery process with the location information of the source nodes already known to the sink nodes. It also considers communication link costs before making decisions for packet forwarding. Carried out simulation compares the network performance of a wireless sensor network with a single sink, dual sink, and multi sink networking approaches. Based on a series of simulation experiments, the lifetime aware multipath routing approach is found appropriate for increasing the lifetime of sensor nodes significantly when compared to other similar routing schemes. However, energy-efficient packet forwarding is a major concern of this work; other network performance metrics like delay, average packet latency, and packet delivery ratio are also taken into the account.

     

无线传感器网络的分区异构分簇协议研究

针对无线传感器网络能量受限和路由协议中节点能量消耗不均衡的问题,提出一种新的无线传感器网络的分区异构分簇协议(PHC协议).该协议的核心是将3种不同能量等级的节点根据能量的不同分别部署在不同区域,能量较高的高级节点和中间节点使用聚类技术通过簇头直接传输数据到汇聚点,能量较低的普通节点则直接传输数据到汇聚点.仿真结果表明,该协议通过对节点合理的分配部署,使簇头分布均匀,更好地均衡了节点的能量消耗,延长了网络的稳定期,提高了网络的吞吐量,增强了网络的整体性能.     

传感器网络中一种分布式数据汇聚层次路由算法

由于传感器网络具有能量约束,低速率冗余数据和多对一传输等特点,传统的端到端集中式路由算法一般不适合传感器网络.提出了一种分布式数据汇聚层次路由算法,该算法利用能量核的思想汇聚数据和减少传输到目的节点的信息.模拟结果表明:比较传统的端到端集中式路由算法,该算法可以显著减少能量消耗;与一般的数据汇聚算法相比,该算法在保证能量消耗少的条件下,具有复杂度低和可扩展性好的特点.     

An Efficient Multicast Routing Protocol in Wireless Mobile Networks

Providing multicast service to mobile hosts in wireless mobile networking environments is difficult due to frequent changes of mobile host location and group membership. If a conventional multicast routing protocol is used in wireless mobile networks, several problems may be experienced since existing multicast routing protocols assume static hosts when they construct the multicast delivery tree. To overcome the problems, several multicast routing protocols for mobile hosts have been proposed. Although the protocols solve several problems inherent in multicast routing proposals for static hosts, they still have problems such as non-optimal delivery path, datagram duplication, overheads resulting from frequent reconstruction of a multicast tree, etc. In this paper, we summarize these problems of multicast routing protocols and propose an efficient multicast routing protocol based on IEFT mobile IP in wireless mobile networks. The proposed protocol introduces a multicast agent, where a mobile host receives a tunneled multicast datagram from a multicast agent located in a network close to it or directly from the multicast router in the current network. While receiving a tunneled multicast datagram from a remote multicast agent, the local multicast agent may start multicast join process, which makes the multicast delivery route optimal. The proposed protocol reduces data delivery path length and decreases the amount of duplicate copies of multicast datagrams. We examined and compared the performance of the proposed protocol and existing protocols by simulation under various environments and we got an improved performance over the existing proposals.     

A scalable multicast routing protocol for building shortest path trees

Scalability is a great concern in the design of multicast routing protocols for the global Internet. Building shortest path trees (SPT) is currently one of the most widely used approaches to supporting multicast routing because of the simplicity and low per‐destination cost of such trees. However, the construction of an SPT typically involves high protocol overhead, which leads to the scalability problem as the number of concurrent multicast sessions increases. In this paper, we present a destination‐initiated shortest path tree (DSPT) routing protocol. The design objective is to effectively reduce the protocol overhead associated with SPT constructions for providing scalable multicast. To achieve this objective, we introduce destination‐initiated joining operations in constructing SPTs. With DSPT, each router receiving a request to join a specific multicast group makes a local decision on selecting its parent node through which it connects to the existing tree. A source‐rooted SPT is built as a result of such collaborative operations at nodes. DSPT requires only limited routing information at routers. Analytical results demonstrate that DSPT scales well with respect to computation, storage and communication overhead when the number of concurrent multicast requests is large. Simulation experiments are also conducted to verify the correctness of the theoretically deduced analytical results. Copyright © 2006 John Wiley & Sons, Ltd.     

多播路由算法MPH的时间复杂度研究

多播通信是从一个源点同时向网络中的多个成员发送分组的通信服务,一个最小代价的多播路由算法是NP完全的,在时间敏感的应用中其运行时间是一个关键问题.MPH(Minimum Path Cost Heuristic)算法是一个著名的启发式最小代价多播路由算法,本文对该算法进行了理论分析和证明,并做了广泛的仿真实验,结果表明其时间复杂度是O(m²n)而不是过去文献中所给出的O(m²n+e).     

基于传输路径质量的无线mesh网络可靠多播

提出了一种可靠多播网(RM)模型,探讨了无线链路和节点可靠性对多播路径选择的影响。首先,建立了无线链路的相关性和多播路径的可靠性模型,并提出了多播传输的可靠性判据;同时,结合首树算法和多路径树算法提出了构造可靠多播网的算法。可靠多播网具有并行的多播路径,通过在多播源节点和目的节点之间选择多播链路和节点构成了可靠的多播路径,提供了多播路径的"负荷分担"和"热备份"功能,从而支持了多播业务可靠性。     

SMORT: Scalable multipath on-demand routing for mobile ad hoc networks

Increasing popularity and availability of portable wireless devices, which constitute mobile ad hoc networks, calls for scalable ad hoc routing protocols. On-demand routing protocols adapt well with dynamic topologies of ad hoc networks, because of their lower control overhead and quick response to route breaks. But, as the size of the network increases, these protocols cease to perform due to large routing overhead generated while repairing route breaks. We propose a multipath on-demand routing protocol (SMORT), which reduces the routing overhead incurred in recovering from route breaks, by using secondary paths. SMORT computes fail-safe multiple paths, which provide all the intermediate nodes on the primary path with multiple routes (if exists) to destination. Exhaustive simulations using GloMoSim with large networks (2000 nodes) confirm that SMORT is scalable, and performs better even at higher mobility and traffic loads, when compared to the disjoint multipath routing protocol (DMRP) and ad hoc on-demand distance vector (AODV) routing protocol.     

无线mesh网中最小编码代价低时延多播路由

提出了一种无线mesh网中最小网络编码代价低时延多播路由协议(MNCLDMR, minimal network coding and low delay multicast routing)。MNCLDMR的目标是选择合适的网络编码节点,最小化网络编码代价,降低网络时延。MNCLDMR主要思想是引入拓扑关键节点和网络编码关键节点的概念,以下一跳的节点是否是网络编码关键节点或拓扑关键节点作为路由判据,采用MNCLD算法构造多播树。仿真结果表明,MNCLDMR可以达到预定目标,合理形成网络编码机会,能实现最小网络编码代价低时延多播路由。     

Fuzzy-based unequal clustering protocol for underwater wireless sensor networks

Underwater wireless sensor network (UWSN) is a network made up of underwater sensor nodes, anchor nodes, surface sink nodes or surface stations, and the offshore sink node. Energy consumption, limited bandwidth, propagation delay, high bit error rate, stability, scalability, and network lifetime are the key challenges related to underwater wireless sensor networks. Clustering is used to mitigate these issues. In this work, fuzzy-based unequal clustering protocol (FBUCP) is proposed that does cluster head selection using fuzzy logic as it can deal with the uncertainties of the harsh atmosphere in the water. Cluster heads are selected using linguistic input variables like distance to the surface sink node, residual energy, and node density and linguistic output variables like cluster head advertisement radius and rank of underwater sensor nodes. Unequal clustering is used to have an unequal size of the cluster which deals with the problem of excess energy usage of the underwater sensor nodes near the surface sink node, called the hot spot problem. Data gathered by the cluster heads are transmitted to the surface sink node using neighboring cluster heads in the direction of the surface sink node. Dijkstra's shortest path algorithm is used for multi-hop and inter-cluster routing. The FBUCP is compared with the LEACH-UWSN, CDBR, and FBCA protocols for underwater wireless sensor networks. A comparative analysis shows that in first node dies, the FBUCP is up to 80% better, has 64.86% more network lifetime, has 91% more number of packets transmitted to the surface sink node, and is up to 58.81% more energy efficient than LEACH-UWSN, CDBR, and FBCA.     

无线传感网络中基于蚁群的路由算法

In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Ant-colony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime.     

High-throughput multicast routing metrics in wireless mesh networks

The stationary nature of nodes in a mesh network has shifted the main design goal of routing protocols from maintaining connectivity between source and destination nodes to finding high-throughput paths between them. Numerous link-quality-based routing metrics have been proposed for choosing high-throughput routing paths in recent years. In this paper, we study routing metrics for high-throughput tree or mesh construction in multicast protocols. We show that there is a fundamental difference between unicast and multicast routing in how data packets are transmitted at the link layer, and accordingly how the routing metrics for unicast routing should be adapted for high-throughput multicast routing. We propose a low-overhead adaptive online algorithm to incorporate link-quality metrics to a representative multicast routing protocol. We then study the performance improvement achieved by using different link-quality-based routing metrics via extensive simulation and experiments on a mesh-network testbed, using ODMRP as a representative multicast protocol.Our extensive simulation studies show that: (1) ODMRP equipped with any of the link-quality-based routing metrics can achieve higher throughput than the original ODMRP. In particular, under a tree topology, on average, ODMRP enhanced with link-quality routing metrics achieve up to 34% higher throughput than the original ODMRP under low multicast sending rate; (2) the improvement reduces to 21% under high multicast sending rate due to higher interference experienced by the data packets from the probe packets; (3) heavily penalizing lossy links is an effective way in the link-quality metric design to avoid low-throughput paths; and (4) the path redundancy from a mesh data dissemination topology in mesh-based multicast protocols provides another degree of robustness to link characteristics and reduces the additional throughput gain achieved by using link-quality-based routing metrics. Finally, our experiments on an eight-node testbed show that on average, ODMRP using SPP and PP achieves 14% and 17% higher throughput over ODMRP, respectively, validating the simulation results.     

Design and Analysis of Spatiotemporal Multicast Protocols for Wireless Sensor Networks

We propose a new multicast communication paradigm called “spatiotemporal multicast” for supporting applications which require spatiotemporal coordination in wireless sensor networks. In this paper we focus on a special class of spatiotemporal multicast called “mobicast” featuring a message delivery zone that moves at a constant velocity $\vec v$ . The key contributions of this work are: (1) the specification of mobicast and its performance metrics, (2) the introduction of four different mobicast protocols along with the analysis of their performance, (3) the introduction of two topological network compactness metrics for facilitating the design and analysis of spatiotemporal protocols, and (4) an experimental evaluation of compactness properties for random sensor networks and their effect on routing protocols.