scholarly journals Energy-Efficient Adaptive Geosource Multicast Routing for Wireless Sensor Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-14 ◽  
Author(s):  
Daehee Kim ◽  
Sejun Song ◽  
Baek-Young Choi

We propose an energy-efficient adaptive geosource multicast routing (EAGER) for WSNs. It addresses the energy and scalability issues of previous location based stateless multicast protocols in WSNs. EAGER is a novel stateless multicast protocol that optimizes location-based and source-based multicast approaches in various ways. First, it uses the receiver's geographic location information to save the cost of building a multicast tree. The information can be obtained during the receiver's membership establishment stage without flooding. Second, it reduces packet overhead, and in turn, energy usage by encoding with a small sized node ID instead of potentially large bytes of location information and by dynamically using branch geographic information for common source routing path segments. Third, it decreases computation overhead at each forwarding node by determining the multicast routing paths at a multicast node (or rendezvous point (RP)). Our extensive simulation results validate that EAGER outperforms existing stateless multicast protocols in computation time, packet overhead, and energy consumption while maintaining the advantages of stateless protocols.

2018 ◽  
Vol 232 ◽  
pp. 01038
Author(s):  
Yang Jiao

Multicast is an important function of Ad Hoc network. It is a point to multipoint or multipoint to multipoint packet transmitting mode. Group management and maintenance, multicast packet routing are two factors of multicast protocol. This paper analyzes the classification of multicast protocols and focuses on tree based multicast protocols, compares several protocols and analyzes the advantages and disadvantages of tree based multicast protocols.


2021 ◽  
Vol 11 (18) ◽  
pp. 8645
Author(s):  
Davide Careglio ◽  
Fernando Agraz ◽  
Dimitri Papadimitriou

With the globalisation of the multimedia entertainment industry and the popularity of streaming and content services, multicast routing is (re-)gaining interest as a bandwidth saving technique. In the 1990’s, multicast routing received a great deal of attention from the research community; nevertheless, its main problems still remain mostly unaddressed and do not reach the acceptance level required for its wide deployment. Among other reasons, the scaling limitation and the relative complexity of the standard multicast protocol architecture can be attributed to the conventional approach of overlaying the multicast routing on top of the unicast routing topology. In this paper, we present the Greedy Compact Multicast Routing (GCMR) scheme. GMCR is characterised by its scalable architecture and independence from any addressing and unicast routing schemes; more specifically, the local knowledge of the cost to direct neighbour nodes is enough for the GCMR scheme to properly operate. The branches of the multicast tree are constructed directly by the joining destination nodes which acquire the routing information needed to reach the multicast source by means of an incremental two-stage search process. In this paper we present the details of GCMR and evaluate its performance in terms of multicast tree size (i.e., the stretch), the memory space consumption, the communication cost, and the transmission cost. The comparative performance analysis is performed against one reference algorithm and two well-known protocol standards. Both simulation and emulation results show that GCMR achieves the expected performance objectives and provide the guidelines for further improvements.


Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1484
Author(s):  
Yunyoung Choi ◽  
Jaehyung Park ◽  
Jiwon Jung ◽  
Younggoo Kwon

In home and building automation applications, wireless sensor devices need to be connected via unreliable wireless links within a few hundred milliseconds. Routing protocols in Low-power and Lossy Networks (LLNs) need to support reliable data transmission with an energy-efficient manner and short routing convergence time. IETF standardized the Point-to-Point RPL (P2P-RPL) routing protocol, in which P2P-RPL propagates the route discovery messages over the whole network. This leads to significant routing control packet overhead and a large amount of energy consumption. P2P-RPL uses the trickle algorithm to control the transmission rate of routing control packets. The non-deterministic message suppression nature of the trickle algorithm may generate a sub-optimal routing path. The listen-only period of the trickle algorithm may lead to a long network convergence time. In this paper, we propose Collision Avoidance Geographic P2P-RPL, which achieves energy-efficient P2P data delivery with a fast routing request procedure. The proposed algorithm uses the location information to limit the network search space for the desired route discovery to a smaller location-constrained forwarding zone. The Collision Avoidance Geographic P2P-RPL also dynamically selects the listen-only period of the trickle timer algorithm based on the transmission priority related to geographic position information. The location information of each node is obtained from the Impulse-Response Ultra-WideBand (IR-UWB)-based cooperative multi-hop self localization algorithm. We implement Collision Avoidance Geographic P2P-RPL on Contiki OS, an open-source operating system for LLNs and the Internet of Things. The performance results show that the Collision Avoidance Geographic P2P-RPL reduced the routing control packet overheads, energy consumption, and network convergence time significantly. The cooperative multi-hop self localization algorithm improved the practical implementation characteristics of the P2P-RPL protocol in real world environments. The collision avoidance algorithm using the dynamic trickle timer increased the operation efficiency of the P2P-RPL under various wireless channel conditions with a location-constrained routing space.


2011 ◽  
Vol 204-210 ◽  
pp. 1399-1402
Author(s):  
Ling Xiu Wang ◽  
Ye Wen Cao

IP multicast protocols tend to construct a single minimum spanning tree for a multicast source (i.e., group), in which only a few internal nodes supply multicast traffic. In multicast networks especially with multiple multicast sources where bottleneck effects may occur frequently, frequently used multicast service leads to inefficient network utilization problems. This paper presents a new network utilization algorithm for multicasting called load distribution algorithm (LDA). The LDA algorithm uses selecting candidate path based on ant colony algorithm and multicast scheduling to distribute the contention multicast packets onto their corresponding candidate paths. The numerical results show that a multicast protocol with LDA has higher efficiency of resource utilization and meanwhile maintains less end to end delay compared with the original one without LDA.


Author(s):  
Christian Esposito ◽  
Domenico Cotroneo

Recently we have witnessed an increasing demand of fault-tolerant communications in publish/subscribe middleware. Although several reliable solutions have been proposed, none of them address the problem of achieving a resilient and timely event dissemination. We investigate how guaranteeing assured message dissemination despite occurrence of network faults without breaking temporal constraints. The contribution of this article is on devising a FEC approach where encoding functionality is placed at the root and on a subset of interior nodes in the multicast tree. Simulations-based experiments demonstrate that the proposed approach allows all the interested subscribers to receive all the published messages and the adopted resiliency mean does not affect the performance of the multicast protocol.


Sign in / Sign up

Export Citation Format

Share Document