دانلود رایگان مقاله انگلیسی پروتکل مسیریابی منفعل مسیر چندگانه برای شبکه های حسگر بی سیم - اشپرینگر 2018

Abstract

In this article, we propose a novel routing algorithm for wireless sensor network, which achieves uniform energy depletion across all the nodes and thus leading to prolonged network lifetime. The proposed algorithm, divides the Region of Interest into virtual zones, each having some designated cluster head nodes. In the entire process, a node can either be a part of a cluster or it may remain as an independent entity. A non-cluster member transmits its data to next hop node using IRPIntelligent Routing Process (based on the trade-off between the residual energy of itself as well as its neighbor, and the required energy to transmit packets to its neighbor). If on the transmission path, some cluster member is elected as a next hop, it rejects IRP and transmits the packets to cluster head, which later forwards them to sink (adopting multihop communication among cluster heads). Routing is not solely performed using clusters, rather they aid the overall routing process, hence this protocol is named as Cluster Aided Multipath Routing (CAMP). CAMP has been compared with various sensor network routing protocols, viz., LEACH, PEGASIS, DIRECT TRANSMISSION, CEED, and CBMR. It is found that the proposed algorithm outperformed them in network lifetime, energy consumption and coverage ratio.

Conclusion

Conservation of energy is the main challenge in the development of wireless sensor networks. We have presented in this paper CAMP, a novel energy balanced routing protocol, which can adapt itself, under the centralized control of the sink. The algorithm consists of clustering and routing phases. We have developed an efficient strategy with which sink partition the network into various regions (and their corresponding clusters). A node belonging to some cluster, transmits its sensed data to its CH, and CH in turn will send it to sink. For non cluster members we have devised a simple but elegant scheme with which they can route their data using both flat and clustered scheme depending upon which scheme requires less energy consumption. Finally, CAMP ensures that no node transmits greater than d0 distance as opposed to existing hierarchical approaches like LEACH [16], which compel sensors to latch to at least one cluster head, which results in tremendous energy exhaustion of the nodes due to the large distance between cluster nodes and the cluster head. In order to test the robustness of CAMP, we simulated it with different parameters and settings viz., varying the terrain size, number of nodes and location of the sink. Simulation results confirm that CAMP yields improved network lifetime and reduced energy consumption compared to its existing counterparts.