ThesisPDF Available

Energy Balanced Load Distribution through Energy Gradation in Underwater Wireless Sensor Network

Authors:

Abstract and Figures

Underwater wireless sensor networks (UWSNs) provide the wide range of aquatic applications. These applications are used for many aspects of life i.e., the tsunami and earthquake monitoring, pollution monitoring, ocean surveillance for defense strategies, seismic monitoring, and equipment monitoring, etc. The limited bandwidth, long propagation delay, energy consumption, high manufacturer and deployment costs are many challenges in the domain of UWSNs. In this thesis, we present the three techniques i.e., energy balanced load distribution through energy gradation (EBLOADEG), energy gradation (EG) and depth adjustment (DA) among various coronas and in without the number of coronas. Our aim is to overcome these issues: Firstly, the forwarder node determines the higher energy node and data is directly transmitted to sink; secondly, if the forwarder node comes in void communication region then the node moves to the new depth so that the data delivery ratio can be ensured effectively. However, data is forwarded on the basis of EG and DA in without the number of coronas. Thirdly, the EBLOAD-EG scheme performs data transmission among various coronas which are based upon the energy comparison of the first node with any neighbor node. Moreover, our aim is to balance the load distribution among various coronas in a network field. Simulation results define that our proposed schemes show better performance in terms of energy efficiency, packet delivery ratio (PDR), network lifetime and stability period etc
Content may be subject to copyright.
𝒟
1500𝑚/𝑠
3 108𝑚/𝑠
𝑚
𝑅
𝑟
1
𝑁
𝑊
𝑁= 50
32
dtx
r , 2r
High Energy grade nodes
Sink
.
.Low Energy grade nodes or sensor nodes
.
.
.
.
.
.
....
.
.
.
.
....
.
.
.
.
.
....
dtx
2r r
R
.
RCircular radius of area
r
𝑃 𝐿 =𝑛*10 log (𝑑) + 𝑑*10 log (𝑎(𝑓))
𝑑 𝑓 𝑛
𝑛= 2 𝑛= 1
𝑛= 1.5
dtx
Move to depth
Void node
High energy node
Transmission range
Sink
r
2r
10 log10 𝑎(𝑓)=0.11 𝑓2
1 + 𝑓2+ 55 𝑓2
5100 + 𝑓2+ 3.75 *104𝑓2+ 0.005
10 log10 𝑎(𝑓)=0.11 𝑓2
1 + 𝑓2+ 0.11 𝑓2
1 + 𝑓2+ 0.003
𝐴(𝑑, 𝑓 ) = 𝑑𝑘*𝑎(𝑓)𝑑
𝑃
𝑆𝑁 𝑅(𝑑, 𝑓 ) = 𝑃
𝐴(𝑑, 𝑓 )*𝑁(𝑓)𝛿𝑓
𝛿𝑓
𝑁𝑡(𝑓)
𝑁𝑤(𝑓)𝑁𝑠(𝑓)𝑁𝑡(𝑓)
𝑁(𝑓) = 𝑁𝑡(𝑓) + 𝑁𝑠(𝑓) + 𝑁𝑤(𝑓) + 𝑁𝑡(𝑓)
𝑃 𝑘𝑡𝑛
𝐸𝑡𝑥(𝑑) = 𝑃𝑇(𝑑)*𝑃 𝑘 𝑡𝑛
𝛼3𝑑𝐵(𝑑)
𝑃 𝑘𝑡𝑛
𝐸𝑟𝑥(𝑑) = 𝑃𝑟 𝑥 *𝑃 𝑘𝑡𝑛
𝛼3𝑑𝐵(𝑑)
𝑃𝑇𝑃𝑟𝑥
𝛼3𝑑𝐵(𝑑)
𝐵3𝑑𝐵(𝑑)
𝑃
𝑚
3.93.10
31
1
𝑚=𝑚𝑖𝑛(𝑁*𝐸
𝐸𝑡𝑥 ,𝐸
𝐸𝑡𝑥 )
𝑁 𝐸
𝐸𝑡𝑥
𝑑𝑖𝑣 𝐸𝑜 =𝐸𝑜
𝑚
𝑑𝑖𝑣 𝐸𝑜 𝐸𝑜
𝑚
𝑚
32
𝐸𝑜
𝐸𝑜/𝑚
𝑚
𝐸𝑖𝐸1𝐸2𝐸𝑛
𝑐1𝑐2𝑐𝑛
𝐸𝑖
𝑚 𝐸𝑜
𝐸𝑜/𝑚
𝑖= 1 𝑛
𝐸𝑖𝐸𝑖+ 1
𝐸𝑖𝐸𝑖+ 1
𝐸𝑖𝐸𝑖+ 1
𝑓𝑜𝑟𝑤𝑎𝑟𝑑𝑒𝑟𝑛𝑜𝑑𝑒
2
32
3
𝐸𝑜
𝐸𝑜/𝑚
𝑚
𝐸𝑖𝐸1𝐸2𝐸𝑛
𝑐1𝑐2𝑐𝑛
𝐸𝑖
𝐸𝑜/𝑚
𝑖= 1 𝑛
𝐸𝑖𝐸𝑖+ 1
𝐸𝑖𝐸𝑖+ 1
𝐸𝑖𝐸𝑖+ 1
𝑓𝑜𝑟𝑤𝑎𝑟𝑑𝑒𝑟𝑛𝑜𝑑𝑒
𝐸𝑖
𝐸𝑖𝐸1𝐸2𝐸𝑛
𝜎 𝑐1𝑐2𝑐𝑛
𝐸𝑖
𝑐𝑣𝑛
𝜎
𝐷 𝑐𝑣𝑛
𝑖= 1 𝑛
𝑟
𝜎
𝑐𝑣𝑛
𝑐𝑣𝑛 𝑟
𝑐𝑣𝑛
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
Etx (mJ)
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
Ercv (mJ)
P2(0.002048, 0.0064)
P1(0.002048, 0.0001024)
P3(0.128, 0.0064)
P4(0.128, 0.0001024)
Etx+Ercv= 0.1344
𝑚𝑖𝑛𝑖𝑚𝑖𝑧𝑒
𝑟𝑚𝑎𝑥
𝑟=1
𝐸𝑃 𝑁
𝐸𝑃 𝑁 (𝑟) = 𝐸𝑛𝑐𝑜𝑛𝑠𝑢𝑚𝑒𝑑
𝑛*𝐸
𝐸𝑃 𝑁 𝑟𝑚𝑎𝑥
𝑟 𝐸𝑛𝑐𝑜𝑛𝑠𝑢𝑚𝑒𝑑
𝑛 𝐸
𝐸𝑛𝑐𝑜𝑛𝑠𝑢𝑚𝑒𝑑(𝑟) = 𝐸𝑇𝑥+𝐸𝑅𝑥
𝐸𝑇𝑥 𝐸𝑅𝑥
𝐸𝑇𝑥=𝑃𝑇(𝑑𝑎𝑡𝑎𝑝𝑎𝑐𝑘𝑒𝑡𝑠𝑖𝑧𝑒
𝑡𝑟𝑎𝑛𝑠𝑚𝑖𝑠𝑠𝑖𝑜𝑛𝑟𝑎𝑡𝑒 )
𝐸𝑅𝑥=𝑃𝑅(𝑑𝑎𝑡𝑎𝑝𝑎𝑐𝑘𝑒𝑡𝑠𝑖𝑧𝑒
𝑡𝑟𝑎𝑛𝑠𝑚𝑖𝑠𝑠𝑖𝑜𝑛𝑟𝑎𝑡𝑒 )
𝑃𝑇𝑃𝑅
𝐶1:𝐸𝑇𝑥, 𝐸𝑅𝑥6𝐸𝑜
𝐶2:𝐸𝑓6𝐸𝑚
𝑓𝑖𝑛
𝐶3:𝑇𝑟6𝑇𝑚
𝑟𝑎𝑥
𝑑𝑎𝑡𝑎𝑝𝑎𝑐𝑘𝑒𝑡𝑠𝑖𝑧𝑒 = 1024 𝑡𝑟𝑎𝑛𝑠𝑚𝑖𝑠𝑠𝑖𝑜𝑛𝑟𝑎𝑡𝑒 = 16000
𝑃𝑇= 0.002048,−−−,0.128 𝑃𝑅= 0.0001024,−−−,0.0064
𝑁= 1,2− −−,50
0.002048 6𝐸𝑇𝑥60.128
0.0001024 6𝐸𝑅𝑥60.0064
0.0021504 6𝐸𝑇𝑥+𝐸𝑅𝑥60.1344
𝑃1 : (0.002048,0.0001024) = 0.00215𝐽
𝑃2 : (0.002048,0.0064) = 0.00845𝐽
𝑃3 : (0.128,0.0064) = 0.1344𝐽
𝑃4 : (0.128,0.0001024) = 0.1281024𝐽
𝐸𝑇𝑥=𝑃𝑇𝑥(𝑡)
𝑃𝑇𝑥 𝑡
𝑡=𝑙
𝑣
𝑙 𝑉
𝐸𝑅𝑥=𝑃𝑅𝑥(𝑡)
𝑃𝑅𝑥
𝑉= 1500𝑚/𝑠 𝑑𝑎𝑡𝑎𝑝𝑎𝑐𝑘𝑒𝑡𝑠𝑖𝑧𝑒 = 512
𝑡𝑟𝑎𝑛𝑠𝑚𝑖𝑠𝑠𝑖𝑜𝑛𝑟𝑎𝑡𝑒 = 12000 𝑃𝑇=
0.0053,−−−,0.0213 𝑃𝑅= 0.0427,−−−,0.0853
𝑁= 1,2− −−,50
0.0023 6𝐸𝑇𝑥60.0213
0.0182 6𝐸𝑅𝑥60.0853
0.0205 6𝐸𝑇𝑥+𝐸𝑅𝑥60.1066
𝑃1 : (0.0023,0.0182) = 0.0205𝐽
𝑃2 : (0.0023,0.0853) = 0.0876𝐽
𝑃3 : (0.0213,0.0853) = 0.1066𝐽
𝑃4 : (0.0213,0.0182) = 0.0395𝐽
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8
Etx (mJ)
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
Ercv (mJ)
P1(0.0023, 0.0182)
P3(0.0213, 0.0853)
P4(0.0213, 0.0182)
Etx+Ercv= 0.1066
P2(0.0023, 0.0853)
𝑉= 1500𝑚/𝑠 𝑑𝑎𝑡𝑎𝑝𝑎𝑐𝑘𝑒𝑡𝑠𝑖𝑧𝑒 = 150
𝑡𝑟𝑎𝑛𝑠𝑚𝑖𝑠𝑠𝑖𝑜𝑛𝑟𝑎𝑡𝑒 = 12000 𝑃𝑇= 2.5,−−−,2.7
𝑃𝑅= 2.7,−−−,3.1𝑁= 1,2− −−,50
0123456
Etx (mJ)
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
0.4
Ercv (mJ)
Etx+Ercv= 2.895
P2(2.5, 0.195)
P1(2.5, 0.193)
P3(2.7, 0.193)
P4(2.7, 0.195)
2.56𝐸𝑇𝑥62.7
0.193 6𝐸𝑅𝑥60.195
2.693 6𝐸𝑇𝑥+𝐸𝑅𝑥62.895
𝑃1 : (2.5,0.193) = 2.693𝐽
𝑃2 : (2.5,0.195) = 2.695𝐽
𝑃3 : (2.7,0.193) = 2.893𝐽
𝑃4 : (2.7,0.195) = 2.895𝐽
𝑟= 100
𝑁= 50
𝐸𝑜 = 1 𝐸𝑡𝑥 = 0.0005 𝐸𝑟𝑥 = 0.00005
100 𝐾= 10
41
𝐶𝑜𝑟𝑜𝑛𝑎𝑠(𝐾) = 𝑅
𝑟
𝑅 𝐾
𝑟1𝑏
𝑊
𝑜
0.005
0.015 67%
45%
12345678910
Corona Nodes
0
0.005
0.01
0.015
0.02
0.025
0.03
0.035
0.04
0.045
0.05
Energy Consumption Per Unit of Time (W)
BLOAD corona based
EBLOAD corona based
41%
50%
12345678910
Corona Nodes
0
5
10
15
20
25
30
35
40
45
50
Packet Load Per Unit of Time (packet/s)
BLOAD corona based
EBLOAD-EG corona based
0 10 20 30 40 50 60 70 80 90 100
Time (s)
5
10
15
20
25
30
35
40
45
50
55
Number of Alive Nodes
BLOAD corona based
EGBLOAD corona based
DA without corona
EG without corona
0 10 20 30 40 50 60 70 80 90 100
Time (s)
-5
0
5
10
15
20
25
30
35
40
45
Number of Dead Nodes
BLOAD corona based
EGBLOAD corona based
DA without corona
EG without corona
0 10 20 30 40 45 50
Number of Nodes
0.1
0.2
0.3
0.4
0.5
0.6
0.7
Packet delivery ratio
BLOAD corona based
EGBLOAD corona based
DA without corona
EG without corona
0 10 20 30 40 50 60 70 80 90 100
Field Radius(m)
-15
-10
-5
0
5
10
15
Energy consumption per unit of time(W)
BLOAD corona based
EGBLOAD corona based
DA without corona
EG without corona
ResearchGate has not been able to resolve any citations for this publication.
Article
Full-text available
In wireless sensor networks (WSNs), energy balancing and energy efficiency are the key requirements to prolong the network lifetime. In this paper, we investigate the problem of energy hole, where sensor nodes located near the sink or in some other parts of the network die very early due to unbalanced load distribution. Moreover, there is a dire need to utilize the energy resource efficiently. For this purpose, balanced energy consuming and hole alleviating (BECHA), and energy-aware balanced energy consuming and hole alleviating (EA-BECHA) algorithms are proposed, not only to balance the load distribution of entire network but also to utilize the energy resource efficiently. This work mainly adopts data forwarding and routing selection strategy for the entire network. An optimal distance and energy-based transmission strategy which is free of location error is adopted to forward the data packets of different sizes. Finally, the simulation results validate the proposed schemes by showing improvement in network lifetime, energy balancing, and enhanced throughput with less number of packets drop on the cost of increased end to end delay.
Article
Full-text available
Due to limited energy resources, energy balancing becomes an appealing requirement/ challenge in Underwater Wireless Sensor Networks (UWSNs). In this paper, we present a Balanced Load Distribution (BLOAD) scheme to avoid energy holes created due to unbalanced energy consumption in UWSNs. Our proposed scheme prolongs the stability period and lifetime of the UWSNs. In BLOAD scheme, data (generated plus received) of underwater sensor nodes is divided into fractions. The transmission range of each sensor node is logically adjusted for evenly distributing the data fractions among the next hop neighbor nodes. Another distinct feature of BLOAD scheme is that each sensor node in the network sends a fraction of data directly to the sink by adjusting its transmission range and continuously reports data to the sink till its death even if an energy hole is created in its next hop region. We implement the BLOAD scheme, by varying the fractions of data using adjustable transmission ranges in homogeneous and heterogeneous simulation environments. Simulation results show that the BLOAD scheme outperforms the selected existing schemes in terms of stability period and network lifetime.
Article
Full-text available
In this paper, a novel routing strategy to cater the energy consumption and delay sensitivity issues in deep underwater wireless sensor networks is proposed. This strategy is named as ESDR: Event Segregation based Delay sensitive Routing. In this strategy sensed events are segregated on the basis of their criticality and, are forwarded to their respective destinations based on forwarding functions. These functions depend on different routing metrics like: Signal Quality Index, Localization free Signal to Noise Ratio, Energy Cost Function and Depth Dependent Function. The problem of incomparable values of previously defined forwarding functions causes uneven delays in forwarding process. Hence forwarding functions are redefined to ensure their comparable values in different depth regions. Packet forwarding strategy is based on the event segregation approach which forwards one third of the generated events (delay sensitive) to surface sinks and two third events (normal events) are forwarded to mobile sinks. Motion of mobile sinks is influenced by the relative distribution of normal nodes. We have also incorporated two different mobility patterns named as; adaptive mobility and uniform mobility for mobile sinks. The later one is implemented for collecting the packets generated by the normal nodes. These improvements ensure optimum holding time, uniform delay and in-time reporting of delay sensitive events. This scheme is compared with the existing ones and outperforms the existing schemes in terms of network lifetime, delay and throughput.
Article
Full-text available
Underwater wireless sensor network (UWSN) features many unique characteristics, including slow propagation speed, high end-to-end delay, low available bandwidth, variable link quality, and energy constraint. All these problems pose a big challenge to devise a transmission efficient, energy-saving, and low delay routing protocol for UWSNs. In this paper we devise a relative distance based forwarding (RDBF) routing protocol, which aims to provide transmission efficient, energy-saving, and low delay routing. We utilize a fitness factor to measure and judge the degree of appropriateness for a node to forward the packets. Under the limitations of the fitness factor, RDBF can confine the scope of the candidate forwarders and find the beneficial relays to forward packets. In this way, only a small fraction of nodes are involved in forwarding process, which can distinctly reduce the energy consumption. Moreover, using only the selected beneficial nodes as forwarders can both enhance the transmission efficiency and reduce the end-to-end delay. This is because the distances of these nodes to the sink are the shortest and the hop counts of routing paths consisted by these nodes are minimum. We use the ns-2 based simulator to conduct our experiment; the results show that RDBF performs better in terms of packet delivery ratio, end-to-end delay, and energy efficiency.
Article
Full-text available
This paper presents two new energy balanced routing protocols for Underwater Acoustic Sensor Networks (UASNs); Efficient and Balanced Energy consumption Technique (EBET) and Enhanced EBET (EEBET). The first proposed protocol avoids direct transmission over long distance to save sufficient amount of energy consumed in the routing process. The second protocol overcomes the deficiencies in both Balanced Transmission Mechanism (BTM) and EBET techniques. EBET selects relay node on the basis of optimal distance threshold which leads to network lifetime prolongation. The initial energy of each sensor node is divided into energy levels for balanced energy consumption. Selection of high energy level node within transmission range avoids long distance direct data transmission. The EEBET incorporates depth threshold to minimize the number of hops between source node and sink while eradicating backward data transmissions. The EBET technique balances energy consumption within successive ring sectors, while, EEBET balances energy consumption of the entire network. In EEBET, optimum number of energy levels are also calculated to further enhance the network lifetime. Effectiveness of the proposed schemes is validated through simulations where these are compared with two existing routing protocols in terms of network lifetime, transmission loss, and throughput. The simulations are conducted under different network radii and varied number of nodes.
Article
How to design an energy-efficient algorithm to maximize the network lifetime in complicated scenarios is a critical problem for heterogeneous wireless sensor networks (HWSN). In this paper, a clustering-tree topology control algorithm based on the energy forecast (CTEF) is proposed for saving energy and ensuring network load balancing, while considering the link quality, packet loss rate, etc. In CTEF, the average energy of the network is accurately predicted per round (the lifetime of the network is denoted by rounds) in terms of the difference between the ideal and actual average residual energy using central limit theorem and normal distribution mechanism, simultaneously. On this basis, cluster heads are selected by cost function (including the energy, link quality and packet loss rate) and their distance. The non-cluster heads are determined to join the cluster through the energy, distance and link quality. Furthermore, several noncluster heads in each cluster are chosen as the relay nodes for transmitting data through multi-hop communication to decrease the load of each cluster-head and prolong the lifetime of the network. The simulation results show the efficiency of CTEF. Compared with low-energy adaptive clustering hierarchy (LEACH), energy dissipation forecast and clustering management (EDFCM) and efficient and dynamic clustering scheme (EDCS) protocols, CTEF has longer network lifetime and receives more data packets at base station.
Article
In Underwater Wireless Sensor Networks (UWSNs), if sensors rely on multi-hop transmission to send sensing data to the sink above the water, sensors that are closer to the water's surface will deplete energy sooner because they share a larger load of the packet relaying work. This problem becomes worse if the water being monitored is very deep. This imbalance in energy consumption can be effectively mitigated by using an Autonomous Underwater Vehicle (AUV) to collect data. However, if the data to collect are important, the delay time required by this data gathering method may be too long. In this study, we integrate the two data gathering mechanisms mentioned above, namely utilization of AUVs and multi-hop transmission, to reduce the problem of unbalanced energy consumption and long delay time. Moreover, we also investigate how to determine the importance level of data and set delay time requirements without domain knowledge. Our purpose is to deliver data of higher importance to the sink within the delay time requirement. Our experimental results confirm that the proposed method can effectively mitigate the imbalance in energy consumption, reduce the delay time required for delivering important data, and also prolong the network lifetime.
Article
The concentration of data traffic toward sink makes sensor nodes nearby have heavier communication burden and more quickly use up their energy, leading to energy hole problem. Sink mobility can realize load balancing data delivery by changing the hotspots around the sink as the sink moves. However, sink mobility also brings about the problem of localization of sink. Frequently broadcasting of mobile sinks' position will generate significant overhead. In this paper, we propose a novel heterogeneous adaptive relay chain routing protocol with a few mobile relay nodes, which is applied to large-scale 1-D long chain network. Mobile relay node is the sink of local subnetwork. The protocol achieves the following performances. First, through scheduled movement of the mobile relay nodes, load balancing is achieved not only among sensor nodes but also among high tier relay nodes in continuous data delivery model. Second, in the context of clock synchronization among nodes, every node decides its operating state by algorithm stored in its own processor. So, there is no need for advertisement of mobile relay nodes' location. Only a few messages for clock synchronization among nodes are needed. Third, by synthetically utilizing node deployment strategy and routing protocol, base station can real-time monitoring residual energy of sensor nodes for timely maintenance, which can extend the protocol to be suitable for event-driven and query-driven data delivery models. Finally, the performances are evaluated via extensive simulations.
Article
Due to the limited battery capacity of sensor nodes, a minimization of energy consumption is a potential research area in underwater wireless sensor networks (UWSNs). However, energy hole and coverage hole creations lead performance degradation of UWSNs in terms of network lifetime and throughput. In this paper, we address the energy hole creation issue in depth-based routing techniques, and devise a technique to overcome the deficiencies in existing techniques. Besides addressing the energy hole issue, the proposition of a coverage hole repair technique is also part of this paper. In areas of the dense deployment, sensing ranges of nodes redundantly overlap. Our proposed technique takes a benefit of redundant overlapping and repairs a coverage hole during network operation. Simulation results show that our two techniques cohesively conserve nodes' energy, which ultimately maximizes the network lifetime and throughput at the cost of increased delay.