An Efficient Grid-Based Geocasting Scheme for Wireless Sensor Networks

被引:1
|
作者
Wang, Neng-Chung [1 ]
Tsai, Ming-Fong [2 ]
Lee, Chao-Yang [3 ]
Chen, Young-Long [4 ]
Wong, Shih-Hsun [1 ]
机构
[1] Natl United Univ, Dept Comp Sci & Informat Engn, Miaoli 360302, Taiwan
[2] Natl United Univ, Dept Elect Engn, Miaoli 360302, Taiwan
[3] Natl Yunlin Univ Sci & Technol, Dept Comp Sci & Informat Engn, Touliu 640301, Taiwan
[4] Natl Taichung Univ Sci & Technol, Dept Comp Sci & Informat Engn, Taichung 404336, Taiwan
关键词
Fermat point; geocasting; grid-based; Internet of Things; wireless sensor network; DELIVERY; PROTOCOL;
D O I
10.3390/s23052783
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
In a wireless sensor network (WSN), geocasting is a location-based routing protocol used for data collection or information delivery. In geocasting, a target region usually contains many sensor nodes with limited battery capacity, and sensor nodes in multiple target regions need to transmit data to the sink. Therefore, how to use location information to construct an energy efficient geocasting path is a very important issue. FERMA is a geocasting scheme for WSNs based on Fermat points. In this paper, an efficient grid-based geocasting scheme for WSNs, which is called GB-FERMA, is proposed. The scheme uses the Fermat point theorem to search for the specific nodes as Fermat points in a grid-based WSN, and it selects the optimal relay nodes (gateways) in the grid structure to realize energy-aware forwarding. In the simulations, when the initial power 0.25 J, the average energy consumption of GB-FERMA is about 53% of FERMA-QL, 37% of FERMA, and 23% of GEAR; however, when with the initial power 0.5 J, the average energy consumption of GB-FERMA is about 77% of FERMA-QL, 65% of FERMA, and 43% of GEAR. The proposed GB-FERMA can effectively reduce the energy consumption and thus prolong the lifetime of the WSN.
引用
收藏
页数:14
相关论文
共 50 条
  • [1] An Efficient Grid-based Data Aggregation Scheme for Wireless Sensor Networks
    Wang, Neng-Chung
    Chiang, Yung-Kuei
    Hsieh, Chih-Hung
    JOURNAL OF INTERNET TECHNOLOGY, 2018, 19 (07): : 2196 - 2204
  • [2] An efficient grid-based data gathering scheme in wireless sensor networks
    Hwang, Shiow-Fen
    Lu, Kun-Hsien
    Chang, Hsiao-Nung
    Dow, Chyi-Ren
    UBIQUITOUS INTELLIGENCE AND COMPUTING, PROCEEDINGS, 2007, 4611 : 545 - +
  • [3] An efficient adjustable grid-based data replication scheme for wireless sensor networks
    Chen, Tzung-Shi
    Wang, Neng-Chung
    Wu, Jia-Shiun
    AD HOC NETWORKS, 2016, 36 : 203 - 213
  • [4] An Efficient Grid-Based Pairwise Key Predistribution Scheme for Wireless Sensor Networks
    Neng-Chung Wang
    Young-Long Chen
    Hong-Li Chen
    Wireless Personal Communications, 2014, 78 : 801 - 816
  • [5] An Efficient Grid-Based Pairwise Key Predistribution Scheme for Wireless Sensor Networks
    Wang, Neng-Chung
    Chen, Young-Long
    Chen, Hong-Li
    WIRELESS PERSONAL COMMUNICATIONS, 2014, 78 (02) : 801 - 816
  • [6] Energy efficient grid-based routing in wireless sensor networks
    Vidhyapriya, Ranganathan
    Vanathi, Ponnusamy Thangapandian
    INTERNATIONAL JOURNAL OF INTELLIGENT COMPUTING AND CYBERNETICS, 2008, 1 (02) : 301 - 318
  • [7] Efficient coverage planning for grid-based wireless sensor networks
    Takahara, Glen
    Xu, Kenan
    Hassanein, Hossam
    2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14, 2007, : 3522 - +
  • [8] Efficient key predistribution for grid-based wireless sensor networks
    Blackburn, Simon R.
    Etzion, Tuvi
    Martin, Keith M.
    Paterson, Maura B.
    INFORMATION THEORETIC SECURITY, PROCEEDINGS, 2008, 5155 : 54 - +
  • [9] An energy efficient authentication scheme based on hierarchical ibds and eibds in grid-based wireless sensor networks
    Kantharaju H.C.
    Narasimha Murthy K.N.
    International Journal of Information and Computer Security, 2020, 13 (01) : 48 - 72
  • [10] A Grid-Based Distributed Event Detection Scheme for Wireless Sensor Networks
    Ko, Ja Won
    Choi, Yoon-Hwa
    SENSORS, 2011, 11 (11) : 10048 - 10062