Browsing by Subject "Multicast routing protocol"
Now showing 1 - 3 of 3
- Results Per Page
- Sort Options
Item Open Access Distributed and location-based multicast routing algorithms for wireless sensor networks(SpringerOpen, 2009-01) Korpeoglu, I.; Bagci, H.Multicast routing protocols in wireless sensor networks are required for sending the same message to multiple different destinations. In this paper, we propose two different distributed algorithms for multicast routing in wireless sensor networks which make use of location information of sensor nodes. Our first algorithm groups the destination nodes according to their angular positions and forwards the multicast message toward each group in order to reduce the number of total branches in multicast tree which also reduces the number of messages transmitted. Our second algorithm calculates an Euclidean minimum spanning tree at the source node by using the positions of the destination nodes. The multicast message is forwarded to destination nodes according to the calculated MST. This helps in reducing the total energy consumed for delivering the message to all destinations by decreasing the number of total transmissions. Evaluation results show that the algorithms we propose are scalable and energy efficient, so they are good candidates to be used for multicasting in wireless sensor networks. Copyright © 2009 H. Bagci and I. Korpeoglu.Item Open Access A performance comparison of zone-based multicast protocols for mobile ad hoc networks(IEEE, 2003) Zhang, Y.; Rangnekar, A.; Selçuk, Ali A.; Bicak, A.; Sidhu, D.With the current trend toward ubiquitous computing come wireless devices capable of forming the nodes of mobile ad hoc networks. Such networks typically rely on routing protocols in order to communicate messages from a source node to a destination node through a set of intermediary nodes. In a typical ad hoc environment, mobile nodes mostly work as a group and are involved in collaborative computing. Multicast communication is more effective in these scenarios. This paper presents the comparison of the performance of two zone-based multicast routing protocols. Shared-tree MZR is a shared tree variant of the Multicast Routing Protocol based on Zone Routing (MZR). We compare the two variants and analyze their performance under various network conditions. The test results show that Shared-tree MZR protocol performs well and has significantly low overhead in scenarios with multiple sources. ©2003 IEEE.Item Open Access Proposing new routing protocol based on chaos algorithm(Conscientia Beam, 2022-05-09) Majdi, AliIn MANET, the multicast routing is considered a non-deterministic polynomial (NP) complexity, it contains assorted objectives and restrictions. In the multicast issue of MANET, the quality of services (QoS) based upon cost, delay, jitter, bandwidth, are constantly deemed as multi-objective for directing multicast routing protocols (MR). Conversely, a mobile node has finite battery energy and the lifetime of a network depends on its mobile node battery energy. Here, the MR problem of MANET has five objectives vis-a-vis the optimization of cost, delay, jitter, bandwidth, and network lifetime with the help of Chaotic-CSA-ROA. Here, evaluation metrics, via delay, delivery ratio, drop, Network lifespan, overhead and throughput are analyzed with node, rate, and speed. The proposed QOS-MRP-CSROA-MANET provides higher throughput at the node between 32.9496% and 65.5839%, and higher throughput in rate as 16.6049% and 30.4654%, higher throughput in speed as 10.1298% and 7.0825%, low packet drop in node as 63.7313% and 52.2255%, low packet drop in rate as 51.5528% and 25.6220%, low packet drop in speed as 18.0857% and 24.5953% compared with existing methods, like QoS aware of multicast routing protocol using particle swarm optimization algorithm in MANET (QOS-MRP-PSOA-MANET) and QoS aware of multicast routing protocol using a genetic algorithm in MANET (QOS-MRP-GA-MANET) respectively.