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

• 한국멀티미디어학회논문지
• /
• 제19권5호
• /
• pp.910-917
• /
• 2016

Sensors have limited resources in sensor networks, so efficient use of energy is important. Representative clustering methods, LEACH, LEACHC, TEEN generally use direct transmission methods from cluster headers to the sink node to pass collected data. However, the communication distance of the sensor nodes at low cost and at low power is not long, it requires a data transfer through the multi-hop to transmit data to the sink node. In the existing cluster-based sensor network studies, cluster process and route selection process are performed separately in order to configure the routing path to the sink node. In this paper, in order to use the energy of the sensor nodes that have limited resources efficiently, a cluster-based multi-hop routing protocol which merges the clustering process and routing process is proposed. And the proposed method complements the problem of uneven cluster creation that may occur in probabilistic cluster methods and increases the energy efficiency of whole sensor nodes.

• 한국멀티미디어학회논문지
• /
• 제21권6호
• /
• pp.667-677
• /
• 2018

Since sensor networks consist of sensor nodes with limited energy resources, so efficient energy use of sensor nodes is very important in the design of sensor networks. Sensor nodes consume a lot of energy for data transmission. Clustering technique is used to efficiently use energy in data transmission. Recently, mobile sink techniques have been proposed to reduce the energy load concentrated on the cluster header near a sink node. The CMS(Cluster-based Mobile sink) technique minimizes the generation of control messages by creating a data transmission path while creating clusters, and supports the inter-cluster one-hop transmission. But, there is a case where there is no connectivity between neighbor clusters, it causes a problem of having a long hop data transmission path regardless of local distance. In this paper, we propose a SCBC(Strong connection balancing cluster) to support the path of the minimum number of hops. The proposed scheme minimizes the number of hops in the data transmission path and supports efficient use of energy in the cluster header. This also minimizes a number of hops in data transmission paths even when the sink moves and establishes a new path, and it supports the effect of extending the life cycle of the entire sensor network.

• IEIE Transactions on Smart Processing and Computing
• /
• 제6권3호
• /
• pp.200-209
• /
• 2017

In this paper, we investigate the tradeoff between security and reliability for a multi-hop protocol in cluster-based underlay cognitive radio networks. In the proposed protocol, a secondary source communicates with a secondary destination via the multi-hop relay method in the presence of a secondary eavesdropper. To enhance system performance under the joint impact of interference constraint required by multiple primary users and hardware impairments, the best relay node is selected at each hop to relay the source data to the destination. Moreover, the destination is equipped with multiple antennas and employs a selection combining (SC) technique to combine the received data. We derive closed-form expressions of the intercept probability (IP) for the eavesdropping links and the outage probability (OP) for the data links over a Rayleigh fading channel. Finally, the correction of our derivations is verified by Monte-Carlo simulations.

• 한국통신학회논문지
• /
• 제39B권11호
• /
• pp.763-770
• /
• 2014

무선 센서 네트워크를 위한 전통적인 계층기반 라우팅 프로토콜인 LEACH 방법은 센서 노드들의 에너지 소비가 싱크 노드까지의 거리에 비례하여 증가하기에 불균일한 에너지 소비패턴을 보인다. 센서 필드가 큰 경우 이를 해결하기 위하여 멀티 홉 라우팅에 관한 연구들이 활발히 진행되고 있다. 기존의 연구에서는 클러스터 헤드로부터 단순히 가장 가까운 노드를 중계 노드로 선택하여 멀티 홉 경로를 구성하는데 반하여, 본 논문에서 제안하는 LEACH-CHT 방법은 최종 목적지인 싱크 노드까지의 전체 전송 에너지를 최소화 하는 경로를 선택한다. 본 논문의 방법은 클러스터 헤드가 매 홉에서 싱크 노드까지의 최소 비용 경로를 선택함으로써 추가적인 에너지 소비 없이 클러스터 헤드 자신보다 싱크 노드에서 멀리 위치한 노드들이 중간 경로 상에서 제외 되도록 하며 라우팅 상의 looping 문제를 효과적으로 해결할 수 있다. 컴퓨터 시뮬레이션을 통하여 본 논문에서 제안하는 방법이 노드들의 에너지 소모를 보다 균일하게 함으로써 LEACH보다 센서 노드의 평균 수명을 36% 더 연장하였고 참고한 기존의 멀티 홉 프로토콜들보다 12% ~ 36% 더 연장함으로써 성능이 더 뛰어나다는 것을 보였다.

• Journal of Information Processing Systems
• /
• 제6권1호
• /
• pp.53-66
• /
• 2010

The energy efficiency is a key design issue to improve the lifetime of the underwater sensor networks (UWSN) consisting of sensor nodes equipped with a small battery of limited energy resource. In this paper, we apply a hexagon tessellation with an ideal cell size to deploy the underwater sensor nodes for two-dimensional UWSN. Upon this setting, we propose an enhanced hybrid transmission method that forwards data packets in a mixed transmission way based on location dependent direct transmitting or uniform multi-hop forwarding. In order to select direct transmitting or uniform multi-hop forwarding, the proposed method applies the threshold annulus that is defined as the distance between the cluster head node and the base station (BS). Our simulation results show that the proposed method enhances the energy efficiency compared with the existing multi-hop forwarding methods and hybrid transmission methods

• 융합신호처리학회논문지
• /
• 제14권1호
• /
• pp.45-50
• /
• 2013

센서 네트워크에서 센서는 제한된 에너지 자원을 가지므로, 에너지를 효율적으로 사용하는 것은 중요하다. 대표적인 클러스터링 기법인 LEACH, LEACHC, TEEN 등은 클러스터 헤더가 수집한 정보를 싱크로 전달할 때, 직접 전송을 기본 방법으로 가정한다. 싱크 노드로부터 먼 거리에 클러스터가 위치하는 경우에, 클러스터 헤더는 데이터를 전송하기 위해서 많은 에너지를 소진하고, 이로 인해서 수명이 단축되고, 이 경우에 재클러스터링을 필요로 한다. 클러스터링 과정에서도 센서 노드는 상당한 에너지를 소모한다. 싱크 노드로부터 먼 곳에 위치한 클러스터 헤더의 빠른 에너지 고갈을 억제하기 위해 이웃 클러스터를 통해 싱크로 데이터를 전송하는 방안이 필요하다. 본 연구는 클러스터 센서 네트워크에서 멀티홉 전송 방안으로 토폴로지 행렬을 기반으로 하는 라우팅 기법을 제안한다. 토폴로지 행렬은 클러스터가 구성된 형태를 나타내고, 에너지 효율성을 기준으로 라우팅은 1홉기반 라우팅과 2홉기반 라우팅 기법을 제안한다.

• Journal of information and communication convergence engineering
• /
• 제8권2호
• /
• pp.223-227
• /
• 2010

In this paper, we present a QoS-aware MAC protocol (QA-MAC) for cluster based wireless sensor networks (WSNs). QA-MAC is a TDMA-based scheduling protocol that minimizes the energy consumption in multi-hop WSNs and provides Quality of Service (QoS). A dynamic scheduling algorithm according to the number of member nodes, node traffics, and traffic priorities is suggested. The selected cluster head allocates time slots for all member nodes in the first TDMA schedule period of each round. During the second schedule period in each round, the cluster head makes a schedule for all data transmission. The proposed QA-MAC (QoS-Aware MAC) could save energy, reduce transmission delay, and support QoS.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권4호
• /
• pp.1237-1255
• /
• 2014

In wireless sensor networks (WSNs), hierarchical clustering is an efficient approach for lower energy consumption and extended network lifetime. In cluster-based multi-hop communications, a cluster head (CH) closer to the sink is loaded heavier than those CHs farther away from the sink. In order to balance the energy consumption among CHs, we development a novel cluster-based routing protocol for corona-structured wireless sensor networks. Based on the relaying traffic of each CH conveys, adequate radius for each corona can be determined through nearly balanced energy depletion analysis, which leads to balanced energy consumption among CHs. Simulation results demonstrate that our clustering approach effectively improves the network lifetime, residual energy and reduces the number of CH rotations in comparison with the MLCRA protocols.