scholarly journals An Energy Efficient Data Gathering in Dense Mobile Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
R. Velmani ◽  
B. Kaarthick
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Collection ◽  
Cluster Formation ◽  
Cluster Head ◽  
Data Gathering ◽  
Wireless Sensor ◽  
End To End Delay ◽  
End To End

Amidst of the growing impact of wireless sensor networks (WSNs) on real world applications, numerous schemes have been proposed for collecting data on multipath routing, tree, clustering, and cluster tree. Effectiveness of WSNs only depends on the data collection schemes. Existing methods cannot provide a guaranteed reliable network about mobility, traffic, and end-to-end connection, respectively. To mitigate such kind of problems, a simple and effective scheme is proposed, which is named as cluster independent data collection tree (CIDT). After the cluster head election and cluster formation, CIDT constructs a data collection tree (DCT) based on the cluster head location. In DCT, data collection node (DCN) does not participate in sensing, which is simply collecting the data packet from the cluster head and delivering it into sink. CIDT minimizes the energy exploitation, end-to-end delay and traffic of cluster head due to transfer of data with DCT. CIDT provides less complexity involved in creating a tree structure, which maintains the energy consumption of cluster head that helps to reduce the frequent cluster formation and maintain a cluster for considerable amount of time. The simulation results show that CIDT provides better QoS in terms of energy consumption, throughput, end-to-end delay, and network lifetime for mobility-based WSNs.

scholarly journals Void Hole Avoidance for Reliable Data Delivery in IoT Enabled Underwater Wireless Sensor Networks

Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3271 ◽  
Author(s):  
Arshad Sher ◽  
Aasma Khan ◽  
Nadeem Javaid ◽  
Syed Ahmed ◽  
Mohammed Aalsalem ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Destination Node ◽  
Transmission Range ◽  
Delivery Ratio ◽  
Underwater Wireless Sensor Networks ◽  
End To End Delay ◽  
End To End

Due to the limited availability of battery power of the acoustic node, an efficient utilization is desired. Additionally, the aquatic environment is harsh; therefore, the battery cannot be replaced, which leaves the network prone to sudden failures. Thus, an efficient node battery dissipation is required to prolong the network lifespan and optimize the available resources. In this paper, we propose four schemes: Adaptive transmission range in WDFAD-Depth-Based Routing (DBR) (A-DBR), Cluster-based WDFAD-DBR (C-DBR), Backward transmission-based WDFAD-DBR (B-DBR) and Collision Avoidance-based WDFAD-DBR (CA-DBR) for Internet of Things-enabled Underwater Wireless Sensor Networks (IoT, UWSNs). A-DBR adaptively adjusts its transmission range to avoid the void node for forwarding data packets at the sink, while C-DBR minimizes end-to-end delay along with energy consumption by making small clusters of nodes gather data. In continuous transmission range adjustment, energy consumption increases exponentially; thus, in B-DBR, a fall back recovery mechanism is used to find an alternative route to deliver the data packet at the destination node with minimal energy dissipation; whereas, CA-DBR uses a fall back mechanism along with the selection of the potential node that has the minimum number of neighbors to minimize collision on the acoustic channel. Simulation results show that our schemes outperform the baseline solution in terms of average packet delivery ratio, energy tax, end-to-end delay and accumulated propagation distance.

scholarly journals Energy-efficient selection of cluster headers in wireless sensor networks

2018 ◽  
Vol 14 (3) ◽  
pp. 155014771876464 ◽  
Author(s):  
Adem Fanos Jemal ◽  
Redwan Hassen Hussen ◽  
Do-Yun Kim ◽  
Zhetao Li ◽  
Tingrui Pei ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Packet Loss ◽  
Energy Efficient ◽  
Low Energy ◽  
Wireless Sensor ◽  
Adaptive Clustering ◽  
End To End Delay ◽  
End To End

Clustering is vital for lengthening the lives of resource-constrained wireless sensor nodes. In this work, we propose a cluster-based energy-efficient router placement scheme for wireless sensor networks, where the K-means algorithm is used to select the initial cluster headers and then a cluster header with sufficient battery energy is selected within each cluster. The performance of the proposed scheme was evaluated in terms of the energy consumption, end-to-end delay, and packet loss. Our simulation results using the OPNET simulator revealed that the energy consumption of our proposed scheme was better than that of the low-energy adaptive clustering hierarchy, which is known to be an energy-efficient clustering mechanism. Furthermore, our scheme outperformed low-energy adaptive clustering hierarchy in terms of the end-to-end delay, throughput, and packet loss rate.

scholarly journals SDN-Based Resource Reservation Protocol for IoT applications in Constrained Networks

2019 ◽  
Vol 8 (10) ◽  
pp. 1615-1622
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Resource Reservation ◽  
Wireless Sensor ◽  
Control Logic ◽  
End To End Delay ◽  
Reservation Protocol ◽  
Resource Reservation Protocol ◽  
End To End

Constrained netwrks like Wireless Sensor Networks have been identified as a promising scheme for next-generation wireless networks. These networks are capable of capturing data from the physical world without human intervention possessing applications such as IoT in various fields of life that require reliable and précised end to end delivery. However, Wireless Sensor Networks inevitably suffers from severe resource constraints and hence promising the provision of desired QoS is a challenge. In most of the applications like military, medical surveillance. Data captured are critical and hence the transmission of such data entails a minimal end to end delay. In constrained networks achieving minimal delay with effective utilization of resources are important cost factors for achieving an end to end delivery. In this Paper, a Softwaredefined Networking (SDN), based resource reservation protocol, which leverages SDN to centrally process the whole control logic and accordingly decides the amount of resources to be allocated for each data flow alleviating the processing overhead of all other nodes thus minimizing the energy consumption is proposed. The proposed algorithm is evaluated through simulation and the results obtained proved the efficiency of the proposed protocol by effectively minimizing the system’s energy consumption and end to end delay.

scholarly journals Adaptive scheme to Control Power Aware for PDR in Wireless Sensor Networks

2016 ◽  
Vol 12 (11) ◽  
pp. 4507-4514
Author(s):  
R. Sivaranjini ◽  
S.Palanivel Rajan
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Collection ◽  
Cluster Head ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Cluster Method ◽  
Prediction Scheme

Nowadays Wireless sensor networks playing vital role in all area. Which is used to sense the environmental monitoring, Temperature, Soil erosin etc. Low data delivery efficiency and high energy consumption are the inherent problems in Wireless Sensor Networks. Finding accurate data is more difficult and also it will leads to more expensive to collect all sensor readings. Clustering and prediction techniques, which exploit spatial and temporal correlation among the sensor data, provide opportunities for reducing the energy consumption of continuous sensor data collection and to achieve network energy efficiency and stability. So as we propose Dynamic scheme for energy consumption and data collection in wireless sensor networks by integrating adaptively enabling/disabling prediction scheme, sleep/awake method with dynamic scheme. Our framework is clustering based. A cluster head represents all sensor nodes within the region and collects data values from them. Our framework is general enough to incorporate many advanced features and we show how sleep/awake scheduling can be applied, which takes our framework approach to designing a practical dynamic algorithm for data aggregation, it avoids the need for rampant node-to-node propagation of aggregates, but rather it uses faster and more efficient cluster-to-cluster propagation. To the best of our knowledge, this is the first work adaptively enabling/disabling prediction scheme with dynamic scheme for clustering-based continuous data collection in sensor networks. When a cluster node fails because of energy depletion we need to choose alternative cluster head for that particular region. It will help to achieve less energy consumption. Our proposed models, analysis, and framework are validated via simulation and comparison with Static Cluster method in order to achieve better energy efficiency and PDR.

scholarly journals Research on Event-driven Data Collection Protocol of Wireless Sensor Networks

2016 ◽  
Vol 12 (10) ◽  
pp. 45
Author(s):  
Cunjiang Yu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Collection ◽  
Information Source ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Font Size ◽  
Cluster Heads ◽  
Event Driven

<p><span style="font-family: Times New Roman; font-size: small;">This paper carries out research on two types of event-driven data collection protocols of wireless sensor networks: EDDGP and ACBP protocols. In the EDDGP protocol, an adaptive evaluation model is put forward to select the cluster head, including the node classification, the fuzzy grade classification, the evaluation function and the parent grid resolution. Once an event of interest occurs, the member nodes will send the collected information to the cluster heads which will then integrate the data and send a </span><span style="font-family: Times New Roman; font-size: small;">request packet for data collection</span><span style="font-family: Times New Roman; font-size: small;"> to the sink. After receiving the request packet, the sink will quickly move to the cluster head for collecting information. If the sink receives the request packet for data collection from other cluster heads of information source in the moving process, it will save their grid ID. </span><span style="font-size: small;"><span style="font-family: Times New Roman;">The data from the other cluster heads of information source are collected in turn from the nearest ones to the farthest ones. The theoretical research and simulation results show that EDDGP can reduce the energy consumption of location updates of the sink so as to balance the energy consumption of nodes and prolong the lifetime of the network.</span></span></p>

QoS Aware Multi-hop Multi-path Routing Approach in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 43-52
Author(s):  
Omkar Singh ◽  
Vinay Rishiwal
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Life Time ◽  
Base Station ◽  
Environmental Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
End To End

Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.

Sign in / Sign up

Export Citation Format

Share Document