Two Phased Routing Protocol Incorporating Distributed Genetic Algorithm and Gradient Based Heuristic in Clustered WSN

被引:11
|
作者
Banerjee, Soumya [1 ]
Chowdhury, Chandreyee [2 ]
Chattopadhyay, Samiran [1 ]
Aslam, Nauman [3 ]
机构
[1] Jadavpur Univ, Dept Informat Technol, Plot 8,LB Block,Sect 3, Kolkata 700098, India
[2] Jadavpur Univ, Dept Comp Sci & Engn, 188 Raja SC Mallick Rd, Kolkata 700032, India
[3] Northumbria Univ, Dept Comp Sci & Digital Technol, Newcastle City Campus,2 Ellison Pl, Newcastle Upon Tyne NE1 8ST, Tyne & Wear, England
关键词
Wireless sensor networks; Genetic algorithm; Two phased approach; Gradient based heuristic; ENERGY-EFFICIENT; DESIGN; HYBRID;
D O I
10.1007/s11277-017-4786-y
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
In wireless cluster networks with a single non mobile sink, finding the optimal cluster assignment is a non-trivial problem. The inherently non centralized nature of wireless sensor networks poses a problem as majority of the learning algorithms are centralized. It is also desirable that single routing algorithm be applicable regardless of whether the sensor network is a dense single-hop network or a sparse multi-hop network. In this paper we present the two phased routing incorporating distributed genetic algorithm and gradient based heuristic (TRIGGER) as an attempt to solve these problems. In the first phase of TRIGGER a distributed (island model) genetic algorithm based clustering is employed to find a spatially optimal cluster assignment. In the second phase a gradient based routing forwards the already aggregated data to the sink. We discuss the rationale behind the two phased nature of TRIGGER. We demonstrate the effectiveness of TRIGGER with extensive simulations and discuss the results.
引用
收藏
页码:5401 / 5425
页数:25
相关论文
共 50 条
  • [41] Hybrid Genetic Firefly Algorithm-Based Routing Protocol for VANETs
    Singh, Gagan Deep
    Prateek, Manish
    Kumar, Sunil
    Verma, Madhushi
    Singh, Dilbag
    Lee, Heung-No
    IEEE Access, 2022, 10 : 9142 - 9151
  • [42] Hybrid Genetic Firefly Algorithm-Based Routing Protocol for VANETs
    Singh, Gagan Deep
    Prateek, Manish
    Kumar, Sunil
    Verma, Madhushi
    Singh, Dilbag
    Lee, Heung-No
    IEEE ACCESS, 2022, 10 : 9142 - 9151
  • [43] A new quality of service multicast routing protocol based on genetic algorithm
    Koyama, A
    Nishie, T
    Arai, J
    Barolli, L
    11TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL I, PROCEEDINGS, 2005, : 655 - 660
  • [44] MOMHR: A Dynamic Multi-hop Routing Protocol for WSN Using Heuristic Based Multi-objective Function
    Vinodhini, R.
    Gomathy, C.
    WIRELESS PERSONAL COMMUNICATIONS, 2020, 111 (02) : 883 - 907
  • [45] MOMHR: A Dynamic Multi-hop Routing Protocol for WSN Using Heuristic Based Multi-objective Function
    R. Vinodhini
    C. Gomathy
    Wireless Personal Communications, 2020, 111 : 883 - 907
  • [46] Multicast routing algorithm based on genetic strategy with two populations
    Chen, Pin
    Liu, Sanyang
    Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2002, 24 (12): : 1760 - 1765
  • [47] An Application-Level Routing Method with Transit Cost Reduction Based on a Distributed Heuristic Algorithm
    Matsuda, Kazuhito
    Hasegawa, Go
    Murata, Masayuki
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2013, E96B (06) : 1481 - 1491
  • [48] Genetic spider monkey-based routing protocol to increase the lifetime of the network and energy management in WSN
    Soundaram, Jothi
    Arumugam, Chandrasekar
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2020, 33 (14)
  • [49] Energy Efficient Cluster Based Routing Protocol Using Charged System Harmony Search Algorithm in WSN
    Nandhini, P.
    Suresh, A.
    WIRELESS PERSONAL COMMUNICATIONS, 2021, 121 (03) : 1457 - 1470
  • [50] Energy Efficient Cluster Based Routing Protocol for WSN Using Firefly Algorithm and Ant Colony Optimization
    Wang, Zongshan
    Ding, Hongwei
    Li, Bo
    Bao, Liyong
    Yang, Zhijun
    Liu, Qianlin
    WIRELESS PERSONAL COMMUNICATIONS, 2022, 125 (03) : 2167 - 2200