Congestion Aware Geographic Routing Protocol for Wireless Ad Hoc and Sensor Networks

被引:0
|
作者
Jaesung Park
机构
[1] The University of Suwon,Department of Information Security
来源
关键词
Geographic routing; Sensor networks; Congestion-awareness; Forwarder selection;
D O I
暂无
中图分类号
学科分类号
摘要
Geographic routing protocols forward packets according to the geographical locations of nodes. Thus, the criteria used to select a forwarding node impacts on the performance of the protocols such as energy efficiency and end-to-end transmission delay. In this paper, we propose a congestion aware forwarder selection (CAFS) method for a geographic routing protocol. To design CAFS, we devise a cost function by combining not only the forward progress made to a packet but also the amount of energy required for packet forwarding, forwarding direction, and congestion levels of potential forwarders. Among the potential forwarders, CAFS selects the next forwarder having the minimum cost. In our simulation studies, we compare the performance of CAFS with those of the maximum progress (MP) method and the cost over progress (CoP) method in various network conditions. The results show that compared with MP, the length of a routing path in terms of the number of hops becomes longer when CAFS is used. However, the shorter hop distance helps to avoid unnecessary retransmissions caused by packet loss in a wireless channel. In addition, since CAFS considers congestion levels of candidate forwarders, it reduces the queuing delay in each forwarder. Therefore, CAFS is superior to the MP and the CoP in terms of the energy consumption, end-to-end packet transfer delay, and the successful packet delivery rate.
引用
收藏
页码:1905 / 1916
页数:11
相关论文
共 50 条
  • [1] Congestion Aware Geographic Routing Protocol for Wireless Ad Hoc and Sensor Networks
    Park, Jaesung
    [J]. WIRELESS PERSONAL COMMUNICATIONS, 2014, 78 (04) : 1905 - 1916
  • [2] Energy-aware routing protocol for ad hoc wireless sensor networks
    Mann R.P.
    Namuduri K.R.
    Pendse R.
    [J]. EURASIP Journal on Wireless Communications and Networking, 2005 (5) : 635 - 644
  • [3] Congestion-aware routing protocol for mobile ad hoc networks
    Chen, Xiaoqin
    Jones, Haley M.
    Jayalath, A. D. S.
    [J]. 2007 IEEE 66TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-5, 2007, : 21 - +
  • [4] Probabilistic geographic routing protocol for ad hoc and sensor networks
    Roosta, Tanya
    [J]. IASTED International Conference on Wireless Networks and Emerging Technologies, 2005, : 65 - 72
  • [5] Secure Geographic Routing in Ad Hoc and Wireless Sensor Networks
    Mariano García-Otero
    Theodore Zahariadis
    Federico Álvarez
    Helen C. Leligou
    Adrián Población-Hernández
    Panagiotis Karkazis
    Francisco J. Casajús-Quirós
    [J]. EURASIP Journal on Wireless Communications and Networking, 2010
  • [6] Secure Geographic Routing in Ad Hoc and Wireless Sensor Networks
    Garcia-Otero, Mariano
    Zahariadis, Theodore
    Alvarez, Federico
    Leligou, Helen C.
    Poblacion-Hernandez, Adrian
    Karkazis, Panagiotis
    Casajus-Quiros, Francisco J.
    [J]. EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2010,
  • [7] Energy aware routing protocol (EARP) for ad-hoc wireless sensor networks
    Mann, RP
    Namuduri, K
    Pendse, R
    [J]. GLOBECOM 2004: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE WORKSHOPS, 2004, : 419 - 427
  • [8] Congestion Aware Routing Metric for Opportunistic Routing in Wireless Ad-hoc Networks
    Parsa, Ali
    Moghim, Neda
    [J]. 2016 EIGHTH INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE TECHNOLOGY (IKT), 2016, : 156 - 160
  • [9] DCAR: Dynamic congestion aware routing protocol in mobile ad hoc networks
    Kim, Young-Duk
    Lee, Sang-Heon
    Lee, Dong-Ha
    [J]. UBIQUITOUS CONVERGENCE TECHNOLOGY, 2007, 4412 : 130 - +
  • [10] A Study of Congestion-aware Routing Protocols for Wireless Ad hoc Networks
    Wu Wei
    Zhang Zhongzhao
    Sha Xuejun
    Qin Danyang
    [J]. 2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 2616 - 2619