ESAM - Energy Saving Slot Allocation Based Multicast Routing in Wireless Mesh Network
DOI:
https://doi.org/10.4108/eai.13-7-2018.164822Keywords:
Wireless Mesh Network, Multicast Routing, Slot Allocation, Snoozing Awaken Period, Binary Track of Span, Channel Dispute, Healthier Channel UsageAbstract
The wireless mesh network is an emerging technology, offering innovative and efficient solutions typically used for last-mile broadband access. Multicasting is a mode of communication that delivers data from a sender to a set of receivers simultaneously in an effective way. This article deals with the problem of assigning synchronized time slots among the forwarded nodes in the multicast group of a wireless mesh network. To solve this problem, we propose a MAC layer solution that developed with snoozing and awaken slot durations for each node to pick the channel at a specific time and during the remaining period, the node will be in an idle state to listen for the packet arrival using Galois estimation. This mechanism divides the available time into slots depends on the demand of the node transmissions and channel availability. During transmission, each node comes to the awaken state and once the transmission completed the node goes to the snoozing state to preserve the energy. The slot allocation is assigned to each node based on the binary track of the span duration and transmission demands. The slot allocation based on multicast packet forwarding technique reduces the energy expense among nodes and supports to balance network communication duration. This shared slot allocation also minimizes the congestion on the network and creates healthier channel usage during communication. The Simulation results show that the proposed approach has achieved a better outcome than previous works in terms of minimum delay and high throughput.
Downloads
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 EAI Endorsed Transactions on Energy Web
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
This is an open-access article distributed under the terms of the Creative Commons Attribution CC BY 3.0 license, which permits unlimited use, distribution, and reproduction in any medium so long as the original work is properly cited.