Cluster – Based Routing for the Mobile Sink in Wireless Sensor Networks with Obstacle

Abstract

Cluster-Based Routing for the Mobile Sink in Wireless Sensor Networks with Obstacle

Cluster – Based Routing for the Mobile Sink in Wireless Sensor Networks with Obstacle The concentration of data traffic to the sink in a wireless sensor network causes the nearby nodes to deplete their batteries faster than other nodes, leaving the sink stranded and disrupting sensor data reporting.

However, the mechanisms to support sink mobility (e.g., advertising the network location of the mobile sink) introduce an overhead in terms of energy consumption and packet delays. With these properties, mobile sink routing is an interesting research field with unique requirements. We present a survey of the existing distributed mobile sink routing protocols in this paper.

Energy efficiency is the most important issue for wireless sensor networks (WSN), as sensor nodes have limited batteries. Replacing the batteries of sensor nodes is likely to require considerable effort; therefore, WSNs must be able to operate for an adequately long time without human intervention. Due to the intersection of multi-hop routes and the concentration of data traffic towards the sinks, nodes near the sinks are more likely to deplete their battery supplies in WSNs with static (immobile) sinks before other nodes.

Conclusion

We used the mobile sink to prolong the life of the network. The sensing field could contain various nodes in physical environments. We introduced the grid-based technique to the WSN to simplify the scheduling for the mobile sink.

At the same time, to find an essential shortest route, we built the djikstra’s algorithm for the mobile sink. Applies the heuristic algorithm to dispatch the mobile sink based on the cluster-based method. And also conducts simulation using Network simulator and experimental results show that our cluster-based approach is feasible for mobile sink dispatch.