Fig 10 - uploaded by Rajashekhar Biradar
Content may be subject to copyright.
Source publication
Quality of Service (QoS) support in Mobile Ad Hoc Networks (MANETs) for group communication necessitates design of reliable
networks with multicast support mechanisms. Reliable network connectivity among MANET nodes require high quality links that
have much less packet drops and reliable nodes considering node mobility and failures. Reliability of...
Similar publications
In this paper, we study the problem of QoS group communication in a heterogeneous network, which consists of multiple MANETs attached to the backbone Internet. We propose a heuristic multicast algorithm called MCMA (Multi-Constrained Multicast Algorithm). MCMA is designed for solving the DVBMT (Delay-and delay Variation-Bounded Multicast Tree) prob...
Real-time transcripts generated by automated speech recognition (ASR) technologies have the potential to facilitate communication between native speakers (NS) and non-native speakers (NNS). Previous studies of ASR have focused on how transcripts aid NNS speech comprehension. In this study, we examine whether transcripts benefit multiparty real-time...
What goes right and what goes wrong in team/group communication
Citations
... The reason for performance degradation in an ad-hoc network is due to an increment in overhead from acknowledgment packets. This is because data and acknowledgment packets use the same path for communication, and acknowledgment packets compete with data packets, which can cause collisions in ad-hoc networks and deplete the resources earlier [49]. Consequently, some segments in ad-hoc networks should be reduced to overcome reduced performance of the network. ...
Ad-hoc social networks (ASNETs) represent a special type of traditional ad-hoc network in which a user's social properties (such as the social connections and communications metadata as well as application data) are leveraged for offering enhanced services in a distributed infrastructureless environments. However, the wireless medium, due to limited bandwidth, can easily suffer from the problem of congestion when social metadata and application data are exchanged among nodes---a problem that is compounded by the fact that some nodes may act selfishly and not share its resources. While a number of congestion control schemes have been proposed for the traditional ad-hoc networks, there has been limited focus on incorporating social awareness into congestion control schemes. We revisit the existing traditional ad-hoc congestion control and data distribution protocols and motivate the need for embedding social awareness into these protocols to improve performance. We report that although some work is available in opportunistic network that uses socially-aware techniques to control the congestion issue, this area is largely unexplored and warrants more research attention. In this regards, we highlight the current research progress and identify multiple future directions of research.
... The reason for performance degradation in an ad-hoc network is due to an increment in overhead from acknowledgment packets. This is because data and acknowledgment packets use the same path for communication, and acknowledgment packets compete with data packets, which can cause collisions in ad-hoc networks and deplete the resources earlier [49]. Consequently, some segments in ad-hoc networks should be reduced to overcome reduced performance of the network. ...
Ad-hoc social networks (ASNETs) represent a special type of traditional ad-hoc network in which a user's social properties (such as the social connections and communications metadata as well as application data) are leveraged for offering enhanced services in a distributed infrastructureless environments. However, the wireless medium, due to limited bandwidth, can easily suffer from the problem of congestion when social metadata and application data are exchanged among nodes---a problem that is compounded by the fact that some nodes may act selfishly and not share its resources. While a number of congestion control schemes have been proposed for the traditional ad-hoc networks, there has been limited focus on incorporating social awareness into congestion control schemes. We revisit the existing traditional ad-hoc congestion control and data distribution protocols and motivate the need for embedding social awareness into these protocols to improve performance. We report that although some work is available in opportunistic network that uses socially-aware techniques to control the congestion issue, this area is largely unexplored and warrants more research attention. In this regards, we highlight the current research progress and identify multiple future directions of research.
... The Quality of Service (QoS) multicast routing protocols require not only finding a route from a source node to a group of destination nodes but also the route must have minimum end-to-end delay, maximum throughput and less energy consumption [7][8][9][10][11][12]. It also consider the residual battery lifetime and the rate of battery utilization in order to increase longevity of such networks [13][14][15][16]. Recently, various schemes have been proposed to minimized the energy consumption in wireless ad-hoc networks [17][18][19][20][21]. ...
A mobile Ad-Hoc networks (MANETs) is a continuously self-configuring, infrastructure-less network of wireless mobile devices. In which multicast is one of the efficient way of communication. Currently, several research have been conducted to design multicast routing protocols for wireless mobile ad-hoc networks (MANETs). Multicasting is a technique that allow to send the same message to a group of destinations simultaneously. However, it faces several challenges against its implementation in ad-hoc network due to its dynamic nature, lack of bandwidth, short battery lifetime of the mobile devices. The multicast routing protocol MAODV have several constraints as mentioned above. Hence to address these constraints a reliable neighbour nodes selection scheme has been integrated over MAODV. This paper attempt a Quality of Service (QoS) based multicast routing protocol using reliable neighbour nodes selection scheme (QMRPRNS) for same. The simulation has been conducted to compare the performance of the proposed scheme against some existing multicast routing protocols which shows significant improvement over EMAODV and MAODV.
... Recently, [3,9,12,13] suggested that reduction of bandwidth consumption in wireless networks is another key factor to affect the performance of multicast routing trees. Bandwidth consumption can be measured by counting the number of transmissions in a network and each transmission has its own bandwidth requirement. ...
... In [9], an example and the shape of the MNT are discussed. A bandwidth delay product based multicast routing scheme [3] in MANET is proposed to enhance the reliability with ring mesh backbone. ...
... The latest simulation research [3] compares the performance of two multicast routing tree algorithms, SPT and MNT. In the simulation results, MNT has a smaller packet success ratio than SPT and the gap between them becomes greater as the node density or traffic load becomes higher in a single multicast tree scenario. ...
Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol : end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.
... Given the number of multicast streams in the server, it efectively solves the problem of both minimizing the delivery cost at content routers and determining the optimal preix length with the in-network caching. Rajashekhar and Sunilkumar 17 proposed Bandwidth Delay Product (BDP) based multicast routing scheme with the help of ring mesh backbone. Reliable node pairs are computed based on mobility, remaining battery power and diferential signal strength. ...
Background/Objectives: Due to the presence of mobility, the nodes may move out of the coverage region. Mobility of nodes causes network partition. This will lead to heavy overhead and less packet forwarding ratio. Methods/Statistical Analysis: In this research work, Residual Energy based Reliable Multicast Routing (RERMR) is proposed to increase the packet forwarding rate based on optimized multicast backbone construction. It consists of following phases. In first phase, the multicast backbone is constructed based on trustable loop and trust factors. The backbone is maintained by means of cluster group members. If the cluster head is not responding to cluster members or other cluster head, the secondary cluster leader checks whether it attains the latency threshold and announces that as a cluster head. Reliable path is calculated based on stability of links and residual energy is saved based on signal strength and distance. Results: For simulation, the network simulator tool (NS 2.34) is used. The QoS parameters and the proposed parameters are taken for analysis for performance of existing and proposed work. Based on the simulation results, the proposed work achieves better performance than previous protocols in terms of path reliability rate, network stability rate, end to end delay, end to end transmission and communication overhead.
... It employs the prefix caching and the multicast schemes respectively. Bandwidth Delay Product (BDP) based multicast routing scheme (Biradar & Manvi, 2012) was proposed for ring mesh backbone based on mobility, remaining battery power and differential signal strength. The node pairs are used to compute BDP between them. ...
... To create this backbone, it is required to have a complete topological knowledge. The MANET boundary area is determined by using the jarvi's convex hull algorithm (Biradar & Manvi, 2012) from computational complexity. If the boundary is known, the area and centroid can be determined, which helps in the construction of backbone. ...
... We compared our proposed scheme with OMRS (Rajaram & Gopinath, 2014), SRMP (Moustafa & Labiod, 2013) and Bandwidth Delay Product based Multicast routing Scheme Manvi, 2012) andOn Demand Multicast Routing Protocol (Sung-Ju et al., 1999). ...
Mobile Ad hoc Network consists of mobile nodes without any assisting infrastructure. Mobility of nodes causes network partition. This leads to heavy overhead and less packet forwarding ratio. In this research work, Residual Energy based Reliable Multicast Routing Protocol (RERMR) is proposed to attain more network lifetime and increased packet delivery and forwarding rate. A multicast backbone is constructed to achieve more stability based on node familiarity and trustable loop. Reliable path criterion is estimated to choose best reliable path among all available paths. Data packets will be forwarded once the reliable path is chosen. We have also demonstrated that residual energy of paths aids to provide maximum network lifetime. Based on the simulation results, the proposed work achieves better performance than previous protocols in terms of path reliability rate, network stability rate, end to end delay, end to end transmission and communication overhead.
... The weight assigned to a link is '1' plus the inverse of the LET of the link. Bandwidth Delay product based multicast routing scheme using reliable ring mesh constructed with reliability pair nodes is given in [20], where reliability is computed based on remaining battery power, differential signal strength and distance between the nodes. ...
Characteristics of mobile ad hoc networks (MANETs) such as lack of central coordination, dynamic topology and limited resources pose a challenging problem in quality of service (QoS) routing. Providing an efficient, robust and low overhead QoS unicast route from source to destination is a critical issue. Bandwidth and route stability are the major important QoS parameters for applications where long duration connections are required with stringent bandwidth requirements for multimedia applications. This paper proposes an On-demand Bandwidth and Stability based Unicast Routing scheme (OBSUR) in MANET by adding additional QoS features to existing Dynamic Source Routing (DSR) protocol. The objective of the OBSUR is to provide QoS satisfied, reliable and robust route for communicating nodes. The scheme works in following steps. (1) Each node in the network periodically (small regular intervals) estimates bandwidth availability, node and link stability, buffer availability, and stability factor between nodes. (2) Construction of neighbor stability and QoS database at every node which is used in route establishment process. (3) The unicast path is constructed by using route request and route reply packets with the help of route information cache, and (4) route maintenance in case of node mobility and route failures. Simulation results show that there is an improvement in terms of traffic admission ratio, control overhead, packet delivery ratio, end to end delay and throughput as compared to Route Stability Based QoS Routing (RSQR) in MANETs.
... 1) The mobility model of nodes [12]: j j X Y , as given in Eq. 2. ...
... The physical network topology is the connections between nodes in the wireless multi-hop network which may be grid-like or mesh (Fig. 2a); while the multicast routing topology is the connections between the IP multicast routers that are selected by the IP routing protocol to forward the multicast traffic ( Fig. 2b-d). Some common multicast routing topologies are tree [8], ring-based [9][10][11], and hybrid (mesh) [7]. The performance of multicast protocols at the network layer relies heavily on a reliable and efficient MAC layer broadcast (multicast). ...
... Therefore, a shared routing topology is constructed and shared by all group members in the case of group communication regardless of the source. Some common multicast routing topologies are tree [8], ring-based [9][10][11], and hybrid (mesh) [7]. ...
... Biradar and Manvi [9] propose an agent-based multicast routing scheme in MANET that builds a backbone in the form of a reliable ring. Multi-ring construction algorithm (MCA) constructs a ring-based two-level hierarchical structure in a wired network, and give a mathematical formulation of the delay-constrained multi-ring construction problem [10]. ...
Wireless mesh networking (WMN) is an emerging technology for future broadband wireless access. The proliferation of the mobile computing devices that are equipped with cameras and ad hoc communication mode creates the possibility of exchanging real-time data between mobile users in wireless mesh networks. In this paper, we argue for a ring-based multicast routing topology with support from infrastructure nodes for group communications in WMNs. We study the performance of multicast communication over a ring routing topology when 802.11 with RTS/CTS scheme is used at the MAC layer to enable reliable multicast services in WMNs. We propose an algorithm to enhance the IP multicast routing on the ring topology. We show that when mesh routers on a ring topology support group communications by employing our proposed algorithms, a significant performance enhancement is realized. We analytically compute the end-to-end delay on a ring multicast routing topology. Our results show that the end-to-end delay is reduced about 33 %, and the capacity of multicast network (i.e., maximum group size that the ring can serve with QoS guarantees) is increased about 50 % as compared to conventional schemes. We also use our analytical results to develop heuristic algorithms for constructing an efficient ring-based multicast routing topology with QoS guarantees. The proposed algorithms take into account all possible traffic interference when constructing the multicast ring topology. Thus, the constructed ring topology provides QoS guarantees for the multicast traffic and minimizes the cost of group communications in WMNs.
