Energy Efficient Data Gathering Technique Based on Optimal Mobile Sink Node Selection for Improved Network Life Time in Wireless Sensor Network (WSN)

2020 
The utilization of mobile sink in spite of its points of interest carries new difficulties to WSNs. The principle disputes are the position update of sink node to the hub. Every sensor hub should know about the sink position all together that it can move its information to the sink. Existing Flooding technique proposed that the portable sink needs to consistently spread its situation all through the system to advise sensor hubs regarding the sink position. In any case, visit position refreshes from the sink can prompt both maximum power utilization and amplified crashes in the network. To diminish the updation of sink position, different types of routing structures can be utilized. A routing mechanism dependent on the mobile sink is effective if it limits the power utilization and delays in the system network. The primary intention of the study is to design an energy embedded routing protocol based on optimal updation of the mobile sink. Here, the most recent sink position will be spared in the hubs developing the implicit environment. Accordingly, in Embedded routing, the position of the sink node is proliferated to the sensor hubs situated at the discs instead of the solicitation of hubs in the system. The remainder of the hubs can locate the most recent sink position by forwarding solicitation information to the closest disc. Based on the received information, the receiver of the message is identified. This will be performed by optimal fuzzy based clustering technique. The optimization can be done by Oppositional grey wolf optimization (OGWO) algorithm. The efficiency is analyzed by maximum network lifetime, minimum delay etc. The results will be analyzed and compared with existing routing protocols to ensure the efficiency.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    51
    References
    0
    Citations
    NaN
    KQI
    []