Advancing the Potential of Routing Protocol in Mobile Ad Hoc Network

An ad hoc network consists of nodes with a radio without wire which has multi hop network surroundings [3]. Their messages can be sent anywhere with the help of intermediate nodes only in limits. Broadcasting is mobile ad hoc networks (MANET) is process to send message one to other nodes of the network [1]. It has far-reaching application in mobile ad hoc networks (MANET). It provides significant control and route administration for all types protocols let it be unicast or multicast protocols. It has become an important and all above to find a strong routing protocol in networking research. MANET has important part like as D.S.R., A.O.D.V. for routing information and location routing are used to established routes [5]. There are many problems in broadcasting of MANETS due to reasons like; Variable and unpredictable characteristics, Fluctuation of Strength, Channel Contention problem and Packet Collision problem [4]. The study had been done to cop up these problems on neighbor coverage based protocol to reduce routing overhead in MANETS. The connectivity factor was also discussed to arrange neighbor coverage system to provide to density adaptation [7]. AODV protocol can be played an important role in optimizing mechanism. This paper presented and completed on new type of rebroadcasting with many performance metrics it is done while using NS-2 Simulator [9]

Low-Latency Broadcast in Multirate Wireless Mesh Networks

Special Issue on “Multi-Hop Wireless Mesh Networks”</p

Cross-Layer Optimal Rate Allocation for Heterogeneous Wireless Multicast

Heterogeneous multicast is an efficient communication scheme especially for multimedia applications running over multihop networks. The term heterogeneous refers to the phenomenon when multicast receivers in the same session require service at different rates commensurate with their capabilities. In this paper, we address the problem of resource allocation for a set of heterogeneous multicast sessions over multihop wireless networks. We propose an iterative algorithm that achieves the optimal rates for a set of heterogeneous multicast sessions such that the aggregate utility for all sessions is maximized. We present the formulation of the multicast resource allocation problem as a nonlinear optimization model and highlight the cross-layer framework that can solve this problem in a distributed ad hoc network environment with asynchronous computations. Our simulations show that the algorithm achieves optimal resource utilization, guarantees fairness among multicast sessions, provides flexibility in allocating rates over different parts of the multicast sessions, and adapts to changing conditions such as dynamic channel capacity and node mobility. Our results show that the proposed algorithm not only provides flexibility in allocating resources across multicast sessions, but also increases the aggregate system utility and improves the overall system throughput by almost 30% compared to homogeneous multicast

An adaptive multi-hop routing with IoT abstraction for minimizing delay-node capacity trade-offs in mobile ad-hoc network

Delay and node capacity are incompatible mobile ad hoc constraints because of the network's versatility and self-disciplined design. It is a challenging problem to maximize the trade-off between the above mobility correlation factors. This manuscript proposes an adaptive multi-hop routing (A.M.R.) for mobile ad-hoc network (MANET) to minimize the trade-off by integrating the internet of things (IoT). IoT nodes' smart computing and offloading abilities are extended to ad-hoc nodes to improve routing and transmission. Dor MANET nodes in route exploration, neighbor selection, and data transmission, the beneficial features of IoT include enhanced decision making. The traditional routing protocols use IoT at the time of the neighbor discovery process in updating the routing table and localization. The harmonizing technologies with their extended support improve the performance of MANETs has been estimated. The proposed method achieves better throughput (14.16 Mbps), delay (0.118), packet drop (126), and overhead (36 packets) when compared to existing methods

An improved performance routing protocol based on delay for MANETs in smart cities

Mobile ad-hoc networks (MANETs) is a set of mobile devices that can self-configuration, self-established parameters to transmission in-network. Although limited inability, MANETs have been applied in many domains to serve humanity in recent years, such as disaster recovery, forest fire, military, intelligent traffic, or IoT ecosystems. Because of the movement of network devices, the system performance is low. In order to MANETs could more contribution in the future of the Internet, the routing is a significant problem to enhance the performance of MANETs. In this work, we proposed a new delay-based protocol aim enhance the system performance, called performance routing protocol based on delay (PRPD). In order to analyze the efficiency of the proposed solution, we compared the proposed protocol with traditional protocols. Experiment results showed that the PRPD protocol improved packet delivery ratio, throughput, and delay compared to the traditional protocols

A Multirate MAC Protocol for Reliable Multicast in Multihop Wireless Networks

Many multicast applications, such as audio/video streaming, file sharing or emergency reporting, are becoming quite common in wireless mobile environment, through the widespread deployment of 802.11-based wirelessnetworks. However, despite the growing interest in the above applications, the current IEEE 802.11 standard does not offer any medium access control (MAC) layer support to the efficient and reliable provision of multicast services. It does not provide any MAC-layer recovery mechanism for unsuccessful multicast transmissions. Consequently, lost frames cannot be detected, hence retransmitted, causing a significant quality of service degradation. In addition, 802.11 multicast traffic is sent at the basic data rate, often resulting in severe throughput reduction. In this work, we address these issues by presenting areliablemulticastMACprotocol for wirelessmultihopnetworks, which is coupled with a lightweight rate adaptation scheme. Simulation results show that our schemes provide high packet delivery ratio and when compared with other state-of-the-art solutions, they also provide reduced control overhead and data delivery dela

Journal of Telecommunications and Information Technology, 2014, nr 3

kwartalni

Updating Content in Cache-Aided Coded Multicast

Motivated by applications to delivery of dynamically updated, but correlated data in settings such as content distribution networks, and distributed file sharing systems, we study a single source multiple destination network coded multicast problem in a cache-aided network. We focus on models where the caches are primarily located near the destinations, and where the source has no cache. The source observes a sequence of correlated frames, and is expected to do frame-by-frame encoding with no access to prior frames. We present a novel scheme that shows how the caches can be advantageously used to decrease the overall cost of multicast, even though the source encodes without access to past data. Our cache design and update scheme works with any choice of network code designed for a corresponding cache-less network, is largely decentralized, and works for an arbitrary network. We study a convex relation of the optimization problem that results form the overall cost function. The results of the optimization problem determines the rate allocation and caching strategies. Numerous simulation results are presented to substantiate the theory developed.Comment: To Appear in IEEE Journal on Selected Areas in Communications: Special Issue on Caching for Communication Systems and Network