• Title/Summary/Keyword: Node ratio

Search Result 717, Processing Time 0.028 seconds

An Efficient Context-aware Opportunistic Routing Protocol (효율적인 상황 인지 기회적 라우팅 프로토콜)

  • Seo, Dong Yeong;Chung, Yun Won
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.12
    • /
    • pp.2218-2224
    • /
    • 2016
  • Opportunistic routing is designed for an environment where there is no stable end-to-end routing path between source node and destination node, and messages are forwarded via intermittent contacts between nodes and routed using a store-carry-forward mechanism. In this paper, we consider PRoPHET(Probabilistic Routing Protocol using History of Encounters and Transitivity) protocol as a base opportunistic routing protocol and propose an efficient context-aware opportunistic routing protocol by using the context information of delivery predictability and node type, e.g., pedestrian, car, and tram. In the proposed protocol, the node types of sending node and receiving node are checked. Then, if either sending node or receiving node is tram, messages are forwarded by comparing the delivery predictability of receiving node with predefined delivery predictability thresholds depending on the combination of sending node and receiving node types. Otherwise, messages are forwarded if the delivery predictability of receiving node is higher than that of sending node, as defined in PRoPHET protocol. Finally, we analyze the performance of the proposed protocol from the aspect of delivery ratio, overhead ratio, and delivery latency. Simulation results show that the proposed protocol has better delivery ratio, overhead ratio, and delivery latency than PRoPHET protocol in most of the considered simulation environments.

Facilitating Data Source Movement with Time-Division Access in Content-Centric Networking

  • Priyono, Olivica;Kong, In-Yeup;Hwang, Won-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.4
    • /
    • pp.433-440
    • /
    • 2014
  • Wireless communication offers the flexibility to the node movement at the spatial dimension more than the wire communication not only in IP architecture but also in Content-Centric Networking. Although it gives such advantage, the intra-domain movement of a node especially the data source node affects the communication to the access point node which in the end affects the acceptance ratio of the client node that requests the data packets from the data source node. In this paper, we use time-division access method to maintain the acceptance ratio of the client node as the effect of the intra-domain data source node movement in Content-Centric Networking. The simulation result shows that the acceptance ratio of the client node can be maintained using the time-division access method as long as the interval access time is less than the coherence time.

Dynamically Adjusted Probabilistic Broadcasting Mechanism based on Distance Ratio and Node Density for MANETs (MANET에서 이격 비율과 노드 밀집도에 기반한 동적 확률을 적용한 브로드캐스팅 기법)

  • Kim, Jae Soo
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.9
    • /
    • pp.1077-1088
    • /
    • 2013
  • As broadcasting is the process that a node sends a packet to all nodes in the network. it is basic process used for discovering of a routes to a node and disseminating of control information message in Mobile Ad hoc NETwork (MANET). In this paper, we propose dynamically adjusted probabilistic mechanism based on distance ratio and node density for broadcasting in MANETs. The distance ratio can be calculated as the ratio of the radio strength length to the distance from sender of a node, and node density can be get from 1-hop nodes of neighbours. A mobile node receiving broadcast packets determines the probability of rebroadcasting considering distance ratio and node density of itself. Rebroadcast probability will be set as low value to a node which is located in nearby area of sender and has high 1-hop node density, So it reduces packets transmission caused by the early die-out of rebroadcast packets. Compared with the simple flooding and fixed probabilistic flooding by simulation, our approach shows better performances results. Proposed algorithm can reduce the rebroadcast packet delivery more than 30% without scanting reachability, where as it shows up to 96% reachability compared with flooding.

Minimizing Energy Consumption of Sensor Networks with Energy Balance Ratio and Relay Node Placement (에너지 균형비와 중계노드 위치를 함께 고려한 센서 네트워크의 에너지 소비 최소화)

  • Sohn, Surg-Won;Han, Kwang-Rok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.7
    • /
    • pp.1549-1555
    • /
    • 2009
  • The Relay node placement problem is one of the most important requirements for many wireless sensor networks because the lifetime of sensor networks is closely related with the placement of relay nodes which receive sensed data from sensor nodes and forward them to the base station. Relay node placement problem has focused at minimization of dissipated total energy of the sensor nodes in whole networks. However, minimum total energy causes the unbalance of consumed energy in sensor nodes due to different distances between relay nodes and sensor nodes. This paper proposes the concept of energy balance ratio and finds the locations of relay nodes using objective functions which maximize the energy balance ratio. Maximizing this ratio results in maximizing the network lifetime by minimizing the energy consumption of large-scale sensor networks. However, finding a solution to relay node placement problem is NP-hard and it is very difficult to get exact solutions. Therefore, we get approximate solutions to EBR-RNP problem which considers both energy balance ratio and relay node placement using constraint programming.

Prognostic Factors on Overall Survival in Lymph Node Negative Gastric Cancer Patients Who Underwent Curative Resection

  • Jeong, Ji Yun;Kim, Min Gyu;Ha, Tae Kyung;Kwon, Sung Joon
    • Journal of Gastric Cancer
    • /
    • v.12 no.4
    • /
    • pp.210-216
    • /
    • 2012
  • Purpose: To assess independent prognostic factors for lymph node-negative metastatic gastric cancer patients following curative resection is valuable for more effective follow-up strategies. Materials and Methods: Among 1,874 gastric cancer patients who received curative resection, 967 patients were lymph node-negative. Independent prognostic factors for overall survival in lymph node-negative gastric cancer patients grouped by tumor invasion depth (early gastric cancer versus advanced gastric cancer) were explored with univariate and multivariate analyses. Results: There was a significant difference in the distribution of recurrence pattern between lymph node-negative and lymph nodepositive group. In the lymph node-negative group, the recurrence pattern differed by the depth of tumor invasion. In univariate analysis for overall survival of the early gastric cancer group, age, macroscopic appearance, histologic type, venous invasion, lymphatic invasion, and carcinoembryonic antigen level were significant prognostic factors. Multivariate analysis for these factors showed that venous invasion (hazard ratio, 6.695), age (${\geq}59$, hazard ratio, 2.882), and carcinoembryonic antigen level (${\geq}5$ ng/dl, hazard ratio, 3.938) were significant prognostic factors. Multivariate analysis of advanced gastric cancer group showed that depth of tumor invasion (T2 versus T3, hazard ratio, 2.809), and age (hazard ratio, 2.319) were prognostic factors on overall survival. Conclusions: Based on our results, independent prognostic factors such as venous permeation, carcinoembryonic antigen level, and age, depth of tumor invasion on overall survival were different between early gastric cancer and advanced gastric cancer group in lymph node-negative gastric cancer patients. Therefore, we are confident that our results will contribute to planning follow-up strategies.

Analysis of Types of Gather Drape with Visual Evaluation (시각적 평가에 의한 개더 드레이프 형상 분석)

  • Lee Myung-Hee;Jung Hee-Kyeong
    • Journal of the Korea Fashion and Costume Design Association
    • /
    • v.7 no.1
    • /
    • pp.33-40
    • /
    • 2005
  • Gathering is method used to control fullness along a seam line. The purpose of this study was to investigate the relationship between the quantitative research and qualitative method; the effect of gather and the types of gather drape. The experimental design consists of four factors: (l) three kinds of different weight and thickness of fabrics (2) three kinds of stitch densities (3) five kinds of ratio of gathers (4) three kinds of grain directions. Therefore one hundred thirty five (135) samples were made. And utilized SPSS WIN 10.0 Package in data analysis. The results of this study were as follows; First, after frequency analysis, side height, hem line width, node depth, node count, node width accorded with these result data recording. Second, after correlation analysis, side height related with front statements. Side height and entire visual was negative correlation. Hem line width, node depth, node count with section statements was negative correlation but node width at section statements was positive correlation. Third, after $k^2$ analysis, front picture parts getting excellent evaluation were 1st side height, 3rd hem line width, 4th node depth, 3rd node count, 3rd node width. And section illustration parts getting excellent evaluation were 4th side height, 1st hem line width, 2nd node depth, 3rd node count, 4th node width.

  • PDF

Effects of Obesity on Presentation of Breast Cancer, Lymph Node Metastasis and Patient Survival: A Retrospective Review

  • Kaviani, Ahmad;Neishaboury, MohamadReza;Mohammadzadeh, Narjes;Ansari-Damavandi, Maryam;Jamei, Khatereh
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.14 no.4
    • /
    • pp.2225-2229
    • /
    • 2013
  • Background: As data on the relation between obesity and lymph node ratio are missing in the literature, we here aimed to assess the impact of obesity on this parameter and other clinicopathological features of breast cancer cases and patient survival. Materials and Methods: Medical data of 646 patients, all referred to two centers in Tehran, Iran, were reviewed. Factors that showed significant association on univariate analysis were entered in a regression model. Kaplan-Meier and Cox-regression were employed for survival analysis. Results: Obesity was correlated with the expression of estrogen and progesterone receptor (p=0.004 and p=0.039, respectively), metastasis to axillary lymph nodes (p=0.017), higher lymph node rate (p<0.001) and larger tumor size (p<0.001). The effect of obesity was stronger in premenopausal women. There was no association between obesity and expression of human epidermal growth factor receptor. Three factors showed independent association with BMI on multivariate analysis; tumor size, estrogen receptor and lymph node ratio. Obesity was predictive of shorter disease-free survival with a hazard ratio of 3.324 (95%CI: 1.225-9.017) after controlling for the above-mentioned variables. Conclusions: The findings of this study support the idea that obese women experience more advanced disease with higher axillary lymph node ratio, and therefore higher stage at the time of diagnosis. Furthermore, obesity was associated with poorer survival independent of lymph node rate.

A Novel Jamming Detection Technique for Wireless Sensor Networks

  • Vijayakumar, K.P.;Ganeshkumar, P.;Anandaraj, M.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.4223-4249
    • /
    • 2015
  • A novel jamming detection technique to detect the presence of jamming in the downstream direction for cluster based wireless sensor networks is proposed in this paper. The proposed technique is deployed in base station and in cluster heads. The proposed technique is novel in two aspects: Firstly, whenever a cluster head receives a packet it verifies whether the source node is legitimate node or new node. Secondly if a source node is declared as new node in the first step, then this technique observes the behavior of the new node to find whether the new node is legitimate node or jammed node. In order to monitor the behavior of the existing node and new node, the second step uses two metrics namely packet delivery ratio (PDR) and received signal strength indicator (RSSI). The rationality of using PDR and RSSI is presented by performing statistical test. PDR and RSSI of every member in the cluster is measured and assessed by the cluster head. And finally the cluster head determines whether the members of the cluster are jammed or not. The CH can detect the presence of jamming in the cluster at member level. The base station can detect the presence of jamming in the wireless sensor network at CH level. The simulation result shows that the proposed technique performs extremely well and achieves jamming detection rate as high as 99.85%.

Virtual Network Embedding based on Node Connectivity Awareness and Path Integration Evaluation

  • Zhao, Zhiyuan;Meng, Xiangru;Su, Yuze;Li, Zhentao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3393-3412
    • /
    • 2017
  • As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.

LLR-based Cooperative ARQ Protocol in Rayleigh Fading Channel (레일리 페이딩 채널에서 LLR 기반의 협력 ARQ 프로토콜)

  • Choi, Dae-Kyu;Kong, Hyung-Yun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.4
    • /
    • pp.31-37
    • /
    • 2008
  • Conventional cooperative communications can attain gain of spatial diversity and path loss reduction because destination node independently received same signal from source node and relay node located between source node and destination node. However, these techniques bring about decreased spectral efficiency with relay node and increased complexity of receiver by using maximal ratio combining (MRC). This paper has proposed cooperative ARQ protocol that can improve the above problems and can get the better performance. This method can increase the spectral efficiency than conventional cooperative communication because if the received signal from source node is satisfied by the destination preferentially, the destination transmits ACK message to both relay node and source node and then recovers the received signal. In addition, if ARQ message indicates NACK relay node operates selective retransmission and we can increase reliability of system compared with that of general ARQ protocol in which source node retransmits data. In the proposed protocol, the selective retransmission and ARQ message are to be determined by comparing log-likelihood ratio (LLR) computation of received signal from source node with predetermined threshold values. Therefore, this protocol don't waste redundant bandwidth with CRC code and can reduce complexity of receiver without MRC. We verified spectral efficiency and BER performance for the proposed protocol through Monte-Carlo simulation over Rayleigh fading plus AWGN.