• Journal of Communications and Networks
• /
• 제7권3호
• /
• pp.294-306
• /
• 2005

Group oriented multicast applications are becoming increasingly popular in mobile ad hoc networks (MANETs). Due to dynamic topology of MANETs, stateless multicast protocols are finding increased acceptance since they do not require maintenance of state information at intermediate nodes. Recently, several multicast schemes have been proposed which scale better' with the number of multicast sessions than traditional multicast strategies. These schemes are also known as explicit multicast (Xcast; explicit list of destinations in the packet header) or small group multicast (SGM). In this paper, we propose a new scheme for small group' multicast in MANETs named extended explicit multicast (E2M), which is implemented on top of Xcast and introduces mechanisms to make it scalable with number of group members for a given multicast session. Unlike other schemes, E2M does not make any assumptions related to network topology or node location. It is based on the novel concept of dynamic selection of Xcast forwarders (XFs) between a source and its potential destinations. The XF selection is based on group membership and the processing overhead involved in supporting the Xcast protocol at a given node. If the number of members in a given session is small, E2M behaves just like the basic Xcast scheme with no intermediate XFs. As group membership increases, nodes may dynamically decide to become an XF. This scheme, which can work with few E2M aware nodes in the network, provides transparency of stateless multicast, reduces header processing overhead, minimizes Xcast control traffic, and makes Xcast scalable with the number of group members.

• Journal of Information Processing Systems
• /
• 제6권3호
• /
• pp.413-434
• /
• 2010

Wireless sensor networks are usually characterized by dense deployment of energy constrained nodes. Due to the usage of a large number of sensor nodes in uncontrolled hostile or harsh environments, node failure is a common event in these systems. Another common reason for node failure is the exhaustion of their energy resources and node inactivation. Such failures can have adverse effects on the quality of the real-time services in Wireless Sensor Networks (WSNs). To avoid such degradations, it is necessary that the failures be recovered in a proper manner to sustain network operation. In this paper we present a dynamic Energy efficient Real-Time Job Allocation (ERTJA) algorithm for handling node failures in a cluster of sensor nodes with the consideration of communication energy and time overheads besides the nodes' characteristics. ERTJA relies on the computation power of cluster members for handling a node failure. It also tries to minimize the energy consumption of the cluster by minimum activation of the sleeping nodes. The resulting system can then guarantee the Quality of Service (QoS) of the cluster application. Further, when the number of sleeping nodes is limited, the proposed algorithm uses the idle times of the active nodes to engage a graceful QoS degradation in the cluster. Simulation results show significant performance improvements of ERTJA in terms of the energy conservation and the probability of meeting deadlines compared with the other studied algorithms.

• Journal of Gastric Cancer
• /
• 제11권2호
• /
• pp.94-100
• /
• 2011

Purpose: The 7th AJCC tumor node metastasis (TNM) staging system modified the classification of the lymph node metastasis widely compared to the 6th edition. To evaluate the prognostic predictability of the new TNM staging system, we analyzed the survival rate of the gastric cancer patients assessed by the 7th staging system. Materials and Methods: Among 2,083 patients who underwent resection for gastric cancer at the department of surgery, Hanyang Medical Center from July 1992 to December 2009, This study retrospectively reviewed 5-year survival rate (5YSR) of 624 patients (TanyN3M0: 464 patients, TanyNanyM1: 160 patients) focusing on the number of metastatic lymph node and distant metastasis. We evaluated the applicability of the new staging system. Results: There were no significant differences in 5YSR between stage IIIC with more than 29 metastatic lymph nodes and stage IV (P=0.053). No significant differences were observed between stage IIIB with more than 28 metastatic lymph nodes and stage IV (P=0.093). Distinct survival differences were present between patients who were categorized as TanyN3M0 with 7 to 32 metastatic lymph nodes and stage IV. But patients with more than 33 metastatic lymph nodes did not show any significant differences compared to stage IV (P=0.055). Among patients with TanyN3M0, statistical significances were seen between patients with 7 to 30 metastatic lymph nodes and those with more than 31 metastatic lymph nodes. Conclusions: In the new staging system, modifications of N classification is mandatory to improve prognostic prediction. Further study involving a greater number of cases is required to demonstrate the most appropriate cutoffs for N classification.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권10호
• /
• pp.4883-4901
• /
• 2016

Energy efficiency in Wireless Sensor Networks (WSNs) is very appealing research area due to serious constrains on resources like storage, processing, and communication power of the sensor nodes. Due to limited capabilities of sensing nodes, such networks are composed of a large number of nodes. The higher number of nodes increases the overall performance in data collection from environment and transmission of packets among nodes. In such networks the nodes sense data and ultimately forward the information to a Base Station (BS). The main issues in WSNs revolve around energy consumption and delay in relaying of data. A lot of research work has been published in this area of achieving energy efficiency in the network. Various techniques have been proposed to divide such networks; like grid division of network, group based division, clustering, making logical layers of network, variable size clusters or groups and so on. In this paper a new technique of group based WSNs is proposed by using some features from recent published protocols i.e. "Energy-Efficient Multi-level and Distance Aware Clustering (EEMDC)" and "Energy-Efficient Multi-level and Distance Aware Clustering (EEUC)". The proposed work is not only energy-efficient but also minimizes the delay in relaying of data from the sensor nodes to BS. Simulation results show, that it outperforms LEACH protocol by 38%, EEMDC by 10% and EEUC by 13%.

• 정보처리학회논문지C
• /
• 제16C권3호
• /
• pp.393-406
• /
• 2009

본 논문에서는 IEEE 802.15.4의 성능을 정확하게 평가하기 위하여 ns-2에 추가한 두 가지 기능을 소개한다. 첫째는 전체 노드의 수와 은닉 노드의 수가 정해짐에 따라 노드들의 배치를 자동으로 결정하는 은닉 노드 배치 방안과 은닉 노드로 인한 신호 충돌을 구별하는 방안이다. 둘째는 2003 표준만 구현되어 있는 현재의 ns-2 2.33 버전에 2006 표준에 기술된 CCA 지연 처리 방안을 구현하였다. 기능이 확장된 ns-2를 이용하여, 802.15.4 네트워크의 성능에 은닉 노드와 CCA 지연에 대한 처리 방안이 미치는 영향을 정확하게 분석할 수 있게 되었다. 시뮬레이션 결과 은닉 노드가 없을 때에 비하여 은닉 노드가 단 하나 존재할 때 네트워크 처리량이 약 66% 감소하며, 충돌율은 65%에서 90%로 급증한다. CCA 지연 처리 알고리즘의 2003 표준과 2006 표준에 따르면, 충돌 확률은 약 19%까지 차이를 보이고, 처리량은 약 38% 차이를 보이며 2006 버전이 우수한 성능을 보인다.

• 산업경영시스템학회지
• /
• 제20권41호
• /
• pp.1-14
• /
• 1997

This study proposes a genetic algorithm using Pr(equation omitted)fer number for the traveling salesman problem(PNGATSP). Nearest neighbor nodes are mixed with randomly selected nodes at the stage of generating initial solutions. Proposed PNGATSP adopts a few ideas which are different from traditional genetic algorithms. For instance, an exponential fitness function and elitism are used and Pr(equation omitted)fer number is used for encoding TSP. Genetic operators are selected by experiments, which make a good solution among four combinations of conventional genetic operators and new genetic operators. For respective combinations, robust set of parameters is determined by the experimental designing approach. The feature of Pr(equation omitted)fer number code for TSP and the search power of GA using Pr(equation omitted)fer number is analysed. The best is a combination of OX(order crossover) and swap, which is superior to the other experimented combinations of genetic operators by 1.0%∼12.8% deviation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권5호
• /
• pp.939-955
• /
• 2010

With the progress of IT and mobile positioning technologies, various types of location-based services (LBS) have been proposed and implemented. Finding a shortest path between two nodes is one of the most fundamental tasks in many LBS related applications. So far, there have been many research efforts on the shortest path finding problem. For instance, $A^*$ algorithm estimates neighboring nodes using a heuristic function and selects minimum cost node as the closest one to the destination. Pruning method, which is known to outperform the A* algorithm, improves its routing performance by avoiding unnecessary exploration in the search space. For pruning, shortest paths for all node pairs in a map need to be pre-computed, from which a shortest path container is generated for each edge. The container for an edge consists of all the destination nodes whose shortest path passes through the edge and possibly some unnecessary nodes. These containers are used during routing to prune unnecessary node visits. However, this method shows poor performance as the number of unnecessary nodes included in the container increases. In this paper, we focus on this problem and propose a new border line-based pruning scheme for path routing which can reduce the number of unnecessary node visits significantly. Through extensive experiments on randomly-generated, various complexity of maps, we empirically find out optimal number of border lines for clipping containers and compare its performance with other methods.

• 한국인터넷방송통신학회논문지
• /
• 제11권4호
• /
• pp.9-16
• /
• 2011

본 논문에서는 이동망에서 통신노드가 다이나믹하게 이동하는 경우, VLC 음성품질을 위지하기 위한 상호연동 구조를 다룬다. 연동구조에서 체계적인 품질 분석은 OPENT 시뮬레이터를 사용하였으며, 패킷지연율과 성능분석으로 결과를 제시하였다. 실험결과에 따라 이동노드의 수가 작을 때, PDR은 상대적으로 데이터 프래픽이 증가함에 따라 안정을 유지하며, 성능은 이동노드의 수에 영향을 받는다. 특히 MANET 노드 밀도가 크게 증가하면, 성능은 높아지지만 이동속도에 영향을 받지 않았다. 또한 FTP 업다운 응답시간은 이동속도와 노드의 수에 크게 영향을 주지 않음을 확인하였다.

• Journal of Communications and Networks
• /
• 제16권1호
• /
• pp.81-91
• /
• 2014

This paper proposes hidden-node aware grouping (HAG) algorithm to enhance the performance of institute of electrical and electronics engineers (IEEE) 802.15.4 networks when they undergo either severe collisions or frequent interferences by hidden nodes. According to the degree of measured collisions and interferences, HAG algorithm dynamically transforms IEEE 802.15.4 protocol between a contention algorithm and a contention-limited one. As a way to reduce the degree of contentions, it organizes nodes into some number of groups and assigns each group an exclusive per-group time slot during which only its member nodes compete to grab the channel. To eliminate harmful disruptions by hidden nodes, especially, it identifies hidden nodes by analyzing the received signal powers that each node reports and then places them into distinct groups. For load balancing, finally it flexibly adapts each per-group time according to the periodic average collision rate of each group. This paper also extends a conventional Markov chain model of IEEE 802.15.4 by including the deferment technique and a traffic source to more accurately evaluate the throughput of HAG algorithm under both saturated and unsaturated environments. This mathematical model and corresponding simulations predict with 6%discrepancy that HAG algorithm can improve the performance of the legacy IEEE 802.15.4 protocol, for example, even by 95% in a network that contains two hidden nodes, resulting in creation of three groups.

• 정보처리학회논문지C
• /
• 제17C권6호
• /
• pp.499-504
• /
• 2010

플러딩은 무선 네트워크에서 모든 노드들에게 패킷을 전달하는 가장 간단한 방법이다. 하지만, 기본적인 플러딩은 모든 노드가 브로드캐스트 패킷을 한 번씩 전송을 하게 되고, 결과적으로 브로드캐스트 폭풍(broadcast storm) 문제를 일으킨다. 이는 네트워크 자원 및 에너지를 심각하게 낭비시키는 결과를 초래한다. 특히, 무선 센서 네트워크에서는 노드들은 제한된 배터리에 의해 전력을 공급받기 때문에 전력은 가장 중요한 자원 중의 하나이다. 다시 말해, 기본적인 플러딩은 많은 중복 패킷을 생성하기 때문에 전력 소비가 많고, 무선 센서 네트워크의 수명을 단축시키게 된다. 이 브로드캐스트 폭풍 문제를 해결하기 위해서 본 논문에서는 이웃 노드 정보를 이용하여 자식 노드 수와 형제 노드 수에 따른 동적인 확률적 플러딩 기법을 제안한다. 시뮬레이션 결과에서 제안 알고리즘은 기존의 기법들과 비교하여 패킷 발생 수는 유사하게 유지하면서 적은 노드 수에 대해서도 높은 전달율을 보인다.