Abstract
Geographic opportunistic routing (GOR) has shown throughput efficiency in coping with unreliable transmissions in multihop wireless networks. The basic idea behind opportunistic routing is to take advantage of the broadcast nature and spacial diversity of the wireless medium by involving multiple neighbors of the sender into the local forwarding, thus improve transmission reliability. The existing GOR schemes typically involve as many as available next-hop neighbors into the local forwarding, and give the nodes closer to the destination higher relay priorities. In this paper, we show that it is not always the optimal way to achieve the best throughput. We introduce a framework to analyze the one-hop throughput of GOR, provide a deeper insight into the trade-off between the benefit (packet advancement and transmission reliability) and cost (medium time delay) associated with the node collaboration, and propose a local metric named expected one-hop throughput (EOT) to balance the benefit and cost. We also identify an upper bound of EOT and its concavity, which indicates that even if the candidate coordination delay were negligible, the throughput gain would become marginal when the number of forwarding candidates increases. Based on the EOT, we also propose a local candidate selection and prioritization algorithm. Simulation results validate our analysis and show that the EOT metric leads to both better one-hop and path throughput than the corresponding pure GOR and geographic routing.
Similar content being viewed by others
Notes
In this paper, we set the threshold as 0.1.
Due to space limit, we only provide a sketch of the proof.
In this paper, an ordered node set \(\mathcal{A}\) containing another ordered node set \(\mathcal{B}\) means \(\mathcal{A}\) is obtained by inserting a new node into \(\mathcal{B}\) but keeping the priority relationship of nodes in \(\mathcal{B}\) unchanged. It’s not necessary for \(\mathcal{B}\) being a subsequence of \(\mathcal{A}\).
References
IEEE Std 802.11b-1999. http://standards.ieee.org/
Awerbuch B, Holmer D, Rubens H (2006) The medium time metric: high throughput route selection in multi-rate ad hoc wireless networks. MONET 11(2):253–266
Biswas S, Morris R (2005) Exor: opportunistic multi-hop routing for wireless networks. In: SIGCOMM’05, Philadelphia, August 2005
Bulusu N, Heidemann J, Estrin D (2000) Gps-less low cost outdoor localization for very small devices. IEEE Pers Commun 7(5):28–34, October
Chachulski S, Jennings M, Katti S, Katabi D (2007) Trading structure for randomness in wireless opportunistic routing. In: ACM SIGCOMM, Kyoto, 27–31 August 2007
Couto D, Aguayo D, Bicket J, Morris R (2003) A high-throughput path metic for multi-hop wireless routing. In: ACM MobiCom’03, San Diego, September 2003
Dubois-Ferriere H, Grossglauser M, Vetterli M (2007) Least-cost opportunistic routing. Technical Report LCAV-REPORT-2007-001, School of Computer and Communication Sciences, EPFL
Fussler H, Widmer J, Kasemann M, Mauve M, Hartenstein H (2003) Contention-based forwarding for mobile ad-hoc networks. Elseviers Ad Hoc Netw 1(4):351–369, November
Gupta P, Kumar PR (2000) The capacity of wireless networks. Trans Inform Theory 46(2):388–404, March
Keshavarzin A, Uysal-Biyikoglu E, Herrmann F, Manjeshwar A (2004) Energy-efficient link assessment in wireless sensor networks. In: IEEE Infocom, Hong Kong, 7–11 March 2004
Lee S, Bhattacharjee B, Banerjee S (2005) Efficient geographic routing in multihop wireless networks. In: MobiHoc, Urbana-Champaign, 25–27 May 2005
Savvides A, Han C, Strivastava MB (2001) Dynamic finegrained localization in ad-hoc networks of sensors. In: IEEE/ACM MobiCom, Rome, July 2001
Seada K, Zuniga M, Helmy A, Krishnamachari B (2004) Energy efficient forwarding strategies for geographic routing in wireless sensor networks. In: ACM Sensys’04, Baltimore, November 2004
Shah RC, Bonivento A, Petrovic D, Lin E, van Greunen J, Rabaey J (2004) Joint optimization of a protocol stack for sensor networks. In: IEEE Milcom, Monterey, November 2004
Simon MK, Alouini M-S (2005) Digital communication over fading channels, 2nd edn. Wiley-Interscience, New York
Zeng K, Lou W, Yang J, Brown DR (2007) On geographic collaborative forwarding in wireless ad hoc and sensor networks. In: WASA’07, Chicago, August 2007
Zeng K, Lou W, Yang J, Brown DR (2007) On throughput efficiency of geographic opportunistic routing in multihop wireless networks. In: QShine’07, Vancouver, August 2007
Zeng K, Lou W, Zhai H (2008) On end-to-end throughput of opportunistic routing in multirate and multihop wireless networks. In: IEEE, Infocom, Phoenix, 15–17 April 2008
Zeng K, Lou W, Zhang Y (2007) Multi-rate geographic opportunistic routing in wireless ad hoc networks. In: Milcom’07, Orlando, October 2007
Zhao J, Govindan R (2003) Understanding packet delivery performance in dense wireless sensor networks. In: ACM Sensys’03, Los Angeles, November 2003
Zhong Z, Wang J, Nelakuditi S (2006) Opportunistic any-path forwarding in multi-hop wireless mesh networks. Technical Report TR-2006-015, USC-CSE
Zorzi M, Armaroli A (2003) Advancement optimization in multihop wireless networks. In: Proc. of VTC, Orlando, October 2003
Zorzi M, Rao RR (2003) Geographic random forwarding (geraf) for ad hoc and sensor networks: energy and latency performance. IEEE Trans Mob Comput 2(4):349–365
Zorzi M, Rao RR (2003) Geographic random forwarding (geraf) for ad hoc and sensor networks: multihop performance. IEEE Trans Mob Comput 2(4):337–348
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported in part by the US National Science Foundation under grants CNS-0626601, CNS-0716306 and CCF-0447743.
Rights and permissions
About this article
Cite this article
Zeng, K., Lou, W., Yang, J. et al. On Throughput Efficiency of Geographic Opportunistic Routing in Multihop Wireless Networks. Mobile Netw Appl 12, 347–357 (2007). https://doi.org/10.1007/s11036-008-0051-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11036-008-0051-7