On the number of candidates in opportunistic routing for multi-hop wireless networks

  • Authors:

  • Amir Darehshoorzadeh;Mohammed Almulla;Azzedine Boukerche;Sonny Chaiwala

  • Affiliations:

  • University of Ottawa, Ottawa, ON, Canada;Kuwait University, Kuwait, Kuwait;University of Ottawa, Ottawa, ON, Canada;Bitfence Inc., Ottawa, ON, Canada

  • Venue:
  • Proceedings of the 11th ACM international symposium on Mobility management and wireless access
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Opportunistic Routing (OR) is a new paradigm that has been investigated as a new way to improve the performance of multihop wireless networks by exploiting the broadcast nature of the wireless medium. In contrast to traditional routing, in OR an ordered set of nodes is selected as potential next-hop forwarders (candidates). Using more number of candidates in OR decreases the number of transmissions in the network, but this comes at the cost of increasing the signaling overhead and also the possibility of having duplicated transmissions which in turn reduces the performance of the OR protocol. The number of candidates that each node can select is an issue which is not well investigated in the literature. In this paper, we propose a Distance-based MAximum number of Candidate Estimation (D-MACE) as an approach to find the number of candidates in each node. In contrast to the traditional approaches in OR which consider an identical number of candidates for all nodes, D-MACE reduces the number of candidates in each node according to the distance between the node and the destination. We evaluate the performance of our proposal, using two relevant candidate selection algorithms. Our results show that D-MACE reduces the number of selected candidates effectively in the network, which improves the network performance compared to the case with the same number of candidates in all nodes.