Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Geographic hole-bypassing forwarding protocol for wireless sensor networks

Geographic hole-bypassing forwarding protocol for wireless sensor networks

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

  • Author(s): F. Li 1 ; B. Zhang 2 ; J. Zheng 3
    • View affiliations
    • Affiliations: 1: Key Lab of Wireless Sensor Networks and Communications, Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, Shanghai, People's Republic of China
      2: Research Center of Ubiquitous Sensor Networks, Graduate University of Chinese Academy of Science, Beijing, People's Republic of China
      3: National Mobile Communications Research Laboratory, Southeast University, Nanjing, People's Republic of China
  • Source: Volume 5, Issue 6, 15 April 2011, p. 737 – 744
    DOI:  10.1049/iet-com.2010.0266 , Print ISSN 1751-8628, Online ISSN 1751-8636
© The Institution of Engineering and Technology
Published

The authors propose a new geographic hole-bypassing forwarding (HBF) protocol to address the hole diffusion problem in wireless sensor networks (WSNs). To support efficient hole-bypassing, the HBF protocol models a hole using a virtual circle whose radius is adjustable within a certain range and is calculated on a per-packet basis. The information associated with the virtual circle will be used, if needed, for selecting an anchor point to bypass the hole in order for a packet to reach a particular sink node. The design objective of the HBF protocol is to balance the traffic load among the nodes near an actual hole boundary. Using the HBF protocol, a packet is always sent to the closest sink and the extra distance for hole-bypassing is considered in the delivery of data packets to reach the sinks (or some of them) in the network. The simulation results show that HBF outperforms existing hole-bypassing protocols in terms of packet delivery ratio and network lifetime.

Inspec keywords: protocols; wireless sensor networks; telecommunication traffic

Other keywords: geographic hole bypassing forwarding protocol; HBF protocol; wireless sensor networks; WSN traffic load

Subjects: Protocols; Wireless sensor networks

References

    1. 1)
      • Kim, Y.-J., Govindan, R., Karp, B., Shenker, S.: `Geographic routing made practical', Proc. USENIX Symp. on Network Systems Design and Implementation, May 2005, Boston, MA, USA, p. 217–230.
    2. 2)
      • http://www.qualnet.com/.
    3. 3)
      • A. Savvides , M.B. Strivastava . Distributed fine-grained localization in ad-hoc networks. IEEE Trans. Mobile Comput. , 4 , 499 - 518
    4. 4)
      • Li, J., Jannotti, J., DeCouto, D., Karger, D., Morris, R.: `A scalable location service for geographic ad-hoc routing', Proc. ACM SIGMOBILE’00, August 2000, Boston, MA, USA, p. 120–130.
    5. 5)
      • Fang, Q., Gao, J., Guibas, L.J.: `Locating and bypassing routing holes in sensor networks', Proc. IEEE INFOCOM’04, March 2004, Hong Kong, China, p. 2458–2468.
    6. 6)
      • Alsalih, W., Hassanein, H., Akl, S.: `Routing to a mobile data collector on a predefined trajectory', Proc. IEEE ICC’09, June 2009, Dresden, Germany.
    7. 7)
      • Ahmed, N., Kanhere, S., Jha, S.: `The holes problem in wireless sensor networks: a survey', Proc. ACM SIGMOBILE’05, September 2005, Cologne, Germany, p. 4–18.
    8. 8)
    9. 9)
    10. 10)
      • Powell, O., Nikoletseas, S.: `Simple and efficient geographic routing around obstacles for wireless sensor networks', Proc. IEEE WEA’07, June 2001, Rome, Italy, p. 161–174.
    11. 11)
      • Zhao, G., Liu, X., Sun, M.-T.: `Energy-aware geographic routing for sensor networks with randomly shifted anchors', Proc. IEEE WCNC’07, March 2007, Hong Kong, China, p. 3454–3459.
    12. 12)
      • Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: `Energy-efficient communication protocol for wireless microsensor networks', Proc. HICSS’00, January 2000, Maui, HI, USA, p. 1–10.
    13. 13)
      • S. Giordano , I. Stojmenovic , X. Cheng , X. Huang , D.A. Du . (2004) Position based routing algorithms for ad hoc networks: a taxonomy’, in, Ad hoc wireless networking.
    14. 14)
      • Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: `Routing with guaranteed delivery in ad hoc wireless networks', Proc. ACM DIALM-POMC’99, August 1999, Seattle, WA, USA, p. 48–55.
    15. 15)
      • Karp, B., Kung, H.: `GPSR: greedy perimeter stateless routing for wireless networks', Proc. ACM MOBICOM’00, August 2000, Boston, MA, USA, p. 243–254.
    16. 16)
      • Yu, F., Choi, Y., Park, S., Lee, E., Tian, Y., Kim, S.-H.: `Anchor node based virtual modeling of holes in wireless sensor networks', Proc. IEEE ICC’08, May 2008, Beijing, China, p. 3120–3124.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2010.0266
Loading

Related content

content/journals/10.1049/iet-com.2010.0266
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address