EETC: Energy Efficient Tree-Clustering in Delay Constrained Wireless Sensor Network

Wireless Sensor Networks (WSNs) are spatially distributed to independent sensor networks that can sense physical characteristics such as temperature, sound, pressure, energy, and so on. WSNs have secure link to physical environment and robustness. Data Aggregation (DA) plays a key role in WSN, and it helps to minimize the Energy Consumption (EC). In order to have trustworthy DA with a rate of high aggregation for WSNs, the existing research works have focused on Data Routing for In-Network Aggregation (DRINA). Yet, there is no accomplishment of an effective balance between overhead and routing. But EC required during DA remained unsolved. The detection of objects belonging to the same event into specific regions by the Bayes Node is distributed through the Sensor Nodes (SNs). Multi-Sensor Data Synchronization Scheduling (MSDSS) framework is proposed for efficient DA at the sink in a heterogeneous sensor network. Secure and Energy-Efficient based In-Network Aggregation Sensor Data Routing (SEE-INASDR) is developed based on the Dynamic Routing (DR) structure with reliable data transmission in WSNs. Theoretical analysis and experimental results showed that in WSN, the proposed Bayes Node Energy Polynomial Distribution (BNEPD) technique reduced Energy Drain Rate (EDR) by 39% and reduced 33% of Communication Overhead (CO) using poly distribution algorithm. Similarly, the proposed MSDSS framework increased the Network Lifetime (NL) by 15%. This framework also increased 10.5% of Data Aggregation Routing (DAR). Finally, the SEE-INASDR framework significantly reduced EC by 51% using a Secure and Energy-Efficient Routing Protocol (SEERP).

show abstract

“…Due to this fact, the RSM creates the selection of the new node in the process to be continued. This mechanism also provides SDA [17,18].…”

Section: End Ifmentioning

confidence: 96%

Improved Energy Based Multi-Sensor Object Detection in Wireless Sensor Networks

Palanisamy¹,

Alghazzawi²,

Bhatia³

et al. 2022

Intelligent Automation &Amp; Soft Computing

View full text Add to dashboard Cite

show abstract

“…Thus, instead of forwarding data of sensor nodes in a multi-hop fashion to a static sink, mobile sinks travel near to all CHs to collect data directly through a single hop, which reduces both the number of hops and the latency for delivering data from sensor nodes to the sink. Existing literature reveals two approaches of using mobile sink, which are adopted in several recent works: either using a single mobile sink [4,7,25,33] or using multiple of them [10,11,24,28].…”

Section: Related Workmentioning

confidence: 99%

EHRP : An effective hybrid routing protocol to compromise between energy consumption and delay in WSNs

Moussa¹,

Hamidi‐Alaoui²,

Alaoui³

2022

Preprint

View full text Add to dashboard Cite

Sink mobility is seen as a successful strategy to resolve the hotspot problem in Wireless Sensor Network (WSN). Mobile sinks roam in the network and collect data from special nodes such as Cluster Heads (CH) by means of short-range communications which improves the energy efficiency. Numerous mobile sink based routing protocols have been proposed, however, they incur high delays especially in large scale networks where the mobile sink has to travel for a long distance to collect data from CHs and consequently they failed to ensure a tradeoff between energy efficiency and delay. To resolve this issue, we propose in this paper an Effective Hybrid Routing Protocol termed as EHRP. The main aim of this protocol is to combine between single-hop and multi-hop routing. Indeed, when the mobile sink arrives at a cluster it collects its data while the other distant CHs continue to send their data using our proposed improved Ant Colony Optimization (ACO) algorithm to avoid the waiting-time. The existing ACO algorithms use in the distance heuristic which is not practical in real world and fail to consider relevant statistic information of energy (e.g., minimum energy, average energy) in path selection which leads

show abstract

“…Zhang et al proposed an effective hybrid ink-adding strategy in order to enhance the network traffic for scale-free networks, and then they proposed a related routing ink-adding strategy for arge-scale heterogeneous WSNs in 2019 [24]. Chowdhury et al [25] proposed a hybrid heterogeneous topological structure in order to meet the real-time performance for big data transmission. Yao et al [26] have proposed an energy-adaptive and bottleneck-aware tree-based communication scheduling for battery-free WSNs, and the simulations show that the algorithm has high performance in terms of communication atency and energy usage ratio.…”

Section: Related Workmentioning

confidence: 99%

Optimal Data Transmission for WSNs with Data-Location Integration

Min

2021

Symmetry

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) have good performance for data transmission, and the data transmission of sensor nodes has the function of symmetry. However, the wireless sensor nodes are facing great pressure in data transmission due to the increasing amount and types of data that easily cause premature energy consumption of some nodes and, thus, affects data transmission. Clustering algorithm is a common method to balance energy consumption, but the existing algorithms fail to balance the network oad effectively for big data transmission. Therefore, an optimal data transmission with data-location integration (ODTD-LI) is proposed for WSNs in this paper. For optimal data transmission, we update the network topology once for one round. In the proposed algorithm, we perform calculations of the optimal cluster heads, clustering and data transmission routing through three steps. We first deploy N homogeneous and symmetry nodes in a square area randomly and calculate the optimal number of cluster heads according to the node ocations. then, the optimal number of cluster heads, energy consumption, the distances and degrees of the nodes are taken into consideration during the clustering phase. Direct communication is carried out within a cluster, and the member nodes of the cluster pass the information directly to the cluster head. Lastly, an optimal hybrid routing from each cluster node to Sink is constructed for data transmission after clustering. The simulations verify the good performance of the proposed algorithm in view of the ifetime, average delay, coverage rate (CR) and oad balance of the network compared with the existing algorithms. Through the research conducted in this paper, we find that our work has good performance for selecting the hybrid routing in the network with the nodes randomly arranged.

show abstract

EETC: Energy Efficient Tree-Clustering in Delay Constrained Wireless Sensor Network

Cited by 21 publications

References 28 publications

Improved Energy Based Multi-Sensor Object Detection in Wireless Sensor Networks

Improved Energy Based Multi-Sensor Object Detection in Wireless Sensor Networks

EHRP : An effective hybrid routing protocol to compromise between energy consumption and delay in WSNs

Optimal Data Transmission for WSNs with Data-Location Integration

Contact Info

Product

Resources

About