Exploiting wireless broadcast advantage as a network-wide cache

Author(s):  
Abhik Banerjee ◽  
Chuan Heng Foh ◽  
Chai Kiat Yeo ◽  
Bu Sung Lee
2019 ◽  
Vol 68 (4) ◽  
pp. 3586-3599 ◽  
Author(s):  
Bing Feng ◽  
Chi Zhang ◽  
Haichuan Ding ◽  
Yuguang Fang

Author(s):  
LEILI FARZINVASH

In this paper, we consider the problem of online multicast routing in multichannel multiradio wireless mesh networks (WMNs). We propose an efficient online algorithm, namely zone-based multicast routing (ZBMR), which exploits network coding and wireless broadcast advantage. In the proposed algorithm, to investigate the acceptance of an arrived session in polynomial time, the WMN is divided into some zones. The derived zones are processed sequentially, where the zone processing is defined as connecting the receivers in a given zone to the session. The main challenge in this scheme is to enable data transmission to the receivers in each zone. If a zone does not contain the source node, it should obtain data from the previously processed neighboring zones. The problem is that the data transmission fails if there is no receiver on the common border between the considered zone and its processed neighboring zones. Our solution to tackle this challenge is to add some virtual receivers to the borders of the zones. The extensive simulations show that ZBMR increases the acceptance rate by 50% in comparison to the previous approaches.


2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Avid Avokh ◽  
Ghasem Mirjalily ◽  
Jamshid Abouei ◽  
Shahrokh Valaee

This paper deals with the problem of multicast/broadcast throughput in multi-channel multi-radio wireless mesh networks that suffer from the resource constraints. We provide a formulation to capture the utilization of the network resources and derive analytical relationships for the network’s throughput in terms of the node utilization, the channel utilization, and the number of transmissions. Our model relies on the on-demand quality of service multicast/broadcast sessions, where each admitted session creates a unique tree with a specific bandwidth. As an advantage, the derived relationships are independent of the type of tree built for each session and can be used for different protocols. The proposed formulation considers the channel assignment strategy and reflects both the wireless broadcast advantage and the interference constraint. We also offer a comprehensive discussion to evaluate the effects of load-balancing and number of transmissions on the network’s throughput. Numerical results confirm the accuracy of the presented analysis.


2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Rab Nawaz Jadoon ◽  
WuYang Zhou ◽  
Iftikhar Ahmed Khan ◽  
Muhammad Amir Khan ◽  
Waqas Jadoon

This paper presents an energy-efficient technique to handle redundant traffic (EEHRT) in the zone-based routing for wireless sensor networks. In this technique, multihop routing is performed based on the remaining energy of the nodes. Afterwards, it performs position-based routing without the need for the nodes to know their respective position. The main objective of this paper is to handle the redundant packets generated in zone-based routing using short beacon messages. Nodes of lower zones route the data of the higher zone to base station (BS) with a minimum number of hops and utilize only those nodes on the path which are energy efficient and located closer to BS. Moreover, the source node is acknowledged by the relaying node using a wireless broadcast advantage (WBA) without sending any special ACK packet to the sender, which reduces the control overhead in the routing process. The EEHRT technique improves the routing against RARZ by ensuring only one copy of the packet is propagated at each hop along the routing path to BS. Simulation results show that EEHRT achieved 28% improvement in energy efficiency, 10% and 25% improvements in data throughput against total and distinct packet reception at BS respectively, 35% increase in overall network lifetime, and 100% reduction in redundant packets generation and propagation in the network against RARZ routing.


2010 ◽  
Vol 9 (12) ◽  
pp. 3701-3713 ◽  
Author(s):  
Zhiguo Ding ◽  
Kin K. Leung ◽  
Dennis L. Goeckel ◽  
Don Towsley

Sign in / Sign up

Export Citation Format

Share Document