Energy Efficient and Congestion Aware Routing Algorithms for Wireless Sensor Networks Connected as Hypercube

被引:1
作者
Mohajerzadeh, Amir Hossein [1 ]
Yaghmaee, Mohammad Hossien [1 ]
Eskandari, Zahra [1 ]
Deldari, Hossein [1 ]
机构
[1] Ferdowsi Univ Mashad, Dept Comp Engn, Mashhad, Iran
来源
2008 INTERNATIONAL SYMPOSIUM ON TELECOMMUNICATIONS, VOLS 1 AND 2 | 2008年
关键词
Energy Aware Algorithm; Fairness; Hypercube; Routing Algorithms; Wireless Sensor Networks;
D O I
10.1109/ISTEL.2008.4651322
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Wireless Sensor Networks (WSN) have been noticed and researched nowadays. These new type of networks have unique characteristics. WSNs have different limitations such as computational power, storage capacity, energy source and etc. The main constraint of wireless sensor networks is energy. The energy source of sensor nodes is limited and not rechargeable. Therefore, optimizing consumption of energy is essential for WSNs protocols. Hypercube topology is very popular in distributed environments. In last few years, many different topology specific routing algorithms have been designed for wireless sensor networks, but to the best of our knowledge, none of them consider Hypercube as their topology. In this paper, different routing algorithms are proposed for WSN with Hypercube topology. The performance of all proposed routing algorithms is evaluated, and the best algorithm which can provide more fairness is introduced. Simulation results which are represented in last section of this paper are the base of our conclusions. The main goal of this paper is to find a fair energy aware routing algorithm for wireless sensor network connected as Hypercube.
引用
收藏
页码:324 / 329
页数:6
相关论文
共 50 条
  • [21] Energy efficient data correlation aware opportunistic routing protocol for wireless sensor networks
    Qin, Xu
    Huang, Guanglun
    Zhang, Baoxian
    Li, Cheng
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2021, 14 (04) : 1963 - 1975
  • [22] A new QoS aware and energy efficient opportunistic routing protocol for wireless sensor networks
    Tiab, Amal
    Bouallouche-Medjkoune, Louiza
    Boulfekhar, Samra
    INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2018, 33 (01) : 52 - 68
  • [23] Energy efficient data correlation aware opportunistic routing protocol for wireless sensor networks
    Xu Qin
    Guanglun Huang
    Baoxian Zhang
    Cheng Li
    Peer-to-Peer Networking and Applications, 2021, 14 : 1963 - 1975
  • [24] Traffic-Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
    Ren, Fengyuan
    He, Tao
    Das, Sajal K.
    Lin, Chuang
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2011, 22 (09) : 1585 - 1599
  • [25] Efficient Fault-Aware Routing for Wireless Sensor Networks
    Yun, Jaekeun
    Kim, Daehee
    An, Sunshin
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2017, E100A (09): : 1985 - 1992
  • [26] Traffic-Aware and Energy-Efficient Routing Algorithm for Wireless Sensor Networks
    Wei Ding
    Liangrui Tang
    Sen Feng
    Wireless Personal Communications, 2015, 85 : 2669 - 2686
  • [27] Traffic-Aware and Energy-Efficient Routing Algorithm for Wireless Sensor Networks
    Ding, Wei
    Tang, Liangrui
    Feng, Sen
    WIRELESS PERSONAL COMMUNICATIONS, 2015, 85 (04) : 2669 - 2686
  • [28] Energy Efficient Clustering and Routing Algorithms for Wireless Sensor Networks: GA Based Approach
    Suneet K. Gupta
    Prasanta K. Jana
    Wireless Personal Communications, 2015, 83 : 2403 - 2423
  • [29] Energy efficient routing algorithms for application to agro-food wireless sensor networks
    Chiti, F
    De Cristofaro, A
    Fantacci, R
    Tarchi, D
    Collodi, G
    Giorgetti, G
    Manes, A
    ICC 2005: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, 2005, : 3063 - 3067
  • [30] Energy Efficient Clustering and Routing Algorithms for Wireless Sensor Networks: GA Based Approach
    Gupta, Suneet K.
    Jana, Prasanta K.
    WIRELESS PERSONAL COMMUNICATIONS, 2015, 83 (03) : 2403 - 2423