Search Results Heading

MBRLSearchResults

mbrl.module.common.modules.added.book.to.shelf
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
    Done
    Filters
    Reset
  • Discipline
      Discipline
      Clear All
      Discipline
  • Is Peer Reviewed
      Is Peer Reviewed
      Clear All
      Is Peer Reviewed
  • Item Type
      Item Type
      Clear All
      Item Type
  • Subject
      Subject
      Clear All
      Subject
  • Year
      Year
      Clear All
      From:
      -
      To:
  • More Filters
14 result(s) for "3D node localization"
Sort by:
Multi-Group Gorilla Troops Optimizer with Multi-Strategies for 3D Node Localization of Wireless Sensor Networks
The localization problem of nodes in wireless sensor networks is often the focus of many researches. This paper proposes an opposition-based learning and parallel strategies Artificial Gorilla Troop Optimizer (OPGTO) for reducing the localization error. Opposition-based learning can expand the exploration space of the algorithm and significantly improve the global exploration ability of the algorithm. The parallel strategy divides the population into multiple groups for exploration, which effectively increases the diversity of the population. Based on this parallel strategy, we design communication strategies between groups for different types of optimization problems. To verify the optimized effect of the proposed OPGTO algorithm, it is tested on the CEC2013 benchmark function set and compared with Particle Swarm Optimization (PSO), Sine Cosine Algorithm (SCA), Whale Optimization Algorithm (WOA) and Artificial Gorilla Troops Optimizer (GTO). Experimental studies show that OPGTO has good optimization ability, especially on complex multimodal functions and combinatorial functions. Finally, we apply OPGTO algorithm to 3D localization of wireless sensor networks in the real terrain. Experimental results proved that OPGTO can effectively reduce the localization error based on Time Difference of Arrival (TDOA).
The EANM practical guidelines for sentinel lymph node localisation in oral cavity squamous cell carcinoma
PurposeSentinel lymph node biopsy is an essential staging tool in patients with clinically localized oral cavity squamous cell carcinoma. The harvesting of a sentinel lymph node entails a sequence of procedures with participation of specialists in nuclear medicine, radiology, surgery, and pathology. The aim of this document is to provide guidelines for nuclear medicine physicians performing lymphoscintigraphy for sentinel lymph node detection in patients with early N0 oral cavity squamous cell carcinoma.MethodsThese practice guidelines were written and have been approved by the European Association of Nuclear Medicine (EANM) and the International Atomic Energy Agency (IAEA) to promote high-quality lymphoscintigraphy. The final result has been discussed by distinguished experts from the EANM Oncology Committee, and national nuclear medicine societies. The document has been endorsed by the Society of Nuclear Medicine and Molecular Imaging (SNMMI).These guidelines, together with another two focused on Surgery and Pathology (and published in specialised journals), are part of the synergistic efforts developed in preparation for the “2018 Sentinel Node Biopsy in Head and Neck Consensus Conference”.ConclusionThe present practice guidelines will help nuclear medicine practitioners play their essential role in providing high-quality lymphatic mapping for the care of early N0 oral cavity squamous cell carcinoma patients.
RSSI-Based 3D Wireless Sensor Node Localization Using Hybrid T Cell Immune and Lotus Optimization
Wireless Sensor Network (WSNs) consists of a group of nodes that analyze the information from surrounding regions. The sensor nodes are responsible for accumulating and exchanging information. Generally, node localization is the process of identifying the target node’s location. In this research work, a Received Signal Strength Indicator (RSSI)-based optimal node localization approach is proposed to solve the complexities in the conventional node localization models. Initially, the RSSI value is identified using the Deep Neural Network (DNN). The RSSI is conceded as the range-based method and it does not require special hardware for the node localization process, also it consumes a very minimal amount of cost for localizing the nodes in 3D WSN. The position of the anchor nodes is fixed for detecting the location of the target. Further, the optimal position of the target node is identified using Hybrid T cell Immune with Lotus Effect Optimization algorithm (HTCI-LEO). During the node localization process, the average localization error is minimized, which is the objective of the optimal node localization. In the regular and irregular surfaces, this hybrid algorithm effectively performs the localization process. The suggested hybrid algorithm converges very fast in the three-dimensional (3D) environment. The accuracy of the proposed node localization process is 94.25%.
Regional heterogeneities of oligodendrocytes underlie biased Ranvier node spacing along single axons in sound localization circuit
Spacing of Ranvier nodes along myelinated axons is a critical determinant of conduction velocity, influencing spike arrival timing and hence neural circuit function. In the chick brainstem auditory circuit, the pattern of nodal spacing varies regionally along single axons, enabling precise binaural integration for sound localization. Using this model, we investigated the potential factors underlying the biased nodal spacing pattern. 3D morphometry revealed that these axons were almost fully myelinated by oligodendrocytes exhibiting distinct morphologies and cell densities across regions after hearing onset. The structure of axons did not affect internodal length. Inhibiting vesicular release from the axons did not affect internodal length or oligodendrocyte morphology, but caused unmyelinated segments on the axons by suppressing oligodendrogenesis near the presynaptic terminals. These results suggest that the regional heterogeneity in the intrinsic properties of oligodendrocytes is a prominent determinant of the biased nodal spacing pattern in the sound localization circuit, while activity-dependent signaling supports the pattern by ensuring adequate oligodendrocyte density. Our findings highlight the importance of oligodendrocyte heterogeneity in fine-tuning neural circuit function.
An improved distance vector hop algorithm and A algorithm with modified supernova optimizer for 3-dimensional localization in wireless sensor networks
Localization is crucial for accurate data interpretation in a wireless sensor network (WSN). The goal of localization is to locate the nodes with their respective coordinates acquired from anchor nodes. It helps to transfer the information via several nodes in WSN. In WSN, accurate node localization provides diverse benefits and enables large applications. Tracking the accurate position or location of the sensor nodes maximizes the system performance in WSN. However, attaining better localization in WSN is critical, because of the dynamic behavior of wireless communication in networks. Several localization algorithms and deep learning (DL) techniques have been developed to enhance the localization accuracy in WSN. These localization algorithms face challenges in several networks, particularly indoor communication; they consume more power. Evaluating the optimal value of anchor nodes, identifying scalability, and maximizing node localization in WSN are complex tasks. Distance Vector Hop (DV-Hop) is referred to as the non-ranging-aided 3D positioning approach with more errors and less positioning accuracy. Focusing on these difficulties, a framework for the 3D localization of DV-Hop (3D-DV-Hop) in the WSN is recommended in this work. Hence in this paper, the DV-Hop Algorithm and A* Algorithm are introduced to resolve the above-mentioned issues. With the implementation of WSN, the experiments of 3-dimensional (3D) node localization provide significant outcomes. The ideology of the A* algorithm and DV-Hop algorithm are integrated to enhance the node localization in WSN. The developed model consumes low power, low data-rate communication solutions, and minimal cost. The multi-objective optimization is carried out by Modified Random Value in Supernova Optimizer (MRV-SO) to locally optimize the node coordinates. This optimization process reduces the average localization error to improve its effectiveness. The comparative analysis of the developed MRV-SO model shows 89.971, 5.0612, and 2.8862 in terms of MASE, MAE, and RMSE. The simulation evaluation is carried out to ensure the recommended model attains better robustness and effectiveness. In this research paper, the free space propagation approach is used for 3D node localization.
Topological Navigation for Autonomous Underwater Vehicles in Confined Semi-Structured Environments
In this work, we present the design, implementation, and simulation of a topology-based navigation system for the UX-series robots, a spherical underwater vehicle designed to explore and map flooded underground mines. The objective of the robot is to navigate autonomously in the 3D network of tunnels of a semi-structured but unknown environment in order to gather geoscientific data. We start from the assumption that a topological map has been generated by a low-level perception and SLAM module in the form of a labeled graph. However, the map is subject to uncertainties and reconstruction errors that the navigation system must address. First, a distance metric is defined to compute node-matching operations. This metric is then used to enable the robot to find its position on the map and navigate it. To assess the effectiveness of the proposed approach, extensive simulations have been carried out with different randomly generated topologies and various noise rates.
Secure 3D: Secure and Energy Efficient Localization in 3D Environment using Wireless Sensor Networks
Wireless Sensor Networks (WSNs) are extensively utilized across diverse applications, ranging from environmental monitoring to industrial automation. These networks deploy autonomous devices equipped with sensors to monitor environmental conditions such as temperature, humidity, and light. They play crucial roles in fields like precision agriculture, healthcare monitoring, and smart cities infrastructure. In the domain of WSNs, ensuring both security and precise localization is vital for sustaining optimal network performance and facilitating timely event detection. Despite numerous localization studies, existing approaches often fall short in 3D localization due to low beacon node accuracy and sparse environment coverage. Furthermore, achieving higher localization accuracy is challenging due to potential attacks that can compromise network integrity and reduce battery life. To address these issues, a novel Secure 3D algorithm is introduced in this paper to combat malicious beacon nodes as well as to enhance localization accuracy. The proposed Secure 3D algorithm demonstrates superior performance compared to the 3D DV-Hop, 3D APIT and Improved 3D localization algorithms in terms of Average Localization Error (ALE), Bad Node Proportion (BNP), and Localized Node Proportion (LNP), while also being energy-efficient. This algorithm achieves an ALE ranging from 3.0 to 6.5, a BNP below 0.2, and an LNP exceeding 0.8, all while consuming 100–130mW of energy. By addressing the challenges of malicious beacon nodes and enhancing localization accuracy, the proposed work not only improves network reliability but also ensures energy-efficient energy localization, making it a promising solution for enhancing the performance and security of WSNs in 3D environments.
Enhancing 3D localization in wireless sensor network: a differential evolution method for the DV-Hop algorithm
Wireless sensor network is large-scale, self-organizing and reliable. It is widely used in the military, disaster management, environmental monitoring, and other fields. Algorithms for localization can be classified as range-based or range-free based on their ability to achieve effective localization. Range-based algorithms require hardware support, which increases deployment costs and complexity. Instead of measuring distance directly, range-free algorithms estimate the position based on hop counts between nodes. While simpler in terms of hardware requirements, this algorithm suffers from large localization errors. To address this problem, this paper proposes an improved 3D DV-Hop localization algorithm (3D DEHDV-Hop) using a differential evolutionary algorithm. First of all, theoretical analysis shows a correlation between the volume of the intersection area containing the communication range between neighbors and the number of shared single-hop nodes. Then, using the number of shared single-hop nodes between nodes, the number of hops is converted from a discrete value to an exact continuous value. Finally, the localization problem is transformed into a minimum optimization problem by incorporating a differential evolutionary algorithm. As compared to the other four algorithms compared, 3D DEHDV-Hop improves localization accuracy by an average of 10.3% under different anchor node densities, 13.7% under different communication radiuses, and 12.1% under different anchor node numbers.
A three-dimensional wireless sensor network with an improved localization algorithm based on orthogonal learning class topper optimization
Numerous sensor network applications require accurate and rapid localization of randomly deployed sensor nodes. For wireless sensor network (WSN) localization, optimization methods can provide specific and reliable position estimates of a sensor node. The fixed density of beacons may be increase or decrease owing to various reasons, such as upkeep, lifespan, and breakdown. Because of its robustness, flexibility, and economic viability, the distance vector-hop (DV-Hop) algorithm is used to locate WSN nodes. Because of its high precision and fast computing speed, class topper optimization (CTO) is suitable to solve localization problems. This study proposes an orthogonal learning CTO-based DV-Hop localization algorithm for three-dimensional WSNs. Moreover, this study used a refined formula to calculate the minimum hop size of beacon nodes for reducing localization errors (LEs) in the approximated distance between the beacon and dumb nodes. Results revealed that our proposed method outperformed some existing algorithms in terms of reducing LEs (0.6 % ) and localization error variance (0.3 % ) and enhancing localization accuracy (0.4 % ) and coverage (0.7 % ).
Range Free Localization for Three Dimensional Wireless Sensor Networks Using Multi Objective Particle Swarm Optimization
Accurate and fast localization of randomly deployed sensor nodes is needed for many applications in wireless sensor networks. Localization also benefits in recognizing the geographically area where an event took place. There is no meaning of any event information without the knowledge of its location coordinates. DV-Hop is one of the main range free localization technique, which estimates the position of nodes using distance vector. Particle swarm optimization is suitable for the localization issues because of its fast computing speed and high precision. To further reduce the positioning error, the traditional DV-Hop localization algorithm based on single objective optimization algorithm is converted into a multi objective optimization algorithm. In our proposed scheme, we have considered six different single objective functions and three different multi objective functions. In this paper, a multi objective particle swarm optimization based DV-Hop localization is proposed in 3-dimensional wireless sensor networks. The proposed functions has been evaluated on the basis of computation time, average localization error and localization error variance. The simulation results show that our proposed multi objective function performs better as compared to traditional single objective function.