http://iet.metastore.ingenta.com
1887

Dual-path-based reliable geocasting for tactical ad hoc networks

Dual-path-based reliable geocasting for tactical ad hoc networks

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

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

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.

Geocasting is an efficient mechanism for disseminating messages towards a specific geographical region. Since its packet forwarding is based on the location information of nodes, it does not require any periodic or on-demand path updates. Especially, geocasting is suitable for several applications in tactical ad hoc networks such as alarms for chemical and missile attacks, guerrilla detection or a local weathercast. However, traditional geocast protocols proposed for pure mobile ad hoc networks are inadequate to meet high demands of reliability in military applications. In this study, the authors propose even more efficient and reliable dual-path geocasting protocol which utilises two independent paths and novel acknowledgement mechanisms to improve the chances of successful message delivery. The authors investigate how to locate this dual path to achieve the best performance by means of destination points. The authors’ comprehensive simulation study using ns-2 shows that the proposed scheme results in high delivery ratio with low packet overhead and latency.

References

    1. 1)
      • Tactical communications for the digitized battlefield
    2. 2)
      • Jiang, X., Camp, T.: `A review of geocasting protocols for mobile ad hoc networks', Proc. Int. Conf. on Grace Hopper Celebration, 2002
    3. 3)
      • Yoon, S.-J., Lee, S.-H., Ko, Y.-B.: `Reliable dual-path geocasting for tactical ad hoc networks', Proc. Int. Conf. on IEEE MILCOM, 2009
    4. 4)
    5. 5)
    6. 6)
    7. 7)
      • Stojmenovic, I.: `Voronoi diagram and convex hull based geocasting and routing in wireless networks', TR-99–11, Technical Report, 1999
    8. 8)
      • GeoGRID: A geocasting protocol for mobile ad hoc networks based on GRID
    9. 9)
    10. 10)
    11. 11)
      • Chen, H.L., Tseng, C.C., Hu, S.H.: `An adaptive handshaking-based geocasting protocol in MANETs', Proc. Int. Conf. on IWCMC, 2006
    12. 12)
      • Karp, B., Kung, H.T.: `GPSR: greedy perimeter stateless routing for wireless networks', Proc. Int. Conf. on MOBICOM, 2000
    13. 13)
      • Boleng, J., Camp, T., Tolety, V.: `Mesh-based geocast routing protocols in an ad hoc network', Proc. Int. Conf. on 15th Int. Parallel & Distributed Processing Symp., 2001
    14. 14)
    15. 15)
    16. 16)
    17. 17)
      • Lin, J.C., Paul, S.: `RMTP: a reliable multicast transport protocol', Proc. Int. Conf. on INFOCOM, 1996
    18. 18)
      • WIN-T increasing the power of battlefield communications
    19. 19)
      • Army transformation-accessing the implications on signal organizations
    20. 20)
      • 802.11 Wireless network: the definitive guide
    21. 21)
      • http://www.isi.edu/nsnam/vint/ns/the network simulator ns-2
    22. 22)
      • http://tools.ietf.org/html/rfc3561
    23. 23)
      • Wolman, W.V., Barsoum, Y.: `Overview of open shortest path first, version 2 (OSPF V2) routing in the tactical environment', Proc. Int. Conf. on IEEE MILCOM, 1995
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2010.1042
Loading

Related content

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