Combination of greedy and compass approaches for efficient multipath geographic routing in wireless multimedia sensor networks

Several geographic routing protocols have been proposed for data transmission in wireless multimedia sensor networks (WMSNs), in which forwarding decisions are made locally based on one-hop neighborhood information of each sensor node. These routing protocols involve one of two routing strategies: distance-based strategy (greedy) which selects the closest neighbor from the base station as next-hop or direction-based strategy (compass) that chooses the neighbor with the smallest angle deviation toward the base station as next-hop. This article proposes a multipath geographic routing protocol for WMSNs that combines the two routing strategies while taking advantage of their benefits, called greedy-compass geographic multipath routing (GCGM) protocol. In GCGM, for the selection of a neighbor as next-hop, a weighting coefficient is associated to each of the two strategies. We performed extensive simulations using OMNeT++ simulator with different scenarios to illustrate the performance of our proposal with our proposed weight values and with various weight values. Simulation results showed that our proposal with the proposed weight values provides better performance compared to GCGM with fixed weight values in terms of several performance criteria. We also compared GCGM with other routing protocols. Simulation results showed that GCGM provides better performance compared to TIGMR, LQEAR, and AGEM.

Automated summary

This article proposes a multipath geographic routing protocol for WMSNs that combines the benefits of greedy and compass routing strategies. Simulation results demonstrate its superior performance in various performance criteria compared to fixed weight values and other routing protocols.