• 제목/요약/키워드: wireless multi-hop networks

Search Result 333, Processing Time 0.028 seconds

Performance Analysis of 1-2-1 Cooperative Protocol in Wireless Sensor Networks (무선 센서 네트워크에서 1-2-1 협력 프로토콜에 관한 연구)

  • Choi, Dae-Kyu;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.5
    • /
    • pp.113-119
    • /
    • 2008
  • Conventional 1-1-1 cooperative protocol offers path-loss gain as advantage of multi-hop and spatial diversity which is equivalent to MIMO system. This protocol is enable to get higher reliability and reduction of power consumption than those of the single-hop or multi-hop. But the 1-1-1 cooperative protocol get only the diversity order 2 and limited path-loss reduction gain because this protocol has a single cooperative relay. We propose 1-2-1 cooperative protocol using two cooperative relays R1, R2. The 1-2-1 cooperative protocol can improve path-loss reduction and increase diversity order 3. Moreover, the cooperative relay R2 attains diversity order 2. The signaling method in transmission uses DF (Decode and Forward) or DR (Decode and Reencode) and 1-2-1 DF/DR cooperative protocol are applied to clustering based wireless sensor networks (WSNs). Simulations are performed to evaluate the performance of the protocols under Rayleigh fading channel plus AWGN (Additive White Gaussian Noise).

  • PDF

An MPR-based broadcast scheme using 3 channels for WSNs (무선 센서 네트워크에서 3개의 채널을 이용한 MPR 기반의 브로드캐스트 기법)

  • Lee, Ji-Hye;Lee, Ki-Seok;Kim, Chee-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10B
    • /
    • pp.1043-1049
    • /
    • 2009
  • Broadcast of sink node is used for network management, data collection by query and synchronization in wireless sensor networks. Simple flooding scheme induces the broadcast storm problem. The MPR based broadcast schemes reduce redundant retransmission of broadcast packets. MPR is a set of one hop neighbor nodes which have to relay broadcast message to cover all two hop neighbors. Though MPR can reduce redundant retransmission remarkably, it still suffers from energy waste problem caused by collision and duplicate packets reception. This paper proposes a new MPR based sink broadcast scheme using 3-channel. The proposed scheme reduces energy consumption by avoiding duplicate packet reception, while increases reliability by reducing collision probability remarkably. The results of analysis and simulation show that the proposed scheme is more efficient in energy consumption compared to the MPR based scheme. The result also shows that the proposed scheme reduces delivery latency by evading a contention with other relay nodes and improves reliability of broadcast message delivery by reducing collision probability.

Implementation of Multimedia Services in a Mobile Ad-hoc Network (이동 Ad-hoc 네트워크에서의 멀티미디어 서비스 구현)

  • Ro Kwang-Hyun;Kwon Hye-Yeon;Shin Jae-Wook;Park Ae-Soon
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.7 no.2
    • /
    • pp.45-52
    • /
    • 2006
  • Mobile Ad-hoc Network(MANET) could be applied to various applications by virtue of its characteristics such as self-organizing and infrastructure-free network. This paper proposes a multimedia application service model for MANET, called multi-hop Relay(mRelay) system. It supports a multi-hop communication-based multimedia service interworked with Internet by using an unmanned moving robot with wireless multimedia communication function as a mRelay terminal. The modified AODV routing protocol was applied to the terminal and it was verified that composition and maintenance of mobile Ad-hoc network in mRelay system under the various indoor scenarios were successful and stable multi-hop multimedia services were possible. The mRelay system can be applicable to various application services of mobile Ad-hoc networks.

  • PDF

TASL: A Traffic-Adapted Sleep/Listening MAC Protocol for Wireless Sensor Network

  • Yang, Yuan;Zhen, Fu;Lee, Tae-Seok;Park, Myong-Soon
    • Journal of Information Processing Systems
    • /
    • v.2 no.1
    • /
    • pp.39-43
    • /
    • 2006
  • In this paper, we proposed TASL-MAC, a medium-access control (MAC) protocol for wireless sensor networks. In wireless sensor networks, sensor nodes are usually deployed in a special environment, are assigned with long-term work, and are supported by a limited battery. As such, reducing the energy consumption becomes the primary concern with regard to wireless sensor networks. At the same time, reducing the latency in multi-hop data transmission is also very important. In the existing research, sensor nodes are expected to be switched to the sleep mode in order to reduce energy consumption. However, the existing proposals tended to assign the sensors with a fixed Sleep/Listening schedule, which causes unnecessary idle listening problems and conspicuous transmission latency due to the diversity of the traffic-load in the network. TASL-MAC is designed to dynamically adjust the duty listening time based on traffic load. This protocol enables the node with a proper data transfer rate to satisfy the application's requirements. Meanwhile, it can lead to much greater power efficiency by prolonging the nodes' sleeping time when the traffic. We evaluate our implementation of TASL-MAC in NS-2. The evaluation result indicates that our proposal could explicitly reduce packet delivery latency, and that it could also significantly prolong the lifetime of the entire network when traffic is low.

Energy Efficiency of Cooperative Routing with EGC Over Rayleigh Fading Channel (레일리 페이딩 채널을 통해 결합된 등가 이득 협력 라우팅의 에너지 효율)

  • Kong, Hyung-Yun;Tran, Truc Thanh
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.5
    • /
    • pp.65-70
    • /
    • 2013
  • In this paper, we propose a multi-hop cooperative transmission protocol to obtain energy savings in static wireless networks. Each terminal in the network is equipped with a single antenna and each receiver uses equal gain combining technique (EGC) to combine received signals. We also propose a power allocation strategy which optimizes the total transmit power at each stage. Monte-Carlo simulations are presented to evaluate and compare performance of the proposed protocol with the multi-hop direct transmission (MDT) and the cooperative routing protocol proposed by Khadani [8], in terms of the average total transmit power and the average number of required stages.

Clustering Algorithm for a Traffic Control of Wireless Ad Hoc Networks multi-hop (무선 에드혹 망 다중홉 트래픽제어를 위한 Clustering 알고리즘에 관한 연구)

  • 이동철;김기문;김동일
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.6
    • /
    • pp.1161-1167
    • /
    • 2003
  • The nodes of Ad hoc network are made up of location registration for sending informations and a great number of packet transmissions to maintain routing route among the nodes. Under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extent of the traffic in order to control the traffics of the multi-hop in Ad hoc.

A Carrier Preference and Location-based Routing Scheme(CPLR) at Multi-carrier Maritime Data Communications Networks (다중캐리어 해상데이터통신망에서 캐리어선호도와 위치기반 라우팅)

  • Son, Joo-Young
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.36 no.6
    • /
    • pp.823-829
    • /
    • 2012
  • Data communications networks at sea in the future can be modelled by overlapped MANET networks with Broadband Wireless Access carriers. A novel routing scheme (CPLR) is proposed in this paper, which finds out an optimal route by selecting an optimal carrier for each hop in routes based on carrier preferences of each application, and locations of ships as well. As distances between each ships and destination ships are considered in this scheme, routing can be done much faster. Performance is compared with that of the CPR (only Carrier Preference-based Routing Scheme), and it shows some improvements.

A Study on Improvement of AODV for Hybrid Wireless Mesh Networks (혼합형 무선 메시 네트워크를 위한 AODV 개선 연구)

  • Kim, Ho-Cheal
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.8
    • /
    • pp.943-953
    • /
    • 2013
  • By the enormous increase in mobile nodes and diverse service requests on wireless networks, wireless mesh network(WMN) takes an interest as the solution for such requests. However, lots of issues which should be solved to deploy WMN are still remained. In the network layer, the performance improvement of routing protocols is the major issue of nowadays researches. WMN can be easily deployed by use of protocols for mobile ad-hoc networks(MANET) because it is much similar with MANET in multi-hop wireless routing and which node plays as host and router concurrently. Unfortunately, most routing protocols for MANET have drawbacks such as large traffic overhead and long delay time for route discovery due to the network extension. They are major factors of performance degradation of WMN and most researches are focused on them. In this paper, domain-based AODV which is amended AODV to be applied in hybrid WMN is proposed. The proposed scheme divides a hybrid WMN as several domains and performs route discovery by header layer domain. Therefore it can reduce the distance for route discovery as much as average hop count between domain header and member nodes. From the simulation, domain-based AODV was showed slowly increasing delay time due to the network extension.

Contents Sharing System for Push/Pull Services in DLNA-based Home Networks

  • Choi, SoonPil;Park, ByoungSeob;Kim, ChungKyue
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.8
    • /
    • pp.85-92
    • /
    • 2015
  • Due to the advancements in the capabilities of smart devices and home networks, we are able to easily access multimedia contents stored in a home server. In this paper, we present a wireless media content sharing mechanism for home networks that utilizes UPnP-based DLNA technology. We also present a novel Peer-to-Peer content sharing system that is able to operate on the client as well as server. Our system supports multiple push/pull services simultaneously via a multi-thread technique, and our intuitive user interface facilitates ease of use. Future studies would explore the feasibility of implementing our system in a multi-hop environment or providing a community-wide service.

Reliable Data Transmission Based on Erasure-resilient Code in Wireless Sensor Networks

  • Lei, Jian-Jun;Kwon, Gu-In
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.1
    • /
    • pp.62-77
    • /
    • 2010
  • Emerging applications with high data rates will need to transport bulk data reliably in wireless sensor networks. ARQ (Automatic Repeat request) or Forward Error Correction (FEC) code schemes can be used to provide reliable transmission in a sensor network. However, the naive ARQ approach drops the whole frame, even though there is a bit error in the frame and the FEC at the bit level scheme may require a highly complex method to adjust the amount of FEC redundancy. We propose a bulk data transmission scheme based on erasure-resilient code in this paper to overcome these inefficiencies. The sender fragments bulk data into many small blocks, encodes the blocks with LT codes and packages several such blocks into a frame. The receiver only drops the corrupted blocks (compared to the entire frame) and the original data can be reconstructed if sufficient error-free blocks are received. An incidental benefit is that the frame error rate (FER) becomes irrelevant to frame size (error recovery). A frame can therefore be sufficiently large to provide high utilization of the wireless channel bandwidth without sacrificing the effectiveness of error recovery. The scheme has been implemented as a new data link layer in TinyOS, and evaluated through experiments in a testbed of Zigbex motes. Results show single hop transmission throughput can be improved by at least 20% under typical wireless channel conditions. It also reduces the transmission time of a reasonable range of size files by more than 30%, compared to a frame ARQ scheme. The total number of bytes sent by all nodes in the multi-hop communication is reduced by more than 60% compared to the frame ARQ scheme.