• Journal of Information Processing Systems
• /
• 제19권1호
• /
• pp.17-32
• /
• 2023

Centralized hierarchical routing protocols are often used to solve the problems of uneven energy consumption and short network life in wireless sensor networks (WSNs). Clustering and cluster head election have become the focuses of WSNs. In this paper, an energy balanced clustering routing algorithm optimized by sine cosine algorithm (SCA) is proposed. Firstly, optimal cluster head number per round is determined according to surviving node, and the candidate cluster head set is formed by selecting high-energy node. Secondly, a random population with a certain scale is constructed to represent a group of cluster head selection scheme, and fitness function is designed according to inter-cluster distance. Thirdly, the SCA algorithm is improved by using monotone decreasing convex function, and then a certain number of iterations are carried out to select a group of individuals with the minimum fitness function value. From simulation experiments, the process from the first death node to 80% only needs about 30 rounds. This improved algorithm balances the energy consumption among nodes and avoids premature death of some nodes. And it greatly improves the energy utilization and extends the effective life of the whole network.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.1982-1985
• /
• 2003

Future cellular networks will mainly be driven by, high quality channels, high band with utilization, low power consumption and efficient network management. For a given channel allocation, the capacity and quality of communication of cellular radio systems using CDMA(Code Division Multiple Access) can be increased by using a transmitter power control scheme to combat the near-far problem. Centralized power control schemes or distributed ones to maximize the minimum signal-to-interference in each user of CDMA wireless network have been investigated. This paper has proposed a distributed power control algorithm, which employs an adaptive search scheme, in order to solve quickly the linear systems of equations for power update in CDMA cellular radio systems. The simulation results show that the proposed scheme has faster convergence rate than the typical bang-bang type of distributed power control algorithm, which has been much used as a reference algorithm in IS-95A and W-CDMA communication network.

• Journal of information and communication convergence engineering
• /
• 제15권1호
• /
• pp.37-42
• /
• 2017

The constrained application protocol (CoAP) can be used for remotely controlling various sensor devices in Internet of Things (IoT) networks. In CoAP, to support the handover of a mobile sensor device, service discovery and message transmission needs to be repeated, although doing so would increase the handover delay significantly. To address this limitation of CoAP, a centralized CoAP scheme has been proposed. However, it tends to result in performance degradation for an inter-domain handover case. In this letter, we propose a distributed CoAP handover scheme to support the inter-domain handover. In the proposed scheme, a distributed mobility agent (DMA) is used for managing the location of mobile sensors in a domain and performing handover control operations with its neighboring DMAs in a distributed manner. A performance comparison reveals that the proposed scheme offers a performance improvement of up to 29.5% in terms of the handover delay.

• 전기전자학회논문지
• /
• 제4권2호
• /
• pp.281-287
• /
• 2000

A mobile ad-hoc network is composed of only mobile nodes, which are distributed dynamically, without any wired backbone or centralized entities. Since the existing works on ad-hoc routing protocol are mostly biased toward a military application, we need a new routing scheme for a support of multimedia services in mobile ad-hoc networks. Therefore, we propose a novel scheme that can support a variety of traffic attributes and can be applicable to high-speed and multimedia data services in mobile ad-hoc networks by using adaptive transmission power level. As a result of simulation, the proposed scheme has better performance than conventional method, which is performed with uniform transmission power level, in view of route query delay time.

• 대한안전경영과학회지
• /
• 제1권1호
• /
• pp.145-157
• /
• 1999

In this paper, a research on the structure and the network configuration of the location register(LR), which database of new locations and service informations of subscribers according to the movement of subscribers in personal communication system(PCS). since the traditional PCS manages all the databases with the location informations as a centralized type. The service informations of the subscribers are centrally controlled by the HLR. So there have been the heavy signal traffic and the call setup delay. In order to relieve such problem, the proposed types of the configurations are the distributed type of PCS scheme and the hierarchical PCS scheme. In the distributed scheme, each PCS has its own LR and in the hierarchical PCS scheme, several LR are grouped to from a layer so that overall structure is a tree style.

• Journal of Communications and Networks
• /
• 제14권2호
• /
• pp.188-194
• /
• 2012

Cognitive networks (CNs) are capable of enabling dynamic spectrum allocation, and thus constitute a promising technology for future wireless communication. Whereas, the implementation of CN will lead to the requirement of an increased energy-arrival rate, which is a significant parameter in energy harvesting design of a cognitive user (CU) device. A well-designed spectrum-sensing scheme will lower the energy-arrival rate that is required and enable CNs to self-sustain, which will also help alleviate global warming. In this paper, spectrum sensing in a multi-user cognitive ad hoc network with a wide-band spectrum is considered. Based on the prospective spectrum sensing, we classify CN operation into two modes: Distributed and centralized. In a distributed network, each CU conducts spectrum sensing for its own data transmission, while in a centralized network, there is only one cognitive cluster header which performs spectrum sensing and broadcasts its sensing results to other CUs. Thus, a wide-band spectrum that is divided into multiple sub-channels can be sensed simultaneously in a distributed manner or sequentially in a centralized manner. We consider the energy consumption for spectrum sensing only of an analog-to-digital convertor (ADC). By formulating energy consumption for spectrum sensing in terms of the sub-channel sampling rate and whole-band sensing time, the sampling rate and whole-band sensing time that are optimal for minimizing the total energy consumption within sensing reliability constraints are obtained. A power dissipation model of an ADC, which plays an important role in formulating the energy efficiency problem, is presented. Using AD9051 as an ADC example, our numerical results show that the optimal sensing parameters will achieve a reduction in the energy-arrival rate of up to 97.7% and 50% in a distributed and a centralized network, respectively, when comparing the optimal and worst-case energy consumption for given system settings.

• 한국통신학회논문지
• /
• 제23권7호
• /
• pp.1639-1649
• /
• 1998

무선 멀티미디어 서비스를 위하여 무선 ATM(Asynchronous Transfer Mode)망에 관한 연구가 현재 활발하게 진행 되고 있다. 이러한 무선 ATM망 환경에서 현재의, 모든 신호 부하가 HLR(Home Location Register)에서 처리되는 중앙 집중구조는 HLR의 부하 집중의 원인이 된다. 따라서 중앙 집중 구조는 호처리 지연의 직접적인 원인으로 작용 하므로 분산 구조를 이용하면 연결설정 지연을 줄일 수 있다. 본 논문에서는 호 처리 및 등록에 대한 시그널링 부 하의 폭증으로 인한 호처리의 지연을 방지하기 위하여 분산 호처리 구조를 기반으로 하는 구조에서 캐쉬(Cache)를 이용한 호처리 절차와 ATM의 Multicasting을 이용한 등록의 캐쉬 갱신(Update)을 통하여 망 전체에 대한 시그널 링 부하를 줄이는 방안을 제시하고 기존 방안과 제안된 방안에 대하여 비용을 비교 분석하였다. 이 결과 제안한 캐쉬 방안이 전체적인 성능향상을 보였으며 특히 이동성이 적고 호 트래픽이 많은 경우에 상당한 성능향상을 나타내었다.

• 정보보호학회논문지
• /
• 제17권4호
• /
• pp.131-136
• /
• 2007

애드혹 네트워크는 완전 분산형 네트워크 구조로 인해 자원 효율성, 확장 가능성, 결함 허용성 측면에서 많은 장점이 있는 반면에, 다른 한편으로는 완전 분산형 네트워크 토폴로지가 보안 서비스 설계에 많은 도전을 안겨주기도 한다. 더구나, 네트워크 노드가 언제든지 추가 또는 탈퇴가 가능한 동적 토폴로지 변화는 보안 메카니즘을 설계 하는데 있어 어려움을 더하게 한다. 따라서, 애드혹 네트워크에서의 보안 서비스는 확장 가능하고 결함 허용이 가능하면서 네트워크 노드의 멤버쉽이 수시로 변경 가능하도록 하는 방식으로 제공되어야 한다. 본 논문에서는 임계치 암호 기술을 활용하여 기존 CA의 기능을 네트워크에 참여하고 있는 노드들에게 분산시켜 네트워크 자체적으로 인증 서비스가 가능 하도록 하는 분산 인증 기술 알고리즘을 살펴본다. 그러던 중 최근에 제안된 RSA 기반 애드혹 서명 알고리즘인 URSA 알고리즘에 중요한 보안 오류들이 있음을 [5]에서 지적한 바 있는데, 본 논문에서는 이들 오류들의 원인을 밝혀내고 이를 수정한 새로운 알고리즘을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권2호
• /
• pp.445-466
• /
• 2022

As everything linking to the internet, people can subscribe to various services from a service provider to facilitate their lives through the Internet of Things (IoT). An obligatory thing for the service provider is that they should push the service data safely and timely to multiple IoT terminal devices regularly after the IoT devices accomplishing the service subscription. In order to control the service message received by the legal devices as while as keep the confidentiality of the data, the public key encryption algorithm is utilized. While the existing public encryption algorithms for push service are too complicated for IoT devices, and almost of the current subscription schemes based on push mode are relying on centralized organization which may suffer from centralized entity corruption or single point of failure. To address these issues, we design a secure subscription-push service scheme based on blockchain and edge computing in this article, which is decentralized with secure architecture for the subscription and push of service. Furthermore, inspired by broadcast encryption and multicast encryption, a new encryption algorithm is designed to manage the permissions of IoT devices together with smart contract, and to protect the confidentiality of push messages, which is suitable for IoT devices. The edge computing nodes, in the new system architecture, maintain the blockchain to ensure the impartiality and traceability of service subscriptions and push messages, meanwhile undertake some calculations for IoT devices with limited computing power. The legalities of subscription services are guaranteed by verifying subscription tags on the smart contract. Lastly, the analysis indicates that the scheme is reliable, and the proposed encryption algorithm is safe and efficient.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.350-353
• /
• 2004

The increasing use of Ethernet-TCP/IP network in industry has led to the growing interest in its reliability in real-time applications such as automated manufacturing systems and process control systems. However, stochastic behavior of its medium access scheme makes it inadequate for time-critical applications. In order to guarantee hard real-time communication service in Ethernet-TCP/IP network, we proposed an algorithm running over TCP/IP protocol stack without modification of protocols. In this paper, we consider communication services guaranteeing deadlines of periodic real-time messages over MAC protocols that have unbounded medium access time. We propose a centralized token scheduling scheme for multiple access networks. The token is used to allow a station to transmit its message during the time amount that is appended to the token. The real-time performance of the proposed algorithm has been described.