• Title/Summary/Keyword: 멀티홉 통신

Search Result 241, Processing Time 0.02 seconds

An Efficient Data Dissemination Protocol for Cluster-based Wireless Sensor Networks (클러스터 기반의 무선 센서네트워크에서 통신량을 줄인 데이터 보급방법)

  • Cho, Ji-Eun;Choe, Jong-Won
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.3
    • /
    • pp.222-230
    • /
    • 2009
  • A sensor network is an important element of the ubiquitous and it consists of sensor fields that contain sensor nodes and sink nodes that collect data from sensor nodes. Since each sensor node has limited resources, one of the important issues covered in the past sensor network studies has been maximizing the usage of limited energy to extend network lifetime. However, most studies have only considered fixed sink nodes, which created various problems for cases with multiple mobile sink nodes. Accordingly, while maintaining routes to mobile sink nodes, this study aims to deploy the hybrid communication mode that combines single and multi-hop modes for intra-cluster and inter-cluster transmission to resolve the problem of failed data transmission to mobile sink nodes caused by disconnected routes. Furthermore, a 2-level hierarchical routing protocol was used to reduce the number of sensor nodes participating in data transmission, and cross-shape trajectory forwarding was employed in packet transmission to provide an efficient data dissemination method.

Environment Monitoring System Using Autonomous Mobile Robot (자율 주행 로봇을 이용한 환경 모니터링 시스템)

  • Jeong, Hye-jin;Kim, Won-jung;Son, Cheol-su;Cho, Byung-lok;Yang, Su-yeong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.1038-1041
    • /
    • 2009
  • Wireless sensor network with wireless sensor nodes which equipped with temperature, humidity, illumination, or soil sensor etc, get a natural environment information and analyze and utilized variety way.these network consist of a short distance wireless communication and multi-hop techniques with multiple nodes equipped low-power wireless transceivers. so the characteristic of the data collected through the wireless sensor network is obtained from compact nodes within a limited range. However, to get a data from the wireless sensor nodes scattered in a wide range, this network needs a wireless transceiver that consumes many power or a lot of intermediate nodes. then, merit of low cost and low electrical energy decrease. To solve this problem, this paper offers environment monitoring system using autonomous mobile robot that collect data from groups of each sensor networks scattered widely.

  • PDF

Query Slipping Prevention for Trajectory-based Contents Publishing and Subscribing in Wireless Sensor Networks (무선 센서 네트워크에서의 궤도 기반 콘텐츠 발간 및 구독을 위한 질의 이탈 방지)

  • Tscha, Yeong-Hwan
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.4
    • /
    • pp.525-534
    • /
    • 2005
  • This paper is concerned with the query slipping and its prevention for trajectory-based matchmaking service in wireless sensor networks. The problem happens when a query propagating along a subscribe trajectory moves through a publish trajectory without obtaining desired information, even though two trajectories intersect geometrically. There follows resubmission of the query or initiation of another subscribe trajectory Thus, query slipping results in considerable time delay and in the worst, looping in the trajectory or query flooding the network. We address the problem formally and suggest a solution. First, the area where nodes are distributed is logically partitioned into smaller grids, and a grid-based multicast next-hop selection algorithm is proposed. Our algorithm not only attempts to make the trajectory straight but also considers the nodal density of recipient nodes and the seamless grid-by-grid multicast. We prove that the publishing and subscribing using the algorithm eventually eliminate the possibility of the slipping. It toms out that our algorithm dissipates significantly less power of neighbor nodes, compared to the non grid-based method, as greedy forwarding, and the fixed- sized grid approach, as GAF (Geographical Adaptive Fidelity)

Implementation of Image Transmission System in Ad-Hoc Network Using AODV Routing Protocol (Ad hoc 네트워크에서 AODV 라우팅 프로토콜을 이용한 영상 전송 시스템 구현)

  • Lee, Sung-Hun;Lee, Hyung-Keun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.7 no.6
    • /
    • pp.92-100
    • /
    • 2008
  • Ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or reliable support services such as wired network and base stations. Recently, Ad-hoc networks are evolving to support multimedia contents according to expansion of ad hoc multi-hop communication system. Wireless ad-hoc network is different from the conventional wired network by frequent changes in network topology, number of routers and resources, there are a number of problems in applying conventional routing protocol to ad-hoc network. The AODV routing protocol is proposed for mobile node in ad-hoc networks. AODV protocol that provides to guarantee QoS for data transmission in ad hoc networks that link break frequently occurs. In this paper, AODV routing protocol based NDIS(Network Driver Interface Specification) is implemented. We design high performance image transmission that can operate with software(AODV) for ad-hoc networks without degradation. and verify operation of AODV routing protocol on the test bed.

  • PDF

Multi-hop Routing Protocol based on Neighbor Conditions in Multichannel Ad-hoc Cognitive Radio Networks (인지 무선 애드혹 네트워크에서의 주변 상황을 고려한 협력적 멀티홉 라우팅 방법)

  • Park, Goon-Woo;Choi, Jae-Kark;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4A
    • /
    • pp.369-379
    • /
    • 2011
  • During the routing process between nodes on the CR(Cognitive Radio) network conducting for efficient use of limited frequency resources, spectrum handover process due to the appearance of the PU occupies most of the routing latency, and also decreases the reliability of the path. In this paper, a cooperative routing protocol in a multi-channel environment is proposed. The source node broadcasts a message with available channel lists and probability of PU appearance during its route guidance. The intermediate nodes re-transmit the message, received from the source node, and update and maintain the information, status table of the path. The destination node determines the optimal path and sends a reply message to the selected path after it receives the messages from the intermediate nodes. The average probability of the PU appearance and the average time of the PU appearance are updated while transferring data. During data transmission the channel with the lowest probability of appearance of the PU is selected dynamically and if a PU appears on the current channel partial repairment is performed. It is examined that reliability of the selected path considerably is improved and the routing cost is reduced significantly compared to traditional routing methods.

LED-to-LED Two Way Visible Light Communication System (LED-to-LED 양방향 가시광통신 시스템)

  • Jo, Seung Wan;Oh, Hoon;Lee, Yeon Jae;Le, The Dung;An, Beongku
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.1
    • /
    • pp.79-85
    • /
    • 2016
  • Recently, visible light communication(VLC) is being actively researched as green wireless communication services are drawing attention. Currently, VLC mostly uses LED for transmission and PD(Photo Diode) for receiving. However, this kind of system has limited applications. Therefore, we design and propose in this paper, a LED-to-LED two way VLC system that doesn't use PD(Photo Diode). This system has the following features and contributions. First, this system uses just LED at both transmitter and receiver with analog switch, Second, this system support both one-way communication and two way communication together. One way communication can support multi-hop communication. The performance evaluation of the proposed system is conducted at a place with standard light. We test the success or failure of one way communication by changing distance and baud rate while test the success and failure of two way communication by changing distance. We expect that the proposed LED-to-LED system in this paper can be applied for various application fields.

A Traffic Aware Demand-Wakeup MAC(TADW-MAC) Protocol for Wireless Sensor Networks (무선 센서 네트워크에서 트래픽에 적응적인 Demand-Wakeup MAC 프로토콜)

  • Kim, Hye-Yun;Kim, Seong-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.1
    • /
    • pp.180-186
    • /
    • 2017
  • In this paper we propose a traffic aware Demand Wakeup MAC(TADW-MAC) protocol, in which low data delay and high throughput can be achieved, for wireless sensor networks. With the TADW-MAC protocol, the problem of the DW-MAC protocol, which schedules only one packet to deliver during the Sleep period in a multi-hop transmission is resolved. DW-MAC is not adequate for the applications such as object tracking and fire detection, in which busty data should be transmitted in a limited time when an event occurs [6-8]. When an event occurs, duty cycle can be adjusted in the TADW-MAC protocol to get less energy consumption and low latency. The duty cycle mechanism has been widely used to save energy consumption of sensor node due to idle listening in wireless sensor networks. But additional delay in packet transmission may be increased in the mechanism. Our simulation results show that TADW-MAC outperforms RMAC and DW-MAC in terms of energy efficiency while achieving low latency.

A Reliable Transmission and Buffer Management Techniques of Event-driven Data in Wireless Sensor Networks (센서 네트워크에서 Event-driven 데이터의 신뢰성 있는 전송 및 버퍼 관리 기법)

  • Kim, Dae-Young;Cho, Jin-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.6B
    • /
    • pp.867-874
    • /
    • 2010
  • Since high packet losses occur in multi-hop transmission of wireless sensor networks, reliable data transmission is required. Especially, in case of event-driven data, a loss recovery mechanism should be provided for lost packets. Because retransmission for lost packets is requested to a node that caches the packets, the caching node should maintains all of data for transmission in its buffer. However, nodes of wireless sensor networks have limited resources. Thus, both a loss recovery mechanism and a buffer management technique are provided for reliable data transmission in wireless sensor networks. In this paper, we propose a buffer management technique at a caching position determined by a loss recovery mechanism. The caching position of data is determined according to desirable reliability for the data. In addition, we validate the performance of the proposed method through computer simulations.

Operating μTESLA based on Variable Key-Slot in Multi-Hop Unattended WSN (멀티 홉 Unattended WSN에서 가변 키 슬롯 기반 μTESLA의 운영)

  • Choi, JinChun;Kang, Jeonil;Nyang, DaeHun;Lee, KyungHee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.3
    • /
    • pp.223-233
    • /
    • 2014
  • As a broadcast message authentication method in wireless sensor networks, ${\mu}$TESLA enables sensor nodes efficiently authenticate message from base station (BS). However, if we use ${\mu}$TESLA that has very short length of key slot in unattended wireless sensor network (UWSN), sensors may calculate a huge amount of hashs at once in order to verify the revealed secret key. In contrast, if we set the length of ${\mu}$TESLA's key slot too long in order to reduce the amount of hashs to calculate, BS should wait out the long slot time to release key. In this paper, we suggest variable key slot ${\mu}$TESLA in order to mitigate the problem. As showing experiment results, we prove that our suggestion improve sensor node's response time and decrease of number of hash function calculation.

A Method to Support Mobile Sink Node in a Hierarchical Routing Protocol of Wireless Sensor Networks (무선 센서 네트워크를 위한 계층적 라우팅 프로토콜에서의 이동 싱크 노드 지원 방안)

  • Kim, Dae-Young;Cho, Jin-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1B
    • /
    • pp.48-57
    • /
    • 2008
  • Wireless sensor networks are composed of a lot of sensor nodes and they are used to monitor environments. Since many studies on wireless sensor networks have considered a stationary sink node, they cannot provide fully ubiquitous applications based on a mobile sink node. In those applications, routing paths for a mobile sink node should be updated while a sink node moves in order to deliver sensor data without data loss. In this paper, we propose a method to continuously update routing paths for a mobile sink node which can be extended on hierarchical multi-hop routing protocols in wireless sensor networks. The efficiency of the proposed scheme has been validated through comparing existing method using a location based routing protocol by extensive computer simulation.