Abstract
Recently, wireless sensor network (WSN) has drawn wide attention. It can be viewed as a network with lots of sensors that are autonomously organized and cooperate with each other to collect, process, and transmit data around targets to some remote administrative center. As such, sensors may be deployed in harsh environments where it is impossible for battery replacement. Therefore, energy efficient routing is crucial for applications that introduce WSNs. In this paper, we present an energy efficient routing schema combined with clustering and sink mobility technology. We first divide the whole sensor field into sectors and each sector elects a Cluster Head (CH) by calculating its members’ weight. Member nodes calculate energy consumption of different routing paths to choose the optimal scenario. Then CHs are connected into a chain using the greedy algorithm for intercluster communication. Simulation results prove the presented schema outperforms some similar work such as Cluster-Chain Mobile Agent Routing (CCMAR) and Energy-efficient Cluster-based Dynamic Routing Algorithm (ECDRA). Additionally, we explore the influence of different network parameters on the performance of the network and further enhance its performance.
Highlights
Recent advances in wireless communication, and computer and micro-electronic technology have enabled the rapid development of tiny, low-cost, and multi-functional sensors
For addressing the above problems, in this paper, we present an energy-efficient routing schema combined with clustering and mobile sink technology
Too much data forwarding resulted in the unnecessary energy dissipation in Cluster-Chain Mobile Agent Routing (CCMAR)
Summary
Recent advances in wireless communication, and computer and micro-electronic technology have enabled the rapid development of tiny, low-cost, and multi-functional sensors. The “hot spots” problem usually happens in WSNs with a static sink and fixed network topology. Clustering technology greatly decreases the energy consumption of WSNs by dividing the sensors into clusters according to some special rules. Data fusion can be adopted in CHs to filter the redundant data to decrease the burden of CHs. One of the classic routing protocols that adopts clustering is the low-energy adaptive clustering algorithm (LEACH); the approach for CHs selection is unreasonable and much further work is being conducted based on LEACH. For addressing the above problems, in this paper, we present an energy-efficient routing schema combined with clustering and mobile sink technology.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
