• Journal of Information Processing Systems
• /
• 제10권1호
• /
• pp.36-54
• /
• 2014

Resource sharing is a major advantage of distributed computing. However, a distributed computing system may have some physical or virtual resource that may be accessible by a single process at a time. The mutual exclusion issue is to ensure that no more than one process at a time is allowed to access some shared resource. The article proposes a token-based mutual exclusion algorithm for the clustered mobile ad hoc networks (MANETs). The mechanism that is adapted to handle token passing at the inter-cluster level is different from that at the intra-cluster level. It makes our algorithm message efficient and thus suitable for MANETs. In the interest of efficiency, we implemented a centralized token passing scheme at the intra-cluster level. The centralized schemes are inherently failure prone. Thus, we have presented an intra-cluster token passing scheme that is able to tolerate a failure. In order to enhance reliability, we applied a distributed token circulation scheme at the inter-cluster level. More importantly, the message complexity of the proposed algorithm is independent of N, which is the total number of nodes in the system. Also, under a heavy load, it turns out to be inversely proportional to n, which is the (average) number of nodes per each cluster. We substantiated our claim with the correctness proof, complexity analysis, and simulation results. In the end, we present a simple approach to make our protocol fault tolerant.

• 한국멀티미디어학회논문지
• /
• 제17권10호
• /
• pp.1160-1170
• /
• 2014

Clustering methods are very useful in many fields such as data mining, classification, and object recognition. Both the supervised and unsupervised grouping approaches can classify a series of sample data with a predefined or automatically assigned cluster number. However, there is no constraint on the number of elements for each cluster. Numbers of cluster members for each cluster obtained from clustering schemes are usually random. Thus, some clusters possess a large number of elements whereas others only have a few members. In some areas such as logistics management, a fixed number of members are preferred for each cluster or logistic center. Consequently, it is necessary to design a clustering method that can automatically adjust the number of group elements. In this paper, a k-means based clustering method with a fixed number of cluster members is proposed. In the proposed method, first, the data samples are clustered using the k-means algorithm. Then, the number of group elements is adjusted by employing a greedy strategy. Experimental results demonstrate that the proposed clustering scheme can classify data samples efficiently for a fixed number of cluster members.

• Journal of Communications and Networks
• /
• 제14권4호
• /
• pp.443-450
• /
• 2012

As for cluster-based wireless sensor networks (WSNs), cluster lifetime is one of the most important subjects in recent researches. Besides reducing the energy consumptions of the clusters, it is necessary to make the clusters achieve equal lifetimes so that the whole network can survive longer. In this paper, we focus on the cluster lifetimes in multi-hop WSNs with cooperative multi-input single-output scheme. With a simplified model of multi-hop WSNs, we change the transmission schemes, the sizes and transmission distances of clusters to investigate their effects on the cluster lifetimes. Furthermore, linear and uniform data aggregations are considered in our model. As a result, we analyze the cluster lifetimes in different situations and discuss the requirements on the sizes and transmission distances of clusters for equal lifetimes.

• 한국통신학회논문지
• /
• 제35권12A호
• /
• pp.1113-1121
• /
• 2010

VSC(Vehicle Safety Communications)는 차량 사고를 방지하기 위한 VANET 응용 중 하나이며, 차량간 통신을 통해 안전과 관련된 메시지들을 주고받는다. 이를 위하여, VSC에서는 여러 종류의 Selective Flooding 기법들이 제안되었다. Selective Flooding 기법은 긴급메시지를 수신한 차량들 중에서 한 차량만이 릴레이 노드로 선정되는 기법이다. 하지만 이러한 기법들은 전송에러 및 동일 긴급 상황에 대한 메시지 중복 생성을 고려하고 있지 않다. 만일 하나의 차량이 전송 에러가 존재하는 환경에서 위험요소를 발견한 경우, 기존의 기법에서는 응급 메시지를 수신하지 못하는 차량들이 존재할 수 있다. 만일 k개의 차량이 위험요소를 발견한다면, k개의 긴급메시지가 중복 생성되고 후방으로 전파되어 메시지 전달의 신뢰성을 증가할 수 있으나 효율성이 감소한다. 본 논문에서는 전송 에러에 강하며 효율적인 긴급메시지 전달 기법을 제안한다. 제안기법은 클러스터링을 활용하여 메시지 통합 및 클러스터 내 재전송을 수행하며, 신뢰성 있는 클러스터간 통신을 위하여 Acknowledgment 기법을 사용한다. 시뮬레이션 결과 제안기법이 Selective Flooding 기법인 Least Common Neighbor Flooding 보다 나은 성능을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권4호
• /
• pp.665-683
• /
• 2011

Wireless sensor networks (WSN) consist of a large amount of sensor nodes distributed in a certain region. Due to the limited battery power of a sensor node, lots of energy-efficient schemes have been studied. Clustering is primarily used for energy efficiency purpose. However, clustering in WSNs faces several unattained issues, such as ensuring connectivity and scheduling inter-cluster transmissions. In this paper, we propose a location-based spiral clustering (LBSC) algorithm for improving connectivity and avoiding inter-cluster collisions. It also provides reliable location aware routing paths from all cluster heads to a sink node during cluster formation. Proposed algorithm can simultaneously make clusters in four spiral directions from the center of sensor field by using the location information and residual energy level of neighbor sensor nodes. Three logical addresses are used for categorizing the clusters into four global groups and scheduling the intra- and inter-cluster transmission time for each cluster. We evaluated the performance with simulations and compared it with other algorithms.

• 한국항행학회논문지
• /
• 제14권4호
• /
• pp.495-503
• /
• 2010

클러스터링은 모바일 노드들에 대한 정보를 효율적으로 제공해 주며, 라우팅, 대역폭 할당과 같은 처리성능을 향상시키는 중요한 메카니즘이다. 본 논문에서 우리는 이동성(mobility)으로 인한 동적 속성, 평면구조 구조상에서 발생하는 노드 분산 등과 같은 문제를 효과적으로 해결하고 라우팅 성능을 향상시키기 위한 퍼지 적합도 기반의 클러스터링 기법을 제안한다. 제안된 기법은 FSV(Fuzzy_State_Viewing) 구조를 이용하여 퍼지 적합도${\alpha}$를 수행한다. 퍼지 적합도${\alpha}$는 FSV 구조에서 클러스터링을 수행하기 위한 클러스터헤드 CH(ClusterHead)를 선정하는 역할을 수행한다. 본 논문에서는 이와 같이 제안된 클러스터링 기법을 통해서 기존의 1-홉 클러스터 및 2-hop 클러스터에서 발생되는 문제를 해결하도록 하였다. 제안된 기법의 성능을 알아보기 위하여 우리는 NS-2 시뮬레이터를 이용하여 시뮬레이션을 수행하였다. 우리는 시뮬레이션 평가를 위해 기존의 Lowest-ID, MOBIC, SCA 기법 그리고 제안된 기법과의 성능을 비교하였다. 시뮬레이션 결과 제안된 기법의 성능이 Lowest-ID, MOBIC, SCA 기법에 비해서 우수함을 알 수 있다.

• 정보처리학회논문지C
• /
• 제9C권2호
• /
• pp.283-292
• /
• 2002

본 논문에서는 무선/이동 인터넷 환경에서 실시간 트래픽의 QoS 보장을 위한 자원 관리 기법에 대해서 연구한다. 이동단말은 이동성때문에 실시간 응용 서비스에서 요구하는 QoS에 중요한 영향을 갖는다. 현재 제안된 MRSVP는 자원 예약 지역 경계의 불명확성과 또한 세션들을 유지하기 위한 신호 과부하를 발생시킬 수 있다. 이러한 문제를 해결하기 위해, MRSVP[1-5]와 이동 클러스터 개념을 조합한 신규자원 예약 프로토콜-이동클러스 기반의 H-MRSVP(Hierarchical MRSVP)-을 제안한다. 본 논문에서는 실시간 이동 호에 대한 이동 클러스터 기반의 H-MRSVP의 분석적인 모델을 설계하고, 시뮬레이션을 이용하여 보호채널 할당 방식, 분산 호 수락제어 기법과 비교 분석한다. 성능 목표값으로는 신규호 차단율, 핸드오프 호 손실율, 무선 시스템에서이 채널 이용율과 호의 서비스 완료율을 보았다. 결과적으로 제안된 기법이 DCA보다는 채널 이용율 측면에서 좀더 유연하고, 보호채널기법보다는 이동호에 대한 좋은 채널 할당을 한다.

• Journal of Communications and Networks
• /
• 제14권5호
• /
• pp.518-523
• /
• 2012

This paper presents new coherent and non-coherent detection methods for the IEEE 802.15.4a low-rate ultra-wideband physical layer with forward error correction (FEC) coding techniques. The coherent detection method involving channel estimation is based on the correlation characteristics of the preamble signal. A coherent receiver uses novel iterated selective-rake (IT-SRAKE) to detect 2-bit data in a non-line-of-sight channel. The non-coherent detection method that does not involve channel estimation employs a 2-bit data detection scheme using modified transmitted reference pulse cluster (M-TRPC) methods. To compare the two schemes, we have designed an IT-SRAKE receiver and a MTRPC receiver using an IEEE 802.15.4a physical layer. Simulation results show the performance of IT-SRAKE is better than that of the M-TRPC by 3-9 dB.

• Journal of information and communication convergence engineering
• /
• 제6권2호
• /
• pp.117-121
• /
• 2008

In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Therefore, the energy consumption is important in the routing design, otherwise cluster schemes are efficient in energy conserving. For the above reasons, an Energy conserving Context aware Clustering algorithm (ECC) is proposed to establish the network clustering structure, and a routing algorithm is introduced to choose the Optimal Energy Routing Protocol (OERP) path in this paper. Because in ad hoc network, the topology, nodes residual energy and energy consuming rate are dynamic changing. The network system should react continuously and rapidly to the changing conditions, and make corresponding action according different conditions. So we use the context aware computing to actualize the cluster head node, the routing path choosing. In this paper, we consider a novel routing protocol using the cluster schemes to find the optimal energy routing path based on a special topology structure of Resilient Ontology Multicasting Routing Protocol (RODMRP). The RODMRP is one of the hierarchical ad hoc network structure which combines the advantage of the tree based and the mesh based network. This scheme divides the nodes in different level found on the node energy condition, and the clustering is established based on the levels. This protocol considered the residual energy of the nodes and the total consuming energy ratio on the routing path to get the energy efficiently routing. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.

• 천문학회보
• /
• 제39권2호
• /
• pp.50-50
• /
• 2014

We present a new catalog of galaxies in the wider region of the Virgo cluster, based on the Sloan Digital Sky Survey (SDSS) Data Release 7. The Extended Virgo Cluster Catalog (EVCC) covers an area of 725 deg2 or 60.1 Mpc2. It is 5.2 times larger than the footprint of the classical Virgo Cluster Catalog (VCC) and reaches out to 3.5 times the virial radius of the Virgo cluster. We selected 1324 spectroscopically targeted galaxies with radial velocities less than 3000 km s-1. In addition, 265 galaxies that have been missed in the SDSS spectroscopic survey but have available redshifts in the NASA Extragalactic Database are also included. Our selection process secured a total of 1589 galaxies of which 676 galaxies are not included in the VCC. The certain and possible cluster members are defined by means of redshift comparison with a cluster infall model. We employed two independent and complementary galaxy classification schemes: the traditional morphological classification based on the visual inspection of optical images and a characterization of galaxies from their spectroscopic features. SDSS u, g, r, i, and z passband photometry of all EVCC galaxies was performed using Source Extractor. We compare the EVCC galaxies with the VCC in terms of morphology, spatial distribution, and luminosity function. The EVCC defines a comprehensive galaxy sample covering a wider range in galaxy density that is significantly different from the inner region of the Virgo cluster. It will be the foundation for forthcoming galaxy evolution studies in the extended Virgo cluster region, complementing ongoing and planned Virgo cluster surveys at various wavelengths.