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
关键词
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 条
  • [1] Tree Based Energy Efficient and Congestion Aware Routing Protocol for Wireless Sensor Networks
    Mohajerzadeh, Arnir Hossein
    Yaghmaee, Mohammad Hossien
    Eskandari, Zahra
    [J]. 2008 11TH IEEE SINGAPORE INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS (ICCS), VOLS 1-3, 2008, : 1705 - 1709
  • [2] Energy and Congestion-Aware QoS Routing for Wireless Sensor Networks
    Alwan, Hind
    Agarwal, Anjali
    [J]. 2013 ANNUAL IEEE INDIA CONFERENCE (INDICON), 2013,
  • [3] Energy efficient and vulnerability aware routing in Wireless Sensor Networks
    Ahmed, Ghufran
    Khalid, Zubair
    Khan, Noor M.
    Vigneras, Pierre
    [J]. 2008 SECOND INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING, 2008, : 145 - 148
  • [4] EEAR: Efficient Energy Aware Routing in Wireless Sensor Networks
    Younus, Munazza
    Minhas, Abid Ali
    Javed, M. Younus
    Naseer, Atif
    [J]. 2009 7TH INTERNATIONAL CONFERENCE ON ICT AND KNOWLEDGE ENGINEERING, 2009, : 51 - +
  • [5] Optimized Congestion Aware Energy Efficient Traffic Load Balancing Scheme for Routing in Wireless Sensor Networks
    Sunitha, G. P.
    Kumar, Vijay B. P.
    Kumar, Dilip S. M.
    [J]. 2015 IEEE INTERNATIONAL CONFERENCE ON INFORMATION PROCESSING (ICIP), 2015, : 696 - 701
  • [6] Energy Efficient and Congestion Control Multipath Routing in Wireless Sensor Networks
    Sudha, M. Nesa
    John, Sapna E.
    Valarmathi, M. L.
    [J]. ADVANCES IN NETWORK SECURITY AND APPLICATIONS, 2011, 196 : 225 - +
  • [7] Efficient Energy and Position Aware Routing Protocol for Wireless Sensor Networks
    Shivalingagowda, Chaya
    Jayasree, P. V. Y.
    Sah, Dinesh K.
    [J]. KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2020, 14 (05) : 1929 - 1950
  • [8] Energy Efficient Collision Aware Multipath Routing for Wireless Sensor Networks
    Wang, Zijian
    Bulut, Eyuphan
    Szymanski, Boleslaw K.
    [J]. 2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8, 2009, : 91 - +
  • [9] Energy and congestion aware routing based on hybrid gradient fields for wireless sensor networks
    Ankush Jain
    K. K. Pattanaik
    Ajay Kumar
    Paolo Bellavista
    [J]. Wireless Networks, 2021, 27 : 175 - 193
  • [10] Energy and congestion aware routing based on hybrid gradient fields for wireless sensor networks
    Jain, Ankush
    Pattanaik, K. K.
    Kumar, Ajay
    Bellavista, Paolo
    [J]. WIRELESS NETWORKS, 2021, 27 (01) : 175 - 193