To see the other types of publications on this topic, follow the link: Maximum Number of Nodes.
Journal articles on the topic 'Maximum Number of Nodes'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Maximum Number of Nodes.'
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
Jiang, Xuejun, Wenbo Zhang, Lincong Zhang, and Xiaobo Tan. "Research on Wireless Sensor Actuator Distribution Algorithm Meeting Maximum Request Expectation." International Journal of Online Engineering (iJOE) 13, no. 04 (2017): 57. http://dx.doi.org/10.3991/ijoe.v13i04.6584.
Full textAbstract:
<strong>In wireless sensor actuator networks, actuator nodes are very important to network coverage for wireless sensor. So according to the characteristics that wireless communication is easy to be affected by the environment, in this wireless sensor actuator network the actuator nodes are abstracted to be service providers and the sensor nodes are abstracted to be service consumers. Furthermore, the messages transferred from actuator nodes to sensor nodes are abstracted to be service requests and the coverage of sensor nodes by actuator nodes is service providing. Moreover, the service faulty ratio of actuator nodes is defined in this paper. Based on that, an actuator node coverage algorithm that satisfies the maximum request expectation is put forwarded. Its goal is to solve the mathematical expectation of maximizing the number of service requests with fixed number of sensor nodes and actuator nodes. So the optimal position of actuator nodes could be identified. The theoretic proof and simulation result show that this algorithm is more efficient compared with similar algorithms</strong>
2
Romanuke, Vadim. "Building Minimum Spanning Trees under Maximum Edge Length Constraint." Information Technology and Management Science 26 (November 30, 2023): 17–26. http://dx.doi.org/10.7250/itms-2023-0003.
Full textAbstract:
Given an initial set of planar nodes, the problem is to build a minimum spanning tree connecting the maximum possible number of nodes by not exceeding the maximum edge length. To obtain a set of edges, a Delaunay triangulation is performed over the initial set of nodes. Distances between every pair of the nodes in respective edges are calculated used as graph weights. The edges whose length exceeds the maximum edge length are removed. A minimum spanning tree is built over every disconnected graph. The minimum spanning trees covering a maximum of nodes are selected, among which the tree whose length is minimal is the solution. It is 1.17 % shorter on average for 10 to 80 nodes compared to a nonselected tree.
3
Di, Ruo-Hai, Ye Li, Ting-Peng Li, Lian-Dong Wang, and Peng Wang. "Dynamic Programming Structure Learning Algorithm of Bayesian Network Integrating MWST and Improved MMPC." Mathematical Problems in Engineering 2021 (December 31, 2021): 1–17. http://dx.doi.org/10.1155/2021/9199951.
Full textAbstract:
Dynamic programming is difficult to apply to large-scale Bayesian network structure learning. In view of this, this article proposes a BN structure learning algorithm based on dynamic programming, which integrates improved MMPC (maximum-minimum parents and children) and MWST (maximum weight spanning tree). First, we use the maximum weight spanning tree to obtain the maximum number of parent nodes of the network node. Second, the MMPC algorithm is improved by the symmetric relationship to reduce false-positive nodes and obtain the set of candidate parent-child nodes. Finally, with the maximum number of parent nodes and the set of candidate parent nodes as constraints, we prune the parent graph of dynamic programming to reduce the number of scoring calculations and the complexity of the algorithm. Experiments have proved that when an appropriate significance level α is selected, the MMPCDP algorithm can greatly reduce the number of scoring calculations and running time while ensuring its accuracy.
4
Wang, Letian. "Identifying Vital Nodes by Local g-Core on Symmetric Networks." Symmetry 17, no. 6 (2025): 925. https://doi.org/10.3390/sym17060925.
Full textAbstract:
The H-index is a widely recognized centrality measure for nodes in symmetric networks, defined as the maximum number of neighbors with degrees equal to or greater than the node’s own degree. However, this metric underestimates the structural influence of “weak nodes”—low-degree nodes connected to high-degree hubs—that often serve as critical connectors in network topology. To address this limitation, we propose the Hα-index, which generalizes the H-index by considering the maximum number of neighbors with degrees at least α times the node’s degree, where α≥1. Based on this refinement, we introduce two novel centrality measures: the g-core and the local g-core, which were derived from iterative applications of the Hα-index to a node’s neighbors. Extensive experiments on sixteen real-world networks demonstrate the efficiency of our methods. Notably, the local g-core achieves 45–105% higher Kendall Tau correlation coefficients compared to the traditional H-index and coreness on three benchmark networks, highlighting its superior performance in capturing node influence.
5
YI, CHIH-WEI, PENG-JUN WAN, CHAO-MIN SU, KUO-WEI LIN, and SCOTT C. H. HUANG. "ASYMPTOTIC DISTRIBUTION OF THE NUMBER OF ISOLATED NODES IN WIRELESS AD HOC NETWORKS WITH UNRELIABLE NODES AND LINKS." Discrete Mathematics, Algorithms and Applications 02, no. 01 (2010): 107–24. http://dx.doi.org/10.1142/s1793830910000516.
Full textAbstract:
In this paper, we study the connectivity of wireless ad hoc networks that are composed of unreliable nodes and links by investigating the distribution of the number of isolated nodes. We assume that a wireless ad hoc network consists of n nodes distributed independently and uniformly in a unit-area disk or square. All nodes have the same maximum transmission radius rn, and two nodes have a link if their distance is at most rn. Nodes are active independently with probability 0 < p1 ≤ 1, and links are up independently with probability 0 < p2 ≤ 1. Nodes are said isolated if they do not have any links to active nodes. We show that if [Formula: see text] for some constant ξ, then the total number of isolated nodes (or isolated active nodes, respectively) is asymptotically Poisson with mean e-ξ (or p1e-ξ, respectively). In addition, in the secure wireless networks that adopt m-composite key predistribution schemes, a node is said isolated if it does not have a secure link. Let p denote the probability of the event that two neighbor nodes have a secure link. If all nodes have the same maximum transmission radius [Formula: see text], the total number of isolated nodes is asymptotically Poisson with mean e-ξ.
6
Jindal, Pawan, Amit Kumar, and Shishir Kumar. "Minimum and maximum ratio of number of red internal nodes to black internal nodes in Red Black tree." International Journal of Computer Applications 5, no. 9 (2010): 1–2. http://dx.doi.org/10.5120/965-1112.
Full text
7
Kowsalya, P., and D. Vijayalakshmi. "On Radio k – Chromatic Number for Mycielski of Some Graphs." Indian Journal Of Science And Technology 17, no. 39 (2024): 4129–37. http://dx.doi.org/10.17485/ijst/v17i39.2315.
Full textAbstract:
Objectives: In radio networks, the main difficulty is managing the radio spectrum, assigning radio frequencies to transmitters optimally without any interferences. This study aims to find the smallest span of Mycielski of some graphs, the maximum color assigned to any node is called span. Methods : This study focused on the problem of reducing interference by modeling it with a radio k - coloring problem on graphs. Where transmitters are modeled as nodes in a graph, with edges connecting nodes that represent transmitters in close proximity to one another. For a graph , with node set , edge set and an integer , a radio k - coloring of is a function satisfying the condition for any two nodes and , where is the distance between and in . The radio k - coloring of , is the maximum color assigned to any node of and it is denoted by . The radio k -chromatic number of is the minimum value of taken over all radio k - coloring of and it is denoted by . Findings: This study obtained the radio k-chromatic number for Mycielski of some graphs for and 3 Novelty: To solve the channel assignment problem in radio transmitters, the interference graph is developed, and the channel assignment has been converted into a graph coloring. Reducing the interference by a radio k - coloring problem will motivate many researchers to find the radio k - coloring in various graphs. Keywords: Radio k – Coloring, Mycielski graph, Double Star graph, Triple Star graph, Sunlet graph, Helm graph and Closed Helm graph
8
Jerbi, Wassim, Hafedh Trabelsi, and Abderrahmen Guermazi. "Equilibrate and Minimize the Energy Consumption in a Cluster for Routing Protocols in Wireless Sensor Network." International Journal of Wireless Networks and Broadband Technologies 5, no. 1 (2016): 46–58. http://dx.doi.org/10.4018/ijwnbt.2016010103.
Full textAbstract:
The Cluster Head is selected on the basis of maximum number of nodes connected, thus several sensor nodes cannot reach any CH, even though they are in the transmission range. These nodes are called the isolated nodes. To solve this problem, the proposed a sub_cluster protocol, its role is to reduce the sensor nodes which do not belong the cluster. The major novel contribution of the proposed work is the sub_cluster protocol which provides coverage of the whole network with a minimum number of isolated nodes and has a very high connectivity rates. The sub_cluster protocol allows firstly with great cluster can be grouped many sub_cluster protocol connected to major CH, each sub_cluster protocol, can be connected of the maximum nodes non CH.
9
Gabriel, Michael W., George Y. Matsui, Robert Friedman, and Charles R. Lovell. "Optimization of Multilocus Sequence Analysis for Identification of Species in the Genus Vibrio." Applied and Environmental Microbiology 80, no. 17 (2014): 5359–65. http://dx.doi.org/10.1128/aem.01206-14.
Full textAbstract:
ABSTRACTMultilocus sequence analysis (MLSA) is an important method for identification of taxa that are not well differentiated by 16S rRNA gene sequences alone. In this procedure, concatenated sequences of selected genes are constructed and then analyzed. The effects that the number and the order of genes used in MLSA have on reconstruction of phylogenetic relationships were examined. TherecA,rpoA,gapA, 16S rRNA gene,gyrB, andftsZsequences from 56 species of the genusVibriowere used to construct molecular phylogenies, and these were evaluated individually and using various gene combinations. Phylogenies from two-gene sequences employingrecAandrpoAin both possible gene orders were different. The addition of thegapAgene sequence, producing all six possible concatenated sequences, reduced the differences in phylogenies to degrees of statistical (bootstrap) support for some nodes. The overall statistical support for the phylogenetic tree, assayed on the basis of a reliability score (calculated from the number of nodes having bootstrap values of ≥80 divided by the total number of nodes) increased with increasing numbers of genes used, up to a maximum of four. No further improvement was observed from addition of the fifth gene sequence (ftsZ), and addition of the sixth gene (gyrB) resulted in lower proportions of strongly supported nodes. Reductions in the numbers of strongly supported nodes were also observed when maximum parsimony was employed for tree construction. Use of a small number of gene sequences in MLSA resulted in accurate identification ofVibriospecies.
10
Hayat, Fazal, and Daniele Ettore Otera. "Extremal k-Connected Graphs with Maximum Closeness." Axioms 13, no. 12 (2024): 810. http://dx.doi.org/10.3390/axioms13120810.
Full textAbstract:
Closeness is a measure that quantifies how quickly information can spread from a given node to all other nodes in the network, reflecting the efficiency of communication within the network by indicating how close a node is to all other nodes. For a graph G, the subset S of vertices of V(G) is called vertex cut of G if the graph G−S becomes disconnected. The minimum cardinality of S for which G−S is either disconnected or contains precisely one vertex is called connectivity of G. A graph is called k-connected if it stays connected even when any set of fewer than k vertices is removed. In communication networks, a k-connected graph improves network reliability; even if up to k−1 nodes fail, the network remains operational, maintaining connectivity between devices. This paper aims to study the concept of closeness within n-vertex graphs with fixed connectivity. First, we identify the graphs that maximize the closeness among all graphs of order n with fixed connectivity k. Then, we determine the graphs that achieve the maximum closeness within all k-connected graphs of order n, given specific fixed parameters such as diameter, independence number, and minimum degree.
11
Son, Seung-Myoung, Chang Gok Woo, Ok-Jun Lee, Sang-Jeon Lee, Taek-Gu Lee, and Ho-chang Lee. "Factors affecting retrieval of 12 or more lymph nodes in pT1 colorectal cancers." Journal of International Medical Research 47, no. 10 (2019): 4827–40. http://dx.doi.org/10.1177/0300060519862055.
Full textAbstract:
Objective The aim of this study was to identify clinicopathological factors that affect the number of lymph nodes (LNs) (12 or more) retrieved from patients with colorectal cancer (CRC), particularly those with pathologic T1 (pT1) disease. Methods From 429 CRC patients, 75 pT1 cancers were identified and digitally scanned. Binary logistic regression analysis was performed to identify the clinicopathological factors affecting the number of LNs retrieved from all 429 patients and from the subset of patients with pT1 CRC. Results For the 429 patients, the mean number of harvested LNs per specimen was 20 (median, 19). The number of retrieved LNs was independently associated with maximum tumor diameter > 2.3 cm and right-sided tumor location. The mean number of LNs retrieved from the 75 patients with pT1 CRC was 14 (median, 15); retrieval of 12 or more LNs from this group was independently associated with maximum tumor diameter > 14.1 mm. Conclusion The number of LNs retrieved from patients with CRC was associated with maximum tumor diameter and right-sided tumor location. For patients with pT1 CRC, maximum tumor diameter was independently associated with the harvesting of 12 or more LNs.
12
MIKHALEVSKA, Galina, and Vitalii MIKHALEVSKYI. "THE USAGE OF GRAPH THEORY CONCEPTS FOR THE COMPLEX NETWORKS ANALYSIS." Herald of Khmelnytskyi National University 305, no. 1 (2022): 59–63. http://dx.doi.org/10.31891/2307-5732-2022-305-1-59-63.
Full textAbstract:
The article considers and investigates the usage of graph theory concepts for the complex networks analysis. Abstract from their physical nature, the topological properties of these networks are considered, which significantly determine the functioning of networks and are the subject of study of complex networks. Each node of the network can be connected with other nodes by a certain number of connections that may have a direction, or nodes can be connected with each other by symmetrical connections. Also in modern systems of analysis and visualization of networks such concepts as degrees of vertices, ranking, clustering, modularity, algorithms of laying of graphs, etc. are widely used. To calculate the parameters of the network as a whole use the number of nodes, the number of edges, the geodetic distance between nodes, the average distance from one node to another, density – the ratio of the number of edges in the network to the maximum possible number of edges for a given number of nodes; number of triads, diameter of the network (maximum geodetic distance). Structural network analysis includes: click detection (subgroups that are more interconnected than other click nodes); identification of network components; finding bridges (nodes, the removal of which breaks the network into incoherent parts); groups of equivalent nodes (which have the most similar communication profiles). One of the areas of complex networks analysis is their visualization, which allows to obtain important information about the structure and properties of the network without accurate calculations. Software tools for the complex networks analysis support the calculation of all the described parameters of the nodes, the network as a whole, provide its structural analysis and visualization, work with different data formats. For the complex networks analysis, the main visualization tools are described, in the vast majority, freely distributed, free programs.
13
Bianconi, Ginestra. "Grand Canonical Ensembles of Sparse Networks and Bayesian Inference." Entropy 24, no. 5 (2022): 633. http://dx.doi.org/10.3390/e24050633.
Full textAbstract:
Maximum entropy network ensembles have been very successful in modelling sparse network topologies and in solving challenging inference problems. However the sparse maximum entropy network models proposed so far have fixed number of nodes and are typically not exchangeable. Here we consider hierarchical models for exchangeable networks in the sparse limit, i.e., with the total number of links scaling linearly with the total number of nodes. The approach is grand canonical, i.e., the number of nodes of the network is not fixed a priori: it is finite but can be arbitrarily large. In this way the grand canonical network ensembles circumvent the difficulties in treating infinite sparse exchangeable networks which according to the Aldous-Hoover theorem must vanish. The approach can treat networks with given degree distribution or networks with given distribution of latent variables. When only a subgraph induced by a subset of nodes is known, this model allows a Bayesian estimation of the network size and the degree sequence (or the sequence of latent variables) of the entire network which can be used for network reconstruction.
14
Li, Yifan. "Parameter Recovery in Erds-Rnyi Graphs via Maximum Likelihood Estimations." Theoretical and Natural Science 105, no. 1 (2025): None. https://doi.org/10.54254/2753-8818/2025.23351.
Full textAbstract:
This study investigates the feasibility of using maximum likelihood estimation to recover the connection probability parameter in the Erdos Renyi graph model. In this model every possible edge between nodes is assumed to appear with the same probability, providing a simplified mathematical description of network structure. By deriving the probability model for the occurrence of edges in a random graph and then develop an estimation formula based on the maximum likelihood principle. A series of simulations are conducted on graphs with a fixed number of nodes and various connection probabilities. The connection probability is estimated by comparing the actual number of observed edges with the maximum number of possible edges. The simulation results indicate that when the connection probability is high the network tends to be dense and the estimated value closely matches the true value. In contrast when the connection probability is low the estimated value is more affected by random fluctuations although it still reflects the basic characteristics of the network. The findings provide theoretical support for parameter estimation in both social and computer networks and lay the foundation for further studies on parameter recovery in more complex network models.
15
Ambrosio, Maria, Bruno Perotti, Alda Battini, et al. "Surgeon–Pathologist Team Approach Dramatically Affects Lymph Nodes Detection and Improves Patients’ Short-Term Outcome." Cancers 14, no. 4 (2022): 1034. http://dx.doi.org/10.3390/cancers14041034.
Full textAbstract:
The downstaging of gastric cancer has recently gained particular attention in the field of gastric cancer surgery. The phenomenon is mainly due to an inappropriate sampling of lymph nodes during standard lymphadenectomy. Hence, collection of the maximum number of lymph nodes is a critical factor affecting the outcome of patients. None of the techniques proposed so far have demonstrated a real efficiency in increasing the number of identified lymph nodes. To harvest the maximum number of lymph nodes, we designed a protocol for on-site macroscopic evaluation and sampling of lymph nodes according to the Japanese Gastric Cancer Association protocol. The procedure was carried out by a surgeon/pathologist team in the operating room. We enrolled one hundred patients, 50 of whom belonged to the study group and 50 to a control group. The study group included patients who underwent lymph node dissection following the proposed protocol; the control group encompassed patients undergoing standard procedures for sampling. We compared the number and maximum diameter of lymph nodes collected in both groups, as well as some postoperative variables, the 30-day mortality and the overall survival. In the study group, the mean number of lymph nodes harvested was higher than the control one (p = 0.001). Moreover, by applying the proposed technique, we sampled lymph nodes with a very small diameter, some of which were metastatic. Noticeably, no difference in terms of postoperative course was identified between the two groups, again supporting the feasibility of an extended lymphadenectomy. By comparing the prognosis of patients, a better overall survival (p = 0.03) was detected in the study group; however, to date, no long-term follow-up is available. Interestingly, patients with metastasis in node stations number 8, 9, 11 or with skip metastasis, experienced a worse outcome and died. Based on our preliminary results, the pathologist/surgeon team approach seems to be a reliable option, despite of a slight increase in sfaff workload and technical cost. It allows for the harvesting of a larger number of lymph nodes and improves the outcome of the patients thanks to more precise staging and therapy. Nevertheless, since a higher number of patients are necessary to confirm our findings and assess the impact of this technique on oncological outcome, our study could serve as a proof-of-concept for a larger, multicentric collaboration.
16
Bhattacharya, Partha Pratim, Shilpi Gupta, and Nupur Pal. "Determination of Optimal Number of Relays Using a New Energy Model for WSN." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 4, no. 2 (2018): 572–79. http://dx.doi.org/10.24297/ijct.v4i2c1.4174.
Full textAbstract:
Wireless Sensor Networks are proving themselves as a boon to the surroundings and its deployment is a prominent area to be considered for minimum energy consumption. In this paper, we have considered deployment of a sensor grid network for 36 and 100 number of sensor nodes. Diagonally opposite nodes are considered to be source and destination. Using a modified energy model, the energy consumption for direct path and that with different number of relays are calculated. The maximum distance up to which direct transmission is possible and the number of required relays for higher transmission distances are then found out.
17
Jiang, Dexia, and Leilei Li. "Node Selection Algorithm for Network Coding in the Mobile Wireless Network." Symmetry 13, no. 5 (2021): 842. http://dx.doi.org/10.3390/sym13050842.
Full textAbstract:
In the multicast network, network coding has proven to be an effective technique to approach maximum flow capacity. Although network coding has the advantage of improving performance, encoding nodes increases the cost and delay in wireless networks. Therefore, minimizing encoding nodes is of great significance to improve the actual network’s performance under a maximum multicast flow. This paper seeks to achieve partial improvements in the existing selection algorithm of encoding nodes in wireless networks. Firstly, the article gives the condition for an intermediate node to be an encoding node. Secondly, a maximum flow algorithm, which depends on the depth-first search method, is proposed to optimize the search time by selecting the larger augmentation flow in each step. Finally, we construct a random graph model to simulate the wireless network and the maximum multicast flow algorithm to analyze the statistical characteristics of encoding nodes. This paper aims at the optimization to find the minimal number of required coding nodes which means the minimum energy consumption. Meanwhile, the simulations indicate that the curve of coding nodes tends to be a geometric distribution, and that the curve of the maximum flow tends to be symmetric as the network scale and the node covering radius increase.
18
WENG, WEN GUO, SHUN JIANG NI, HONG YONG YUAN, and WEI CHENG FAN. "MODELING THE DYNAMICS OF DISASTER SPREADING FROM KEY NODES IN COMPLEX NETWORKS." International Journal of Modern Physics C 18, no. 05 (2007): 889–901. http://dx.doi.org/10.1142/s0129183107010619.
Full textAbstract:
In this paper, we present the dynamics of disaster spreading from key nodes in complex networks. The key nodes have maximum and minimum out-degree nodes, which show important in spreading disaster. This paper considers directed Erdös–Rényi, scale-free and small-world networks. Using the model considering the common characteristics of infrastructure and lifeline networks, i.e., self-healing function and disaster spreading mechanism, we carry out simulations for the effects of the recovery time parameter and the time delay on the recovery rate and the number of damaged nodes. Simulation results show some typical disaster spreading characteristics, e.g., a non-equilibrium phase transition in the parameter space, disturbance from the maximum out-degree nodes resulting in more damaged effect, etc.
19
Yang, Yunyun, and Gang Xie. "Maximum Matchings of a Digraph Based on the Largest Geometric Multiplicity." Mathematical Problems in Engineering 2016 (2016): 1–7. http://dx.doi.org/10.1155/2016/4702387.
Full textAbstract:
Matching theory is one of the most forefront issues of graph theory. Based on the largest geometric multiplicity, we develop an efficient approach to identify maximum matchings in a digraph. For a given digraph, it has been proved that the number of maximum matched nodes has close relationship with the largest geometric multiplicity of the transpose of the adjacency matrix. Moreover, through fundamental column transformations, we can obtain the matched nodes and related matching edges. In particular, when a digraph contains a cycle factor, the largest geometric multiplicity is equal to one. In this case, the maximum matching is a perfect matching and each node in the digraph is a matched node. The method is validated by an example.
20
Tang, Jiang-Hua, Tahira Noreen, Muhammad Salman, Masood Ur Rehman, and Jia-Bao Liu. "k , l -Anonymity in Wheel-Related Social Graphs Measured on the Base of k -Metric Antidimension." Journal of Mathematics 2021 (September 16, 2021): 1–13. http://dx.doi.org/10.1155/2021/8038253.
Full textAbstract:
For the study and valuation of social graphs, which affect an extensive range of applications such as community decision-making support and recommender systems, it is highly recommended to sustain the resistance of a social graph G to active attacks. In this regard, a novel privacy measure, called the k , l -anonymity, is used since the last few years on the base of k -metric antidimension of G in which l is the maximum number of attacker nodes defining the k -metric antidimension of G for the smallest positive integer k . The k -metric antidimension of G is the smallest number of attacker nodes less than or equal to l such that other k nodes in G cannot be uniquely identified by the attacker nodes. In this paper, we consider four families of wheel-related social graphs, namely, Jahangir graphs, helm graphs, flower graphs, and sunflower graphs. By determining their k -metric antidimension, we prove that each social graph of these families is the maximum degree metric antidimensional, where the degree of a vertex is the number of vertices linked with that vertex.
21
ALT, HELMUT, ULRICH FUCHS, and KLAUS KRIEGEL. "On the Number of Simple Cycles in Planar Graphs." Combinatorics, Probability and Computing 8, no. 5 (1999): 397–405. http://dx.doi.org/10.1017/s0963548399003995.
Full textAbstract:
Let C(G) denote the number of simple cycles of a graph G and let C(n) be the maximum of C(G) over all planar graphs with n nodes. We present a lower bound on C(n), constructing graphs with at least 2.28n cycles. Applying some probabilistic arguments we prove an upper bound of 3.37n.We also discuss this question restricted to the subclasses of grid graphs, bipartite graphs, and 3-colourable triangulated graphs.
22
P, Kowsalya, and Vijayalakshmi D. "On Radio k – Chromatic Number for Mycielski of Some Graphs." Indian Journal of Science and Technology 17, no. 39 (2024): 4129–37. https://doi.org/10.17485/IJST/v17i39.2315.
Full textAbstract:
Abstract <strong>Objectives:</strong> In radio networks, the main difficulty is managing the radio spectrum, assigning radio frequencies to transmitters optimally without any interferences. This study aims to find the smallest span of Mycielski of some graphs, the maximum color assigned to any node is called span. <strong>Methods :</strong> This study focused on the problem of reducing interference by modeling it with a radio k - coloring problem on graphs. Where transmitters are modeled as nodes in a graph, with edges connecting nodes that represent transmitters in close proximity to one another. For a graph , with node set , edge set and an integer , a radio k - coloring of is a function satisfying the condition for any two nodes and , where is the distance between and in . The radio k - coloring of , is the maximum color assigned to any node of and it is denoted by . The radio k -chromatic number of is the minimum value of taken over all radio k - coloring of and it is denoted by . <strong>Findings:</strong> This study obtained the radio k-chromatic number for Mycielski of some graphs for and 3 <strong>Novelty:</strong> To solve the channel assignment problem in radio transmitters, the interference graph is developed, and the channel assignment has been converted into a graph coloring. Reducing the interference by a radio k - coloring problem will motivate many researchers to find the radio k - coloring in various graphs. <strong>Keywords</strong>: Radio k – Coloring, Mycielski graph, Double Star graph, Triple Star graph, Sunlet graph, Helm graph and Closed Helm graph
23
Bajorski, Peter, and Michael Kurdziel. "A Markov-Chain-Based Model for Group Message Distribution in Connected Networks." International Journal of Data Analytics 1, no. 2 (2020): 13–29. http://dx.doi.org/10.4018/ijda.2020070102.
Full textAbstract:
The authors introduce a stochastic Markov-chain-based model for the recursive distribution of a message from the source node to all remaining nodes. This recursive message distribution process produces a spanning tree topology over the connected network of nodes. The model has five input parameters: (1) the number of nodes n in the group, (2) the maximum number of child nodes, (3) the number of sub-message components needed to transfer a single message, (4) the probability p1 that two adjacent nodes in a network initiate a connection (edge) in the spanning tree, and (5) the probability p2 that each sub-message component is transferred correctly between nodes. The authors derive a closed-form expression for the expected group message distribution time, measured in discrete-time epochs, that is verified via Monte Carlo simulations. Since both the closed-form formulas and the Monte Carlo simulations are computationally intensive for networks with a large number of nodes n, this paper derives a reliable approximate formula for the expected distribution time for networks as large as n = 1000.
24
Palios, Leonidas. "Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments." Journal of Algorithms 22, no. 1 (1997): 57–92. http://dx.doi.org/10.1006/jagm.1995.0798.
Full text
25
K. Kathirvel, S. Hemalatha. "A Multi-Metric Trust-based Approach for Detecting Black Hole Attacks in Wireless Sensor Networks using K-Means Clustering." Power System Technology 49, no. 1 (2025): 1804–32. https://doi.org/10.52783/pst.1741.
Full textAbstract:
In Wireless Sensor Networks (WSNs), securing communication against threats like blackhole attacks is essential for maintaining the integrity of the network. This paper proposes a system where the Cluster Head (CH) monitors and evaluates node behavior using manifold metrics: Packet Forwarding Behavior (PFB), Acknowledgment Ratio (AR), Reputation Score (RS), Cooperation Ratio (CR), and Energy Deviation (ED). These metrics help detect abnormal activities, especially packet dropping associated with blackhole attacks. The PFB measures how effectively a node forwards packets, while AR gauges the node's reliability in sending acknowledgments for forwarded packets. The RS is a long-term metric combining AR and PFB to track a node's trustworthiness over time. CR assesses a node's cooperative behavior with neighboring nodes, and ED evaluates energy usage, identifying anomalies in power consumption that could signal malicious activity. To classify nodes as either normal or potentially malicious (blackhole), a K-means clustering algorithm is employed. Nodes are grouped based on the five metrics into two clusters: one for normal nodes and another for suspicious nodes. The algorithm iteratively adjusts the cluster centroids using Euclidean distance until stable clusters are formed or a maximum number of iterations is reached. By applying this approach, the system effectively differentiates between normal and blackhole nodes, improving the security and resilience of WSNs against attacks. A proof of mathematical has proven the applicability of the proposed model. The simulation results shows better result compare with other existing models in terms of performance metrics. The proposed model has effectively detect the balckhole nodes compare with other models. DOI : https://doi.org/10.52783/pst.1741
26
V, Kanchana Devi, and Ganesan R. "A GENERIC TRUST MANAGEMENT FRAMEWORK FOR HETEROGENEOUS SENSORS IN CYBER PHYSICAL SYSTEMS." Asian Journal of Pharmaceutical and Clinical Research 10, no. 13 (2017): 176. http://dx.doi.org/10.22159/ajpcr.2017.v10s1.19631.
Full textAbstract:
Objective: “Wireless Technology” is the magic word in today’s era. In which, Cyber Physical Systems (CPS) is the booming world which binds the physical world and cyber world together. The CPS is also called as Safety Critical System because of the human life involvement. In this emerging technology, lots of heterogeneous sensors are involved and each sensor will play an important role. If something goes wrong with sensor or sensor data. It will definitely affect the human life involved in it.Methods: In this paper, we proposed a generic trust management framework for heterogeneous sensors which will detect the sensor data falsification (Data Integrity), faulty sensor reading, and packet dropping nodes (Selfish Nodes) through rules and rating concept.Results: The efficiency of the proposed framework is evaluated with the help of Network Simulator 2 (NS-2.35). The maximum numbers of untrusted nodes are identified in point 0.40 than Multi-Level Trust Framework for Wireless Sensor Network (MTF-WSN) and Framework for Packet-Droppers Mitigation (FPDM). It is also evident that Trust Management Framework for Cyber Physical Systems (TRMF-CPS) identifies maximum number of untrusted nodes in the detection range of 0.35 and 0.45. Therefore, 0.35 and 0.45 are considered as maximum and minimum threshold points for effective untrusted nodes. Conclusion:The experimentation results and comparative study shows that, our trust management framework will easily detected sensors which misbehave.
27
Ariina, M. M. Shulee, S. P. Kanaujia, C. S. Maiti, Pauline Alila, Malini B. Sharma, and Animesh Sarkar. "Correlation and Path Coefficient Analysis in chowchow (Sechium edule (Jacq.) Swartz.)." Ecology, Environment and Conservation 28 (2022): 342–47. http://dx.doi.org/10.53550/eec.2022.v28i07s.056.
Full textAbstract:
Correlation and path analysis were carried out in twenty diverse genotypes of chow-chow collected from different North Eastern states of India. Correlation studies indicated that fruit yield per plant was positively and significantly correlated with days to first flowering, number of nodes at first fruit set, length of internodes, length of leaf, width of leaf, petiole length, number of fruits per plant, fruit length, fruit weight, fruit diameter which indicated the importance of these traits in selection for yield. Path analysis revealed that maximum positive direct effect on fruit yield per plant was imposed by fruit weight, number of fruits per plant and number of nodes at genotypic level. This indicated that these are the real independent characters and have maximum contribution towards increase in fruit yield per plant.
28
Mond, David. "Looking at bent wires – -codimension and the vanishing topology of parametrized curve singularities." Mathematical Proceedings of the Cambridge Philosophical Society 117, no. 2 (1995): 213–22. http://dx.doi.org/10.1017/s0305004100073060.
Full textAbstract:
Projecting a knot onto a plane – or, equivalently, looking at it through one eye – one sees a more or less complicated plane curve with a number of crossings (‘nodes’); viewing it from certain positions, some other more complicated singularities appear. If one spends a little time experimenting, looking at the knot from different points of view, then provided the knot is generic, one can convince oneself that there is only a rather short list of essentially distinct local pictures (singularities) – see Fig. 3 below. All singularities other than nodes are unstable: by moving one's eye slightly, one can make them break up into nodes. For each type X the following two numbers can easily be determined experimentally:1. the codimension in ℝ3 of the set View(X) of centres of projection (viewpoints) for which a singularity of type X appears, and2. the maximum number of nodes n into which the singularity X splits when the centre of projection is moved.
29
Minet, Pascale, and Yasuyuki Tanaka. "Optimal Number of Message Transmissions forProbabilistic Guarantee of Latency in the IoT." Sensors 19, no. 18 (2019): 3970. http://dx.doi.org/10.3390/s19183970.
Full textAbstract:
The Internet of Things (IoT) is now experiencing its first phase of industrialization. Industrial companies are completing proofs of concept and many of them plan to invest in automation, flexibility and quality of production in their plants. Their use of a wireless network is conditioned upon its ability to meet three Key Performance Indicators (KPIs), namely a maximum acceptable end-to-end latency L, a targeted end-to-end reliability R and a minimum network lifetime T. The IoT network has to guarantee that at least R % of messages generated by sensor nodes are delivered to the sink with a latency ≤L, whereas the network lifetime is at least equal to T. In this paper, we show how to provide the targeted end-to-end reliability R by means of retransmissions to cope with the unreliability of wireless links. We present two methods to compute the maximum number of transmissions per message required to achieve R. M F a i r is very easy to compute, whereas M O p t minimizes the total number of transmissions necessary for a message to reach the sink. M F a i r and M O p t are then integrated into a TSCH network with a load-based scheduler to evaluate the three KPIs on a generic data-gathering application. We first consider a toy example with eight nodes where the maximum number of transmissions M a x T r a n s is tuned per link and per flow. Finally, a network of 50 nodes, representative of real network deployments, is evaluated assuming M a x T r a n s is fixed. For both TSCH networks, we show that M O p t provides a better reliability and a longer lifetime than M F a i r , which provides a shorter average end-to-end latency. M O p t provides more predictable end-to-end performances than Kausa, a KPI-aware, state-of-the-art scheduler.
30
Tossa, Frantz, Wahabou Abdou, Keivan Ansari, Eugène C. Ezin, and Pierre Gouton. "Area Coverage Maximization under Connectivity Constraint in Wireless Sensor Networks." Sensors 22, no. 5 (2022): 1712. http://dx.doi.org/10.3390/s22051712.
Full textAbstract:
Wireless sensor networks (WSNs) have several important applications, both in research and domestic use. Generally, their main role is to collect and transmit data from an ROI (region of interest) to a base station for processing and analysis. Therefore, it is vital to ensure maximum coverage of the chosen area and communication between the nodes forming the network. A major problem in network design is the deployment of sensors with the aim to ensure both maximum coverage and connectivity between sensor node. The maximum coverage problem addressed here focuses on calculating the area covered by the deployed sensor nodes. Thus, we seek to cover any type of area (regular or irregular shape) with a predefined number of homogeneous sensors using a genetic algorithm to find the best placement to ensure maximum network coverage under the constraint of connectivity between the sensors. Therefore, this paper tackles the dual problem of maximum coverage and connectivity between sensor nodes. We define the maximum coverage and connectivity problems and then propose a mathematical model and a complex objective function. The results show that the algorithm, called GAFACM (Genetic Algorithm For Area Coverage Maximization), covers all forms of the area for a given number of sensors and finds the best positions to maximize coverage within the area of interest while guaranteeing the connectivity between the sensors.
31
Yadav, Murlee, D. B. Singh, Rashmi Chaudhary, and Devi Singh. "Genetic Variability in Bitter Gourd (Momordica charantia L.)." Journal of Horticultural Sciences 3, no. 1 (2008): 35–38. http://dx.doi.org/10.24154/jhs.v3i1.591.
Full textAbstract:
The variance analysis for 17 plant characters showed significant differences. Maximum vine length was recorded in IC-85635A. Significantly higher number of primary branches per vine and internodal length were observed in IC-85639. Maximum number of nodes was observed in JMC-4. Significantly minimum number of days for first appearance of male flower and maximum fruit length, fruit width, yield per vine, yield per plot, yield/ha were recorded in MC-84. Highest number of fruits per vine was recorded in GY-I and minimum powdery mildew infestation was observed in JMC-22.
32
Chamin, A. A., M. O. Kolbanev, D. A. Semenov, and E. A. Sbitnev. "Analysis of Energy Consumption of Telecommunication Network Nodes." LETI Transactions on Electrical Engineering & Computer Science 17, no. 4 (2024): 61–70. http://dx.doi.org/10.32603/2071-8985-2024-17-4-61-70.
Full textAbstract:
The paper considers the issue of energy consumption and energy efficiency improvement of telecommunication network nodes of various characteristics. A number of experiments was conducted on actual microcontrollers used in industry for monitoring and automating processes, as well as a virtual simulation experiment for a wireless sensor network microcontroller. A virtual model was developed to assess the efficiency of energy consumption. The most energy-intensive operation modes of the studied devices were identified. Calculations on energy consumption and maximum battery life of these devices are given. Based on the data obtained, a number of methods for improving the energy efficiency of telecommunication network nodes are proposed.
33
Jain, Tapan Kumar, Davinder Singh Saini, and Sunil Vidya Bhooshan. "Cluster Head Selection in a Homogeneous Wireless Sensor Network Ensuring Full Connectivity with Minimum Isolated Nodes." Journal of Sensors 2014 (2014): 1–8. http://dx.doi.org/10.1155/2014/724219.
Full textAbstract:
The research work proposes a cluster head selection algorithm for a wireless sensor network. A node can be a cluster head if it is connected to at least one unique neighbor node where the unique neighbor is the one that is not connected to any other node. If there is no connected unique node then the CH is selected on the basis of residual energy and the number of neighbor nodes. With the increase in number of clusters, the processing energy of the network increases; hence, this algorithm proposes minimum number of clusters which further leads to increased network lifetime. The major novel contribution of the proposed work is an algorithm that ensures a completely connected network with minimum number of isolated nodes. An isolated node will remain only if it is not within the transmission range of any other node. With the maximum connectivity, the coverage of the network is automatically maximized. The superiority of the proposed design is verified by simulation results done in MATLAB, where it clearly depicts that the total numbers of rounds before the network dies out are maximum compared to other existing protocols.
34
Guo, Mingyu, Jialiang Li, Aneta Neumann, Frank Neumann, and Hung Nguyen. "Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 9 (2022): 9360–67. http://dx.doi.org/10.1609/aaai.v36i9.21167.
Full textAbstract:
Active Directory is the default security management system for Windows domain networks. We study the shortest path edge interdiction problem for defending Active Directory style attack graphs. The problem is formulated as a Stackelberg game between one defender and one attacker. The attack graph contains one destination node and multiple entry nodes. The attacker's entry node is chosen by nature. The defender chooses to block a set of edges limited by his budget. The attacker then picks the shortest unblocked attack path. The defender aims to maximize the expected shortest path length for the attacker, where the expectation is taken over entry nodes. We observe that practical Active Directory attack graphs have small maximum attack path length and are structurally close to trees. We first show that even if the maximum attack path length is a constant, the problem is still w[1]-hard with respect to the defender's budget. Having a small maximum attack path length and a small budget is not enough to design fixed-parameter algorithms. If we further assume that the number of entry nodes is small, then we derive a fixed-parameter tractable algorithm. We then propose two other fixed-parameter algorithms by exploiting the tree-like features. One is based on tree decomposition and requires a small tree width. The other assumes a small number of splitting nodes (nodes with multiple out-going edges). Finally, the last algorithm is converted into a graph convolutional neural network based heuristic, which scales to larger graphs with more splitting nodes.
35
T., Swathi, and Baritha Begum M. "Maximum Connected Load Balancing Cover Tree Algorithm for Wireless Sensor Network." Journal of Switching Hub 3, no. 3 (2018): 1–5. https://doi.org/10.5281/zenodo.1492963.
Full textAbstract:
<em>In wireless sensor network the main problem is in the network lifetime, power transmission, energy consumption, speed and bandwidth for transmitting the packets and another problem is that the sink node can connect only with the limited nodes if more number of nodes is connected means then there may be occurrence of traffic and the data information can be eliminated. In order to overcome this problem maximum connected load balancing cover tree (MCLCT) algorithm is used. In various studies it is observed that the MCLCT has more network lifetime, power transmission and energy consumption when compared to the other methods and also to solve the optimization problem simulated annealing algorithm is used to transmit the data which form minimum movement in wireless sensor network and which can achieve both target coverage (TCOV) and network connectivity (NCON).</em>
36
Bhandari, Phanindra Prasad, and Shree Ram Khadka. "Non-conserving Flow Aspect of Maximum Dynamic Flow Problem." Journal of the Institute of Engineering 14, no. 1 (2018): 107–14. http://dx.doi.org/10.3126/jie.v14i1.20073.
Full textAbstract:
Shifting as many people as possible from disastrous area to safer area in a minimum time period in an efficient way is an evacuation planning problem (EPP). Modeling the evacuation scenarios reflecting the real world characteristics and investigation of an efficient solution to them have become a crucial due to rapidly increasing number of natural as well as human created disasters. EPPs modeled on network have been extensively studied and the various efficient solution procedures have been established where the flow function satisfies the flow conservation at each intermediate node. Besides this, the network flow problem in which flow may not be conserved at nodes necessarily could also be useful to model the evacuation planning problem. This paper proposes an efficient solution procedure for maximum flow evacuation planning problem of later kind on a single-source-single-sink dynamic network with integral arc capacities with holding capability of flow (evacuees) in the temporary shelter at intermediate nodes. Journal of the Institute of Engineering, 2018, 14(1): 107-114
37
Nurwarsito, Heru, and Ervani Sofyana Putra. "Analysis of OLSR Routing Protocol Performance Based on Gauss-Markov Mobility and Random Walk in Mobile Ad-Hoc Network (MANET)." Journal of Information Technology and Computer Science 7, no. 3 (2023): 183–95. http://dx.doi.org/10.25126/jitecs.73243.
Full textAbstract:
MANET is included in the network without infrastructure from a collection of nodes that are interconnected to communicate. Routing protocol performance is a measure of the performance of how the ability of the routing protocol works. A routing protocol is needed where the routing table information must be kept up to date at regular intervals such as Optimized Link State Routing (OLSR). MANET is dynamic, so node mobility increases the risk of node failure. Gauss-Markov and random walk are mobility that has a significant impact on the performance of the routing protocol. This study analyzes the effect of mobility on the OLSR protocol in MANET topology using Network Simulator 3.25 with packet delivery ratio (PDR) parameters, end to end delay and routing overhead. The test scenario is done by varying the number of nodes as many as 20, 40, 60, and 80 nodes as well as the minimum and maximum speed of nodes 0-5 m/s, 5-10 m / s, 10-15 m/s, and 15-20 m/s. PDR results show the highest value on Gauss-Markov with 80 nodes and a minimum and maximum speed of 10-15 m/s of 69.36%. The best end to end delay results is seen in Gauss-Markov with 20 nodes and a minimum and maximum speed of 15-20 m/s of 10.22 ms. The routing overhead results display the best value on a random walk with 20 nodes and a minimum and maximum speed of 0-5 m/s of 8100 packets.
38
Gill, Jasper, Richard Lovegrove, Katrien Naessens, et al. "Sentinel Lymph Node Biopsy in Breast Cancer: An Analysis of the Maximum Number of Nodes Requiring Excision." Breast Journal 17, no. 1 (2010): 3–8. http://dx.doi.org/10.1111/j.1524-4741.2010.01019.x.
Full text
39
Novikov, Alexander Nikolaevich, and Svetlana Anatolievna Zhestkova. "SOLVING THE PROBLEM OF ROUTING WITH RESTRICTIONS ON THE SIZE OF CARGO AND THE NUMBER OF POINTS." World of transport and technological machines 2(83), no. 4 (2023): 70–76. http://dx.doi.org/10.33979/2073-7432-2023-4-2(83)-70-76.
Full textAbstract:
The task of transporting cargo by road is considered. The procedure for designing the routing task when limiting the number of units of cargo batches and the number of points where it is necessary to unload it is presented. For calculation, the method of dummy nodes and branches is used, which allows you to visit nodes several times. As a result, several ring routes are replaced by the optimal one that passes through dummy bases. Constraints are taken into account when reciprocating along the branches of the decision tree by blocking the cell with the maximum rating. A numerical example is given according to the developed calculation method.
40
Pyrih, Ya, and Yu Pyrih. "INVESTIGATION OF SENSOR NODE PLACEMENT ON A PLANE USING A GENETIC ALGORITHM." Information and communication technologies, electronic engineering 5, no. 1 (2025): 82–88. https://doi.org/10.23939/ictee2025.01.082.
Full textAbstract:
The study focuses on investigating the efficiency of a genetic algorithm-based sensor node placement method for a random topology. The primary objective is to identify a node configuration that minimizes the number of "blind spots" and ensures the most efficient coverage of a given area. Random node placement is characterized by the potential for each node to establish connections with other nodes, resulting in a complex search space. For this study, 25 nodes with identical sensing radii were analyzed. Based on the authors' research and the use of custom-developed software, optimal parameter values for the genetic algorithm were determined, and simulation results were presented. The effectiveness of the sensor placement method was evaluated with an increasing number of generations, reflecting the algorithm's ability to identify optimal solutions. In scenarios with 25 generations, there were numerous overlapping zones between nodes. However, as the number of generations increased, a more optimal node placement was observed. To analyze the algorithm's performance, the relationship between the fitness function value and the number of generations was used. The results demonstrated that the maximum fitness function value increased most significantly during the initial phase of the evolutionary process. Subsequently, the quality of the solutions (maximum and average fitness values) improved substantially with an increasing number of generations. The most optimal placement of 25 nodes with a sensing radius of 30 meters on a 100 × 100 m plane was achieved with 152 generations. A chromosome representing the optimal placement of the 25 nodes on the studied area was provided. To achieve synergy between topology and the routing algorithm, a route was constructed between two sensor nodes. The distance matrix for the nodes, a graph model of the network, and the generated route were presented. The research findings hold practical significance for the design and operation of sensor networks with arbitrary topology, enhancing their reliability and performance under uncertain node placement conditions.
41
Babchuk, Serhii, and Iryna Babchuk. "CLASSIFICATION OF SPECIALIZED DIGITAL NETWORKS, WHICH ARE BASED ON THE CAN NETWORK, BY THE NUMBER OF NODES IN SEGMENT." Sworld-Us Conference proceedings, usc17-01 (March 30, 2020): 28–31. http://dx.doi.org/10.30888/2709-2267.2023-17-01-024.
Full textAbstract:
The analysis of specialized digital networks, which were created on the basis of the CAN network, was carried out. The maximum number of nodes that segment of the network, which is created on the basis of the CAN network, can have is determined. In a CAN
42
Farooq, Muhammad Omar, Bilal Umair, Sohail Saqib Chatha, Rashid Hasnain, Raheel Khan, and Farhan Ullah. "Oncological Outcomes after Minimally Invasive Oesophagectomy for Oesophageal Carcinoma: Experience from a High Volume Centre in Pakistan." Pakistan Armed Forces Medical Journal 75, SUPPL-4 (2025): S553—S557. https://doi.org/10.51253/pafmj.v75isuppl-4.9155.
Full textAbstract:
Objective: To share the experience of minimally invasive oesophagectomy for oesophageal carcinoma in terms of oncological clearance and number of lymph nodes resected in our setup, being one of the high volume centres in country. Study Design: Prospective observational study. Place and Duration of Study: Department of Thoracic surgery, Combined Military Hospital, Rawalpindi Pakistan, from Jan 2018 to Dec 2021. Methodology: A total number of 83 patients were included in the study who had a histological diagnosis of carcinoma of oesophagus and underwent minimally invasive oesophagectomy. The resection samples were subjected to histopathological analysis at Armed Forces Institute of Pathology. A Pro forma was designed to record all the demographic information as well as information regarding histological diagnosis, margin clearance, number of lymph nodes retrieved and one-year follow-up analysis. Results: A total of 83 minimally invasive oesophagectomies were performed for carcinoma of oesophagus. Histopathology report confirmed clearance margin and R0 resection in 80 patients (96.38%) while in 3 patients (3.61%) involvement of radial resection margin was found. Lymph nodes were retrieved with a minimum number of 13 and maximum number of 33 lymph nodes. Mean number of lymph nodes retrieved was 22.23+3.68. (Stations of lymph node removed including abdominal nodes). Conclusion: Satisfactory oncological clearance and adequate lymphadenectomy can be performed with minimally invasive oesophagectomy when performed in experienced hands.
43
Acampora, Anthony S., Ralph A. Gholmieh, and Srikanth Krishnamurthy. "On tolerating single link, double link, and nodal failures in symmetric grid networks." Journal of High Speed Networks 11, no. 1 (2002): 23–44. https://doi.org/10.3233/hsn-2002-213.
Full textAbstract:
In this paper, we consider a symmetric grid network consisting of N distinct nodes. The number of allowable calls (either the number of circuit switched calls or the maximum number of virtual connections such that QoS objectives are maintained) between any two nodes of the network is assumed to be a constant. We first determine this constant assuming that the network is fully loaded. Then, we find the maximum additional capacity needed on each link such that single link, and double link failures can be tolerated by rerouting calls around failed links. Results show that the maximum additional capacity needed to recover from any single link, double link, or single node failure, with no loss of connections (except for those connections terminating at a failed node) scales as ${1/\sqrt{(N)}}$ . Thus, we conclude that rerouting, combined with an admission policy which blocks new call attempts such that a fraction of capacity proportional to ${1/\sqrt{(N)}}$ is reserved for failure recovery, provides totally failsafe operation in the presence of such failure events.
44
Zhang, Ziyong, Tao Dong, Jie Yin, et al. "A Particle Swarm Optimization-Based Queue Scheduling and Optimization Mechanism for Large-Scale Low-Earth-Orbit Satellite Communication Networks." Sensors 25, no. 4 (2025): 1069. https://doi.org/10.3390/s25041069.
Full textAbstract:
The spatial topology of large-scale low-Earth-orbit satellite communication networks is dynamically time-variant, and the load on the output ports of network nodes is continuously changing. The lengths and numbers of output port queues at each network node can affect the packet loss rate and end-to-end latency of traffic flows. In order to provide high-quality satellite communication services, it is necessary to schedule and optimize the lengths and numbers of queues used for transmitting time-sensitive traffic flows at each node’s output port to achieve the best deterministic transmission performance. This paper introduces a queue scheduling optimization mechanism based on the Particle Swarm Optimization algorithm (PSO-QSO) for large-scale low-Earth-orbit satellite communication networks. This method analyzes the relevant parameters of various traffic flows transmitted through the network and calculates the maximum time-sensitive business load within network nodes. It applies the Particle Swarm Optimization algorithm to calculate the optimal solution for the length and number of queues at each node’s output port used for forwarding time-sensitive traffic flows. The mechanism proposed in this paper ensures the deterministic end-to-end transmission of time sensitive traffic in large-scale low-Earth-orbit satellite communication networks and can provide real-time satellite communication services.
45
Maria Diamanti, Nikolaos Fryganiotis, Symeon Papavassiliou, Christos Pelekis, and Eirini Eleni Tsiropoulou. "Minimum collisions assignment in interdependent networked systems via defective colorings." ITU Journal on Future and Evolving Technologies 5, no. 1 (2024): 1–12. http://dx.doi.org/10.52953/jndy5511.
Full textAbstract:
In conjunction with the traffic overload of next-generation wireless communication and computer networks, their resource-constrained nature calls for effective methods to deal with the fundamental resource allocation problem. In this context, the Minimum Collisions Assignment (MCA) problem in an interdependent networked system refers to the assignment of a finite set of resources over the nodes of the network, such that the number of collisions, i.e., the number of interdependent nodes receiving the same resource, is minimized. Given the interdependent networked system's organization in the form of a graph, there already exists a randomized algorithm that converges with high probability to an assignment of resources having zero collisions when the number of resources is larger than the maximum degree of the underlying graph. In this article, differing from the prevailing literature, we investigate the case of a resource-constrained networked system, where the number of resources is less than or equal to the maximum degree of the underlying graph. We introduce two distributed, randomized algorithms that converge in a logarithmic number of rounds to an assignment of resources over the network for which every node has at most a certain number of collisions. The proposed algorithms apply to settings where the available resources at each node are equal to three and two, respectively, while they are executed in a fully-distributed manner without requiring information exchange between the networked nodes.
46
DeCamp, M. M., A. Recht, M. Nikolov, J. C. Flickinger, and J. M. Varlotto. "Extent of lymphadenectomy (LA) and outcome for patients with stage I non-small cell lung cancer (NSCLC)." Journal of Clinical Oncology 25, no. 18_suppl (2007): 7604. http://dx.doi.org/10.1200/jco.2007.25.18_suppl.7604.
Full textAbstract:
7604 Background: It is uncertain if LA affects overall survival (OS) or disease-free survival (DFS) rates for patients with stage I NSCLC and, if performed, what is the minimum number of nodes that should be recovered. Methods: 24,273 patients with stage I NSCLC diagnosed from 1992–2002 underwent a definitive surgical procedure and were included in the SEER data-base. For patients diagnosed from 1998–2002, outcome was examined separately for patients having only N1 (2,683 patients) or N2 nodal (1,019 patients) dissections. Results: For the entire population, LA was associated with an increase in the 5-year OS rate from 41.7% to 58.4% (p <0.0001) and in DFS from 58.4% to 72.9%, compared to not having LA. For patients undergoing only N1 dissection, LA was also associated with significant improvements in OS and DFS, compared to no LA (p=0.056 and 0.043). The maximum difference between those with no LA and those with only N1 dissection was when 11–16 nodes were removed (4-year OS, 40.0% vs. 68.2%; DFS, 40.0% vs. 60.4%). For patients undergoing only N2 dissection, LA was associated with a significant improvement in OS (p=0.045) and a trend for a DFS benefit (p=0.086), with the maximum difference between those with no LA and those with 7–10 nodes removed (4-year OS, 75.0% vs. 77.7%; DFS, 75.0% vs. 85.0%). Those patients undergoing removal of ≥ 11 N2 nodes were found to have a significantly increased risk of death to cardiopulmonary/infectious causes (5.56% vs 1.79%) as compared to those patients having < 11 nodes removed (p = 0.023). Conclusions: LA was associated with increased rates of OS and DFS, compared to no LA. Our results also suggest the minimum number of recovered nodes needed to see the maximum staging accuracy of LA. No significant financial relationships to disclose.
47
Lin, ShengNan, Shuai Li, and Yang Su. "Global Importance Analysis of Nodes Based on Complex Network Theory." Journal of Physics: Conference Series 2290, no. 1 (2022): 012094. http://dx.doi.org/10.1088/1742-6596/2290/1/012094.
Full textAbstract:
Abstract Aiming at the effectiveness of global importance index of nodes in directed network, according to complex network theory, using degree index, intermediate centrality index, proximity centrality index and PageRank algorithm, the importance ranking of nodes is obtained,The global efficiency of the network and the number of nodes in the maximum connected subgraph are used as the criterion to attack the directed network with priority of node importance, analyzing the effectiveness of four indexes to evaluate the global importance of nodes.The global importance of nodes is studied by using the index with high effectiveness. By protecting the nodes with high global importance, the survivability and the overall efficiency of the directed network can be improved.
48
Zhou, Xiaoya, and Qi Zhu. "Optimization Algorithm for AoI-Based UAV-Assisted Data Collection." International Journal of Distributed Sensor Networks 2024 (February 19, 2024): 1–15. http://dx.doi.org/10.1155/2024/6691579.
Full textAbstract:
Regarding the issue of information freshness in systems that aid in data collection using unmanned aerial vehicles (UAVs), a data collection algorithm that is based on freshness and UAV assistance is proposed. Under the limitations of wireless sensor node communication distance and UAV parameters, the optimization problem of minimizing the average spatial correlation age of information (SCAoI) of all nodes in the area is set up. This problem is solved by optimizing the number of clusters, UAV flight trajectories, and the order of data collection from cluster member nodes. The maximum communication distance of the nodes is used as the cluster formation radius, and the maximum-minimum distance clustering algorithm is used to cluster the nodes in the region to obtain the minimum number of clusters. After it has been proven that the trajectory optimization problem in this study is NP-hard, the ant colony algorithm is applied to obtain the minimum flight time and the corresponding trajectory. By using the greedy algorithm to determine the member nodes in the sequence of data collection for a cluster, the instantaneous SCAoI of the UAV arriving at the cluster head is solved. Simulation results show that the proposed algorithm in this paper can effectively improve the freshness of data and reduce the average SCAoI of the system compared with the algorithm in the comparative literature, reducing the average SCAoI by about 61%.
49
Krisnawati, Ayda, Andy Soegianto, Budi Waluyo, and Kuswanto. "Pod shattering incidence in relation to seed dispersal and maximum harvest delay in soybean genotypes." January 2022, no. 16(01):2022 (January 5, 2022): 26–34. http://dx.doi.org/10.21475/ajcs.22.16.01.p2950.
Full textAbstract:
The efforts to minimize the pod shattering incidence in soybean can be done by the use of resistant variety and the determination on the limit of harvest delay. The study aims to evaluate the pod shattering resistance and to determine the maximum limit for harvest delay in soybean. Sixteen soybean genotypes were planted during the dry season 2019. After plants reached the F8 phase, ten randomly sample plants were taken from each plot. The examination for the effect of the harvest delay on the pod shattering incidence was based on the simulation on the pot. The experiment was arranged in a randomized block design with four replications. Pod shattering on each fertile node and seed dispersal were observed for twenty days. The number of fertile nodes, number of pods per fertile node, and pod shattering on the fertile node varied between genotypes. The highest number of pods where found at the third node (7.50a ± 4.26) and fourth node (7.44a ± 4.23) from the lower part of the stem. Pod shattering in the nodes at the lower part of the stem (17 % ± 4.96 %) was higher than in the nodes at the middle (8% ± 6.86%), and upper part of the stem (3% ± 3.79%). The evaluation for pod shattering resistance resulted in two very resistant genotypes, ten resistant, two moderately resistant, one susceptible, and one very susceptible genotype. The seed dispersal of very resistant and resistant genotypes ranged from 0 - 8.55%, the moderately resistant genotypes were 12 – 15%, and the susceptible and very susceptible genotypes were between 23.72 – 48.65%. The harvest delay in resistant or very resistant genotypes could be done 20 days after maturity, meanwhile in susceptible and very susceptible genotypes, the harvest delay should not exceed three days after maturity
50
Guo, Jianyuan, and Limin Jia. "A new algorithm for finding the K shortest paths in a time-schedule network with constraints on arcs." Journal of Algorithms & Computational Technology 11, no. 2 (2016): 170–77. http://dx.doi.org/10.1177/1748301816680470.
Full textAbstract:
Time-schedule network with constraints on arcs (TSNCA) means network with a list of pre-defined departure times for each arc. Compared to past research on finding the K shortest paths in TSNCA, the algorithm in this paper is suitable for networks having parallel arcs with the same direction between two nodes. A node label algorithm for finding the K shortest paths between two nodes is proposed. Temporal-arcs are put into the labels of nodes and arranged by ascending order. The number of temporal-arcs is limited to K in every label of node to improve the effectiveness of the algorithm. The complexity of this algorithm is [Formula: see text], where [Formula: see text] is the maximum number of departure times from a node, [Formula: see text] is the number of arcs in network, and [Formula: see text] is the number of nodes in network. Experiments are carried out on major part of real urban mass transit network in Beijing, China. The result proves that the algorithm is effective and practical.