scholarly journals Optimal sleep time controller based on traffic prediction and residual energy in duty-cycled wireless sensor networks

2017 ◽  
Vol 13 (12) ◽  
pp. 155014771774890 ◽  
Author(s):  
Haibo Luo ◽  
Minghua He ◽  
Zhiqiang Ruan ◽  
Xiaxia Zeng
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sleep Time ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Traffic Prediction

An Energy-Balance Based Distributed Topology Control Algorithm for Wireless Sensor Networks

2012 ◽  
Vol 490-495 ◽  
pp. 1392-1396 ◽  
Author(s):  
Chu Hang Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Topology Control ◽  
Control Algorithm ◽  
Path Loss ◽  
Network Connectivity ◽  
Premature Death ◽  
Residual Energy ◽  
Wireless Sensor

Topology control is an efficient approach which can reduce energy consumption for wireless sensor networks, and the current algorithms mostly focus on reducing the nodes’ energy consumption by power adjusting, but pay little attention to balance energy consumption of the whole network, which results in premature death of many nodes. Thus, a distributed topology control algorithm based on path-loss and residual energy (PRTC) is designed in this paper. This algorithm not only maintains the least loss links between nodes but also balances the energy consumption of the network. The simulation results show that the topology constructed by PRTC can preserve network connectivity as well as extend the lifetime of the network and provide good performance of energy consumption.

scholarly journals An Efficient Anonymous Communication Scheme to Protect the Privacy of the Source Node Location in the Internet of Things

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Fengyin Li ◽  
Pei Ren ◽  
Guoyu Yang ◽  
Yuhong Sun ◽  
Yilei Wang ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Location Privacy ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Source Node ◽  
Wireless Sensor ◽  
Anonymous Communication ◽  
Privacy Leakage ◽  
Communication Scheme

Advances in machine learning (ML) in recent years have enabled a dizzying array of applications such as data analytics, autonomous systems, and security diagnostics. As an important part of the Internet of Things (IoT), wireless sensor networks (WSNs) have been widely used in military, transportation, medical, and household fields. However, in the applications of wireless sensor networks, the adversary can infer the location of a source node and an event by backtracking attacks and traffic analysis. The location privacy leakage of a source node has become one of the most urgent problems to be solved in wireless sensor networks. To solve the problem of source location privacy leakage, in this paper, we first propose a proxy source node selection mechanism by constructing the candidate region. Secondly, based on the residual energy of the node, we propose a shortest routing algorithm to achieve better forwarding efficiency. Finally, by combining the proposed proxy source node selection mechanism with the proposed shortest routing algorithm based on the residual energy, we further propose a new, anonymous communication scheme. Meanwhile, the performance analysis indicates that the anonymous communication scheme can effectively protect the location privacy of the source nodes and reduce the network overhead.

A Novel Energy-Balanced Dynamic Routing Algorithm for Wireless Sensor Networks

2014 ◽  
Vol 681 ◽  
pp. 235-238
Author(s):  
Xin Xin Zhou ◽  
Yan Zhao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transfer ◽  
Routing Algorithm ◽  
Dynamic Routing ◽  
Residual Energy ◽  
Wireless Sensor ◽  
The Novel ◽  
Balance Energy ◽  
Transfer Tasks

Wireless sensor networks (WSNs) is taking an increasing role in our lives. Because the energy of the sensors is limited how to efficiently use the energy to prolong the lifecycle of the sensor networks is very important. In this paper, a novel energy-balanced dynamic routing algorithm based on ACO is proposed. The novel routing algorithm can dynamically choose routing according to the residual energy of the sensors and the sensors with more power is taken more data transfer tasks. The simulation results show that the proposed routing algorithm can effectively balance energy consumption and prolong the lifecycle of the networks.

scholarly journals R-bUCRP: A Novel Reputation-Based Uneven Clustering Routing Protocol for Cognitive Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-9
Author(s):  
Mingchuan Zhang ◽  
Ruijuan Zheng ◽  
Ying Li ◽  
Qingtao Wu ◽  
Liang Song
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Selfish Nodes ◽  
Simulation Results ◽  
Establishment Phase ◽  
Optimal Cluster

Energy of nodes is an important factor that affects the performance of Wireless Sensor Networks (WSNs), especially in the case of existing selfish nodes, which attracted many researchers’ attention recently. In this paper, we present a reputation-based uneven clustering routing protocol (R-bUCRP) considering both energy saving and reputation assessment. In the cluster establishment phase, we adopt an uneven clustering mechanism which controls the competitive scope of cluster head candidates to save the energy of WSNs. In the cluster heads election phase, the residual energy and reputation value are used as the indexes to select the optimal cluster head, where the reputation mechanism is introduced to support reputation assessment. Simulation results show that the proposed R-bUCRP can save node energy consumption, balance network energy distribution, and prolong network lifetime.

scholarly journals Hierarchical Agglomerative Clustering Schemes for Energy-Efficiency in Wireless Sensor Networks

2017 ◽  
Vol 18 (2) ◽  
pp. 128-138 ◽  
Author(s):  
Tariq Taleb ◽  
Mejdi Kaddour
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Agglomerative Clustering ◽  
Efficient Communication ◽  
Hierarchical Agglomerative Clustering ◽  
Primary Means ◽  
Topic Clustering

Abstract Extending the lifetime of wireless sensor networks (WSNs) while delivering the expected level of service remains a hot research topic. Clustering has been identified in the literature as one of the primary means to save communication energy. In this paper, we argue that hierarchical agglomerative clustering (HAC) provides a suitable foundation for designing highly energy efficient communication protocols for WSNs. To this end, we study a new mechanism for selecting cluster heads (CHs) based both on the physical location of the sensors and their residual energy. Furthermore, we study different patterns of communications between the CHs and the base station depending on the possible transmission ranges and the ability of the sensors to act as traffic relays. Simulation results show that our proposed clustering and communication schemes outperform well-knows existing approaches by comfortable margins. In particular, networks lifetime is increased by more than 60% compared to LEACH and HEED, and by more than 30% compared to K-means clustering.

Sign in / Sign up

Export Citation Format

Share Document