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.     

Analysis of tree‐based multicast routing in wireless sensor networks with varying network metrics

Wireless ad hoc and sensor networks are emerging with advances in electronic device technology, wireless communications and mobile computing with flexible and adaptable features. Routing protocols act as an interface between the lower and higher layers of the network protocol stack. Depending on the size of target nodes, routing techniques are classified into unicast, multicast and broadcast protocols. In this article, we give analysis and performance evaluation of tree‐based multicast routing in wireless sensor networks with varying network metrics. Geographic multicast routing (GMR) and its variations are used extensively in sensor networks. Multicast routing protocols considered in the analytical model are GMR, distributed GMR, demand scalable GMR, hierarchical GMR, destination clustering GMR and sink‐initiated GMR. Simulations are given with comparative analysis based on varying network metrics such as multicast group size, number of sink nodes, average multicast latency, number of clusters, packet delivery ratio, energy cost ratio and link failure rate. Analytical results indicate that wireless sensor network multicast routing protocols operate on the node structure (such as hierarchical, clustered, distributed, dense and sparse networks) and application specific parameters. Simulations indicate that hierarchical GMR is used for generic multicast applications and that destination clustering GMR and demand scalable GMR are used for distributed multicast applications. Copyright © 2012 John Wiley & Sons, Ltd.     

一种节点自分布最优Ad Hoc多播树及其应用

为无线单播模式设计的RTS/CTS信道握手机制不适用于多播模式,导致Ad hoc多播树节点易与隐藏终端发生冲突.通过提出m阶冲突域、节点在冲突域中的分布指标,结合无线网多播数据通信机制分析树节点所在m阶冲突域的冲突概率,进而得到节点自分布最优树的概念,并将它融入多播树的适应函数的设计中,淘汰不良树,优化树节点在m阶冲突域中的分布,在网络层形成一种预防机制,可降低隐藏终端冲突概率;应用于MAODV协议中,提高了MAODV的端到端数据分组平均投递率,这也能够为基于网的和混合式的其他类型MANETs多播路由协议的路由节点分布优化提供有价值的参考.     

Scalable location guide overlay multicast in mobile ad hoc networks using tree partition scheme

Nodes mobility brings flinty challenges to multicast in Mobile ad hoc Networks (MANETs). To track nodes mobility, flooding messages are widely used for data delivery structure construction and maintenance in many multicast protocols. These periodic flooding messages significantly consume network resources, such as energy and bandwidth, and result in network collisions. To release data delivery structure maintenance onus, profited from GPS location service, a number of stateless location based multicast protocol were proposed, where a destination list is encapsulated into each data packet for data packet orientation. However, due to data packet capability limitation, the way of encapsulating a destination list in each data packet header restricts the protocol scalability. To solve the scalability issue of multicast protocols, we propose a Scalable Location Guide Overlay Multicast (SLGOM) for MANETs. Analysis and simulation results show that SLGOM achieves high performance in large multicast group and significantly improves the scalability of stateless multicast with respect to group size. Copyright © 2010 John Wiley & Sons, Ltd.     

An efficient mesh‐based multicast routing protocol in mobile ad hoc networks

Mesh‐based multicast routing protocols for mobile ad hoc networks (MANETs) build multiple paths from senders to receivers to deliver packets even in the presence of links breaking. This redundancy results in high reliability/robustness but may significantly increase packet overhead. This paper proposes a mesh‐based multicast protocol, called centered protocol for unified multicasting through announcements (CPUMA), that achieves comparable reliability as existing mesh‐based multicast protocols, however, with significantly much less data overhead. In CPUMA, a distributed core‐selection and maintenance algorithm is used to find the source‐centric center of a shared mesh. We leverage data packets to center the core of each multicast group shared mesh instead of using GPS or any pre‐assignment of cores to groups (the case of existing protocols). The proposed centering scheme allows reducing data packet overhead and creating forwarding paths toward the nearest mesh member instead of the core to reduce latency. We show, via simulations, that CPUMA outperforms existing multicast protocols in terms of data packet overhead, and latency while maintaining a constant or better packet delivery ratio, at the cost of a small increase in control overhead in a few scenarios. Copyright © 2010 John Wiley & Sons, Ltd.     

A routing protocol for mobile ad‐hoc networks using the profit optimization model

Recently, wireless networks have become one of the major development trends in computer network technology. Because there is no more need of the wired transmission medium, applications have thus diversified. One such growing field of wireless networks is the mobile ad‐hoc network (MANET). A MANET consists of mobile hosts (such as portable laptops, vehicles, etc.), and no fixed infrastructure is required. MANETs provide ease of self‐configuration and can extend coverage at a low cost. Numerous applications have therefore been proposed under this network environment for daily life use. Because MANETs nodes are capable of moving, MANET network topology changes frequently. Thus, the traditional routing protocols fail to fit such an environment. In this paper, we propose an efficient routing protocol for MANETs, which integrates the mathematical model of profit optimization (the Kelly formula) from the field of economics to cope with the routing problem caused by node mobility. Some numerical simulations have been conducted to evaluate the performance of the proposed method using the network simulator NS‐2. The results show that our proposed method outperforms conventional routing protocols in packet delivery ratio comparisons; and the average end‐to‐end delays are within a tolerable range. Copyright © 2013 John Wiley & Sons, Ltd.     

移动自组织网络中基于树结构的优化组播路由算法(英)

Mobile Ad hoc Networks(MANETs) play an important role in emergency communications where network needs to be constructed temporarily and quickly.Since the nodes move randomly,routing protocols must be highly effective and reliable to guarantee successful packet delivery.Based on the data delivery structure,most of the existing multicast routing protocols can be classified into two folders:tree-based and mesh-based.We observe that tree-based ones have high forwarding efficiency and low consumptions of bandwidth,and they may have poor robustness because only one link exists between two nodes.As a treebased multicast routing protocol,MAODV(Multicast Ad hoc On-demand Vector) shows an excellent performance in lightweight ad hoc networks.As the load of network increases,QoS(Quality of Service) is degraded obviously.In this paper,we analyze the impact of network load on MAODV protocol,and propose an optimized protocol MAODV-BB(Multicast Ad hoc On-demand Vector with Backup Branches),which improves robustness of the MAODV protocol by combining advantages of the tree structure and the mesh structure.It not only can update shorter tree branches but also construct a multicast tree with backup branches.Mathematical analysis and simulation results both demonstrate that the MAODV-BB protocol improves the network performance over conventional MAODV in heavy load ad hoc networks.     

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.     

Deploying power‐aware on‐demand (PAOD) schemes over routing protocols of mobile wireless ad hoc networks

A mobile ad hoc network (MANET) is an autonomous collection of mobile nodes that communicate over relatively bandwidth‐constrained wireless links. MANETs need efficient algorithms to determine network connectivity, link scheduling, and routing. An important issue in network routing for MANETs is to conserve power while still achieve a high packet success rate. Traditional MANET routing protocols do not count for such concern. They all assume working with unlimited power reservoirs. Several ideas have been proposed for adding power‐awareness capabilities to ad hoc networks. Most of these proposals tackle the issue by either proposing new power‐aware routing protocols or modifying existing routing protocols through the deployment of power information as cost functions. None of them deal with counter‐measures that ought to be taken when nodes suffer from low power reserves and are subject to shut down in mid of normal network operations. In this paper, power‐awareness is added to a well‐known traditional routing protocol, the ad hoc on‐demand distance vector (AODV) routing protocol. The original algorithm is modified to deal with situations in which nodes experience low power reserves. Two schemes are proposed and compared with the original protocol using different performance metrics such as average end‐to‐end delays, transmission success rates, and throughputs. These schemes provide capabilities for AODV to deal with situations in which operating nodes have almost consumed their power reserves. Copyright © 2005 John Wiley & Sons, Ltd.     

Joint Design of Routing and Medium Access Control for Hybrid Mobile Ad Hoc Networks

Efficient routing and medium access control (MAC) are very important for Mobile Ad hoc Networks (MANETs). Most existing routing and MAC protocols consider homogeneous ad hoc networks, in which all nodes are modeled as the same, i.e., they have the same communication capabilities and characteristics. Although a homogeneous network model is simple and easy to analyze, it misses important characteristics of many realistic MANETs such as military battlefield ad hoc networks. In addition, a homogeneous ad hoc network suffers from poor performance and scalability. In many ad hoc networks, multiple types of nodes do co-exist; and some nodes have larger transmission power, higher transmission data rate, and better processing capability, are more reliable and robust than other nodes. Hence, a hybrid network model is more realistic and provides many advantages for designing better routing and MAC protocols. In this paper, we present a new routing protocol called Hybrid Routing, which is specifically designed for hybrid MANETs. In addition, a novel MAC protocol is jointly designed for hybrid MANETs. Extensive simulations demonstrate that the proposed routing MAC protocols have very good performance.

Ad hoc mobile multicast routing using the concept of long‐lived routes

Mobile ad hoc networks are recognized by their abilities to form, sustain, and deform networks on‐the‐fly without the need for any pre‐established and fixed infrastructures. This wireless multi‐hop technology requires adaptive networking protocols with low control overhead and low power consumption to operate efficiently. Existing research so far are mainly concerned with unicast routing for ad hoc mobile networks. There is a growing interest in supporting multicast communication in an ad hoc mobile environment. In this paper, the associativity‐based ad hoc multicast (ABAM) routing protocol is proposed. The concept of association stability is utilized during multicast tree discovery, selection, and reconfiguration. This allows routes that are long‐lived to be selected, thereby reducing the frequency of route reconstructions. ABAM employs a localized route reconstruction strategy in response to migrations by source, receiver, and tree nodes. It can repair an affected subtree via a single route reconstruction operation. ABAM is robust since the repair can be triggered by a node in the tree or by the migrated node itself. ABAM is also capable of handling multicast group dynamics when mobile hosts decide to join and leave an existing multicast group. Our simulation results reveal that under different mobility scenarios and multicast group size, ABAM has low communication overhead and yields better throughput performance. Copyright © 2001 John Wiley & Sons, Ltd.     

Adaptive zone routing protocol for ad hoc network nodes with non‐uniform mobilities

In recent years, a variety of new routing protocols for mobile ad hoc wireless NETworks (MANETs) have been developed. Performance evaluation and comparison of many of these routing protocols have been performed using detailed simulation models. Zone routing protocol (ZRP) is one of these routing protocols, which is a hybrid routing protocol that proactively maintains routing information for a local neighbourhood (routing zone), while reactively acquiring routes to destinations beyond the routing zone. The studies on ZRP have assumed homogeneous scenarios where all mobile nodes have uniform mobility and are statistically identical, lacking the studies on heterogeneous scenarios where mobile nodes move with non‐uniform mobilities in the same network. In this paper, we study the performance of ZRP in such scenarios. We propose an efficient scheme for ZRP to adapt to the non‐uniform mobilities scenario and study its performance for different mobility scenarios, network loads and network sizes. Copyright © 2003 John Wiley & Sons, Ltd.     

基于频率域多目标MANETs可信路由决策研究

移动Ad-hoc网络(MANETs)具有开放的媒质,动态的拓扑结构,分布式的合作和受限的网络能力等基本特点。网络中移动节点具有匿名性和高度自治的特点,网络通讯依靠在通信路径上的中间节点转发数据包,实现无线传输范围外节点间的正常通信。该文提出了一种独特的MANETs中基于频率下多目标可信路由决策算法,它和现在大多数路由算法都是在时间域下使用单一约束参数选择路由的方式截然不同。利用概率理论分析安全和可信路由,基于概率密度函数的时频相互转化,减小计算复杂度,解决MEANTs中节点间缺乏物理安全以及在低信任水平和节点相互勾结扰乱网络操作情况下,发现可信安全路由难的问题。实例分析证明了此算法的可行性。     

Performance evaluation of ad hoc routing protocols for military communications

Mobile ad hoc networks (MANETs) are of much interest to both the research community and the military because of the potential to establish a communication network in any situation that involves emergencies. Examples are search‐and‐rescue operations, military deployment in hostile environments, and several types of police operations. One critical open issue is how to route messages considering the characteristics of these networks. The nodes act as routers in an environment without a fixed infrastructure, the nodes are mobile, the wireless medium has its own limitations compared to wired networks, and existing routing protocols cannot be employed, at least without modifications. Over the last few years, a number of routing protocols have been proposed and enhanced to address the issue of routing in MANETs. It is not clear how those different protocols perform under different environments. One protocol may be the best in one network configuration but the worst in another. This article provides an analysis and performance evaluation of those protocols that may be suitable for military communications. The evaluation is conducted in two phases. In the first phase, we compare the protocols based on qualitative metrics to locate those that may fit our evaluation criteria. In the second phase, we evaluate the selected protocols from the first phase based on quantitative metrics in a mobility scenario that reflects tactical military movements. The results disclose that there is no routing protocol in the current stage without modifications that can provide efficient routing to any size of network, regardless of the number of nodes and the network load and mobility. Copyright © 2011 John Wiley & Sons, Ltd.     

GMZRP: Geography-aided Multicast Zone Routing Protocol in Mobile Ad Hoc Networks

This paper presents the design and evaluation of a highly efficient on-demand multicast routing protocol for mobile ad hoc networks (MANETs). The protocol, called Geography-aided Multicast Zone Routing Protocol (GMZRP), eliminates as much as possible duplicate route queries by using a simple yet effective strategy for propagating the multicast route request (MRREQ) packets. GMZRP is the first hybrid multicast protocol taking the advantages of both topological routing and geographical routing. It partitions the network coverage area into small zones and guarantees that each geographic zone is queried only once. GMZRP maintains a multicast forwarding tree at two levels of granularities, i.e., the zone granularity and the node granularity. By doing this, it can easily handle route breakage since the zone level information can help recover the link failure at the node level. The results of the performance evaluation of GMZRP using simulation show that, comparing with the well-known multicast protocol ODMRP (On-Demand Multicast Routing Protocol), GMZRP has much lower protocol overhead in terms of query packets and, meanwhile, achieves competing packet delivery ratio and shorter delivery latency.

移动Ad Hoc网络组播路由协议的研究综述

移动Ad Hoc网络是一个自组织、移动节点通过无线链路组成的动态拓扑变化的网络。由于网络规模小、无基础设施构建快速等特点,从而广泛应用于灾难救助、临时会议、战场指挥等场合。这些应用都涉及到移动Ad Hoc对组播的支持,因此,随着网络应用规模的增长,移动Ad Hoc网络对组播的支持成为一个重要的研究课题。本文对目前的组播路由机制进行了分类和研究,详细描述和比较了这些移动Ad Hoc网络组播路由协议,为组播路由协议和算法进一步的研究提出了新的课题。     

Two algorithms for multi‐constrained optimal multicast routing

Multimedia applications, such as video‐conferencing and video‐on‐demand, often require quality of service (QoS) guarantees from the network, typically in the form of minimum bandwidth, maximum delay, jitter and packet loss constraints, among others. The problem of multicast routing subject to various forms of QoS constraints has been studied extensively. However, most previous efforts have focused on special situations where a single or a pair of constraints is considered. In general, routing under multiple constraints, even in the unicast case is an NP‐complete problem. We present in this paper two practical and efficient algorithms, called multi‐constrained QoS dependent multicast routing (M_QDMR) and (multicasting routing with multi‐constrained optimal path selection (M_MCOP)), for QoS‐based multicast routing under multiple constraints with cost optimization. We provide proof in the paper that our algorithms are correct. Furthermore, through extensive simulations, we illustrate the effectiveness and efficiency of our proposals and demonstrate their significant performance improvement in creating multicast trees with lower cost and higher success probability. Copyright © 2003 John Wiley & Sons, Ltd.     

E‐TDGO: An encrypted trust‐based dolphin glowworm optimization for secure routing in mobile ad hoc network

Mobile ad hoc networks (MANETs) are independent networks, where mobile nodes communicate with other nodes through wireless links by multihop transmission. Security is still an issue to be fixed in MANETs. Hence, a routing protocol named encrypted trust‐based dolphin glowworm optimization (DGO) (E‐TDGO) is designed using Advanced Encryption Standard‐128 (AES‐128) and trust‐based optimization model for secure routing in MANET. The proposed E‐TDGO protocol includes three phases, namely, k‐path discovery, optimal path selection, and communication. At first, k paths are discovered based on the distance and the trust level of the nodes. From the k paths discovered, the optimal path is selected using a novel algorithm, DGO, which is developed by combining glowworm swarm optimization (GSO) algorithm and dolphin echolocation algorithm (DEA). Once the optimal path is selected, communication begins in the network such that E‐TDGO protocol ensures security. The routing messages are encrypted using AES‐128 with shared code and key to offer security. The experimental results show that the proposed E‐TDGO could attain throughput of 0.11, delay of 0.01 second, packet drop of 0.44, and detection rate of 0.99, at the maximum number of rounds considered in the network of 75 nodes with attack consideration.     

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

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

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.