Performance Evaluation of Unicast and Broadcast Mobile Ad hoc Network Routing Protocols
Sumon Kumar Debnath, Foez Ahmed, Nayeema Islam
备注：
7 Pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS January 2010, ISSN 1947 5500, http://sites.google.com/site/ijcsis/
发表信息：
International Journal of Computer Science and Information Security, IJCSIS, Vol. 7, No. 1, pp. 40-46, January 2010, USA
Efficient routing mechanism is a challenging issue for group oriented computing in Mobile Ad Hoc Networks (MANETs). The ability of MANETs to support adequate Quality of Service (QoS) for group communication is limited by the ability of the underlying ad-hoc routing protocols to provide consistent behavior despite the dynamic properties of mobile computing devices. In MANET QoS requirements can be quantified in terms of Packet Delivery Ratio (PDR), Data Latency, Packet Loss Probability, Routing Overhead, Medium Access Control (MAC) Overhead and Data Throughput etc. This paper presents an in depth study of one to many and many to many communications in MANETs and provides a comparative performance evaluation of unicast and broadcast routing protocols. Dynamic Source Routing protocol (DSR) is used as unicast protocol and BCAST is used to represent broadcast protocol. The performance differentials are analyzed using ns2 network simulator varying multicast group size (number of data senders and data receivers). Both protocols are simulated with identical traffic loads and mobility models. Simulation result shows that BCAST performs better than DSR in most cases.
The Long Term Evolution (LTE) broadcast is a promising solution to cope with exponentially increasing user traffic by broadcasting common user requests over the same frequency channels. In this paper, we propose a novel network framework provisioning broadcast and unicast services simultaneously. For each serving file to users, a cellular base station determines either to broadcast or unicast the file based on user demand prediction examining the file's content specific characteristics such as: file size, delay tolerance, price sensitivity. In a network operator's revenue maximization perspect…
In recent years, video-related services such as YouTube and Netflix have generated huge amounts of traffic and the network neutrality debate has emerged as a major issue. In this paper, we consider feasibility of using a hybrid of unicast and broadcast in cellular networks for high-traffic services (e.g., video streaming), from the perspective of cost effectiveness. To reflect spatial characteristics of base stations (BSs) and mobile users (MUs), we use the stochastic geometry approach where BSs and MUs are modeled as independent homogeneous Poisson point processes (PPPs). With these assumptio…
We investigate the unicast problem for ad-hoc networks in the plane using MIMO techniques. In particular, we use the multi-node beamforming gain and present a self-synchronizing algorithm for the necessary carrier phase synchronization. First, we consider $n$ nodes in a grid where the transmission power per node is restricted to reach the neighboring node. We extend the idea of multi-hop routing and relay the message by multiple nodes attaining joint beamforming gain with higher reception range. In each round, the message is repeated by relay nodes at dedicated positions after a fixed waiting …
Multi-channel multi-interface Wireless Mesh Networks permit to spread the load across orthogonal channels to improve network capacity. Although broadcast is vital for many layer-3 protocols, proposals for taking advantage of multiple channels mostly focus on unicast transmissions. In this paper, we propose broadcast algorithms that fit any channel and interface assignment strategy. They guarantee that a broadcast packet is delivered with a minimum probability to all neighbors. Our simulations show that the proposed algorithms efficiently limit the overhead.
The 3rd Generation Partnership Project (3GPP) has defined based on the Long Term Evolution (LTE) enhanced Multicast Broadcast Multimedia Service (eMBMS) a set of new features to support the distribution of Terrestrial Broadcast services in Release 14. On the other hand, a new 5th Generation (5G) system architecture and radio access technology, 5G New Radio (NR), are being standardised from Release 15 onwards, which so far have only focused on unicast connectivity. This may change in Release 17 given a new Work Item set to specify basic Radio Access Network (RAN) functionalities for the provisi…
A classical result in undirected wireline networks is the near optimality of routing (flow) for multiple-unicast traffic (multiple sources communicating independent messages to multiple destinations): the min cut upper bound is within a logarithmic factor of the number of sources of the max flow. In this paper we "extend" the wireline result to the wireless context. Our main result is the approximate optimality of a simple layering principle: {\em local physical-layer schemes combined with global routing}. We use the {\em reciprocity} of the wireless channel critically in this result. Our form…
Many mobile ad hoc network protocols use simple flooding, in order to adapt to changes in time varying network topology. Most of the times, a network-wide flood results in redundant packets and increases network congestion, probability of packet collision, low utilization of available bandwidth, and most important, higher power consumption. In this paper, we propose a new cross-layer broadcast scheme to minimize broadcast traffic in mobile ad hoc networks. Our scheme is based on use of received signal strength indicator, RSSI, value to reduce the number of broadcast packets. The effectiveness …
An optimized broadcast protocol is proposed for VANETs. It is based on two key information: the direction to the destination and the beamforming angle θ. The efficiency of this technique is demonstrated in terms of packet delivery, bandwidth gain and probability of transmission success. An analytical model is developed to calculate the transmission area. This model allows capturing the propagation shape of the forwarding area. Comparisons with simulations show that the analytical model is precise.
Cellular and Broadcast services have been traditionally treated independently due to the different market requirements, thus resulting in different business models and orthogonal frequency allocations. However, with the advent of cheap memory and smart caching, this traditional paradigm can converge into a single system which can provide both services in an efficient manner. This paper focuses on multimedia delivery through an integrated network, including both a cellular (also known as unicast or broadband) and a broadcast last mile operating over shared spectrum. The subscribers of the netwo…
Network coding is a recently proposed method for transmitting data, which has been shown to have potential to improve wireless network performance. We study network coding for one specific case of multicast, broadcasting, from one source to all nodes of the network. We use network coding as a loss tolerant, energy-efficient, method for broadcast. Our emphasis is on mobile networks. Our contribution is the proposal of DRAGONCAST, a protocol to perform network coding in such a dynamically evolving environment. It is based on three building blocks: a method to permit real-time decoding of network…
Broadcast routing has become an important research field for vehicular ad-hoc networks (VANETs) recently. However, the packet delivery rate is generally low in existing VANET broadcast routing protocols. Therefore, the design of an appropriate broadcast protocol based on the features of VANET has become a crucial part of the development of VANET. This paper analyzes the disadvantage of existing broadcast routing protocols in VANETs, and proposes an improved algorithm (namely ODAM-C) based on the ODAM (Optimized Dissemination of Alarm Messages) protocol. The ODAM-C algorithm improves the packet…
It is now commonly accepted that the unit disk graph used to model the physical layer in wireless networks does not reflect real radio transmissions, and that the lognormal shadowing model better suits to experimental simulations. Previous work on realistic scenarios focused on unicast, while broadcast requirements are fundamentally different and cannot be derived from unicast case. Therefore, broadcast protocols must be adapted in order to still be efficient under realistic assumptions. In this paper, we study the well-known multipoint relay protocol (MPR). In the latter, each node has to cho…
We study broadcast in multiple access channels in dynamic adversarial settings. There is an unbounded supply of anonymous stations attached to a synchronous channel. There is an adversary who injects packets into stations to be broadcast on the channel. The adversary is restricted by injection rate, burstiness, and by how many passive stations can be simultaneously activated by providing them with packets. We consider deterministic distributed broadcast algorithms, which are further categorized by their properties. We investigate for which injection rates can algorithms attain bounded packet l…
We study the minimum latency broadcast scheduling (MLBS) problem in Single-Radio Multi-Channel (SR-MC) wireless ad-hoc networks (WANETs), which are modeled by Unit Disk Graphs. Nodes with this capability have their fixed reception channels, but can switch their transmission channels to communicate with their neighbors. The single-radio and multi-channel model prevents existing algorithms for single-channel networks achieving good performance. First, the common assumption that one transmission reaches all the neighboring nodes does not hold naturally. Second, the multi-channel dimension provide…
York University（约克大学）；Thompson Rivers University（汤普森河大学）
This paper investigates the problem of minimizing the age-of-information (AoI) and transmit power consumption in a vehicular network, where a roadside unit (RSU) provides timely updates about a set of physical processes to vehicles. Each vehicle is interested in maintaining the freshness of its information status about one or more physical processes. A framework is proposed to optimize the decisions to unicast, multicast, broadcast, or not transmit updates to vehicles as well as power allocations to minimize the AoI and the RSU's power consumption over a time horizon. The formulated problem is…
In a wired network, a packet can be transmitted to a specified destination only, no broadcasting required. But in ad hoc wireless network a packet transmitted by a node can reach all neighbors due to broadcasting. This broadcasting introduces unnecessary retransmissions of same message. Therefore, the total number of transmissions (forward nodes) is generally used as the cost criterion for broadcasting. The problem of finding the minimum number of forward nodes is NP-complete. In this paper, the goal is to reduce the number of forward nodes which will reduce redundant transmission as a result.…
This paper deals with broadcasting problem in vehicular ad hoc networks (VANETs). This communication mode is commonly used for sending safety messages and traffic information. However, designing an efficient broadcasting protocol is hard to achieve since it has to take into account some parameters related to the network environment, for example, the network density, in order to avoid causing radio interferences. In this paper, we propose a novel Autonomic Dissemination Method (ADM) which delivers messages in accordance with given priority and density levels. The proposed approach is based on t…
This work investigates the maximum broadcast throughput and its achievability in multi-hop wireless networks with half-duplex node constraint. We allow the use of physical-layer network coding (PNC). Although the use of PNC for unicast has been extensively studied, there has been little prior work on PNC for broadcast. Our specific results are as follows: 1) For single-source broadcast, the theoretical throughput upper bound is n/(n+1), where n is the "min vertex-cut" size of the network. 2) In general, the throughput upper bound is not always achievable. 3) For grid and many other networks, t…
In this paper, we propose solutions for the energy-efficient broadcasting over cross networks, where N nodes are located on two perpendicular lines. Our solutions consist of an algorithm which finds the optimal range assignment in polynomial time (O(N^12)), a near-optimal algorithm with linear complexity (O(N)), and a distributed algorithm with complexity O(1). To the best of our knowledge, this is the first study presenting an optimal solution for the minimum-energy broadcasting problem for a 2-D network (with cross configuration). We compare our algorithms with the broadcast incremental powe…
Network-Wide Broadcast (NWB) is a common operation in Mobile Ad hoc Networks (MANETs) used by routing protocols to discover routes and in group communication operations. NWB is commonly performed via flooding, which has been shown to be expensive in dense MANETs because of its high redundancy. Several efforts have targeted reducing the redundancy of floods. In this work, we target another problem that can substantially impact the success of NWBs: since MAC level broadcasts are unreliable, it is possible for critical rebroadcasts to be lost, leading to a significant drop in the node coverage. T…
Barrage relays networks (BRNs) are ad hoc networks built on a rapid cooperative flooding primitive as opposed to the traditional point-to-point link abstraction. Controlled barrage regions (CBRs) can be used to contain this flooding primitive for unicast and multicast, thereby enabling spatial reuse. In this paper, the behavior of individual CBRs is described as a Markov process that models the potential cooperative relay transmissions. The outage probability for a CBR is found in closed form for a given topology, and the probability takes into account fading and co-channel interference (CCI) …
The conventional wireless schedulers of Unicast and Multicast either fulfill multiuser diversity or broadcast gain, but not both together. To achieve optimal system throughput we need a scheduler that exploits both the multiuser diversity gain and the Multicasting gain simultaneously. We first propose a new medianthreshold scheduler that selects all users having instantaneous SNR above the median value for transmission. The system rate equation for the proposed scheduler is also derived. We then optimize the median-threshold so that it performs well over an entire SNR range.With the help of si…
Nodes in an ad hoc wireless network incur certain costs for forwarding packets since packet forwarding consumes the resources of the nodes. If the nodes are rational, free packet forwarding by the nodes cannot be taken for granted and incentive based protocols are required to stimulate cooperation among the nodes. Existing incentive based approaches are based on the VCG (Vickrey-Clarke-Groves) mechanism which leads to high levels of incentive budgets and restricted applicability to only certain topologies of networks. Moreover, the existing approaches have only focused on unicast and multicast…
The new type of Mobile Ad hoc Network which is called Vehicular Ad hoc Networks (VANET) created a fertile environment for research. In this research, a protocol Particle Swarm Optimization Contention Based Broadcast (PCBB) is proposed, for fast andeffective dissemination of emergency messages within a geographical area to distribute the emergency message and achieve the safety system, this research will help the VANET system to achieve its safety goals in intelligent and efficient way.
Network coding has been successfully used in the past for efficient broadcasting in wireless multi-hop networks. Two coding approaches are suitable for mobile networks; Random Linear Network Coding (RLNC) and XOR-based coding. In this work, we make the observation that RLNC provides increased resilience to packet losses compared to XOR-based coding. We develop an analytical model that justifies our intuition. However, the model also reveals that combining RLNC with probabilistic forwarding, which is the approach taken in the literature, may significantly impact RLNC's performance. Therefore, w…
Network coding is commonly used to improve the energy efficiency of network-wide broadcasting in wireless multi-hop networks. In this work, we focus on XOR-based broadcasting in mobile ad hoc networks with multiple sources. We make the observation that the common approach, which is to benefit from the synergy of XOR network coding with a CDS-based broadcast algorithm, suffers performance breakdowns. After delving into the details of this synergy, we attribute this behavior to an important mechanism of the underlying broadcast algorithm, known as the "termination criterion". To tackle the probl…
The multi-copy routing paradigm in Delay Tolerant Networks (DTNs) implies that increasing contact bandwidth leads to a decrease in data delivery delay and an improvement in throughput. With Hybrid Radio Frequency/Free Space Optical (RF/FSO) PHY layers, the high data rate FSO links can be used to increase the contact bandwidth. However, due to the highly directional nature of FSO links, broadcasting is difficult. A naive broadcast strategy where the beam divergence angle is increased to include many nodes in the broadcast set results in low data rate, and does not always result in the minimum a…
Multicasting is effective when its group members are sparse and the speed is low. On the other hand, broadcasting is effective when the group members dense and the speed are high. Since mobile ad hoc networks are highly dynamic in nature, either of the above two strategies can be adopted at different scenarios. In this paper, we propose an ant agent based adaptive, multicast protocol that exploits group members desire to simplify multicast routing and invoke broadcast operations in appropriate localized regimes. By reducing the number of group members that participate in the construction of th…
In Mobile Ad-Hoc networks, broadcasting is a fundamental operation in the network layer. A node transmits a rebroadcast message to any or all other nodes whenever it receives for the first time. It will generate several redundant transmissions and it ends up in a significant downside Broadcast Storm problem. Within the literature, researchers have proposed 2-Hop Neighbour based protocol like DP, TDP, PDP and APDP to reduce broadcast storm in MANETs by choosing the minimum number of forwarding nodes from 1-Hop nodes to cover all 2-Hop nodes.
We consider the problem of throughput-optimal broadcast- ing in time-varying wireless networks, whose underlying topology is restricted to Directed Acyclic Graphs (DAG). Previous broadcast algorithms route packets along spanning trees. In large networks with time-varying connectivities, these trees are difficult to compute and maintain. In this paper we propose a new online throughput-optimal broadcast algorithm which makes packet-by-packet scheduling and routing decisions, obviating the need for maintaining any global topological structures, such as spanning-trees. Our algorithm relies on sys…
Flooding provides important control and route establishment functionality for a number of unicast and multicast protocols in Mobile Ad Hoc Networks. Considering its wide use as a building block for other network layer protocols, the flooding methodology should deliver a packet from one node to all other network nodes using as few messages as possible. In this paper, we propose the Optimized Flooding Protocol (OFP), based on a variation of The Covering Problem that is encountered in geometry, to minimize the unnecessary transmissions drastically and still be able to cover the whole region. OFP …
We consider the problem of minimizing age of information in multihop wireless networks and propose three classes of policies to solve the problem - stationary randomized, age difference, and age debt. For the unicast setting with fixed routes between each source-destination pair, we first develop a procedure to find age optimal Stationary Randomized policies. These policies are easy to implement and allow us to derive closed-form expression for average AoI. Next, for the same unicast setting, we develop a class of heuristic policies, called Age Difference, based on the idea that if neighboring…
Vehicular ad hoc networks (VANETs) facilitate vehicles to broadcast beacon messages to ensure road safety. The rogue nodes in VANETs broadcast malicious information leading to potential hazards, including the collision of vehicles. Previous researchers used either cryptography, trust values, or past vehicle data to detect rogue nodes, but they suffer from high processing delay, overhead, and false-positive rate (FPR). We propose fog-based rogue nodes detection (F-RouND), a fog computing scheme, which dynamically creates a fog utilizing the on-board units (OBUs) of all vehicles in the region fo…
A Mobile Ad hoc network (MANET) consists of nodes which use multi-hop communication to establish connection between nodes. Traditional infrastructure based systems use a centralized architecture for address allocation. However, this is not possible in Ad hoc networks due to their dynamic structure. Many schemes have been proposed to solve this problem, but most of them use network-wide broadcasts to ensure the availability of a new address. This becomes extremely difficult as network size grows. In this paper, we propose an address allocation algorithm which avoids network-wide broadcasts to a…
Several emerging classes of applications that run over wireless networks have a need for mathematical models and tools to systematically characterize the reliability of the network. We propose two metrics for measuring the reliability of wireless mesh routing topologies, one for flooding and one for unicast routing. The Flooding Path Probability (FPP) metric measures the end-to-end packet delivery probability when each node broadcasts a packet after hearing from all its upstream neighbors. The Unicast Retransmission Flow (URF) metric measures the end-to-end packet delivery probability when a r…
In this paper we design throughput-optimal dynamic broad- cast algorithms for multi-hop networks with arbitrary topolo- gies. Most of the previous broadcast algorithms route pack- ets along spanning trees, rooted at the source node. For large dynamic networks, computing and maintaining a set of spanning trees is not efficient, as the network-topology may change frequently. In this paper we design a class of dynamic algorithms which makes packet-by-packet schedul- ing and routing decisions and thus obviates the need for maintaining any global topological structures, such as span- ning trees. Ou…
In this paper, we investigate the performance of LTE Multicast-Broadcast Single-Frequency Networks (MBSFN). LTE-MBSFN is viewed as one of the most promising candidates for vehicular communications which can enhance reliability of vehicular application traffic. This is achieved due to the possibility to efficiently support message exchange in-between vehicles by multicasting information to several vehicles in parallel (point-to-multipoint transmission) employing an Multimedia Broadcast/Multicast Service (MBMS). We investigate two metrics to gauge the performance of MBMS/MBSFN transmissions in c…
We introduce group-to-group anycast (g2g-anycast), a network design problem of substantial practical importance and considerable generality. Given a collection of groups and requirements for directed connectivity from source groups to destination groups, the solution network must contain, for each requirement, an omni-directional down-link broadcast, centered at any node of the source group, called the ball; the ball must contain some node from the destination group in the requirement and all such destination nodes in the ball must aggregate into a tree directed towards the source, called the …
Broadcast is a fundamental operation in networks, especially in wireless Mobile Ad Hoc NETworks (MANET). For example, some form of broadcasting is used by all on-demand MANET routing protocols, when there is uncertainty as to the location of the destination node, or for service discovery. Being such a basic operation of the networking protocols, the importance of efficient broadcasting has long been recognized by the networking community. Numerous papers proposed increasingly more efficient implementation of broadcasting, while other studies presented bounds on broadcast performance. In this w…
Wireless ad hoc networks, in particular mobile ad hoc networks (MANETs), are growing very fast as they make communication easier and more available. However, their protocols tend to be difficult to design due to topology dependent behavior of wireless communication, and their distributed and adaptive operations to topology dynamism. Therefore, it is desirable to have them modeled and verified using formal methods. In this paper, we present an actor-based modeling language with the aim to model MANETs. We address main challenges of modeling wireless ad hoc networks such as local broadcast, unde…
Internet of underwater things (IoUT) is a technological revolution that could mark a new era for scientific, industrial, and military underwater applications. To mitigate the hostile underwater channel characteristics, this paper hybridizes underwater acoustic and optical wireless communications to achieve a ubiquitous control and high-speed low-latency networking performance, respectively. Since underwater optical wireless communications (UOWC) suffers from limited range, it requires effective multi-hop routing solutions. In this regard, we propose a Sector-based Opportunistic Routing (SectOR…
Wireless communication in a network of mobile devices is a challenging and resource demanding task, due to the highly dynamic network topology and the wireless channel randomness. This paper investigates information broadcast schemes in 2D mobile ad-hoc networks where nodes are initially randomly distributed and then move following a random direction mobility model. Based on an in-depth analysis of the popular Susceptible-Infectious-Recovered epidemic broadcast scheme, this paper proposes a novel energy and bandwidth efficient broadcast scheme, named the energy-efficient broadcast scheme, whic…
Performance characterization is a fundamental issue in wireless networks for real time routing, wireless network simulation, and etc. There are four basic wireless operations that are required to be modeled, i.e., unicast, anycast, broadcast, and multicast. As observed in many recent works, the temporal and spatial distribution of packet receptions can have significant impact on wireless performance involving multiple links (anycast/broadcast/multicast). However, existing performance models and simulations overlook these two wireless behaviors, leading to biased performance estimation and simu…
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols which broadcasts control packets to discover routes to the destination nodes, generate a high number of broadcast packets in a larger networks causing contention and collision. We propose an efficient route discovery protocol, which reduces the number of broadcast packet, using controlled flooding technique. The simulation results show that the proposed probabilistic flooding decreases th…
We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number of transmissions and total time until all rumors arrive to their destination. Under centralized settings, we introduce a novel approximation algorithm that provides almost optimal results with respect to the number of transmissions and total time, separately. Later on, we show how to efficiently implement this algorithm under distributed settings, where the …
We consider the problem of throughput-optimal packet dissemination, in the presence of an arbitrary mix of unicast, broadcast, multicast and anycast traffic, in a general wireless network. We propose an online dynamic policy, called Universal Max-Weight (UMW), which solves the above problem efficiently. To the best of our knowledge, UMW is the first throughput-optimal algorithm of such versatility in the context of generalized network flow problems. Conceptually, the UMW policy is derived by relaxing the precedence constraints associated with multi-hop routing, and then solving a min-cost rout…
Vehicular Ad Hoc Networks (VANETs) are characterized by intermittent connectivity, which leads to failures of end-to-end paths between nodes. Named Data Networking (NDN) is a network paradigm that deals with such problems, since information is forwarded based on content and not on the location of the hosts. In this work, we propose an enhanced routing protocol of our previous topology-oblivious Multihop, Multipath, and Multichannel NDN for VANETs (MMM-VNDN) routing strategy that exploits several paths to achieve more efficient content retrieval. Our new enhanced protocol, i mproved MMM-VNDN (i…
We propose the design and development of an energy-efficient Risk Notification Message Dissemination Protocol (RNMDP) for vehicular ad hoc networks (VANETs). RNMDP propagates Risk Notification Messages (RNMs) from their location of origin (called the Risk Zone) to vehicles approaching the Risk Zone. RNMDP assumes each node is aware of its current location in the network. The protocol works as follows: A RNM is broadcast in the neighborhood of the Risk Zone. A node receiving the RNM from another node waits for a Rebroadcast-Wait-Time before deciding to rebroadcast the message. The Rebroadcast-W…
Broadcast networks are often used in modern communication systems. A common broadcast network is a single hop shared media system, where a transmitted message is heard by all neighbors, such as some LAN networks. In this work we consider a more complex environment, in which a transmitted message is heard only by a group of neighbors, such as Ad-Hoc networks, satellite and radio networks, as well as wireless multistation backbone system for mobile communication. It is important to design efficient algorithms for such environments. Our main result is a new Leader Election algorithm, with O(n) ti…
A Mobile Ad hoc NETwork (MANET) is a type of wireless network without any infrastructure, where nodes must adapt to the changing dynamic situations that result from their mobility. Because of the decentralization of nodes and the security needs of communications, management of MANETs must be self-organized, which is a major research challenge. In order to cope with the intrinsic properties of MANETs, a new decentralized management system for MANETs called Self-organizing Life Cycle Management (SLCM), is here fully described and evaluated. Regarding security, node authentication is the most cri…
Ad-hoc Social Networks have become popular to support novel applications related to location-based mobile services that are of great importance to users and businesses. Unlike traditional social services using a centralized server to fetch location, ad-hoc social network services support infrastructure less real-time social networking. It allows users to collaborate and share views anytime anywhere. However, current ad-hoc social network applications are either not available without rooting the mobile phones or don't filter the nearby users based on common interests without a centralized serve…
Multicast communication plays a crucial role in Mobile Adhoc Networks (MANETs). MANETs provide low cost, self configuring devices for multimedia data communication in military battlefield scenarios, disaster and public safety networks (PSN). Multicast communication improves the network performance in terms of bandwidth consumption, battery power and routing overhead as compared to unicast for same volume of data communication. In recent past, a number of multicast routing protocols (MRPs) have been proposed that tried to resolve issues and challenges in MRP. Multicast based group communication…
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters blindly broadcast without knowledge of the surrounding nodes, two fundamental design parameters are the node transmission probability and the transmission spectral efficiency. In this paper these parameters are selected to maximize end-to-end performance, characterized by the product of transmitter density, hop distance and rate. Due to the intractability of the problem as stated, an approximation function is examin…
In this report we propose a MultiObjective (MO) performance evaluation framework for wireless ad hoc networks where criteria such as capacity, robustness, energy and delay are optimized concurrently. Within such a framework, we can determine both the Pareto-optimal performance bounds and the networking parameters that provide these bounds. The originality of this approach is that it accounts for the inherent broadcast properties of the transmission and finely models the interference distribution. In the proposed model, the network performance can be optimized when several flows (source- destin…
