About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
Wireless Internet. 7th International ICST Conference, WICON 2013, Shanghai, China, April 11-12, 2013, Revised Selected Papers

Research Article

Two-Hop Geographic Multipath Routing in Duty-cycled Wireless Sensor Networks

Download(Requires a free EAI acccount)
495 downloads
Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1007/978-3-642-41773-3_17,
        author={Yuhui Dong and Guangjie Han and Lei Shu and Hui Guo and Chuan Zhu},
        title={Two-Hop Geographic Multipath Routing in Duty-cycled Wireless Sensor Networks},
        proceedings={Wireless Internet. 7th International ICST Conference, WICON 2013, Shanghai, China, April 11-12, 2013, Revised Selected Papers},
        proceedings_a={WICON},
        year={2013},
        month={10},
        keywords={Duty-cycle Wireless sensor networks 2-hop neighborhood Geographic routing},
        doi={10.1007/978-3-642-41773-3_17}
    }
    
  • Yuhui Dong
    Guangjie Han
    Lei Shu
    Hui Guo
    Chuan Zhu
    Year: 2013
    Two-Hop Geographic Multipath Routing in Duty-cycled Wireless Sensor Networks
    WICON
    Springer
    DOI: 10.1007/978-3-642-41773-3_17
Yuhui Dong,*, Guangjie Han,*, Lei Shu1,*, Hui Guo2,*, Chuan Zhu,*
  • 1: Guangdong University of Petrochemical Technology
  • 2: Hohai University
*Contact email: titiyaya09@gmail.com, hanguangjie@gmail.com, lei.shu@live.ie, guohuiqz@gmail.com, dr.river.zhu@gmail.com

Abstract

As an extension of our previous designed Two-Phase geographic Greedy Forwarding (TPGF) routing algorithm in wireless sensor networks (WSNs), this paper proposes a new 2-hop geographic greedy forwarding algorithm called TPGFPlus, which uses 2-hop neighborhood information for geographic routing. In our TPGFPlus, a forwarding node selects its next-hop node which is closest to the based station among all its 1-hop and 2-hop neighbor nodes. Moreover, to prolong network lifetime, not all the nodes are awake for working in our work since the EC-CKN algorithm is applied to make the network be duty-cycled. We evaluate the performance of our algorithm versus running existing TPGF algorithm on the same duty-cycled WSNs. Simulations show that our proposed algorithm outperforms previous work TPGF on finding more average paths and shorter average length of paths, yet without causing additional energy consumption.

Keywords
Duty-cycle Wireless sensor networks 2-hop neighborhood Geographic routing
Published
2013-10-08
http://dx.doi.org/10.1007/978-3-642-41773-3_17
Copyright © 2013–2025 ICST
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL