• ETRI Journal
• /
• v.39 no.2
• /
• pp.275-283
• /
• 2017

A green technology for reducing energy consumption has become a critical factor in ICT industries. However, for the telecommunications sector in particular, most network elements are not usually optimized for power efficiency. Here, we propose a novel energy-efficient packet switching method for use in an IP network for reducing unnecessary energy consumption. As a green networking approach, we first classify the network nodes into either header or member nodes. The member nodes then put the routing-related module at layer 3 to sleep under the assumption that the layer in the OSI model can operate independently. The entire set of network nodes is then partitioned into clusters consisting of one header node and multiple member nodes. Then, only the header node in a cluster conducts IP routing and its member nodes conduct packet switching using a specially designed identifier, a tag. To investigate the impact of the proposed scheme, we conducted a number of simulations using well-known real network topologies and achieved a more energy- efficient performance than that achieved in previous studies.

• Asian Pacific Journal of Cancer Prevention
• /
• v.14 no.6
• /
• pp.3769-3772
• /
• 2013

Background: To investigate the impact of the lymph node ratio (LNR) on the prognosis of patients with locally advanced rectal cancer undergoing pre-operative chemoradiation. Methods: Clinicopathologic and follow up data of 128 patients with stage III rectal cancer who underwent curative resection from 1996 to 2007 were reviewed. The patients were divided into two groups according to the lymph node ratio: LNR ${\leq}$ 0.2 (n=28), and >0.2 (n=100). Kaplan-Meier and the Cox proportional hazard regression models were used to evaluate the prognostic effects according to LNR. Results: Median numbers of lymph nodes examined and lymph nodes involved by tumour were 10.3 (range 2-28) and 5.8 (range 1-25), respectively, and the median LNR was 0.5 (range, 0-1.6). The 5-year survival rate significantly differed by LNR (${\leq}$ 0.2, 69%; >0.2, 19%; Log-rank p value < 0.001). LNR was also a significant prognostic factor of survival adjusted for age, sex, post-operative chemotherapy, total number of examined lymph nodes, metastasis and local recurrence (${\leq}$ 0.2, HR=1; >0.2, HR=4.8, 95%CI=2.1-11.1) and a significant predictor of local recurrence and distant metastasis during follow-up independently of total number of examined lymph node. Conclusions: Total number of examined lymph nodes and LNR were significant prognostic factors for survival in patients with stage III rectal cancer undergoing pre-operative chemoradiotherapy.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.172-182
• /
• 2014

In this paper, we investigate the fundamental performance limits of the cooperative sensing using energy detection by considering the unlimited number of sensing nodes. Although a lot of cognitive radio research so far proposed various uses of energy detection because of its simplicity, the performance limits of energy detection have not been studied when a large number of sensing nodes exist. First, we show that when the sensing nodes see the independent and identically distributed channel conditions, then as the number of sensing nodes N goes to infinity, the OR rule of hard decision achieves zero of false alarm Pf for any given target probability of detection $\bar{P_d}$ irrespective of the non-zero received primary user signal to noise ratio ${\gamma}$. Second, we show that under the same condition, when the AND rule of hard decision is used, there exists a lower bound of $P_f$. Interestingly, however, for given $\bar{P_d}$, $P_f$ goes to 1 as N goes to infinity. Third, we show that when the soft decision is used, there exists a way of achieving 100% utilization of secondary user, i.e., the sensing time overhead ratio goes to zero so does $P_f$.We verify our analyses by performing extensive simulations of the proposed unlimited cooperative sensing. Finally, we suggest a way of incorporating the unlimited cooperative sensing into a practical cellular system such as long term evolutionadvanced by exploiting the existing frame structure of absolute blank subframe to implement the in-band sensing.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.3
• /
• pp.194-202
• /
• 2009

In this paper, we address an optimization problem and a case study for minimizing the cost of inspections incurred throughout an inspection system, which includes a K-stage inspection system, a source inspection shop, and a re-inspection shop. In order to formulate the inspection cost function, we make a time-based flow analysis between nodes (or shops), and derive the limiting sizes of flows between nodes and limiting defective rates by solving a set of nonlinear balance equations. It turns out that the number of items reworked throughout the inspection system is invariant irrespective of the defective rate of items moved through the K-stage inspection system. Hence we define the inspection cost as the total number of items inspected, and we provide an enumeration method for determining an optimal value of K which minimizes the number of items inspected.

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.3
• /
• pp.175-180
• /
• 2004

The machine-part group formation is to group the sets of parts having similar processing requirements into part families, and the sets of machines needed to process a particular part family into machine cells using grid computing. It forms machine cells from the machine-part incidence matrix by means of Self-Organizing Maps(SOM) whose output layer is one-dimension and the number of output nodes is the twice as many as the number of input nodes in order to spread out the machine vectors. It generates machine-part group which are assigned to machine cells by means of the number of bottleneck machine with processing part. The proposed algorithm was tested on well-known machine-part grouping problems. The results of this computational study demonstrate the superiority of the proposed algorithm.

• Journal of Gastric Cancer
• /
• v.10 no.4
• /
• pp.247-253
• /
• 2010

Purpose: Most stomach surgeons have been educated sufficiently in conventional open distal gastrectomy (ODG) but insufficiently in laparoscopy-assisted distal gastrectomy (LADG). We compared learning curves and clinical outcomes between ODG and LADG by a single surgeon who had sufficient education of ODG and insufficient education of LADG. Materials and Methods: ODG (90 patients, January through September, 2004) and LADG groups (90 patients, June 2006 to June 2007) were compared. The learning curve was assessed with the mean number of retrieved lymph nodes, operation time, and postoperative morbidity/mortality. Results: Mean operation time was 168.3 minutes for ODG and 183.6 minutes for LADG. The mean number of retrieved lymph nodes was 37.9. Up to about the 20th to 25th cases, the slope decrease in the learning curve for LADG was more apparent than for ODG, although they both reached plateaus after the 50th cases. The mean number of retrieved lymph nodes reached the overall mean after the 30th and 40th cases for ODG and LADG, respectively. For ODG, complications were evenly distributed throughout the subgroups, whereas for LADG, complications occurred in 10 (33.3%) of the first 30 cases. Conclusions: Compared with conventional ODG, LADG is feasible, in particular for a surgeon who has had much experience with conventional ODG, although LADG required more operative time, slightly more time to get adequately retrieved lymph nodes and more complications. However, there were more minor problems in the first 30 LADG than ODG cases. The unfavorable results for LADG can be overcome easily through an adequate training program for LADG.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.11
• /
• pp.603-609
• /
• 2003

Adaptive routing methods are studied for effective routing in many topologies where occurrence of the faulty nodes are inevitable. Mesh topology provides simplicity in implementing these methods. Many routing methods for mesh are able to tolerate a large number of faults enclosed by a rectangular faulty block. But they consider even good nodes in the faulty block as faulty nodes. Hence, it results the degradation of node utilization. This problem is solved by a method which transmits messages to destinations within faulty blocks via multiple “intermediate nodes”. It also divides faulty block into multiple expanded meshes. With these expanded meshes, DAG(Directed Acyclic Graph) is formed and a message is able to be routed by the shortest path according to the DAG. Therefore, the additional number of hops can be resulted. We propose a method that reduces the number of hops by searching direct paths from the destination node to the border of the faulty block. This path is called SCP(Short-Cut Path). If the path and the traversing message is on the same side of outside border of the faulty block, the message will cut into the path found by our method. It also reduces the message traverse latency between the source and the destination node.

• International Journal of Internet, Broadcasting and Communication
• /
• v.7 no.1
• /
• pp.62-65
• /
• 2015

Wireless Sensor Network consists of several sensor nodes, these nodes loss some of their energy after the process of communication. So an energy efficient approach is required to improve the life of the network. In case of broadcast network, LEACH protocol uses an aggregative approach by creating cluster of nodes. Now the major concern is to built such clusters over WSN in an optimized way. This work presents the improvement over LEACH protocol. Hence we have different work environments where the network is having different capacities. The proposed work shows how the life time of the network will improve when the number of nodes varies within the network.

• Journal of Korea Multimedia Society
• /
• v.11 no.3
• /
• pp.331-340
• /
• 2008

In order to make load balancing, workload information of nodes should be informed to the network. In a load balancing algorithm[13] based on the SBIBD(Symmetric Balanced Incomplete Block Design), each node receives global workload information by only two round message exchange with O (${\upsilon}{\sqrt{\upsilon}}$) traffic overhead, where ${\upsilon}$ is the number of nodes. It is very efficient but works well only when ${\upsilon}=p^2+p+1$ for a prime number p. In this paper, we generate a special incidence structure in order for the algorithm works well for an arbitrary number of nodes. In the experiment with w,($5{\leq}w{\leq}5,000$), nodes and more than 80% of receiving workload information, traffic overhead was less than O ($w{\sqrt{w}})$ and the result for standard deviation of traffic overhead showed that each node has largely balanced amount of traffic overhead.

• International journal of advanced smart convergence
• /
• v.6 no.3
• /
• pp.59-64
• /
• 2017

A wireless sensor network is a network in which nodes equipped with sensors capable of collecting data from the real world are configured wirelessly. Because the sensor nodes are configured wirelessly, they have limited power such as batteries. If the battery of the sensor node is exhausted, the node is no longer usable. If more than a certain number of nodes die, the network will not function. There are many wireless sensor network protocols to improve energy efficiency, among which LEACH Protocol is a typical example. The LEACH protocol is a cluster-based protocol that divides sensor space into clusters and transmits and receives data between nodes. Therefore, depending on how the cluster is structured, the shape of the energy cow may decrease or increase. We compare the network lifetimes of the existing LEACH protocols and the three types of protocols that have been improved using fuzzy methods for cluster selection.