• ETRI Journal
• /
• 제40권5호
• /
• pp.604-612
• /
• 2018

To solve the problem of unbalanced loads and the short network lifetime of heterogeneous wireless sensor networks, this paper proposes a node-selection algorithm based on energy balance and dynamic adjustment. The spacing and energy of the nodes are calculated according to the proximity to the network nodes and the characteristics of the link structure. The direction factor and the energy-adjustment factor are introduced to optimize the node-selection probability in order to realize the dynamic selection of network nodes. On this basis, the target path is selected by the relevance of the nodes, and nodes with insufficient energy values are excluded in real time by the establishment of the node-selection mechanism, which guarantees the normal operation of the network and a balanced energy consumption. Simulation results show that this algorithm can effectively extend the network lifetime, and it has better stability, higher accuracy, and an enhanced data-receiving rate in sufficient time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권3호
• /
• pp.1083-1097
• /
• 2018

This paper presents a novel range-free localization algorithm based on quantum particle swarm optimization. The proposed algorithm is capable of estimating the distance between two non-neighboring sensors for multi-hop heterogeneous wireless sensor networks where all nodes' communication ranges are different. Firstly, we construct a new cumulative distribution function of expected hop progress for sensor nodes with different transmission capability. Then, the distance between any two nodes can be computed accurately and effectively by deriving the mathematical expectation of cumulative distribution function. Finally, quantum particle swarm optimization algorithm is used to improve the positioning accuracy. Simulation results show that the proposed algorithm is superior in the localization accuracy and efficiency when used in random and uniform placement of nodes for heterogeneous wireless sensor networks.

• 한국산학기술학회논문지
• /
• 제11권3호
• /
• pp.896-905
• /
• 2010

유비쿼터스 센서 네트워크 환경은 다양한 이기종의 센서와 센서들 상호간의 통신을 통해 데이터를 수집하고 제공하여 물리공간의 지능화된 환경을 제공한다. 이러한 상태감지를 위한 센서노드들은 싱크노드와 센서노드로 구성되는데 이기종 센서 노드들간의 시간동기화를 고려하지 않고 전체 센서네트워크의 시간 동기화가 불가능 하게 된다는 문제점이 발생한다. 이러한 이기종 센서노드들간의 시간동기화 문제를 해결하기 위해서 본 논문에서는 싱크노드 아래의 센서노드들 중 싱크노드와 클럭소스가 같은 센서노드를 시간동기 마스터로 설정하고, 싱크노드와 다른 클럭소스를 가지는 센서노드를 마스터 아래에 속하는 시간동기 슬레이브로 설정하여 시간동기 마스터가 동작을 개시 할 때에만 시간동기 슬레이브 노드들이 동작하도록 하는 마스터 슬레이브 시간동기화 기법을 제안한다. 제안하는 마스터-슬레이브 토폴로지 기반 시간 동기화 기법은 센서의 설치가 용이하지 않은 USN환경에서 최대 슬립타임을 유지함으로써 센서의 전력소모를 최소화 할 수 있다.

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

In this paper, we propose a symmetric key establishment scheme for wireless sensor networks which tries to minimize the resource usage while satisfying the security requirements. This is accomplished by taking advantage of the communication pattern of wireless sensor networks and adopting heterogeneous wireless sensor networks. By considering the unique communication pattern of wireless sensor networks due to the nature of information gathering from the physical world, the number of keys to be established is minimized and, consequently, the overhead spent for establishing keys decreases. With heterogeneous wireless sensor networks, we can build a hybrid scheme where a small number of powerful nodes do more works than a large number of resource-constrained nodes to provide enhanced security service such as broadcast authentication and reduce the burden of resource-limited nodes. In addition, an on-demand key establishment scheme is introduced to support extra communications and optimize the resource usage. Our performance analysis shows that the proposed scheme is very efficient and highly scalable in terms of storage, communication and computation overhead. Furthermore, our proposed scheme not only satisfies the security requirements but also provides resilience to several attacks.

• International Journal of Internet, Broadcasting and Communication
• /
• 제9권4호
• /
• pp.51-58
• /
• 2017

This paper deals with the improvement of cluster head selection method in L-SEP for heterogeneous nodes among hierarchical routing protocols of wireless sensor network. Wireless sensor networks are classified into homogeneous and heterogeneous network. In heterogeneous network, SEP, L-SEP are mainly used because cluster head selection probability is different depending on node type. But, since protocol based on SEP has different cluster head selection probabilities depending on the node type, clusters that transmit data inefficiently can be formed. to improve this, it is necessary to select the cluster head that minimizes the transmission distance of member node and the cluster head. Therefore, we propose a protocol that improve the cluster head selection method.

• Journal of Information Processing Systems
• /
• 제13권3호
• /
• pp.500-517
• /
• 2017

In this paper, an improved zone-based routing protocol for heterogeneous wireless sensor networks is proposed. The proposed protocol has fixed the sized zone according to the distance from the base station and used a dynamic clustering technique for advanced nodes to select a cluster head with maximum residual energy to transmit the data. In addition, we select an optimal route with minimum energy consumption for normal nodes and conserve energy by state transition throughout data transmission. Simulation results indicated that the proposed protocol performed better than the other algorithm by reducing energy consumption and providing a longer network lifetime and better throughput of data packets.

• Journal of Communications and Networks
• /
• 제15권3호
• /
• pp.292-300
• /
• 2013

Nowadays, energy saving has become a hot topic and information and communication technology has become a major power consumer. In long term evolution advanced (LTE-A) networks, heterogeneous deployments of low-power nodes and conventional macrocells provide some new features, such as coverage extension, throughput enhancement, and load balancing. However, a large-scale deployment of low-power nodes brings substantial energy consumption and interference problems. In this paper, we propose a novel switching strategy (NS), which adaptively switches on or off some low-power nodes based on the instantaneous load of the system. It is compatible with the microcells' load balancing feature and can be easily implemented on the basis of existing LTE-A specifications. Moreover, we develop an analytical model for analyzing the performance of system energy consumption, block rate, throughput, and energy efficiency. The performance of NS is evaluated by comparison with existing strategies. Theoretical analysis and simulation results show that NS not only has a low block rate, but also achieves a high energy efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권4호
• /
• pp.1182-1199
• /
• 2023

Fractional repetition (FR) codes can achieve exact uncoded repair for multiple failed nodes, with lower computational complexity and bandwidth overhead, and effectively improve repair performance in distributed storage systems (DSS). The actual distributed storage system is dynamic, that is, the parameters such as node storage overhead and number of storage nodes will change randomly and dynamically. Considering that traditional FR codes cannot be flexibly applied to dynamic distributed storage systems, a new construction scheme of adaptive-and-resolvable FR codes based on hypergraph coloring is proposed in this paper. Specifically, the linear uniform regular hypergraph can be constructed based on the heuristic algorithm of hypergraph coloring proposed in this paper. Then edges and vertices in hypergraph correspond to nodes and coded packets of FR codes respectively, further, FR codes is constructed. According to hypergraph coloring, the FR codes can achieve rapid repair for multiple failed nodes. Further, FR codes based on hypergraph coloring can be generalized to heterogeneous distributed storage systems. Compared with Reed-Solomon (RS) codes, simple regenerating codes (SRC) and locally repairable codes (LRC), adaptive-and-resolvable FR codes have significant advantages over repair locality, repair bandwidth overhead, computational complexity and time overhead during repairing failed nodes.

• 한국통신학회논문지
• /
• 제37B권11호
• /
• pp.993-1003
• /
• 2012

본 논문에서는 무선 이동 단말이 이기종 망의 다중 연결을 통해 높은 대역폭을 이용하고 또한 이기종 망의 동시사용을 통해 손실 패킷을 감소시킬 수 있는 기법을 제안한다. 현재의 이동 단말은 하나의 네트워크를 통해 데이터를 전송한다. 하지만 제안하는 기법은 이동 단말이 WLAN과 3G망 등 다수의 망이 존재하는 환경에서 하나의 망을 사용하는 것이 아니라 이기종의 망의 동시 사용을 통해 대역폭을 넓게 사용한다. 이기종 망을 동시에 사용할 수 있는 지역으로 이동 단말이 이동하게 되면 이를 인지한 이동 단말은 서버에 이기종 무선망 동시사용 허용 요청을 하게 되고, 이를 수신한 서버는 다수의 프로토콜 연결을 통해 데이터를 전송하게 된다. 또한 제안하는 기법은 이동 단말이 다른 네트워크로 이동할 때 기존의 망을 끊지 않기 때문에 핸드오버 구간에서 발생하는 패킷 손실이 감소하게 된다. 제안하는 기법을 네트워크 시뮬레이션(NS-2)을 통해 실험하였고, 처리량이 향상되었음을 확인하였다.

• ETRI Journal
• /
• 제38권3호
• /
• pp.529-539
• /
• 2016

Recently, a product-matrix (PM) framework was proposed to construct optimal regenerating codes for homogeneous distributed storage systems (DSSs). In this paper, we propose an extended PM (EPM) framework for coding of heterogeneous DSSs having different repair bandwidths but identical storage capacities. Based on the EPM framework, an explicit construction of minimum remote-repair bandwidth regenerating (MRBR) codes is presented for a specific heterogeneous DSS, where two geographically different datacenters with associated storage nodes are deployed. The data reconstruction and regeneration properties of the MRBR code are proved strictly. For the purpose of demonstration, an example implementation of MRBR code is provided. The presented MRBR code is the first optimal strict-regenerating code for heterogeneous DSSs. In addition, our proposed EPM framework can be applied to homogeneous systems also.