Maximizing The Lifetime Of Multi-hop Wireless Sensor Networks

Maximizing the lifetime of the network is a crucial challenge in wireless sensor networks(WSNs).It becomes extremely crucial in WSNs when the sensor nodes,generally inaccessible in sensing regions,are powered by terminable or not readily replaceable energy batteries.The drainage of these terminable energy batteries can lead to modify the topology of the network or the network’s lifetime fizzle out.It is therefore of significance to extend the sensor network’s lifetime.In addition to energy,there are other problems,such as constrained processing and memory power,scalability,short range transmission,and their placement in combat regions.The sensor node’s radio and processor are two of the most energy-draining components.The energy drainage of various protocol stack components may vary.Therefore,we consider the network layer to be the core concern because of well-managed and efficient load balanced routing that can reduce the energy drainage of each sensor node’s radio and processor.Minimizing message overhead and limiting control messages should,in particular,control the amount of energy drained by data processing and transceivers.Academics have implemented several energy-aware communications protocols,but prior to each round of data transmission begin they are unable to manage the network well and to restrict control messages required to find neighboring nodes,load balanced energy-efficient routes,reliability,and route maintenance,which eventually diminishes network’s lifetime quickly.Control message restriction through proper network management,load balancing among nodes,trustworthiness of the nodes,and data aggregation methodologies can significantly improve network’s lifetime.In this thesis,we will concentrate on increasing network lifetime by overcoming three challenges.The first challenge is to provide stable and efficient network management with effective load balancing among nodes to reduce each node’s processing and computational cost.The second challenge is to provide trustworthiness of each node with load balancing to ensure the reliability and effectiveness of the path from each node to sink.The third challenge is to provide dynamic cluster head and access node selection by taking into account the balanced load among the nodes and the energy threshold of being cluster head or access node in order to collect and route data efficiently in large-scale networks.In addition,to reduce energy drain by cluster heads for direct transmission to sink,efficient inter-cluster routing is necessary.Consequently,firstly,we propose a software-defined networking(SDN)based load balanced Opportunistic Routing(OR)for duty-cycled WSNs.SDN is adapted for the flexible management of WSNs by allowing the decoupling of the control plane from the sensor nodes.OR benefits the low duty cycled WSNs by prioritizing the multiple candidates for each node instead of selecting one node as in conventional unicast routing.OR reduces the sender waiting time,but it also suffers from the duplicate packets problem due to multiple candidates waking up simultaneously.The number of candidates should be restricted to counterbalance between the sender waiting time and duplicate packets.This study addresses two parts,first,the candidates are computed and controlled in the control plane.Second,the metric used to prioritize the candidates considers the average of three probability distributions,namely transmission distance distribution,expected number of hops distribution and residual energy distribution so that more traffic is guided through the nodes with higher priority.The simulation results show that our proposed protocol can significantly improve the network lifetime,routing efficiency,energy consumption,sender waiting time and duplicate packets as compared with the benchmarks.Secondly,we propose a trust-based load-balanced OR for duty-cycled WSNs.OR is gaining popularity in low-duty WSNs,so the need for efficient and reliable data transmission is becoming more essential.Reliable transmission is only feasible if the routing protocols are secure and efficient.Due to high energy consumption,current cryptographic schemes for WSN are not suitable.Trust-based OR will ensure security and reliability with fewer resources and minimum energy consumption.OR selects the set of potential candidates for each sensor node using a prioritized metric by load balancing among the nodes.In this study,the candidates are prioritized on the basis of a trusted OR metric that is divided into two parts.First,the OR metric is based on the average of four probability distributions:the distance from node to sink distribution,the expected number of hops distribution,the node degree distribution,and the residual energy distribution.Second,the trust metric is based on the average of two probability distributions:the direct trust distribution and the recommended trust distribution.Thus,trusted OR metric is calculated by multiplying the average of two metrics distributions in order to direct more traffic through the higher priority nodes.The simulation results show that our proposed protocol provides a significant improvement in the performance of the network compared to the benchmarks in terms of energy consumption,end to end delay,throughput,and packet delivery ratio.Finally,we propose a probabilistic weight-based energy efficient cluster routing for large-scale WSNs.Cluster-based routing has been regarded as an appealing technique with limited resources for WSNs where dynamic clustering is a practical approach to increase scalability and maximize the lifetime of the network.This study consists of two main parts,first,it introduces the probabilistic weighted average metric,which provides an efficient and effective way to dynamically select cluster heads based on the higher priority weight.It is determined by four attributes:the node degree weight,the distance from the node to sink weight,the average number of hops weight,and the residual energy weight.Second,it introduces the effective inter-cluster routing through load balancing by discovering the access nodes based on the probabilistic weighted average.The simulation results showed that our proposed protocol gives better performance as compared to the benchmarks regarding energy consumption,network lifetime,latency,throughput,and packet delivery ratio.The three proposed approaches are linked with the goal of reducing node energy usage by balancing the load and improving network lifetime through the use of various methodologies.The features of these approaches differ.The first approach makes use of the SDN concept to provide management flexibility,lowering the computation and processing costs of the sensor node.It also employs the OR,which benefits multiple candidates,and those candidates are prioritized using the load balance methodology.The second approach is based on secure data transmission,which computes the trustworthiness of nodes that provide reliability in both the one hop and whole path routing processes.It also considers load balancing in OR with trustworthiness to make the routing more reliable and efficient in terms of efficiency.The third approach offers an effective methodology for dynamically selecting and rotating cluster heads.It also concentrated on inter-cluster routing with access nodes in large-scale networks by utilizing probabilistic weighted average.