• Title/Summary/Keyword: Hierarchical Transmission

Search Result 213, Processing Time 0.024 seconds

A Method of Hierarchical Address Autoconfiguration base on Hop-count in 6LoWPAN (6LoWPAN에서 홉-수 기반 계층적 자동주소할당 방법)

  • Kim, Dong-Kyu;Kim, Jung-Gyu
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.15 no.3
    • /
    • pp.11-21
    • /
    • 2010
  • Increase in the number of sensor nodes in sensor networks and sensor node to automatically assign addresses are needed. The method developed to address existing severe wasting, coordinators have all address information, each sensor node when addressing the shortcomings are a lot of traffic. In this paper, 6LoWPAN automatically from the sensor nodes capable of efficiently addressing Hop-Count based hierarchical address allocation algorithm is proposed. How to propose a hop-count of divided areas are separated, with no overlap and can be assigned a unique address, DAD(Duplicate Address Detection) reduced area. Perform DAD to reduce traffic, packet transmission in the IP header destination address, respectively, with a minimum 32-bit compression and packet transmission over a non-compression method to reduce the number of 11.1%.

Single Image Haze Removal Technique via Pixel-based Joint BDCP and Hierarchical Bilateral Filter (픽셀 기반 Joint BDCP와 계층적 양방향 필터를 적용한 단일 영상 기반 안개 제거 기법)

  • Oh, Won-Geun;Kim, Jong-Ho
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.1
    • /
    • pp.257-264
    • /
    • 2019
  • This paper presents a single image haze removal method via a pixel-based joint BDCP (bright and dark channel prior) and a hierarchical bilateral filter in order to reduce computational complexity and memory requirement while improving the dehazing performance. Pixel-based joint BDCP reduces the computational complexity compared to the patch-based DCP, while making it possible to estimate the atmospheric light in pixel unit and the transmission more accurately. Moreover the bilateral filter, which can smooth an image effectively while preserving edges, refines the transmission to reduce the halo effects, and its hierarchical structure applied to edges only prevents the increase of complexity from the iterative application. Experimental results on various hazy images show that the proposed method exhibits excellent haze removal performance with low computational complexity compared to the conventional methods, and thus it can be applied in various fields.

A MAC Protocol based on Hi.erarchical Virtual Clusters (계층적 가상 클러스터 기반 MAC 프로토콜)

  • Back, Doo-Sung;Pyun, Ki-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.5
    • /
    • pp.93-102
    • /
    • 2009
  • Environmental monitoring applications measure temporature, humidity, and pollution degrees of large areas periodically and are essential for ubiquitous society. In this paper, we propose a sensor network MAC protocol that is applicable to environmental monitoring applications. The proposing MAC protocol has scalability by constructing multiple groups of sensor nodes as in SMAC protocol. Differently from SMAC protocol, however, ours have hierarchical structure between adjacent groups. Data transmission schedules are efficient since lower groups are synchronized to higher groups. Thus. the end-to-end delays and energy consumption can be reduced due to sequential transmission schedules. But since the nodes within the same group are synchronized to themselves. they have good adaptability and scalability compared to existing hierarchical approaches such as DMAC. We show by simulations that the proposing MAC protocol is superior to SMAC for environmental monitoring applications.

Stability Analysis of Multi-motor Controller based on Hierarchical Network (계층적 네트워크 기반 다중 모터 제어기의 안정도 분석)

  • Chanwoo Moon
    • The Journal of the Convergence on Culture Technology
    • /
    • v.9 no.3
    • /
    • pp.677-682
    • /
    • 2023
  • A large number of motors and sensors are used to drive a humanoid robot. In order to solve the wiring problem that occurs when connecting multiple actuators, a controller based on a communication network has been used, and CAN, which is advantageous in terms of cost and a highly reliable communication protocol, was mainly used. In terms of the structure of the controller, a torque control type structure that is easy to implement an advanced algorithm into the upper controller is preferred. In this case, the low communication bandwidth of CAN becomes a problem, and in order to obtain sufficient communication bandwidth, a communication network is configured by separating into a plurality of CAN networks. In this study, a stability analysis on transmission time delay is performed for a multi-motor control system in which high-speed FlexRay and low-speed CAN communication networks are hierarchically connected in order to obtain a high communication bandwidth, and sensor information and driving signals are delivered within the allowed transmission time. The proposed hierarchical network-based control system is expected to improve control performance because it can implement multiple motor control systems with a single network.

DL-LEACH: Hierarchical Dual-Hop Routing Protocol for Wireless Sensor Network (DL-LEACH : 무선 센서 네트워크를 위한 계층형 멀티 홉 라우팅 프로토콜)

  • Lee, Chang-Hee;Lee, Jong-Yong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.5
    • /
    • pp.139-145
    • /
    • 2015
  • This paper proposes to increase the node energy effienciecy, which rapidly drops during the transmission of LEACH (Low Energy Adaptive Clustering Hierachy), using the method of DL-LEACH (Dual-hop Layered LEACH). By introducing dual-hop method in the data transmission, the proposed single-hop method for short-range transmission and multi-hop transmission method between the cluster heads for remote transmission was introduce. By introducing a partial multi-hop method in the data transmission, a single-hop method for short range transmission method between the cluster heads for remote transmission was introduces. In the proposed DL-LEACH, the energy consumption of cluster head for remote transmission reduces and increases the energy efficiency of sensor node by reducing the transmission distance and simplifying the transmission routine for short-range transmission. As compared the general LEACH, it was adapted to a wider sensor field.

An Energy Efficient Chain-based Routing Protocol for Wireless Sensor Networks

  • Sheikhpour, Razieh;Jabbehdari, Sam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.6
    • /
    • pp.1357-1378
    • /
    • 2013
  • Energy constraint of wireless sensor networks makes energy saving and prolonging the network lifetime become the most important goals of routing protocols. In this paper, we propose an Energy Efficient Chain-based Routing Protocol (EECRP) for wireless sensor networks to minimize energy consumption and transmission delay. EECRP organizes sensor nodes into a set of horizontal chains and a vertical chain. Chain heads are elected based on the residual energy of nodes and distance from the header of upper level. In each horizontal chain, sensor nodes transmit their data to their own chain head based on chain routing mechanism. EECRP also adopts a chain-based data transmission mechanism for sending data packets from the chain heads to the base station. The simulation results show that EECRP outperforms LEACH, PEGASIS and ECCP in terms of network lifetime, energy consumption, number of data messages received at the base station, transmission delay and especially energy${\times}$delay metric.

Solving Mixed Strategy Equilibria of Multi-Player Games with a Transmission Congestion (다자게임 전력시장에서 송전선 혼잡시의 복합전략 내쉬균형 계산)

  • Lee, Kwang-Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.55 no.11
    • /
    • pp.492-497
    • /
    • 2006
  • Nash Equilibrium (NE) is essential to investigate a participant's bidding strategy in a competitive electricity market. The transmission line constraints make it difficult to compute the NE due to causing a mixed strategy NE instead of a pure strategy NE. Computing a mixed strategy is more complicated in a multi-player game. The competition among multi-participants is modeled by a two-level hierarchical optimization problem. A mathematical programming approach is widely used in finding this equilibrium. However, there are difficulties to solving a mixed strategy NE. This paper presents two propositions to add heuristics to the mathematical programming method. The propositions are based on empirical studies on mixed strategies in numerous sample systems. Based on the propositions a new formulation is provided with a set of linear and nonlinear equations, and an algorithm is suggested for using the prepositions and the newly-formulated equations.

A Study on Secure Routing Technique using Trust Value and Key in MANET (신뢰도와 키를 이용한 보안 라우팅 기법에 관한 연구)

  • Yang, Hwanseok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.11 no.3
    • /
    • pp.69-77
    • /
    • 2015
  • MANET is composed of only the mobile nodes have a limited transmission range. The dynamic topology by the frequent movement of nodes makes routing difficult and is also cause exposed to security vulnerabilities. In this paper, we propose the security routing technique consisted of mechanism of two steps in order to respond effectively to attack by the modification of the routing information and transmit secure data. The hierarchical structure is used and the authentication node that issues the key of the nodes within each cluster is elected in this proposed method. The authentication node manages key issues and issued information for encrypting the routing information from the source node. The reliability value for each node is managed to routing trust table in order to secure data transmission. In the first step, the route discovery is performed using this after the routing information is encrypted using the key issued by the authentication node. In the second step, the average reliability value of the node in the found path is calculated. And the safety of the data transmission is improved after the average reliability value selects the highest path. The improved performance of the proposed method in this paper was confirmed through comparative experiments with CBSR and SEER. It was confirmed a better performance in the transmission delay, the amount of the control packet, and the packet transmission success ratio.

A Study on Trusted Routing Scheme for Secure Path and Secure Data Transmission in MANET (MANET에서 보안 경로와 안전한 데이터 전송을 위한 신뢰 기반 라우팅 기법에 관한 연구)

  • Yang, Hwanseok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.13 no.2
    • /
    • pp.43-51
    • /
    • 2017
  • Recently, MANET has been used in many fields as the range of applications increases. However, the dynamic topology that MANET has makes it difficult to route and provides the cause of exposure to security vulnerabilities. Therefore, the security features that can be robust to many attacks must have been applied in the routing technique provided in the MANET. In this paper, we propose a secure routing method that secure route is established by reliability evaluation of nodes and secure data communication has applied through key exchange mechanism. The proposed technique used hierarchical structure for efficiency of reliability evaluation of nodes. The reliability of nodes is performed by trust management node and reliability of nodes managed periodically is broadcasted. And the key exchange for secure data transmission is dene without CA as the certificate issuing organization. This allows fast key exchange and the integrity of data transmission improved. The proposed technique improves the security of the data transmission because a secure route to the destination node is established by the reliability evaluation and the data transmission is performed after the key between the source node and the destination node is exchanged through the established route.

A Data Aggregation Scheme based on Designated Path for Efficient Energy Management of Sensor Nodes in Geosensor Networks (지오센서 네트워크에서 센서 노드의 효율적인 에너지 관리를 위한 지정 경로 기반 데이터 집계 처리 기법)

  • Yoon, Min;Kim, Yong-Ki;Bista, Rabindra;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.12 no.1
    • /
    • pp.10-17
    • /
    • 2010
  • Sensor nodes used in Geosensor network are resource limited and power constrained. So it is necessary to research on routing protocols to gather data by using energy efficiently. Wireless sensor networks collect data gathered from sensor nodes by transfering it to the sink using multihop. However, it has two problems. First, the existing works require unnecessary data transmission for choosing a proper parent node to transfer data. Secondly, they have a large number of data transmission because each sensor node has a different path. To solves the problems, we, in this paper, propose a designated path based data aggregation scheme for efficient energy management in WSNs. The proposed scheme can reduce unnecessary data transmission by pre-determining a set of paths and can enable all the sensor nodes to participate in gathering data by running them in round-robin fashion. We show from performance analysis that the proposed scheme is more energy efficient than the existing directed diffusion(DD) and the hierarchical data aggregation(HDA).