Log in

Relevant bibliographies by topics / Head node / Journal articles

To see the other types of publications on this topic, follow the link: Head node.

Journal articles on the topic 'Head node'

Author: Grafiati

Published: 5 June 2025

Last updated: 2 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Head node.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Cao, Li, Yinggao Yue, and Yong Zhang. "A Data Collection Strategy for Heterogeneous Wireless Sensor Networks Based on Energy Efficiency and Collaborative Optimization." Computational Intelligence and Neuroscience 2021 (September 29, 2021): 1–13. http://dx.doi.org/10.1155/2021/9808449.

Full text

Abstract:

In the clustering routing protocol, prolonging the lifetime of the sensor network depends to a large extent on the rationality of the cluster head node selection. The selection of cluster heads for heterogeneous wireless sensor networks (HWSNs) does not consider the remaining energy of the current nodes and the distribution of nodes, which leads to an imbalance of network energy consumption. A strategy for selecting cluster heads of HWSNs based on the improved sparrow search algorithm- (ISSA-) optimized self-organizing maps (SOM) is proposed. In the stage of cluster head selection, the propose

APA, Harvard, Vancouver, ISO, and other styles

2

Kanwal, Samira, Zeshan Iqbal, Aun Irtaza, Muhammad Sajid, Sohaib Manzoor, and Nouman Ali. "Head Node Selection Algorithm in Cloud Computing Data Center." Mathematical Problems in Engineering 2021 (July 24, 2021): 1–12. http://dx.doi.org/10.1155/2021/3418483.

Full text

Abstract:

Cloud computing provides multiple services such as computational services, data processing, and resource sharing through multiple nodes. These nodes collaborate for all prementioned services in the data center through the head/leader node. This head node is responsible for reliability, higher performance, latency, and deadlock handling and enables the user to access cost-effective computational services. However, the optimal head nodes’ selection is a challenging problem due to consideration of resources such as memory, CPU-MIPS, and bandwidth. The existing methods are monolithic, as they sele

APA, Harvard, Vancouver, ISO, and other styles

3

Zhang, Wen-mei. "An Energy-Balance Unequal Clustering Routing Protocol for Wireless Sensor Networks." Journal of Physics: Conference Series 2224, no. 1 (2022): 012088. http://dx.doi.org/10.1088/1742-6596/2224/1/012088.

Full text

Abstract:

Abstract On the basis of traditional unequal clustering protocol for wireless sensor networks, an energy-balance unequal clustering routing protocol is proposed. In the clustering stage, the entire network is divided into clusters of different sizes based on the remaining energy and the distance from the sink node to the node. In the cluster establishment phase, each node calculates the cluster head selection time based on the relative remaining energy, the position, the average distance between the nodes in the cluster. The cluster head is selected by time series, and non-cluster head nodes a

APA, Harvard, Vancouver, ISO, and other styles

4

Xu, Bao, and Yong Feng Ju. "Distributed Coverage-Hole Repair Algorithm towards Nodes Failure in Wireless Sensor Networks." Applied Mechanics and Materials 135-136 (October 2011): 464–69. http://dx.doi.org/10.4028/www.scientific.net/amm.135-136.464.

Full text

Abstract:

In order to preserve the coverage and ensure the efficiency of Wireless Sensor Networks (WSNs), a distributed coverage-hole repair algorithm towards nodes failure is proposed in this paper. Every node has a energy threshold, if node’s energy is lower than its threshold, it sends a failure message to the nearest node and appoints it as the head node, the head node consideres all the neighbors of the failure node are preparatory boundary nodes at first, then judges every preparatory boundary nodes whether be a non-boundary node through the intersection angle with the failure node. In the last, t

APA, Harvard, Vancouver, ISO, and other styles

5

Song, Wenguang, Haiyu Chen, Qiujuan Zhang, Bingxin Zhang, Hao Wang, and Hao Xu. "On-Chip Embedded Debugging System Based on Leach Algorithm Parameter on Detection of Wireless Sensor Networks." Mathematical Problems in Engineering 2020 (September 7, 2020): 1–7. http://dx.doi.org/10.1155/2020/7249674.

Full text

Abstract:

Leach (low energy adaptive clustering hierarchy) algorithm is a self-clustering topology algorithm. Its execution process is cyclical. Each cycle is divided into two phases: cluster building phase and stable data communication phase. In the stage of cluster building, the adjacent nodes cluster dynamically and randomly generate cluster heads. In the data communication phase, the nodes in the cluster send the data to the cluster head, and the cluster head performs data fusion and sends the results to the aggregation node. Because the cluster head needs to complete data fusion, communication with

APA, Harvard, Vancouver, ISO, and other styles

6

Krishnaraj, N. "Selection of Cluster Head in Wireless Sensor Network using Convolution Neural Network Algorithm." March 2022 4, no. 1 (2022): 46–54. http://dx.doi.org/10.36548/jsws.2022.1.005.

Full text

Abstract:

Network lifetime enhancement is one of the primary goals for all the Wireless Sensor Network (WSN) applications. Clustering process helps the WSNs to improve its lifetime by forming a group with nearby sensor nodes. A primary node called cluster head is elected from the group for managing the data transmission from the other clustering groups to the basic sensor nodes. Also, the cluster heads are placed to transfer the signal collected from its sensor nodes to the base stations. Identifying an optimum node for making it as a cluster head is a challengeable process for many WSN applications. Th

APA, Harvard, Vancouver, ISO, and other styles

7

Gupta, Amit, Mahesh Motwani, and J. L. Rana. "Cluster Formation and Maintenance Techniques for Mobile Adhoc Networks with Improved Quality of Service." International Journal of Emerging Technology and Advanced Engineering 11, no. 8 (2021): 97–110. http://dx.doi.org/10.46338/ijetae0821_12.

Full text

Abstract:

— In an Adhoc Network, every node is mobile and self-contained. As these networks lack infrastructure, highly adaptive algorithms are required to deal with frequent mobility changes by member nodes as well as Cluster Head (CH) nodes. The weighted clustering algorithms contribute significantly to cluster-based routing. In these algorithms, the selection of cluster heads is the most important task. In weighted clustering methods, the selected CH did their best to serve the network. However, the CH may become overloaded due to the arrival of nodes greater than their desired threshold value. In th

APA, Harvard, Vancouver, ISO, and other styles

8

Yong, Jin, Zhou Lin, Wei Qian, Bai Ke, Wang Chen, and Li Ji-fang. "Tree-Based Multihop Routing Method for Energy Efficiency of Wireless Sensor Networks." Journal of Sensors 2021 (April 28, 2021): 1–14. http://dx.doi.org/10.1155/2021/6671978.

Full text

Abstract:

In wireless sensor networks (WSNs), due to the limited energy of sensor nodes, how to design efficient hierarchical routing algorithms to balance network resources and extend network life is an important problem to be solved. Aiming at the problems such as random selection of cluster head, redundancy of working node, and construction of cluster head transmission path, which affect network energy consumption, this paper proposes a multihop routing algorithm based on path tree (MHRA-PT) to optimize the network energy. Firstly, some nodes are those close to the base station and have large remaini

APA, Harvard, Vancouver, ISO, and other styles

9

Mazinani, S. M., J. Chitizadeh, M. H. Yaghmaee, M. T. Honary, and F. Tashtarian. "NEW CLUSTERING SCHEMES FOR WIRELESS SENSOR NETWORKS." IIUM Engineering Journal 11, no. 1 (2010): 51–69. http://dx.doi.org/10.31436/iiumej.v11i1.39.

Full text

Abstract:

In this paper, two clustering algorithms are proposed. In the first one, we investigate a clustering protocol for single hop wireless sensor networks that employs a competitive scheme for cluster head selection. The proposed algorithm is named EECS-M that is a modified version to the well known protocol EECS where some of the nodes become volunteers to be cluster heads with an equal probability.Â In the competition phase in contrast to EECS using a fixed competition range for any volunteer node, we assign a variable competition range to it that is related to its distance to base station. The v

APA, Harvard, Vancouver, ISO, and other styles

10

Kaur, Sawroop, Deepak Prashar, and Rita Rani. "Improvement inEnergy Efficiency of Wireless Sensor Network." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 2, no. 2 (2012): 85–87. http://dx.doi.org/10.24297/ijct.v2i2b.2636.

Full text

Abstract:

Clustering in wireless sensor network is important to increase the lifetime of sensor network. LEACH protocol is one of the clustering routing protocols in wireless sensor networks. In LEACH each node has the equal probability to be a cluster head, due to which the energy dissipation of every node is balanced. In LEACH protocol, time is divided into many rounds and in each round, all the nodes wishes to be cluster head according to a predefined criterion. This paper focuses on the approach that how could the number of cluster heads are limited in the network, if we limit the number of cluster

APA, Harvard, Vancouver, ISO, and other styles

11

Song, Ling, Qidong Song, Jin Ye, and Yan Chen. "A Hierarchical Topology Control Algorithm for WSN, Considering Node Residual Energy and Lightening Cluster Head Burden Based on Affinity Propagation." Sensors 19, no. 13 (2019): 2925. http://dx.doi.org/10.3390/s19132925.

Full text

Abstract:

The low energy adaptive clustering hierarchy (LEACH) is the classical hierarchical topology control algorithm and still widely used today in wireless sensor networks. There are some problems in LEACH such us an unreasonable selection and uneven distribution of cluster heads, not considering the residual energy of nodes, the cluster head is overloaded and there is a high energy consumption of data transmission. In this paper, a topology control algorithm with double cluster heads and multi-hop based on affinity propagation clustering (APDC-M) was proposed. In APDC-M, firstly, a cluster head ele

APA, Harvard, Vancouver, ISO, and other styles

12

Bao, Zhanbiao. "Secure Clustering Strategy Based on Improved Particle Swarm Optimization Algorithm in Internet of Things." Computational Intelligence and Neuroscience 2022 (July 16, 2022): 1–9. http://dx.doi.org/10.1155/2022/7380849.

Full text

Abstract:

This paper proposes a secure clustering strategy based on improved particle swarm optimization (PSO) in the environment of the Internet of Things (IoT). First, in the process of cluster head election, by considering the residual energy and load balance of nodes, a new fitness function is established to evaluate and select better candidate cluster head nodes. Second, the optimized adaptive learning factor is used to adjust the location update speed of candidate cluster head nodes, expand the local search, and accelerate the convergence speed of global search. Finally, in the stage of forwarding

APA, Harvard, Vancouver, ISO, and other styles

13

Zhou, Xin Lian, and Jian Bo Xu. "The Research of Data Gathering Protocol for Mobile Sensor Networks." Advanced Materials Research 216 (March 2011): 621–24. http://dx.doi.org/10.4028/www.scientific.net/amr.216.621.

Full text

Abstract:

This paper first proposed an energy-efficient distributed clustering technology for mobile sensor nodes and sink node mobility, select the higher residual energy and the nearest node from fixed nodes as cluster heads responsible for collecting sensed data, and all the fixed nodes form routing backbone to forward data, both can save energy and avoid cluster head away. Then, proposed a cross-layer scheduling mechanism to avoid the impact of mobile node and meet expectations cluster coverage. With energy-efficient clustering technology, efficient network topology control technology and mobile sin

APA, Harvard, Vancouver, ISO, and other styles

14

Shivappa, Nagesha, and Sunilkumar S. Manvi. "ANFIS-Based Resource Mapping for Query Processing in Wireless Multimedia Sensor Networks." Journal of Intelligent Systems 26, no. 3 (2017): 505–22. http://dx.doi.org/10.1515/jisys-2015-0114.

Full text

Abstract:

AbstractWireless multimedia sensor networks (WMSNs) are usually resource constrained, and where the sensor nodes have limited bandwidth, energy, processing power, and memory. Hence, resource mapping is required in a WMSN, which is based on user linguistic quality of service (QoS) requirements and available resources to offer better communication services. This paper proposes an adaptive neuro fuzzy inference system (ANFIS)-based resource mapping for video communications in WMSNs. Each sensor node is equipped with ANFIS, which employs three inputs (user QoS request, available node energy, and a

APA, Harvard, Vancouver, ISO, and other styles

15

Atul Pawar. "Energy-Efficient Cluster Formation in Wireless Sensor Networks." Journal of Information Systems Engineering and Management 10, no. 14s (2025): 595–603. https://doi.org/10.52783/jisem.v10i14s.2330.

Full text

Abstract:

Sensor nodes that are wireless are extremely energy-constrained devices. Due to a number of sensor node limitations, including size and cost, their battery life is limited. Furthermore, the majority of Wireless Sensor Network (WSN) applications make it impossible to recharge or swap out sensor node batteries. Thus, one of the main challenges in wireless sensor networks is making the best use of node energy. An efficient way to maximize node energy utilization and extend the lifespan of an energy-constrained wireless sensor network is to cluster sensor nodes. In order to extend the lifespan of

APA, Harvard, Vancouver, ISO, and other styles

16

Nivedhitha, V., P. Thirumurugan, A. Gopi Saminathan, and V. Eswaramoorthy. "Combination of improved Harris’s hawk optimization with fuzzy to improve clustering in wireless sensor network." Journal of Intelligent & Fuzzy Systems 41, no. 6 (2021): 5969–84. http://dx.doi.org/10.3233/jifs-202098.

Full text

Abstract:

A Wireless Sensor Network (WSN) is divided into groups of sensor nodes for efficient transmission of data from the point of measuring to sink. By performing clustering, the network remains energy-efficient and stable. An intelligent mechanism is needed to cluster the sensors and find an organizer node, the cluster head. The organizer node assembles data from its constituent nodes called member nodes, finds an optimal route to the sink of the network, and transfers the same. The nomination of cluster head is crucial since energy utilization is a major challenge of sensor nodes deployed over a h

APA, Harvard, Vancouver, ISO, and other styles

17

Susila, S. G., and J. Arputhavijayaselvi. "Multipart Layer Node Deployment and Computational Technique with Finest Cluster Head Selection for Network Lifetime Enhancement." Journal of Computational and Theoretical Nanoscience 13, no. 10 (2016): 6642–48. http://dx.doi.org/10.1166/jctn.2016.5609.

Full text

Abstract:

The continual research and development in wireless sensor networks, power is most vital resource because each sensor node has limited battery power. Numerous clustering concept routing protocols have been developed to balance and enhance lifetime of the sensor nodes in wireless sensor networks. Available clustering routing protocols are select cluster heads periodically and they considered only how can select cluster heads energy-efficiently and the most excellent selection of cluster heads, without considering energy-efficient period of the cluster heads replacement. Herein paper, it is emplo

APA, Harvard, Vancouver, ISO, and other styles

18

Yi, Yun Hui, and Run Liu Wang. "Routing Algorithm with Energy-Efficient and High Quality of Clusters in Wireless Sensor Network." Advanced Materials Research 989-994 (July 2014): 1942–45. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.1942.

Full text

Abstract:

This paper proposes an energy-efficient clustering routing algorithm based on the node degree, relative distance between nodes and residual energy. Selecting the cluster head fully consider the node degree and their relative distance. By this way, the coverage performance of cluster head is better and the average distance between member nodes and cluster head is short, so the cost of communication in the cluster is decreased. At the same time, the nodes with low energy have less probability to become the cluster head. Therefore, it can improve the quality of cluster; prolong the life time of t

APA, Harvard, Vancouver, ISO, and other styles

19

Mrs. T. Nivetha, Dr. K. Prabhavathy. "Cluster Based Improved Particle Swarm Optimization for Optimum Cluster Head Election for Energy Efficient Routing in Wireless Sensor Networks." Tuijin Jishu/Journal of Propulsion Technology 44, no. 4 (2023): 5223–37. http://dx.doi.org/10.52783/tjjpt.v44.i4.1877.

Full text

Abstract:

The proposed methodology addresses critical challenges in Wireless Sensor Networks (WSN), focusing on optimizing cluster head and forwarding node selection. Leveraging an enhanced Particle Swarm Algorithm (PSO), the approach prioritizes residual energy and spatial balance in node selection. It efficiently assigns cluster head nodes to ordinary nodes and selects forwarding nodes within clusters. The algorithm incorporates proximity principles to ensure balanced positioning of nodes. Through iterative iterations, the method refines node selections, favoring candidates with higher residual energy

APA, Harvard, Vancouver, ISO, and other styles

20

ISHA, VARSHA, and POOJA. "NETWORK LIFETIME ENHANCEMENT BY CO-OPERATIVE ROUTING IN WIRELESS SENSOR NETWORKS." Asian Journal of Current Research 2, no. 1 (2017): 33–39. https://doi.org/10.5281/zenodo.1408490.

Full text

Abstract:

In this paper, we have proposed an energy efficient cooperative communication routing protocol (EECCRP). This Protocol considered three parameters- energy, distance and node density. Every node of this network is initially charged 0.3 joule of energy. This protocol can perform better with 0.3 joule as compared with EEE-LEACH protocol that have 0.5 joule of energy of every node because energy efficient clustering is being adopted in this. It adds scalability to the network as other topologies are not favored for large area network. It avoids the Hot-Spot problem, i.e. the nodes nearer to the ba

APA, Harvard, Vancouver, ISO, and other styles

21

Patil, Hemavati, and Vishwanath Tegampure. "Trust aware angle based secure routing approach for wireless sensor network." Bulletin of Electrical Engineering and Informatics 13, no. 1 (2024): 529–37. http://dx.doi.org/10.11591/eei.v13i1.5811.

Full text

Abstract:

Security in wireless sensor network (WSN) is an important approach in the present context as data breaching is becoming more. The data to be routed from source to destination needs more security as WSN has no specific security approach by default. This paper proposes trust based security in WSN using approach. The secure line is drawn from head node to its cluster end point called as angle to provide the security to the nodes which are transferring the data to the head node. Secure line becomes the trust worth line where mobile agent migrates to all the corresponding nodes which are along or n

APA, Harvard, Vancouver, ISO, and other styles

22

Peter, Maina Mwangi, Gichuki Ndia John, and Muchiri Muketha Geoffrey. "AN EXTENDED K-MEANS CLUSTER HEAD SELECTION ALGORITHM FOR EFFICIENT ENERGY CONSUMPTION IN WIRELESS SENSOR NETWORKS." International Journal of Network Security & Its Applications (IJNSA) 15, no. 3 (2023): 65–83. https://doi.org/10.5281/zenodo.8072861.

Full text

Abstract:

Effective use of sensor nodes’ batteries in wireless sensor networks is critical since the batteries are difficult to recharge or replace. This is closely connected to the networks’ lifespan since once the battery is used up, the node is no longer useful. The entire network will not function if 60 to 80% of the nodes in it have completely depleted their energy. In order to minimize energy usage and sustain the network for a long time, many cluster head selection algorithms have been developed. However, the existing cluster head selection algorithms such as K-Means, particle swarm s

APA, Harvard, Vancouver, ISO, and other styles

23

Kim, Si Gwan. "Reliable Cluster-Based Routing Algorithms in Wireless Sensor Networks." Applied Mechanics and Materials 284-287 (January 2013): 2147–51. http://dx.doi.org/10.4028/www.scientific.net/amm.284-287.2147.

Full text

Abstract:

With advanced micro-electromechanical technology, the development of small-size, low-cost, and low-power sensors that possess sensing, signal processing and wireless communication capabilities is becoming popular than ever. To achieve the energy efficiency in the wireless sensor networks, LEACH has been proposed as a routing protocol, composing of a few clusters, each of which consists of member nodes that sense the data, and head nodes that deliver the collected data from member nodes to a sink node. When wireless link error occurs, LEACH may miss some messages because of only one cluster hea

APA, Harvard, Vancouver, ISO, and other styles

24

D, Rajesh. "Energy-Resourceful Routing by Fuzzy Based Secured CH Clustering for Smart Dust." International Journal of Electrical and Electronics Research 10, no. 3 (2022): 659–63. http://dx.doi.org/10.37391/ijeer.100340.

Full text

Abstract:

Smart Dust Network (SDN) consists of no-infrastructure, sovereign network, smart dust nodes are associated with wireless paths in multihop fashion. No-infrastructure and mobility atmosphere contains complexity to establish an innovative secure routing approach for MWSN. The major problem in MWSN is in routing because of its scarce resource accessibility and mobility in nature. Energy-resourceful routing is indispensable since each smart dust node is containing constrained battery energy. Power breakdown of a particular smart dust node splits network design. So MWSN routing utilizes offered bat

APA, Harvard, Vancouver, ISO, and other styles

25

Yuan, Kou Lin, Lin Qiao, and Lei Han. "Level and Cluster Based Routing for Wireless Sensor Network." Applied Mechanics and Materials 321-324 (June 2013): 515–22. http://dx.doi.org/10.4028/www.scientific.net/amm.321-324.515.

Full text

Abstract:

This paper proposes a level and cluster based routing approach for a wireless sensor network. Nodes in the network are divided into several levels according to their hops to sink node. Every sensor node has a level number. Using level information, a sensor node can send messages to a sink node in a more efficient way, and a sink node can easily locate other sensor nodes. To make network more balanced, the paper introduces a cluster method, which splits nodes in the same level into different clusters, and chooses a cluster head for every cluster, to switch nodes in the cluster to work in turn.

APA, Harvard, Vancouver, ISO, and other styles

26

Kaur, Chamanpreet, and Vikramjit Singh. "A NOVEL APPROACH OF CLUSTERING FOR ENHANCED LIFETIME IN WIRELESS SENSOR NETWORK." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 16, no. 7 (2017): 7031–39. http://dx.doi.org/10.24297/ijct.v16i7.6454.

Full text

Abstract:

Wireless sensor network has revolutionized the way computing and software services are delivered to the clients on demand. Our research work proposed a new method for cluster head selection having less computational complexity. It was also found that the modified approach has improved performance to that of the other clustering approaches. The cluster head election mechanism will include various parameters like maximum residual energy of a node, minimum separation distance and minimum distance to the mobile node. Each CH will create a TDMA schedule for the member nodes to transmit the data. No

APA, Harvard, Vancouver, ISO, and other styles

27

Haque, Ahshanul, and Hamdy Soliman. "Hierarchical Early Wireless Forest Fire Prediction System Utilizing Virtual Sensors." Electronics 14, no. 8 (2025): 1634. https://doi.org/10.3390/electronics14081634.

Full text

Abstract:

Deploying thousands of sensors across remote and challenging environments—such as the Amazon rainforest, Californian wilderness, or Australian bushlands—is a critical yet complex task for forest fire monitoring, while our backyard emulation confirmed the feasibility of small-scale deployment as a proof of concept, large-scale scenarios demand a scalable, efficient, and fault-tolerant network design. This paper proposes a Hierarchical Wireless Sensor Network (HWSN) deployment strategy with adaptive head node selection to maximize area coverage and energy efficiency. The network architecture fol

APA, Harvard, Vancouver, ISO, and other styles

28

Lee, Jong-Yong, and Daesung Lee. "Improvement of CH election in three-level heterogeneous WSN." Indonesian Journal of Electrical Engineering and Computer Science 13, no. 1 (2019): 272. http://dx.doi.org/10.11591/ijeecs.v13.i1.pp272-278.

Full text

Abstract:

<p>A Wireless Sensor Network is a wirelessly configured Sensor Node with limited power such as a battery. There are many Wireless Sensor Network Protocols to increase energy efficiency, among which LEACH Protocol and SEP are typical. The LEACH Protocol is mainly used for homogeneous sensor networks with the same initial energy, and SEP is used for heterogeneous sensor networks with different initial energies. In the case of SEP-E, another heterogeneous sensor with different initial energy is added. SEP and SEP-E provide a higher probability of Cluster Head election for node types with mo

APA, Harvard, Vancouver, ISO, and other styles

29

Lee, Jong-Yong, and Daesung Lee. "Improvement of CH election in three-level heterogeneous WSN." Indonesian Journal of Electrical Engineering and Computer Science 13, no. 1 (2019): 272–78. https://doi.org/10.11591/ijeecs.v13.i1.pp272-278.

Full text

Abstract:

A Wireless Sensor Network is a wirelessly configured Sensor Node with limited power such as a battery. There are many Wireless Sensor Network Protocols to increase energy efficiency, among which LEACH Protocol and SEP are typical. The LEACH Protocol is mainly used for homogeneous sensor networks with the same initial energy, and SEP is used for heterogeneous sensor networks with different initial energies. In the case of SEP-E, another heterogeneous sensor with different initial energy is added. SEP and SEP-E provide a higher probability of Cluster Head election for node types with more energy

APA, Harvard, Vancouver, ISO, and other styles

30

Xu, Gui Sen, and Xue Zhi Tan. "A Cluster Head Rotating Threshold for Cognitive Radio Network." Advanced Materials Research 171-172 (December 2010): 211–14. http://dx.doi.org/10.4028/www.scientific.net/amr.171-172.211.

Full text

Abstract:

Cluster-based topology is an energy-efficient topology control method in cognitive radio networks. The cluster head node depletes energy faster than cluster member node and the rotation of cluster head node is needed to balance the energy consumption for the whole network. Aimed at the problem of unbalanced residual energy of each node caused by cluster heads and cluster members in wireless cognitive radio network, a novel algorithm named cluster head rotating threshold (CHRT) is presented. In the proposed algorithm, rotation energy threshold is estimated using cluster head real-time energy lo

APA, Harvard, Vancouver, ISO, and other styles

31

Vermeeren, L., W. M. C. Klop, M. W. M. van den Brekel, A. J. M. Balm, O. E. Nieweg, and R. A. Valdés Olmos. "Sentinel Node Detection in Head and Neck Malignancies: Innovations in Radioguided Surgery." Journal of Oncology 2009 (2009): 1–10. http://dx.doi.org/10.1155/2009/681746.

Full text

Abstract:

Sentinel node mapping is becoming a routine procedure for staging of various malignancies, because it can determine lymph node status more precisely. Due to anatomical problems, localizing sentinel nodes in the head and neck region on the basis of conventional images can be difficult. New diagnostic tools can provide better visualization of sentinel nodes. In an attempt to keep up with possible scientific progress, this article reviews new and innovative tools for sentinel node localization in this specific area. The overview comprises a short introduction of the sentinel node procedure as wel

APA, Harvard, Vancouver, ISO, and other styles

32

Pushkin, Shailendra, and Ranvijay. "A Novel Hypergraph Clustered Gray Relational Analysis HGPSO Algorithm for Data Aggregation in WSN." Cybernetics and Information Technologies 23, no. 3 (2023): 163–78. http://dx.doi.org/10.2478/cait-2023-0031.

Full text

Abstract:

Abstract Wireless Sensor Networks (WSN) aggregate data from multiple sensors and transfer it to a central node. Sensor nodes should use as little energy as possible to aggregate data. This work has focused on optimal clustering and cluster head node selection to save energy. HyperGraphs (HGC) and cluster head selection based on distance and energy consumption are unique approaches to spectral clustering. GRA computes a relational matrix to select the cluster head. The network’s Moving Agent (MA) may use Hypergraphed Particle Swarm Optimization (HGPSO) to collect data from cluster heads. Compar

APA, Harvard, Vancouver, ISO, and other styles

33

Chen, Li Jun. "An Improved Clustering Algorithm Based on Coverage Area for Wireless Sensor Networks." Advanced Materials Research 542-543 (June 2012): 643–46. http://dx.doi.org/10.4028/www.scientific.net/amr.542-543.643.

Full text

Abstract:

Clustering is an effective topology control approach in wireless sensor networks, which can increase network scalability and lifetime. A clustering algorithm based on the total number of neighbor nodes is proposed to maximize the lifetime of the network. The larger amount of neighbor nodes, the more chance a node has to be selected as a cluster head. Therefore, it can ensure the minimum cluster heads in the whole network. By closing the communication parts of cluster head to avoid selecting as cluster head in next epoch, the energy of the whole system is consumed symmetrically. The simulations

APA, Harvard, Vancouver, ISO, and other styles

34

Du, Yong-wen, Zhang-min Wang, Gang Cai, and Jun-hui Gong. "Load-balanced routing algorithm based on cluster heads optimization for wireless sensor networks." MATEC Web of Conferences 232 (2018): 04050. http://dx.doi.org/10.1051/matecconf/201823204050.

Full text

Abstract:

In order to solve the problem of unbalanced load consumption of nodes for wireless sensor networks (WSNs), this paper proposes a load-balanced routing algorithm based on cluster heads optimization for wireless sensor network. The proposed algorithm first applies first-order wireless transmission model to calculate the optimal number of clusters, then calculate nodes competitiveness rating by fuzzy algorithm considering the residual energy of node and distance from the node to base station, cluster head selection uses unequal clustering algorithm according to the competitiveness of nodes. By no

APA, Harvard, Vancouver, ISO, and other styles

35

Rani, Anju, and Amit Kumar Bindal. "Optimization of Energy Conservation in Wireless Sensor Networks." Journal of Computational and Theoretical Nanoscience 17, no. 6 (2020): 2658–63. http://dx.doi.org/10.1166/jctn.2020.8962.

Full text

Abstract:

Presently, Wireless Sensor Networks (WSNs) is quickest developing technology which broadly embracing for different application services including; climate observing, traffic expectation, reconnaissance, research and scholastic fields and so on. As the sensor nodes are haphazardly conveyed in remote condition, security measurements turns out to be most encouraging test where correspondence wirelesses systems confronting today. The Stable Election Protocol (SEP) is an enhanced algorithm of Adaptive Clustering Hierarchy (LEACH) with low energy in heterogeneous Wireless Sensor Network (WSN) for im

APA, Harvard, Vancouver, ISO, and other styles

36

Alagiri, I., V. Madhuviswanatham, and P. VenkataKrishna. "Efficient Data Transfer by Mobility Adjustment Algorithm for Clustered Mobile Ad-Hoc Networks." Cybernetics and Information Technologies 14, no. 2 (2014): 50–64. http://dx.doi.org/10.2478/cait-2014-0019.

Full text

Abstract:

Abstract Mobile Ad-hoc NETwork (MANET) is a prevalent deployable network for easy plug-in and it is widely applied for many real time scenarios. Clustering is a well known solution for efficient communication among nodes with least control overheads. The communication link breaks between nodes when a node moves beyond the transmission range of another node because of mobility. Frequent link breaks happen because of nodes mobility which cannot be controlled without increasing the network control overheads. The authors propose an Mobility Adjustment Routing (MAR) routing algorithm for establishi

APA, Harvard, Vancouver, ISO, and other styles

37

Xiaogang, Yuan. "Secure Low-Energy Routing Protocol Based on Dynamic Trust Awareness and Load Balancing in Wireless Sensor Networks." Security and Communication Networks 2023 (September 9, 2023): 1–12. http://dx.doi.org/10.1155/2023/6772435.

Full text

Abstract:

Since wireless sensor networks (WSNs) have the requirements of high security and energy conservation, a distributed secure low-energy routing protocol (SLERP) based on dynamic trust awareness and load balancing is proposed. In order to reduce the adverse influence of malicious nodes in the network, the Chebyshev neural network is used to predict the dynamic trust degree of network nodes to accelerate the speed and accuracy of malicious node detection. Based on the comprehensive consideration of the average dynamic trust degree of cluster-head nodes, the load of the cluster-head node, network e

APA, Harvard, Vancouver, ISO, and other styles

38

Akhbari, Abbas, and Ali Ghaffari. "Selfish node Detection Based on Fuzzy Logic and Harris Hawks Optimization Algorithm in IoT Networks." Security and Communication Networks 2021 (November 30, 2021): 1–20. http://dx.doi.org/10.1155/2021/2658272.

Full text

Abstract:

The Internet of things describes a network of physical things for example, “things” that are connected with the sensors, software, and other technologies to connect and exchange data with other devices and systems via the Internet. In this type of network, the nodes communicate with each other because of the low radio range by step by step with the help of each other until they reach their destination, but there are nodes in the network that do not cooperate with other nodes in the network, which are called “selfish nodes”. In this paper, we try to detect selfish nodes based on a hybrid approa

APA, Harvard, Vancouver, ISO, and other styles

39

Maina Mwangi, Peter, John Gichuki Ndia, and Geoffrey Muchiri Muketha. "AN EXTENDED K-MEANS CLUSTER HEAD SELECTION ALGORITHM FOR EFFICIENT ENERGY CONSUMPTION IN WIRELESS SENSOR NETWORKS." International Journal of Network Security & Its Applications 15, no. 03 (2023): 65–83. http://dx.doi.org/10.5121/ijnsa.2023.15305.

Full text

Abstract:

Effective use of sensor nodes’ batteries in wireless sensor networks is critical since the batteries are difficult to recharge or replace. This is closely connected to the networks’ lifespan since once the battery is used up, the node is no longer useful. The entire network will not function if 60 to 80% of the nodes in it have completely depleted their energy. In order to minimize energy usage and sustain the network for a long time, many cluster head selection algorithms have been developed. However, the existing cluster head selection algorithms such as K-Means, particle swarm selection opt

APA, Harvard, Vancouver, ISO, and other styles

40

Dai, Hong, and Heng Hui Ge. "Improved LEACH Routing Protocol Through Selecting Cluster Head Node and Data Transmission Algorithm." Journal of Computational and Theoretical Nanoscience 13, no. 10 (2016): 7184–88. http://dx.doi.org/10.1166/jctn.2016.5690.

Full text

Abstract:

For LEACH routing protocol in the clustering routing protocol of wireless sensors, the network energy consumption inequality, node energy inequality and deficiency of cluster head election, this paper proposes the method of improving the cluster head election through node residual energy and the distance between the nodes. To balance the network energy consumption, improves the algorithm of stable data transmission phase. The simulation experiment results prove the fact that the improved algorithm is better than the original algorithm through comparing the node mortality, receiving data amount

APA, Harvard, Vancouver, ISO, and other styles

41

Epee, Paul T. M., Olaf Schelezki, Michael C. T. Trought, et al. "Effects of cane- and spur-retained node numbers on the pre-flowering vegetative growth of cane-pruned Sauvignon blanc." OENO One 56, no. 4 (2022): 157–71. http://dx.doi.org/10.20870/oeno-one.2022.56.4.5530.

Full text

Abstract:

In established vineyards, node number retention at winter pruning is the first step to achieving and maintaining vine balance. Balanced vines exhibit timely and quasi-uniform 100 percent budburst. To understand how vine capacity and balance are expressed before flowering, mature Sauvignon blanc vines were pruned according to a 5 [total node numbers on canes: 10, 20, 30, 40, 50] x 3 [total node numbers on spurs: 1, 2, 3] factorial design in one site, and in two other sites according to a 5 [total node numbers on canes: 10, 20, 30, 40, 50] x 2 [total node numbers on spurs: 1, 2] factorial design

APA, Harvard, Vancouver, ISO, and other styles

42

Gao, Lei, and Qun Chen. "A Cluster Algorithm for Wireless Sensor Networks Based on Energy Efficiency." Applied Mechanics and Materials 785 (August 2015): 744–50. http://dx.doi.org/10.4028/www.scientific.net/amm.785.744.

Full text

Abstract:

In order to solve the energy limited problem of sensor nodes in the wireless sensor networks (WSN), a fast clustering algorithm based on energy efficiency for wire1ess sensor networks is presented in this paper. In the system initialization phase, the deployment region is divided into several clusters rapidly. The energy consumption ratio and degree of the node are chosen as the selection criterion for the cluster head. Re-election of the cluster head node at this time became a local trigger behavior. Because of the range of the re-election is within the cluster, which greatly reduces the comp

APA, Harvard, Vancouver, ISO, and other styles

43

Pfau, David, Akina Tamaki, Kathryn R. Hoppe, Kord Honda, Rod Rezaee, and Chad A. Zender. "Sentinel Node Biopsy in Young Patients with Atypical Melanocytic Tumors of the Head and Neck." OTO Open 3, no. 2 (2019): 2473974X1985075. http://dx.doi.org/10.1177/2473974x19850752.

Full text

Abstract:

Objective To examine the diagnostic value of the sentinel lymph node biopsy in pediatric through young adult head and neck melanocytic tumors of unknown malignant potential. Study Design Retrospective case series. Setting Single academic institution. Subjects and Methods Demographics, histology, and outcomes were examined in 14 patients aged 4 to 24 years with head and neck melanocytic tumors of unknown malignant potential. Information on age at diagnosis, primary lesion characteristics, and sentinel lymph node biopsy were compared. Results Of 14 patients meeting criteria for head and neck mel

APA, Harvard, Vancouver, ISO, and other styles

44

Loganathan, Sathyapriya, and Jawahar Arumugam. "Clustering Algorithms for Wireless Sensor Networks Survey." Sensor Letters 18, no. 2 (2020): 143–49. http://dx.doi.org/10.1166/sl.2020.4193.

Full text

Abstract:

This paper aims to discuss a comprehensive survey on clustering algorithms for wireless sensor networks (WSN). The several real-time applications adopted the WSN with the advance features. But the capacity and size of the battery used in the sensor nodes are limited. Battery replacement or recharging is very difficult in most outdoor applications. Hence handling this kind of network is one of the issues. One of the best solutions to the energy issue is Clustering. Clustering is to balance the energy consumption of the whole network by cluster-based architecture to prolong the network lifetime.

APA, Harvard, Vancouver, ISO, and other styles

45

Teng, Zhiyang, and Yue Zhang. "Head-Lexicalized Bidirectional Tree LSTMs." Transactions of the Association for Computational Linguistics 5 (December 2017): 163–77. http://dx.doi.org/10.1162/tacl_a_00053.

Full text

Abstract:

Sequential LSTMs have been extended to model tree structures, giving competitive results for a number of tasks. Existing methods model constituent trees by bottom-up combinations of constituent nodes, making direct use of input word information only for leaf nodes. This is different from sequential LSTMs, which contain references to input words for each node. In this paper, we propose a method for automatic head-lexicalization for tree-structure LSTMs, propagating head words from leaf nodes to every constituent node. In addition, enabled by head lexicalization, we build a tree LSTM in the top-

APA, Harvard, Vancouver, ISO, and other styles

46

P. Biradar, Shivshanker, and T. S. Vishwanath. "Optimized Cluster Establishment and Cluster-Head Selection Approach in WSN." International journal of Computer Networks & Communications 13, no. 04 (2021): 53–70. http://dx.doi.org/10.5121/ijcnc.2021.13404.

Full text

Abstract:

In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes i

APA, Harvard, Vancouver, ISO, and other styles

47

MS., POONAM SHINDE, and MR. V. M. SARDAR PROF. "DATA LOSS PREVENTION IN CONGESTION PRONE WIRELESS SENSOR NETWORK USING VCLR MODEL." JournalNX - a Multidisciplinary Peer Reviewed Journal 3, no. 9 (2017): 52–55. https://doi.org/10.5281/zenodo.1420616.

Full text

Abstract:

In WSN source node generate an event within the cluster at that time this collected information forward towards sink node through cluster head node. Cluster head acts as intermediate node between sink node and source node. The congestion may occur at the cluster head and this prompts to data loss also affect the reliability of the network. In existing system cluster head only performs normal data packet transmission from source node to sink. Due to insufficient buffer size at cluster head node there is more packets drop during the transmission of packets. So, this system gives lower packet del

APA, Harvard, Vancouver, ISO, and other styles

48

M, L. Umashankar, N. Anitha T, and Mallikarjunaswamy S. "An efficient hybrid model for cluster head selection to optimize wireless sensor network using simulated annealing algorithm." Indian Journal of Science and Technology 14, no. 3 (2021): 270–88. https://doi.org/10.17485/IJST/v14i3.2318.

Full text

Abstract:

Abstract <strong>Objective:</strong> Energy efficiency aspect in wireless sensor networks (WSN) can be achieved by small sized rechargeable and easily replaceable batteries. The lifetime of wireless sensor network can be improved by identifying the efficient and reliable nodes as a cluster heads using Hybrid Simulated Annealing algorithm. The proposed algorithm identifies cluster head to reduce overhead and is capable of handling high volume of nodes with minimum node death rate. <strong>Methods:</strong> This study proposed initialization of population vectors using the opposit

APA, Harvard, Vancouver, ISO, and other styles

49

Zhao, Liquan, and Qi Tang. "An Improved Threshold-Sensitive Stable Election Routing Energy Protocol for Heterogeneous Wireless Sensor Networks." Information 10, no. 4 (2019): 125. http://dx.doi.org/10.3390/info10040125.

Full text

Abstract:

In the Threshold-Sensitive Stable Election Protocol, sensors are randomly deployed in the region without considering the balanced energy consumption of nodes. If a node that has been selected as a cluster head is located far away from the base station, it will affect the efficiency of the network due to its early death. This paper proposes an improved energy efficient routing protocol named Improved Threshold-Sensitive Stable Election protocol (ITSEP) for heterogeneous wireless sensor networks. Firstly, we use a node state transformation mechanism to control the number of cluster heads in high

APA, Harvard, Vancouver, ISO, and other styles

50

Huang, Zhen, Qiang Lu, Rijian Su, and Kaibo Zhou. "Optimal Distribution Method of Photoelectric Sensing Radio Frequency Identification Multi-Tags Using Ant Colony Algorithm." Journal of Nanoelectronics and Optoelectronics 15, no. 5 (2020): 645–53. http://dx.doi.org/10.1166/jno.2020.2785.

Full text

Abstract:

In this study, RFID technology and wireless photoelectric sensor (WOSN) technology were combined in the acquisition of traffic information. RFID tag and photoelectric sensor were used as a node to build a traffic information collection network. To improve the life cycle and load performance of the network, and achieve the optimal distribution among nodes, the ant colony optimization (ACO) algorithm was taken as the research object, and the network node distribution routing algorithm of multiple RFID tags-photoelectric sensor nodes was designed. The improved ACO based on energy and distance was

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!