Analysis and simulation of the dynamic spectrum allocation based on parallel immune optimization in cognitive wireless networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Huixin W
PROVIDER: S-EPMC4164817 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Node placement is one of the basic problems in a Wireless Sensor Network (WSN). During the operation of a WSN, sensor nodes may fail or die suddenly, which may lead to a coverage hole. To solve this problem, the node placement needs to be re-optimized. The dimensions of node placement optimization are high because of the large node number. In view of this defect, a regional optimization dynamic algorithm is put forward. In this paper, the regional optimization problem of node placement is modeled, and a regional optimization dynamic algorithm with a mixed strategy for node placement (MRDA) is proposed. Simulation experiments are carried out for the proposed algorithm and other comparison algorithms. Results of experiments show that the proposed algorithm can greatly reduce the dimensions and narrow the search range, with a significant improvement in the search performance and convergence speed.
| S-EPMC7435444 | biostudies-literature
Project description:Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum-minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms.
| S-EPMC5539723 | biostudies-other
Project description:Wireless cellular networks have become increasingly important in providing data access to cellular users via a grid of cells. Many applications are considered to read data from smart meters for potable water, gas, or electricity. This paper proposes a novel algorithm to assign paired channels for intelligent metering through wireless connectivity, which is particularly relevant due to the commercial advantages that a virtual operator currently provides. The algorithm considers the behavior of secondary spectrum channels assigned to smart metering in a cellular network. It explores spectrum reuse in a virtual mobile operator to optimize dynamic channel assignment. The proposed algorithm exploits the white holes in the cognitive radio spectrum and considers the coexistence of different uplink channels, resulting in improved efficiency and reliability for smart metering. The work also defines the average user transmission throughput and total smart meter cell throughput as metrics to measure performance, providing insights into the effects of the chosen values on the overall performance of the proposed algorithm.
| S-EPMC10143220 | biostudies-literature
Project description:The typical human personal social network contains about 150 relationships including kin, friends, and acquaintances, organized into a set of hierarchically inclusive layers of increasing size but decreasing emotional intensity. Data from a number of different sources reveal that these inclusive layers exhibit a constant scaling ratio of [Formula: see text] While the overall size of the networks has been connected to our cognitive capacity, no mechanism explaining why the networks present a layered structure with a consistent scaling has been proposed. Here we show that the existence of a heterogeneous cost to relationships (in terms of time or cognitive investment), together with a limitation in the total capacity an individual has to invest in them, can naturally explain the existence of layers and, when the cost function is linear, explain the scaling between them. We develop a one-parameter Bayesian model that fits the empirical data remarkably well. In addition, the model predicts the existence of a contrasting regime in the case of small communities, such that the layers have an inverted structure (increasing size with increasing emotional intensity). We test the model with five communities and provide clear evidence of the existence of the two predicted regimes. Our model explains, based on first principles, the emergence of structure in the organization of personal networks and allows us to predict a rare phenomenon whose existence we confirm empirically.
| S-EPMC6099867 | biostudies-other
Project description:Vehicular ad hoc networks (VANETs) are emerging as new research area and attracting an increasing attention from both industry and research communities. In this context, a dynamic resource allocation policy that maximizes the use of available resources and meets the quality of service (QoS) requirement of constraining applications is proposed. It is a combination of a fair packet scheduling policy and a new adaptive QoS oriented call admission control (CAC) scheme based on the vehicle density variation. This scheme decides whether the connection request is to be admitted into the system, while providing fair access and guaranteeing the desired throughput. The proposed algorithm showed good performance in testing in real world environment.
| S-EPMC3925575 | biostudies-other
Project description:Cognitive radio networks (CRN) enable wireless devices to sense the radio spectrum, determine the frequency state channels, and reconfigure the communication variables to satisfy Quality of Service (QoS) needs by reducing energy utilization. In CRN, spectrum sensing is an essential process that is highly challenging and can be addressed by several traditional techniques, such as energy detection, match filtering, etc. For now, the current models' performance is impacted by the comparatively low Signal to Noise Ratio (SNR) of recognized signals and the insignificant quantity of traditional signal samples. This research proposals a new spectral sensing technique for cognitive radio networks (SST-CRN) that addresses the drawbacks of predictable energy detection models. With the use of a deep belief network (DBN), the suggested model contributes to accomplish a nonlinear threshold based on the chicken swarm algorithm (CSA). The proposed DBN enabled SST-CRN technique goes through two phases in a organized process: offline and online. Throughout the offline phase, the DBN model is methodically trained on pre-gathered data, developing the aptitude to identify problematic patterns and examples from the spectral features of the radio environment. This stage involves extensive feature extraction, validation, and model development to ensure that the DBN can professionally represent complicated spectral dynamics. Additionally, online spectrum sensing is conducted during the real communication phase to enable real-time adaptation to dynamic changes in the spectrum environment. Offline spectrum sensing is typically performed during a devoted sensing period before actual communication begins. When combined with DBN's deep learning capabilities and CSO's innate nature-inspired algorithms, a synergistic framework is created that enables CRNs to explore and allocate incidences on their own with astonishing accuracy. The proposed solution considerably improves the spectrum efficiency and resilience of CRNs by harnessing the power of DBN, which leads to more effective resource utilization and less interference. The Simulation results show that our proposed strategy produces more accurate spectrum occupancy assessments. The result parameters such as probability of detection, SNR of -24dB, the SST-CRN perfect has increased a developed Pd of 0.810, whereas the existing methods RMLSSCRN-100 and RMLSSCRN-300 have accomplished a lower Pd of 0.577 and 0.736, respectively. Our deep learning methodology uses convolutional neural networks to automatically learn and adapt to dynamic and complicated radio environments, improving accuracy and flexibility over classic spectrum sensing approaches. Future research might focus on improving CSO algorithms to better optimize the spectrum sensing process, enhancing the reliability of DBN-enabled sensing techniques.
| S-EPMC11309510 | biostudies-literature
Project description:Wireless sensor networks (WSN) are among the most prominent current technologies. Its popularity has skyrocketed because of its capacity to operate in difficult situations. The WSN market encompasses various industries, including building automation, security networks, healthcare systems, logistics, and military operations. Therefore, increasing the energy efficiency of these networks is of utmost importance. Hierarchical topology, which typically uses a clustering methodology, is one of the most well-known methods for WSN energy optimization. To achieve energy efficiency in WSN, hierarchical topology low-energy adaptive clustering hierarchy (LEACH) was first introduced, and this served as the foundation. However, conventional LEACH has several limitations, which have led to extensive research into improving LEACH's efficacy in its current form. The use of particular algorithms and strategies to enhance the functionality of the conventional LEACH protocol forms the basis of ongoing efforts. Utilizing this enhanced LEACH, performance in terms of throughput and network life may be enhanced by concentrating on elements such as cluster head formation and transmission energy consumption. The enhanced LEACH algorithm demonstrates significant improvements in both throughput and network lifetime compared with conventional LEACH. Through rigorous experimentation, it was found that the enhanced algorithm increases the throughput by 25% on average, which is attributed to its dynamic clustering and optimized routing strategies. Furthermore, the network lifetime is extended by approximately 30%, primarily because of enhanced energy efficiency through adaptive clustering and transmission power control.
| S-EPMC11232628 | biostudies-literature
Project description:BackgroundThe ambition of most molecular biologists is the understanding of the intricate network of molecular interactions that control biological systems. As scientists uncover the components and the connectivity of these networks, it becomes possible to study their dynamical behavior as a whole and discover what is the specific role of each of their components. Since the behavior of a network is by no means intuitive, it becomes necessary to use computational models to understand its behavior and to be able to make predictions about it. Unfortunately, most current computational models describe small networks due to the scarcity of kinetic data available. To overcome this problem, we previously published a methodology to convert a signaling network into a dynamical system, even in the total absence of kinetic information. In this paper we present a software implementation of such methodology.ResultsWe developed SQUAD, a software for the dynamic simulation of signaling networks using the standardized qualitative dynamical systems approach. SQUAD converts the network into a discrete dynamical system, and it uses a binary decision diagram algorithm to identify all the steady states of the system. Then, the software creates a continuous dynamical system and localizes its steady states which are located near the steady states of the discrete system. The software permits to make simulations on the continuous system, allowing for the modification of several parameters. Importantly, SQUAD includes a framework for perturbing networks in a manner similar to what is performed in experimental laboratory protocols, for example by activating receptors or knocking out molecular components. Using this software we have been able to successfully reproduce the behavior of the regulatory network implicated in T-helper cell differentiation.ConclusionThe simulation of regulatory networks aims at predicting the behavior of a whole system when subject to stimuli, such as drugs, or determine the role of specific components within the network. The predictions can then be used to interpret and/or drive laboratory experiments. SQUAD provides a user-friendly graphical interface, accessible to both computational and experimental biologists for the fast qualitative simulation of large regulatory networks for which kinetic data is not necessarily available.
| S-EPMC2238325 | biostudies-literature
Project description:The performance of any communication system heavily relies on the efficient routing of interventions. This article addresses the significant issue of routing protocol selection for optimal path determination in networks. Particularly, when wireless communication occurs among mobile nodes with limited resources, such as batteries, the routing problem becomes even more challenging. This article proposes the Fuzzy Control Energy Efficient (FCEE) routing protocol to overcome these challenges. The FCEE protocol combines the Ad-Hoc On-Demand Distance Vector (AODV) protocol with fuzzy logic techniques to enhance network lifetime and performance. The proposed approach introduces a memory-based channel integrated with fuzzy logic methodologies, which effectively restricts the forwarding of unnecessary broadcast packets based on the energy availability of the operating node. Through extensive simulations, demonstrate the promising capabilities of FCEE as a routing protocol for wireless mesh networks. To further assess the effectiveness of the FCEE protocol, the proposed article compares it with two existing routing protocols: AODV and Intelligent Routing AODV (IRAODV). The simulation results shows that the FCEE routing protocol significantly enhances the reliability of the conventional AODV, providing improved link connectivity and longer route lifetimes. Additionally, our proposed protocol enhances the quality of service (QoS) for mesh routing, with an average throughput of 351.374 (Kbps) compared to 90 (Kbps) for IRAODV and 39 (Kbps) for AODV. Moreover, FCEE exhibits superior energy efficiency with an average energy consumption of 14, while IRAODV and AODV consume 40 and 90 joules, respectively. In conclusion, the FCEE routing protocol demonstrates its potential to address the challenges of efficient routing in wireless mesh networks. By leveraging fuzzy logic and integrating it with AODV, FCEE enhances network lifetime, performance, and energy efficiency, making it a promising solution for future wireless communication systems.
| S-EPMC10702716 | biostudies-literature
Project description:In this paper, we propose to combine Orthogonal Frequency Division Multiplexing-Interleave Division Multiple Access (OFDM-IDMA) with Simultaneous Wireless Information and Power Transfer (SWIPT), resulting in SWIPT aided OFDM-IDMA scheme for power-limited sensor networks. In the proposed system, the Receive Node (RN) applies Power Splitting (PS) to coordinate the Energy Harvesting (EH) and Information Decoding (ID) process, where the harvested energy is utilized to guarantee the iterative Multi-User Detection (MUD) of IDMA to work under sufficient number of iterations. Our objective is to minimize the total transmit power of Source Node (SN), while satisfying the requirements of both minimum harvested energy and Bit Error Rate (BER) performance from individual receive nodes. We formulate such a problem as a joint power allocation and splitting one, where the iteration number of MUD is also taken into consideration as the key parameter to affect both EH and ID constraints. To solve it, a sub-optimal algorithm is proposed to determine the power profile, PS ratio and iteration number of MUD in an iterative manner. Simulation results verify that the proposed algorithm can provide significant performance improvement.
| S-EPMC5539895 | biostudies-other