Analyzing Core Migration Protocol Wireless Ad Hoc Networks by Adopting Multiple Nodes Diverse Test-bed
TL;DR: The migration of core node in wireless ad hoc network has been achieved by modeling the network in two different platform independent high-level languages viz.
read more
Abstract: A number of application level multicast protocols have been proposed for core selection and core migration in Mobile Ad Hoc Networks. Core migration is necessary to minimize any disruptions on the transmission of data due to the changes in tree structure and to achieve improvement in the delivery of media streams in multicast group. In this paper, core migration is performed on the varying size network graph model. The nodes within this ad hoc arrangement take on the values of the edge (We) and node (W) randomly. With the varying numbers of iterations done on the core migration algorithm, every node and every edge picks up different random values. The migration of core node in wireless ad hoc network has been achieved by modeling the network in two different platform independent high-level languages viz. C++ and JAVA. Further, various techniques are proposed for the migration of core if needed.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
An Algorithmic Approach for Core Election in Mobile Ad-hoc Network
TL;DR: An algorithm is proposed for core-based protocol and mathematical model is used to analyze the overhead performance and the performance of efficiency and reliability is measured in Network Simulator 2 (NS-2).
Disjoint multi mobile agent itinerary planning for big data analytics
TL;DR: This paper builds a multi-agent-based distributed WSN (DWSN) model and energy consumption model, and presents a novel routing itinerary algorithm named DMAIP, which can group all the sensor nodes into multiple itineraries for agents.
New algorithm for leader election in Distributed WSN with software agents
Ehsan Amiri,Hassan Keshavarz,Afshin Shahriari Fahleyani,Hossein Moradzadeh,Shozo Komaki +4 more
- 01 Jul 2013
TL;DR: The proposed algorithm to find a leader in a Distributed WSN (Wireless Sensor Network) using software agents is illustrated and the simulation result shows that the proposed algorithm can find faster the leader in WSN.
8
Enhancing Network Life-Time of Wireless Sensor Networks through Itinerary Definition and Mobile Agents for Routing among Sensor Nodes
Ojonukpe Sylvester Egwuche,Olumide Sunday Adewale,Samuel A. Oluwadare,Oladunni Abosede Daramola +3 more
- 18 Mar 2020
TL;DR: A routing itinerary scheme for multi-mobile agent itinerary planning for energy efficiency in wireless sensor networks by constructing the spanning tree of wireless sensor nodes is formulated and the proposed Energy-Aware Mobile Agent Based (EAMB) model performed better than Least Energy Adaptive Clustering Hierarchy (LEACH), Local Closest First (LCF) and Global Closmost First (GCF).
2
Influence of packets losses on video quality in case of using multiple description coding with time division into two and three substreams
Alexey Tarakanov,Olga Gushchina,Ilya Nenakhov +2 more
- 20 Apr 2015
TL;DR: Analysis of simultaneous use of multiple description coding (MDC) algorithm and multipath routing for IP-based videoconferencing system and video quality is estimated with the use of two reference quality criterions.
2
References
Design and analysis of a leader election algorithm for mobile ad hoc networks
Sudarshan Vasudevan,Jim Kurose,Don Towsley +2 more
- 05 Oct 2004
TL;DR: This work presents a leader election algorithm that is highly adaptive to arbitrary (possibly concurrent) topological changes and is therefore well-suited for use in mobile ad hoc networks and shows that each node has a leader approximately 97-99% of the time in a variety of operating conditions.
243
Distributed center-location algorithms
TL;DR: Simulation results on hierarchical and nonhierarchical networks are presented showing that of the methods potentially feasible in the Internet multicast backbone, the authors' offer the best results in terms of cost and delay, and they incur low overhead.
Core selection methods for multicast routing
Kenneth L. Calvert,Ellen Zegura,Michael J. Donahoo +2 more
- 20 Sep 1995
TL;DR: It is concluded that simple methods are adequate for widely distributed groups, but that the addition of group information can be leveraged to improve performance especially when the group is small or exhibits a high degree of locality.
107
Tree multicast strategies in mobile, multishop wireless networks
TL;DR: The main contributions of this study are the use of a 2‐level mobility model to improve the stability of the shared tree, the development of a hybrid, adaptive per‐source and shared tree scheme, and the dynamic relocation of the RP in theshared tree.
106
Adaptive core selection and migration method for multicast routing in mobile ad hoc networks
TL;DR: The cost of multicast tree is used as the sum of weights of all the links in the tree, which signifies the total bandwidth consumed for multicasting a packet, and the cost of shortest-path tree rooted at the median of the graph, Cost/sub GM/, is compared.
50