نتایج جستجو برای: at each node
تعداد نتایج: 4377801 فیلتر نتایج به سال:
Objective(s): The present study was conducted to examine whether the standardized uptake value (SUV) may be affected by the spatial position of a lesion in the radial direction on positron emission tomography (PET) images, obtained via two methods based on time-of-flight (TOF) reconstruction and point spread function (PSF). Methods: A cylinder phantom with the sphere (30mm diameter), located in...
Introduction: The applicability of sentinel lymph node biopsy for early detection of metastasis in patients with renal cell carcinoma (RCC) is still in the validation phase and under investigation, which might be due to the unpredictability of the lymphatic pattern in RCC. In this study, we aimed to evaluate the feasibility and accuracy of sentinel node biopsy in patients with ...
Given a graph ( , ) G N E , the Covering Salesman Problem (CSP) is to identify the minimum length tour “covering” all the nodes. More specifically, it seeks the minimum length tour visiting a subset of the nodes in N such that each node i not on the tour is within a predetermined distance di of a node on the tour. In this paper, we define and develop a generalized version of the CSP, and refe...
Mobile Ad Hoc Networks (MANET) can be considered as a class of unstructured networks created by a number of autonomous wireless and sensor nodes. The inherent characteristics of such networks have made specific applications, such as multimedia transfer and challenging. Basically, the functionality of a node and very few resources directly affect the delivery of packets which depends on the ...
Network Load balancing is a technique of balancing at each node the number of packets received and the number of packets forward to the other node so that the chance of network congestion problem has been reduced and bandwidth is utilized. Although there are many techniques implemented for the balancing of nodes based on maintaining a routing table at each node and is updated as the packet get ...
sink location is considered as a basic service in geographic routing in wireless sensor networks. obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. in this paper, a sink location algorithm based on fano plane is proposed. the research challenge is how to ensure the intersection of two slq and sla rou...
In this paper, we propose an autonomous transmission timing control scheme for collision avoidance in ad hoc multicasting. In ad hoc multicasting, packet collisions due to hidden node problems at upstream nodes cause packet losses at all downstream nodes. Therefore, collision avoidance mechanisms are important to improve packet delivery ratio at destination nodes. In this paper, we extend an On...
Recently the growth of packet switched networks lead to new traffic problems. To solve these problems, the differentiated service models have been considered as a scalable traffic management mechanism to ensure guaranteed quality of service. In this paper, a three stage/node communication network model with homogeneous bulk arrivals and dynamic bandwidth is developed and analyzed. The data pack...
This work proposes a self-organizing, dynamic infrastructure called a spine for efficient routing in ad hoc networks. We present a scalable framework for routing that encompasses a range of knowledge at each spine node, and identify the trade-offs involved for routing at different points in this range. Our routing algorithm requires only partial topology information at each spine node, consisti...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید