A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks

This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanismsComment: 15 page

Adaptive Multicast Multimedia Transmission Routing Protocol System (ACMMR) for Congestion Control and Load Balancing Techniques in Mobile Adhoc Networks

A MANET is a probable solution for this need to quickly establish interactions in a mobile and transient environment. Proposed congestion controlled adaptive multicasting routing protocol to achieve load balancing and avoid congestion in MANETs. The existing algorithm for finding multicasting routes computes fail-safe multiple paths, which provide all the intermediate nodes on the primary path with multiple routes to target node. Routing may let a congestion happen, which is detected by congestion control, but dealing with congestion in this reactive manner results in longer delay and redundant packet loss and requires significant overhead if a new route is needed. Transmission of real-time video typically has bandwidth, delay, and loss requirements. Video transmission over wireless network poses many challenges. To overcome these challenges, extensive research has been conducted in the various areas of video application

Scalability of broadcast performance in wireless network-on-chip

Networks-on-Chip (NoCs) are currently the paradigm of choice to interconnect the cores of a chip multiprocessor. However, conventional NoCs may not suffice to fulfill the on-chip communication requirements of processors with hundreds or thousands of cores. The main reason is that the performance of such networks drops as the number of cores grows, especially in the presence of multicast and broadcast traffic. This not only limits the scalability of current multiprocessor architectures, but also sets a performance wall that prevents the development of architectures that generate moderate-to-high levels of multicast. In this paper, a Wireless Network-on-Chip (WNoC) where all cores share a single broadband channel is presented. Such design is conceived to provide low latency and ordered delivery for multicast/broadcast traffic, in an attempt to complement a wireline NoC that will transport the rest of communication flows. To assess the feasibility of this approach, the network performance of WNoC is analyzed as a function of the system size and the channel capacity, and then compared to that of wireline NoCs with embedded multicast support. Based on this evaluation, preliminary results on the potential performance of the proposed hybrid scheme are provided, together with guidelines for the design of MAC protocols for WNoC.Peer ReviewedPostprint (published version

Broadcasting in Prefix Space: P2P Data Dissemination with Predictable Performance

A broadcast mode may augment peer-to-peer overlay networks with an efficient, scalable data replication function, but may also give rise to a virtual link layer in VPN-type solutions. We introduce a simple broadcasting mechanism that operates in the prefix space of distributed hash tables without signaling. This paper concentrates on the performance analysis of the prefix flooding scheme. Starting from simple models of recursive $k$-ary trees, we analytically derive distributions of hop counts and the replication load. Extensive simulation results are presented further on, based on an implementation within the OverSim framework. Comparisons are drawn to Scribe, taken as a general reference model for group communication according to the shared, rendezvous-point-centered distribution paradigm. The prefix flooding scheme thereby confirmed its widely predictable performance and consistently outperformed Scribe in all metrics. Reverse path selection in overlays is identified as a major cause of performance degradation.Comment: final version for ICIW'0

Routing in mobile Ad Hoc Networks

A Mobile Ad Hoc Network (MANET) is built on the fly where a number of wireless mobile nodes work in cooperation without the engagement of any centralized access point or any fixed infrastructure. Two nodes in such a network can communicate in a bidirectional manner if and only if the distance between them is at most the minimum of their transmission ranges. When a node wants to communicate with a node outside its transmission range, a multihop routing strategy is used which involves some intermediate nodes. Because of the movements of nodes, there is a constant possibility of topology change in MANET. Considering this unique aspect of MANET, a number of routing protocols have been proposed so far. This chapter gives an overview of the past, current, and future research areas for routing in MANET. In this chapter we will learn about the following things: - The preliminaries of mobile ad hoc network - The challenges for routing in MANET - Expected properties of a MANET routing protocol - Categories of routing protocols for MANET - Major routing protocols for MANET - Criteria for performance comparison of the routing protocols for MANET - Achievements and future research directions - Expectations and realit

Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks

This book presents collective works published in the recent Special Issue (SI) entitled "Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks”. These works expose the readership to the latest solutions and techniques for MANETs and VANETs. They cover interesting topics such as power-aware optimization solutions for MANETs, data dissemination in VANETs, adaptive multi-hop broadcast schemes for VANETs, multi-metric routing protocols for VANETs, and incentive mechanisms to encourage the distribution of information in VANETs. The book demonstrates pioneering work in these fields, investigates novel solutions and methods, and discusses future trends in these field

Multiple-Tree Push-based Overlay Streaming

Multiple-Tree Overlay Streaming has attracted a great amount of attention from researchers in the past years. Multiple-tree streaming is a promising alternative to single-tree streaming in terms of node dynamics and load balancing, among others, which in turn addresses the perceived video quality by the streaming user on node dynamics or when heterogeneous nodes join the network. This article presents a comprehensive survey of the different aproaches and techniques used in this research area. In this paper we identify node-disjointness as the property most approaches aim to achieve. We also present an alternative technique which does not try to achieve this but does local optimizations aiming global optimizations. Thus, we identify this property as not being absolute necessary for creating robust and heterogeneous multi-tree overlays. We identify two main design goals: robustness and support for heterogeneity, and classify existing approaches into these categories as their main focus

Mobile object location discovery in unpredictable environments

Emerging mobile and ubiquitous computing environments present hard challenges to software engineering. The use of mobile code has been suggested as a natural fit for simplifing software development for these environments. However, the task of discovering mobile code location becomes a problem in unpredictable environments when using existing strategies, designed with fixed and relatively stable networks in mind. This paper introduces AMOS, a mobile code platform augmented with a structured overlay network. We demonstrate how the location discovery strategy of AMOS has better reliability and scalability properties than existing approaches, with minimal communication overhead. Finally, we demonstrate how AMOS can provide autonomous distribution of effort fairly throughout a network using probabilistic methods that requires no global knowledge of host capabilities

Scalable Downward Routing for Wireless Sensor Networks and Internet of Things Actuation

We present the opportunistic Source Routing (OSR), a scalable and reliable downward routing protocol for large-scale and heterogeneous wireless sensor networks (WSNs) and Internet of Things IoT. We devise a novel adaptive Bloom filter mechanism to efficiently encode the downward source route in OSR, which significantly reduces the length of the source route field in the packet header. Moreover, each node in the network stores only the set of its direct children. Thus, OSR is scalable to very large-size WSN/IoT deployments. OSR introduces opportunistic routing into traditional source routing based on the parent set of a node's upward routing in data collection, significantly addressing the drastic link dynamics in low-power and lossy networks (LLNs). Our evaluation of OSR via both simulations and real-world testbed experiments demonstrates its merits in comparison with the state-of-the-art protocols