• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권3호
• /
• pp.224-242
• /
• 2010

Data routing in wireless sensor networks must be energy-efficient because tiny sensor nodes have limited power. A cluster-based hierarchical routing is known to be more efficient than a flat routing because only cluster-heads communicate with a sink node. Existing hierarchical routings, however, assume unrealistically large radio transmission ranges for sensor nodes so they cannot be employed in real environments. In this paper, by considering the practical transmission ranges of the sensor nodes, we propose a clustering and routing method for hierarchical sensor networks: First, we provide the optimal ratio of cluster-heads for the clustering. Second, we propose a d-hop clustering scheme. It expands the range of clusters to d-hops calculated by the ratio of cluster-heads. Third, we present an intra-cluster routing in which sensor nodes reach their cluster-heads within d-hops. Finally, an inter-clustering routing is presented to route data from cluster-heads to a sink node using multiple hops because cluster-heads cannot communicate with a sink node directly. The efficiency of the proposed clustering and routing method is validated through extensive simulations.

• 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.

• Journal of Communications and Networks
• /
• 제17권1호
• /
• pp.84-92
• /
• 2015

Multi-hop relay networks have been widely considered as a promising solution to extend the coverage area and to reduce the deployment cost by deploying the relay stations (RSs) in mobile communication systems. Suitable deployment for the RSs is one of the most important features of the demand nodes (DNs) to obtain a high data transmission rate in such systems. Considering a tradeoff among the network throughput, the deployment budget, and the overall coverage of the systems, efficient RS deployment schemes and corresponding algorithms must be developed and designed. A novel cluster-based RS deployment scheme is proposed in this paper to select the appropriate deployment locations for the relay stations from the candidate positions. To make an ideal cluster distribution, the distances between the DNs are calculated when deploying the RSs. We take into account the traffic demands and adopt a uniform cluster concept to reduce the data transmission distances of the DNs. On the basis of the different candidate positions, the proposed scheme makes an adaptive decision for selecting the deployment sites of the RSs. A better network throughput and coverage ratio can be obtained by balancing the network load among the clusters. Simulation results show that the proposed scheme outperforms the previously known schemes in terms of the network throughput and the coverage ratio. Additionally, a suitable deployment budget can be implemented in multi-hop relay networks.

• 한국정보통신학회논문지
• /
• 제17권4호
• /
• pp.996-1004
• /
• 2013

본 논문에서는 무선 센서 네트워크에서 센서 노드들 간의 에너지 소비 불균형을 개선하여 무선 센서 네트워크의 전체적인 수명을 연장할 수 있는 클러스터링 기법들을 제안한다. 무선 센서 네트워크의 생성 단계에서 무선 센서 네트워크의 에너지 소모를 줄이기 위해서 센서 노드들의 밀도에 따라 클러스터 헤더를 선출하여 클러스터를 형성한다. 그 이후 센서 네트워크가 활성화되는 동안 센서 노드들 간의 에너지 불균형을 개선하기 위하여 에너지 소모량을 추정한 후 릴레이 기반으로 다음 라운드의 클러스터 헤더를 선출한다.

• International journal of advanced smart convergence
• /
• 제7권2호
• /
• pp.22-32
• /
• 2018

In VANET, frequent movement of nodes causes dynamic changes of the network topology. Therefore the routing protocol, which is stable to effectively respond the changes of the network topology, is required. Moreover, the existing cluster-based routing protocol, that is the hybrid approach, has routing delay due to the frequent re-electing of the cluster header. In addition, the routing table of CBRP has only one hop distant neighbor nodes. PCBRP (Paired CBRP), proposed in this paper, ties two clusters in one pair of clusters to make longer radius. Then the pair of the cluster headers manages and operates corresponding member nodes. In the current CBRP, when the cluster header leaves the cluster the delay, due to the re-electing a header, should be occurred. However, in PCBRP, another cluster header of the paired cluster takes the role instead of the left cluster header. This means that this method reduces the routing delay. Concurrently, PCBRP reduces the delay when routing nodes in the paired cluster internally. Therefore PCBRP shows improved total delay of the network and improved performance due to the reduced routing overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.1133-1151
• /
• 2010

Energy balanced consumption routing is based on assumption that the nodes consume energy both in transmitting and receiving. Lopsided energy consumption is an intrinsic problem in low-cost sensor networks characterized by multihop routing and in many traffic overhead pattern networks, and this irregular energy dissipation can significantly reduce network lifetime. In this paper, we study the problem of maximizing network lifetime through balancing energy consumption for uniformly deployed low-cost sensor networks. We formulate the energy consumption balancing problem as an optimal balancing data transmitting problem by combining the ideas of corona cluster based network division and optimized transmitting state routing strategy together with data transmission. We propose a localized cluster based routing scheme that guarantees balanced energy consumption among clusters within each corona. We develop a new energy cluster based routing protocol called "OECR". We design an offline centralized algorithm with time complexity O (log n) (n is the number of clusters) to solve the transmitting data distribution problem aimed at energy balancing consumption among nodes in different cluster. An approach for computing the optimal number of clusters to maximize the network lifetime is also presented. Based on the mathematical model, an optimized energy cluster routing (OECR) is designed and the solution for extending OEDR to low-cost sensor networks is also presented. Simulation results demonstrate that the proposed routing scheme significantly outperforms conventional energy routing schemes in terms of network lifetime.

• 한국멀티미디어학회논문지
• /
• 제11권8호
• /
• pp.1082-1092
• /
• 2008

무선 센서 네트워크에서 LEACH와 같은 클러스터링 프로토콜은 전체 네트워크의 수명을 연장시키는 효율적인 방법이지만 클러스터 헤드 노드에 높은 부하를 주게 되어 급격한 에너지 소모를 유발하는 문제가 있다. 따라서 클러스터의 구성과 클러스터 헤드 노드의 역할을 주기적으로 교체하여 네트워크의 수명을 연장시켰다. 그러나 이 방법은 클러스터를 구성하는 과정에서 상당한 량의 에너지 소모를 보인다. 따라서 본 논문은 소모되는 에너지의 효율성 증대를 위해 클러스터링 알고리즘을 제안하였다. 이 알고리즘에서 서로 인접한 노드들은 intra cluster를 이루며 이 클러스터를 구성하는 노드들은 라운드 로빈 형태로 데이터를 수집하고 전송한다. 전체 네트워크의 관점에서 볼 때 이 intra cluster는 한개의 노드로 취급된다. 한 라운드의 setup단계에서 intra cluster들은 클러스터 헤드(intra cluster)에 의해 다시 클러스터를 형성(network cluster)하게 된다. 클러스터 헤드가 된 intra cluster의 모든 멤버노드는 라운드 로빈 방식으로 클러스터 헤드 역할을 수행한다. 따라서 intra cluster의 크기에 의해 라운드의 주기를 연장할 수 있다. 또한 steady-state에서 각 intra cluster의 노드는 라운드 로빈 방식으로 데이터를 수집하며 network cluster의 클러스터 헤드에 전송한다. 성능분석 결과 제안하는 방법은 제안된 클러스터링 방법에 비해 노드들의 에너지 소모가 줄어들었으며 전송 효율이 증가하였다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1996년도 추계학술대회발표논문집; 고려대학교, 서울; 26 Oct. 1996
• /
• pp.31-34
• /
• 1996

The extensive researches have compared the performance of neural networks(NN) with those of various statistical techniques for the classification problem. The empirical results of these comparative studies have indicated that the neural networks often outperform the traditional statistical techniques. Moreover, there are some efforts that try to combine various classification methods, especially multivariate discriminant analysis with neural networks. While these efforts improve the performance, there exists a problem violating robust assumptions of multivariate discriminant analysis that are multivariate normality of the independent variables and equality of variance-covariance matrices in each of the groups. On the contrary, cluster analysis alleviates this assumption like neural networks. We propose a new approach to classification problems by combining the cluster analysis with neural networks. The resulting predictions of the composite model are more accurate than each individual technique.

• 전자공학회논문지
• /
• 제50권8호
• /
• pp.103-109
• /
• 2013

이동 애드혹 네트워크는 역동적인 구조를 가지는 단독적 네트워크로서 기반 시설을 필요로 하지 않는다. 애드혹 네트워크에서 사용자의 안전성을 제공하기 위해서는 기본적이면서도 다양한 보안 서비스가 제공되어야 한다. 특히 모바일 상업 시장을 고려할 때, 사용자의 프라이버시 보호는 중요하게 고려 되여야 할 보안 요구사항이다. 최근 클러스터 기반 이동 애드혹 네트워크 환경에서 익명성을 보장하는 보안 시스템이 연구되고 있다. 본 논문에서는 익명성을 보장하는 클러스터 기반 이동 애드혹 네트워크에서 네트워크의 안정성을 향상시키기 위한 클러스터 갱신 프로토콜을 제안한다. 제안하는 방식을 통해서 개선된 익명성을 보장하는 이동 애드혹 네트워크는 특정 클러스터 헤더의 비정상적인 상태에서도 네트워크 구조를 회복할 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권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%.