Broadcast Routing Research Articles

MINIMUM ENERGY BROADCAST ROUTING IN AD HOC AND SENSOR NETWORKS WITH DIRECTIONAL ANTENNAS

In this paper we discuss minimum energy broadcast routing with directional antennas in ad hoc and sensor networks. We assume that the network consists of sensor nodes whose antennas are switched beam directional antennas. The problem of our concern is: a given set V with n nodes and each node vi has l(i) transmission directions (i.e. the antenna sectors) and a broadcast request sourced at s, how to find a broadcast tree rooted at s and spanning all nodes in V such that the total energy is minimized. This problem involves with the choice of transmitting nodes and their transmission directions, which is NP-hard. We firstly propose a directed Steiner tree-based approximation algorithm for this problem and discuss its distributed implementation. Then we also propose a |V|-approximation algorithm and one heuristic with lower time complexities. Extensive simulations have demonstrated the efficiency of our algorithms.

Self-healing network for scalable fault-tolerant runtime environments

The number of processors embedded on high performance computing platforms is growing daily to satisfy the user desire for solving larger and more complex problems. Scalable and fault-tolerant runtime environments are needed to support and adapt to the underlying libraries and hardware which require a high degree of scalability in dynamic large-scale environments. This paper presents a self-healing network (SHN) for supporting scalable and fault-tolerant runtime environments. The SHN is designed to support transmission of messages across multiple nodes while also protecting against recursive node and process failures. It will automatically recover itself after a failure occurs. SHN is implemented on top of a scalable fault-tolerant protocol (SFTP). The experimental results show that both the latest multicast and broadcast routing algorithms used in SHN are faster and more reliable than the original SFTP routing algorithms.

New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm

The Broadcast Incremental Power (BIP) algorithm is the most frequently cited method for the minimum energy broadcast routing problem. A recent survey concluded that BIP has O ( | V | 3 ) time complexity, and that its approximation ratio is at least 4.33. We strengthen these results to O ( | V | 2 ) and 4.598, respectively.

A fast local search method for minimum energy broadcast in wireless ad hoc networks

Local search methods are often used to reduce the power consumption of broadcast routing in wireless networks. For a classic method, sweep, the best available time complexity result is O ( | V | 4 ) . We present an O ( | V | 2 ) -time method, which exhaustively removes unnecessary transmissions yielding a solution comparable to that of sweep.

Exploring optimised route selection strategy in tree- and mesh-based multicast routing in MANETs

Mobile ad hoc networks are collections of mobile nodes with dynamism forming a momentary network, with no pre-existing network infrastructure or centralised administration. Disaster relief, education and armed forces are widespread situations where mobile nodes need to communicate in areas without any pre-existing infrastructure. Multicast routing protocols outperform the basic broadcast routing by giving out the resources along general links while sending information to a set of multiple destinations. As the network topology is dynamic, optimised routing protocols are needed for communication proficiency. This paper explores the intelligent Genetic Algorithm (GA)-based on-demand multicast routing protocol and GA-based multicast ad hoc on-demand distance vector protocol which improve the control overheads and packet delivery ratio in the routing messages.

Scheme for on-demand route protocol in Ad-hoc networks

On-demand route protocol is widely developed in mobile wireless Ad-hoc networks because of its effectiveness and efficiency. Previous studies have shown limitations of these protocols: in the process of route discovery, broadcast route request (RREQ) messages by flooding may result in excessive redundancy, contention, and collision. In order to relieving broadcast messages, a novel scheme is proposed which is based on the velocities of nodes (VON). Intuition behind VON is that the redundancy of route information and the instability of the route which is composed of high speed of nodes. In VON scheme we use the nodes which have slow speed forward RREQ messages while the nodes which have high speed do not. Simulation results show that VON outperforms the AODV protocol in terms of several metrics, including normalized routing load, end-to-end delay, and packet delivery ratio. The advantages and disadvantages of VON are analyzed, on the based of which, the subsequent investigation work is presented.

An Intelligent Multicast Ad-hoc On demand Distance Vector Protocol for MANETs

Recently multicast ro uting protocols in Mobile Ad-hoc Networks (MANETs) are emerging for wireless group communication. This includes application such as multipoint data dissemination and multiparty conferencing which made the analytical design and development of the MANETs in a very efficient manner. For MANETs there are several multicast routing protocols are available, but they perform well under specific scenarios only. The topology of a MANET changes adequately based on the random mobility of network nodes, unlike the network topology of a wired network which is static. Multicast routing protocol outperforms the basic broadcast routing by sharing the resources along general links, while sending information to a set of predefined multiple destinations in a concurrent way. Due to the lack of redundancy in multipath and multicast structures, the multicast routing protocols are vulnerable to the component failure in ad-hoc networks. So it is the dire need to solve the problem optimally. One of the efficient techniques for solving the optimization problem is the Genetic Algorithm (GA). The key factors that determine the performance of GA is by the well designed architecture of chromosomes and operators in the intelligent algorithm. This paper proposes a new genetic algorithm based Multicast Ad-hoc On demand Distance Vector Protocol for MANETs (GA-MAODV), which improves the packet delivery ratio of the routing messages. The GAbased MAODV allows each node in the network to send out multicast data packets, and the multicast data packets are broadcast when propagating along the multicast group tree.

On the Potential of NoC Virtualization for Multicore Chips

As the end of Moores-law is on the horizon, power becomes a limiting factor to continuous increases in performance gains for single-core processors. Processor engineers have shifted to the multicore paradigm and many-core processors are a reality. Within the context of these multicore chips, three key metrics point themselves out as being of major importance, performance , fault-tolerance (including yield), and power consumption . A solution that optimizes all three of these metrics is challenging. As the number of cores increases the importance of the interconnection network-on-chip (NoC) grows as well, and chip designers should aim to optimize these three key metrics in the NoC context as well. In this paper we identify and discuss the main properties that a NoC must exhibit in order to enable such optimizations. In particular, we propose the use of virtualization techniques at the NoC level. As a major finding, we identify the implementation of unicast and broadcast routing algorithms to become a key design parameter in order to achieve an effective virtualization of the chip. The intention behind this paper is for it to serve as a position paper on the topic of virtualization for NoC and the challenges that should be met at the routing layer in order to optimize performance, fault-tolerance and power consumption in multicore chips.

Load-balanced broadcast routing in wireless Ad-hoc networks

In wireless Ad-hoc networks, where mobile hosts are powered by batteries, the entire network may be partitioned because of the drainage of a small set of batteries. Therefore, the crucial issue is to improve the energy efficiency, with an objective of balancing energy consumption. A greedy algorithm called weighted minimum spanning tree (WMST) has been proposed, in which time complexity is O( n 2). This algorithm takes into account the initial energy of each node and energy consumption of each communication. Simulation has demonstrated that the performance of the proposed algorithm improves the load balance and prolongs the lifetime.

3-Dimensional minimum energy broadcasting problem

The minimum energy broadcast routing problem was extensively studied during the last years. Given a sample space where wireless devices are distributed, the aim is to perform the broadcast communication pattern from a given source while minimising the total energy consumption. While many papers deal with the 2-dimensional case where the sample space is given by a plain area, few results are known about the more interesting and practical 3-dimensional case. In this paper we study this case and we present a tighter analysis of the minimum spanning tree heuristic in order to considerably decrease its approximation factor from the known 26 to roughly 18.8. This decreases the gap with the known lower bound of 12 given by the so-called 3-dimensional kissing number.

Tightening the upper bound for the minimum energy broadcasting

In this paper we present a new upper bound on the approximation ratio of the Minimum Spanning Tree heuristic for the basic problem on Ad-Hoc Networks given by the Minimum Energy Broadcast Routing (MEBR). We introduce a newanalysis allowing to establish a 6.33-approximation ratio in the 2-dimensional case, thus decreasing the previously known 7.6 upper bound [4], almost closing the gap with the lower bound of 6 [12].

소규모 애드혹 네트워크에서의 유니캐스트와 브로드캐스트 라우팅 프로토콜의 성능비교

본 논문은 소규모 애드혹 네트워크에서 데이터를 전달함에 있어 유니캐스트 라우팅 프로토콜과 브로드캐스트 라우팅 프로토콜의 성능을 비교 분석한다. 기존의 애드혹 네트워크를 위한 라우팅 프로토콜은 범용의 대규모 네트워크를 위한 프로토콜이며, 홈네트워크와 같은 소규모 네트워크를 위하여 최적화되어 설계되지 않았다. 본 논문은 소규모 애드혹 네트워크 환경에서 기존의 유니캐스트 라우팅 프로토콜과 브로드캐스트 라우팅 프로토콜의 성능을 비교 분석하여 그 결과를 기술한다. 시뮬레이션 결과에 따르면 소규모의 애드혹 네트워크에는 기존의 애드혹 네트워크를 위한 유니캐스트 라우팅 프로토콜보다 브로드캐스트 라우팅 프로토콜이 더 좋은 성능을 보인다. 특히 브로드캐스트 라우팅 프로토콜은 기존의 유니캐스트 라우팅 프로토콜보다 높은 전송률과 낮은 패킷 전송을 위한 지연시간을 보여준다. This paper compares the performance of the unicast routing protocol and the broadcast routing protocol in a small-sized wireless multi-hop network, such as home network. Normally, ad-hoc routing protocols are designed for general wireless multi-hop networks, not being said to be optimized for the small-sized ad hoc network. This paper compares some unicast routing protocols and optimal broadcast routing protocol, and shows the result. The result of the simulation says the broadcast routing protocol shows better performance than the ad-hoc routing protocols in the small-sired wireless multi-hop network. Especially, the result shows that the broadcast protocol has higher packet delivery ratio and lower packet latency than unicast routing protocols

Energy and Spatial Reuse Efficient Network-Wide Real-Time Data Broadcasting in Mobile Ad Hoc Networks

In this paper, we present NB-TRACE, which is an energy-efficient network-wide voice broadcasting architecture for mobile ad hoc networks. In the NB-TRACE architecture, the network is organized into overlapping clusters through a distributed algorithm, where the clusterheads create a nonconnected dominating set. Channel access is regulated through a distributed TDMA scheme maintained by the clusterheads. The first group of packets of a broadcast session is broadcast through flooding, where each data rebroadcast is preceded by an acknowledgment to the upstream node. Nodes that do not get an acknowledgment for a predetermined time, except the clusterheads, cease to rebroadcast, which prunes the redundant retransmissions. The connected dominating set formed through this basic algorithm is broken in time due to node mobility. The network responds to the broken links through multiple mechanisms to ensure the maintenance of the connected dominating set. We compare NB-TRACE with four network layer broadcast routing algorithms (flooding, gossiping, counter-based broadcasting, and distance-based broadcasting) and three medium access control protocols (IEEE 802.11, SMAC, and MH-TRACE) through extensive ns-2 simulations. Our results show that NB-TRACE outperforms other network/MAC layer combinations in minimizing energy dissipation and optimizing spatial reuse, while producing competitive QoS performance

SENS: A Scalable and Expressive Naming System for Resource Information Retrieval

SUMMARY We have designed a scalable and expressive naming system called SENS, capable of retrieving information of computing and content resources distributed widely across the Internet through exact queries and multi-attribute range queries over resource names. Our system utilizes a descriptive naming scheme to name resources and a multi-dimensional resource ID space for message routing through an overlay network of name servers (NSs). The resource ID space is constructed on the overlay network based on CAN routing algorithm. Our novel mapping scheme between resource names and resource IDs preserves resource ID locality while still achieving good load balancing regarding resource information distribution. We also propose a multicast routing algorithm to deliver resource information and a broadcast routing algorithm to route query messages to corresponding NSs with small cost of message transmission. Our simulation results show that our system can achieve good routing performance and

LAKER: learning from past actions to guide future behaviors in ad hoc routing

AbstractIn this paper, we present a location aided knowledge extraction routing (LAKER) protocol for mobile ad hoc networks (MANETs). The novelty of LAKER is that it learns from past actions to guide future behaviors. In particular, LAKER can gradually discover current topological characteristics of the network, such as population density distribution, residual battery map, and traffic load status. This knowledge can be organized in the form of a set of guiding routes, each of which consists of a chain of guiding positions between a pair of source and destination locations. The guiding route information is learned by individual nodes during route discovery phase, and it can be used to guide future route discovery processes in a more efficient manner. LAKER is especially suitable for mobility models where nodes are not uniformly distributed. LAKER can exploit topological characteristics in these models and limit the search space in route discovery processes in a more refined granularity than location aided routing (LAR) protocol. Simulation results show that LAKER outperforms LAR and DSR in term of routing overhead, saving up to 30–45% broadcast routing messages compared to LAR approach. Copyright © 2006 John Wiley & Sons, Ltd.

Energy‐efficient broadcast and multicast routing in multihop ad hoc wireless networks

AbstractThis paper addresses the problem of broadcasting and multicasting in large scale multihop ad hoc wireless networks. We focus on the energy‐efficient broadcast routing in stationary networks and consider the case where wireless nodes can dynamically control their transmission power for each broadcast session.Minimum spanning tree (MST) has the property that the longest edge in the tree is the shortest among all the spanning trees. We introduce a new algorithm called minimum longest edge (MLE) that constructs a broadcast tree based on MST, and for networks where nodes have different energy reserves, we introduce minimum weight incremental arborescence (MWIA) algorithm to compute the broadcast tree. Multicast tree can be obtained by pruning broadcast tree. These algorithms provide a scheme to balance the energy consumption among all nodes. The simulation results show that MLE and MWIA improved the energy balance and network lifetime for a wide range of networks, and the improvement is more significant when the network size grows. Copyright © 2006 John Wiley & Sons, Ltd.

On the construction of maximum residual energy resource broadcast trees with minimum diameter in staticad hoc wireless networks

Each node in a wireless ad hoc network runs on a local energy source that has a limited energy life span. Thus, energy conservation is a critical issue in such networks. In addition, it is in general desirable to construct routes with low hop counts as a route with a high hop count is more likely to be unstable (because the probability that intermediate nodes will move away is higher). In this paper, we address these two issues concurrently with energy conservation as the primary objective and low hop count as the secondary objective. One way of addressing the energy conservation issue is to construct routes that maximize the minimum residual battery capacity available among all nodes in each route. A broadcast tree with all routes satisfying this condition is referred to as a maximum residual energy resource broadcast tree. A maximum residual energy resource broadcast tree with the least diameter is referred to as a minimum diameter maximum residual energy resource broadcast tree and the problem of constructing such a tree is referred to as the minimum diameter maximum residual energy resource broadcast routing problem (MDMRERBRP). We propose an algorithm for MDMRERBRP and prove that MDMRERBRP is optimally solvable in polynomial time using the proposed algorithm. Copyright © 2005 John Wiley & Sons, Ltd.

On the construction of energy-efficient maximum residual battery capacity broadcast trees in static ad hoc wireless networks

This work considers the problem of broadcast routing in a wireless ad hoc network from the viewpoint of energy efficiency. Each node in a wireless ad hoc network runs on a local energy source which has a limited energy life span. Thus, energy conservation is a critical issue in such networks. In this paper, we address the problem of finding a broadcast tree for a given network that maximizes the minimum residual battery capacity available among all nodes in the network. We call this problem the Maximum Residual Battery Capacity Broadcast Routing Problem (RBBP). We propose a new algorithm for RBBP and prove that RBBP is optimally solvable in polynomial time using the proposed algorithm. In addition, we show that the problem of finding a maximum residual battery capacity broadcast tree with minimum total energy consumption is NP-complete and we propose a new heuristic algorithm for this problem.

Broadcast Routing with Minimum Wavelength Conversion in WDM Optical Networks

We consider dynamic routing of broadcast connections in WDM optical networks. Given the current network state, we want to find a minimum set of network nodes S such that a broadcast routing using only the nodes in S as wavelength conversion nodes can be found. This ensures that the average conversion delay from the source to all destinations is minimized. We refer to the problem as Broadcast Conversion Node Selection (BCNS) problem. We prove that BCNS has no polynomial-time approximation with performance ratio ρ ln n for ρ < 1 unless NP⊂DTIME(nO(log log n)) where n is the number of vertices in the input graph. We present a greedy approximation algorithm for BCNS that achieves approximation ratio 2+ln n. Simulation results show that the algorithm performs very well in practice, obtaining optimal solutions in most of the cases.

On-demand loop-free routing with link vectors

We present the on-demand link vector (OLIVE) protocol, a routing protocol for ad hoc networks based on link-state information that is free of routing loops and supports destination-based packet forwarding. Routers exchange routing information reactively for each destination in the form of complete paths, and each node creates a labeled source graph based on the paths advertised by its neighbors. A node originates a broadcast route request (RREQ) to obtain a route for a destination for which a complete path does not exist in its source graph. When the original path breaks, a node can select an alternative path based on information reported by neighbors, and a node can send a unicast RREQ to verify that the route is still active. A node that cannot find any alternate path to a destination sends route errors reliably to those neighbors that were using it as next hop to the destination. Using simulation experiments in ns2, OLIVE is shown to outperform dynamic source routing, ad hoc on-demand distance vector, optimized link-state routing protocol, and topology broadcast based on reverse-path forwarding, in terms of control overhead, throughput, and average network delay, while maintaining loop-free routing with no need for source routes.