• Title/Summary/Keyword: wireless multi-hop networks

Search Result 333, Processing Time 0.033 seconds

Implementation of a Buoy System Based on Multi-Hop Relay Networks for Ocean Observation (해양관측을 위한 다중 홉 릴레이 네트워크 기반의 부이 시스템 구현)

  • Lee, Woon-hyun;Kwon, Hyuk-Jin;Kim, Si-moon;Jeong, SeongHoon;Kim, Jeongchang
    • Journal of Advanced Navigation Technology
    • /
    • v.20 no.3
    • /
    • pp.182-189
    • /
    • 2016
  • In this paper, we propose a buoy system based on multi-hop relay networks for ocean observation. The proposed system consists of various sensor modules, a gateway, wireless communication modules, and a remote monitoring site. The sensor modules are integrated with various communication interfaces and connected to the gateway of the proposed buoy system with an unified protocol based on controller area network (CAN)-bus. In order to communicate with the remote monitoring site and extend the coverage, the proposed system uses long-term evolution (LTE) router and XBee mesh network modules. The field test results show that the proposed system can extend the coverage using the proposed multi-hop relay network.

A Performance Comparison of Flooding Schemes in Wireless Sensor Networks (무선센서네트워크에서 플러딩 기법의 성능평가)

  • Kim, Kwan-Woong;Cho, Juphil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.6
    • /
    • pp.153-158
    • /
    • 2016
  • Broadcasting in multi-hop wireless sensor networks is a basic operation that supports many applications such as route search, setting up addresses and sending messages from the sink to sensor nodes. The broadcasting using flooding causes problems that can be mentioned as a broadcasting storm such as redundancy, contention and collision. A variety of broadcasting schemes using wireless sensor networks have been proposed to achieve superior performance rather than simple flooding scheme. Broadcasting algorithms in wireless sensor networks can be classified into six subcategories: flooding scheme, probabilistic scheme, counter-based scheme, distance-based scheme, location-based schemes, and neighbor knowledge-based scheme. This study analyzes a simple flooding scheme, probabilistic scheme, counter-based scheme, distance-based scheme, and neighbor knowledge-based scheme, and compares the performance and efficiency of each scheme through network simulation.

Fixed Relays for Next Generation Wireless Systems - System Concept and Performance Evaluation

  • Pabst Ralf;Esseling Norbert;Walke Bernhard H.
    • Journal of Communications and Networks
    • /
    • v.7 no.2
    • /
    • pp.104-114
    • /
    • 2005
  • This work presents a concept and the related analysis of the traffic performance for a wireless broadband system based on fixed relay stations acting as wireless bridges. The analysis focuses on the important performance indicators end-to-end throughput and delay, taking into account the effects of an automated repeat request protocol. An extension to a MAC frame based access protocol like IEEE 802.11e, 802.15.3, 802.16a, and HIPERLAN2 is outlined and taken as basis for the calculations. The system is intended for both dense populated areas as an overlay to cellular radio systems and to provide wide-area broad-band coverage. The two possible deployment scenarios for both dense urban and wide-area environments are introduced. Analytical and validating simulation results are shown, proving the suitability of the proposed concept for both of the mentioned scenarios. It is established that the fixed relaying concept is well suited to substantially contribute to provide high capacity cellular broad-band radio coverage in next generation (NG) cellular wireless broadband systems.

A Dynamic Queue Management for Network Coding in Mobile Ad-hoc Network

  • Kim, Byun-Gon;Kim, Kwan-Woong;Huang, Wei;Yu, C.;Kim, Yong K.
    • International journal of advanced smart convergence
    • /
    • v.2 no.1
    • /
    • pp.6-11
    • /
    • 2013
  • Network Coding (NC) is a new paradigm for network communication. In network coding, intermediate nodes create new packets by algebraically combining ingress packets and send it to its neighbor node by broadcast manner. NC has rapidly emerged as a major research area in information theory due to its wide applicability to communication through real networks. Network coding is expected to improve throughput and channel efficiency in the wireless multi-hop network. Many researches have been carried out to employ network coding to wireless ad-hoc network. In this paper, we proposed a dynamic queue management to improve coding opportunistic to enhance efficiency of NC. In our design, intermediate nodes are buffering incoming packets to encode queue. We expect that the proposed algorithm shall improve encoding rate of network coded packet and also reduce end to end latency. From the simulation, the proposed algorithm achieved better performance in terms of coding gain and packet delivery rate than static queue management scheme.

Power-efficient MAC protocol for energy harvesting wireless sensor networks (에너지하베스팅 무선센서네트워크를 위한 전력효율적인 매체접근제어 프로토콜)

  • Shim, Kyu-Wook;Park, Hyung-Kun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.10a
    • /
    • pp.580-581
    • /
    • 2018
  • In order to reduce end-to-end delay in EH-WSN (energy harvestin wireless sensor netowk), medium access control protocols using multi-hop routing technique have been studied. In a real environment, there are many situations where it is difficult to harvest enough energy than the energy consumed. Therefore, it is required to design a MAC protocol that allows nodes to reliably relay data without exhausting power in multi-hop transmission. In this paper, we propose a power-efficient MAC protocol that can select the relay node according to the residual power and the energy collection rate to increase network lifetime.

  • PDF

A Robust Wearable u-Healthcare Platform in Wireless Sensor Network

  • Lee, Seung-Chul;Chung, Wan-Young
    • Journal of Communications and Networks
    • /
    • v.16 no.4
    • /
    • pp.465-474
    • /
    • 2014
  • Wireless sensor network (WSN) is considered to be one of the most important research fields for ubiquitous healthcare (u-healthcare) applications. Healthcare systems combined with WSNs have only been introduced by several pioneering researchers. However, most researchers collect physiological data from medical nodes located at static locations and transmit them within a limited communication range between a base station and the medical nodes. In these healthcare systems, the network link can be easily broken owing to the movement of the object nodes. To overcome this issue, in this study, the fast link exchange minimum cost forwarding (FLE-MCF) routing protocol is proposed. This protocol allows real-time multi-hop communication in a healthcare system based on WSN. The protocol is designed for a multi-hop sensor network to rapidly restore the network link when it is broken. The performance of the proposed FLE-MCF protocol is compared with that of a modified minimum cost forwarding (MMCF) protocol. The FLE-MCF protocol shows a good packet delivery rate from/to a fast moving object in a WSN. The designed wearable platform utilizes an adaptive linear prediction filter to reduce the motion artifacts in the original electrocardiogram (ECG) signal. Two filter algorithms used for baseline drift removal are evaluated to check whether real-time execution is possible on our wearable platform. The experiment results shows that the ECG signal filtered by adaptive linear prediction filter recovers from the distorted ECG signal efficiently.

Improved MP-DD Routing Algorithm Considering Energy Efficiency in Wireless Sensor Networks (무선 센서 네트워크의 에너지 효율성을 고려한 MP-DD 라우팅 알고리즘)

  • Jang, Yoon-Sik;Park, Nam-Kyu;Oh, Chung-Sik;Choi, Seung-Kwon;Lee, Chang-Jo;Cho, Yong-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.7
    • /
    • pp.97-103
    • /
    • 2009
  • This paper proposes efficient routing scheme named MP-DD(MultiPath-Direct Diffusion) which is simple enough to be applicable to the wireless sensor networks. Conventional DD uses only one optimal path, therefore it consumes more energy of specific nodes. MP-DD uses multiple path and has a information of hop upstream node in the direction of the base-station is determined which are obtainable via the process of self-organization of the network. Simulation results show the feasibility of the simple routing schemes for the sensor networks.

Cross-Layer Architecture for QoS Provisioning in Wireless Multimedia Sensor Networks

  • Farooq, Muhammad Omer;St-Hilaire, Marc;Kunz, Thomas
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.1
    • /
    • pp.178-202
    • /
    • 2012
  • In this paper, we first survey cross-layer architectures for Wireless Sensor Networks (WSNs) and Wireless Multimedia Sensor Networks (WMSNs). Afterwards, we propose a novel cross-layer architecture for QoS provisioning in clustered and multi-hop based WMSNs. The proposed architecture provides support for multiple network-based applications on a single sensor node. For supporting multiple applications on a single node, an area in memory is reserved where each application can store its network protocols settings. Furthermore, the proposed cross-layer architecture supports heterogeneous flows by classifying WMSN traffic into six traffic classes. The architecture incorporates a service differentiation module for QoS provisioning in WMSNs. The service differentiation module defines the forwarding behavior corresponding to each traffic class. The forwarding behavior is primarily determined by the priority of the traffic class, moreover the service differentiation module allocates bandwidth to each traffic class with goals to maximize network utilization and avoid starvation of low priority flows. The proposal incorporates the congestion detection and control algorithm. Upon detection of congestion, the congested node makes an estimate of the data rate that should be used by the node itself and its one-hop away upstream nodes. While estimating the data rate, the congested node considers the characteristics of different traffic classes along with their total bandwidth usage. The architecture uses a shared database to enable cross-layer interactions. Application's network protocol settings and the interaction with the shared database is done through a cross-layer optimization middleware.

Multi-Hop MAC Protocol for Wireless Sensor Networks (센서 네트워크를 위한 멀티 홉 MAC 프로토콜)

  • Cho, Kyong-Tak;Bahk, Sae-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.6A
    • /
    • pp.506-514
    • /
    • 2009
  • To minimize energy consumption, most of MAC Protocols in WSNs exploit low duty cycling. Among those, RMAC [4] allows a node to transmit a data packet for multiple hops in a single duty cycle, which is made possible by exploiting a control frame named Pioneer (PION) in setting up the path. In this paper, we present a MAC Protocol called Hop Extended MAC (HE-MAC) that transmits the data packet for more multiple hops in a single duty cycle. It employs an EXP (Explorer) frame to set up the multiple hop transmission, which contains the information of the maximum hop that a packet can be transmitted. With the use of the information in EXP and an internal state of Ready to Receive (RTR), HEMAC extends the relay of the packet beyond the termination of the data period by two more hops compared to RMAC. Along with our proposed adaptive sleeping method, it also reduces power consumption and handles heavy traffic efficiently without experiencing packet inversion observed in RMAC. We analytically obtain the packet delivery latency in HE-MAC and evaluate the performance through ns-2 simulations. Compared to RMAC, HE-MAC achieves 14% less power consumption and 20% less packet delay on average for a random topology of 300 nodes.

Neighbor Caching for P2P Applications in MUlti-hop Wireless Ad Hoc Networks (멀티 홉 무선 애드혹 네트워크에서 P2P 응용을 위한 이웃 캐싱)

  • 조준호;오승택;김재명;이형호;이준원
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.5
    • /
    • pp.631-640
    • /
    • 2003
  • Because of multi-hop wireless communication, P2P applications in ad hoc networks suffer poor performance. We Propose neighbor caching strategy to overcome this shortcoming and show it is more efficient than self caching that nodes store data in theirs own cache individually. A node can extend its caching storage instantaneously with neighbor caching by borrowing the storage from idle neighbors, so overcome multi-hop wireless communications with data source long distance away from itself. We also present the ranking based prediction that selects the most appropriate neighbor which data can be stored in. The node that uses the ranking based prediction can select the neighbor that has high possibility to keep data for a long time and avoid caching the low ranked data. Therefore the ranking based prediction improves the throughput of neighbor caching. In the simulation results, we observe that neighbor caching has better performance, as large as network size, as long as idle time, and as small as cache size. We also show the ranking based prediction is an adaptive algorithm that adjusts times of data movement into the neighbor, so makes neighbor caching flexible according to the idleness of nodes