scispace - formally typeset
Proceedings ArticleDOI

Research on the routing algorithm based greedy multicast algorithm

Reads0
Chats0
TLDR
Simulations result indicates that the results of the greedy algorithm in multicast node are with greater density of the advantages and it shows that the invalid in other cases were acceptable, and has complicated the low quality.
Abstract
Because all the nodes are multi-cast, the minimum spanning tree is the best, therefore, it is expected by the niche tree dynamic greed multicast routing algorithms produce more of the performance with a reasonable level. As for the greedy algorithm and the text of the characters tree dynamic greedy algorithm are made detailed emulation, Simulations result indicates that the results of the algorithm in multicast node are with greater density of the advantages and it shows that the invalid in other cases were acceptable, and has complicated the low quality.

read more

Citations
More filters
Proceedings ArticleDOI

Dynamic QoS multicasting using greedy approach and fuzzy-based Tabu Search

TL;DR: This paper combines a greedy approach with static multicast routing using Tabu Search to find a low cost dynamic multicast tree with desirable QoS parameters and results show that, on a large number of events i.e. where nodes are leaving or joining, the proposed algorithm is able to find multicast trees of lower cost and more desirableQoS properties.
Proceedings ArticleDOI

Design and implementation of a queue manager for IP switches with massive ports

TL;DR: An Address Transfer Queue is added in the queue manager to store multicast or broadcast packet pointers and all the queues share one pointer memory, which will reduce the on-chip pointer memory requirements greatly.
Journal Article

GA-based algorithms for multiple sources to one sink routing in WSNs

TL;DR: A GA-based algorithm is employed to solve the least energy-consumption multiple sources to one sink routing problem in wireless sensor networks with bandwidth and delay constraints by transforming the problem to a Steiner tree problem, which is proven to be a NP-complete problem.
Journal ArticleDOI

Tabu Search for Low-Cost Dynamic Multicast Tree Generation with Quality of Service Guarantees

TL;DR: This article combines a greedy approach with static multicast routing using Tabu Search to find a low-cost dynamic multicast tree with desirable QoS parameters and shows that, on a large number of events, the proposed algorithm is able to find multicast trees of lower cost and more desirableQoS properties.
Journal Article

Multiple-Hop Routing Algorithm of Cluster Heads Based on Energy-Restriction for Wireless Sensor Networks

TL;DR: Simulation results demonstrate that compared with LEACH this novel protocol is more efficient to save energy of consumption and prolong the living time of the whole network.
References
More filters
Journal ArticleDOI

Information distortion in a supply chain: the bullwhip effect

TL;DR: The authors analyzes four sources of the bullwhip effect: demand signal processing, rationing game, order batching, and price variations, and shows that the distortion tends to increase as one moves upstream.
Journal ArticleDOI

50th Anniversary Article: The Evolution of Research on Information Systems: A Fiftieth-Year Survey of the Literature in Management Science

TL;DR: Based on a discussion of these streams, the IS literature's core contributions to theoretical and managerial knowledge are evaluated, and some predictions about the road that lies ahead for IS researchers are made.
Journal Article

Improvement of LEACH in Wireless Sensor Networks

TL;DR: It is proved that network life time and energy consuming of node are improved greatly from mending algorithm results.
Journal Article

Cluster-head selection enhancing algorithm based on energy for wireless sensor networks

TL;DR: Simulation proved that this enhancing cluster-head selection algorithm can prolong the lifetime of network by more than 10% compared with LEACH, and thus the performance of network is improved.
Related Papers (5)