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

Search Result 384, Processing Time 0.027 seconds

A Low-Power Clustering Algorithm Based on Fixed Radio Wave Radius in Wireless Sensor Networks (무선센서네트워크에서 전파범위기반의 저 전력 클러스터링 알고리즘)

  • Li, Yong-Zhen;Jin, Shi-Mei;Rhee, Chung-Sei
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7B
    • /
    • pp.1098-1104
    • /
    • 2010
  • Recently, a variety of research of multi-hop routing protocol have been done to balance the sensor node energy consumption of WSN(wireless sensor network) and to improve the node efficiency for extending the life of the entire network. Especially in multi-hop protocol, a variety of models have been concerned to improve energy efficiency and apply in the reality. In multi-hop protocol, we assumption that energy consumption can be adjusted based on the distance between the sensor nodes. However, according to the physical property of the actual WSN, it's hard to establish this assumption. In this dissertation, we propose low-power sub-cluster protocol to improve the energy efficiency based on the spread of distance. Compared with the previous protocols, this proposed protocol can be effectively used in the wireless sensing networks.

Study of Location-based Routing Techniques of BS and Sensor Node (BS와 센서 노드의 위치 기반 라우팅 기법에 관한 연구)

  • Kim, Yong-Tae;Jeong, Yoon-Su
    • Journal of Digital Convergence
    • /
    • v.10 no.9
    • /
    • pp.289-295
    • /
    • 2012
  • Routing technique of wireless sensor network that is presented to improve effectiveness of consumption in energy at the previous study is existing in various ways, however for routing, its own location data and nodes' location data close to with 1-hop distance should be kept. And it uses multi-hop transmission method that transmits data to BS node via several nodes. This technique makes electronic consumption of sensor node and entire network's energy consumption so that it makes effective energy management problem. Therefore, this paper suggests location based 1-hop routing technique of BS node that satisfies distance $d{\pm}{\alpha}$ with source node using RSSI and radio wave range of sensor node.

A Study of Relay scheme for shadow area in WiBro network (와이브로 네트워크에서 음영지역에 대한 중계방식에 관한 연구)

  • Son, Sung-Chan;Oh, Chung-Gyun
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.394-397
    • /
    • 2008
  • Recently WiBro network is installed for high speed wireless internet service by telecommunication service provider, however WiBro service is not provided in the region of mountain or difficult region to install network infra. Fixed repeater is used to resolve those shadow area problem in current WiBro network. This paper study introducing Ad-hoc based multi-hop relay instead of using fixed repeater in order to resolve those shadow area problem. Cost down of fixed repeater and active network expansion is possible to resolve shadow area problem by introducing multi-hop relay technology.

  • PDF

An Energy Efficient Multi-hop Cluster-Head Election Strategy for Wireless Sensor Networks

  • Zhao, Liquan;Guo, Shuaichao
    • Journal of Information Processing Systems
    • /
    • v.17 no.1
    • /
    • pp.63-74
    • /
    • 2021
  • According to the double-phase cluster-head election method (DCE), the final cluster heads (CHs) sometimes are located at the edge of cluster. They have a long distance from the base station (BS). Sensor data is directly transmitted to BS by CHs. This makes some nodes consume much energy for transmitting data and die earlier. To address this problem, energy efficient multi-hop cluster-head election strategy (EEMCE) is proposed in this paper. To avoid taking these nodes far from BS as CH, this strategy first introduces the distance from the sensor nodes to the BS into the tentative CH election. Subsequently, in the same cluster, the energy of tentative CH is compared with those of other nodes, and then the node that has more energy than the tentative CH and being nearest the tentative CH are taken as the final CH. Lastly, if the CH is located at the periphery of the network, the multi-hop method will be employed to reduce the energy that is consumed by CHs. The simulation results suggest that the proposed method exhibits higher energy efficiency, longer stability period and better scalability than other protocols.

Angular MST-Based Topology Control for Multi-hop Wireless Ad Hoc Networks

  • Kim, Hwang-Nam;Park, Eun-Chan;Noh, Sung-Kee;Hong, Sung-Back
    • ETRI Journal
    • /
    • v.30 no.2
    • /
    • pp.341-343
    • /
    • 2008
  • This letter presents an angular minimum spanning tree (AMST) algorithm for topology control in multi-hop wireless ad hoc networks. The AMST algorithm builds up an MST for every angular sector of a given degree around each node to determine optimal transmission power for connecting to its neighbors. We demonstrate that AMST preserves both local and network-wide connectivity. It also improves robustness to link failure and mitigates transmission power waste.

  • PDF

A New Local Information Distribution System on Multi-Hop Wireless Networks

  • Koide, Toshio;Watanabe, Hitoshi
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1363-1366
    • /
    • 2002
  • The studies of multi-hop wireless networks are active as the new communication media, which does not require any fixed communication infrastructure. One of application of the networks is local information distribution service, which is useful far daily activities in certain geographically restricted region or community within a radius of several kilometers. In this paper, MID-Net, which is the network enabling such distribution service, and effective information distribution algorithm MCMS are proposed. The behavior of the MID-Net is characterized by the waiting time function, three types of the functions are proposed in this paper.

  • PDF

Retransmission Persistence Management with ARQ in Multi-Hop Wireless Network (무선 멀티 홉 환경에서 ARQ를 통한 재전송 지속성 관리 기법)

  • Oh, Bong-Hwan;Kim, Seog-Gyu;Lee, Jaiyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.10
    • /
    • pp.674-683
    • /
    • 2014
  • Multi-hop wireless networks has become common phenomenon according to a development of wireless communications and an increase of usage of wireless link. ARQ is one of the common protocols in link layer and can improve a link performance recovering packet loss in wireless link. However, ARQ cannot sufficient to assure a end-to-end performance because ARQ only manages the ARQ's own link. In this paper, we propose a new retransmission persistence for ARQ in multi-hop wireless network to satisfy the end-to-end performance. The proposed scheme can aware a bottleneck link according to the exchange of link information between ARQs and can support the end-to-end performance by managing a retransmission persistence. OPNET simulator is used to evaluate the performance of the proposed scheme and results show that proposed scheme can improve the end-to-end performance with satisfying a requirement of entire wireless section.

Performance Evaluation of a Enhanced Network Coding Scheme using NS2 (NS2를 이용한 향상된 네트워크 코딩 기법의 성능평가)

  • Kim, Kwan-Woong;Kim, Yong-Kab;Kim, Byun-Gon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.10
    • /
    • pp.2281-2287
    • /
    • 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. Network Coding 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. Prior researches have been carried out to employ network coding to wireless ad-hoc network. In our study, intermediate nodes identify one-hop bidirectional flows for network coding decision. We expect that the proposed scheme shall improve decoding success rate of network coded packet. From the simulation, the proposed network coding scheme achieved better performance in terms of coding gain and packet delivery rate than traditional network coding scheme.

A Low-Power Clustering Algorithm Based on Fixed Radio Wave Radius in WSN (WSN에서 전파범위 기반의 저 전력 클러스터링 알고리즘)

  • Rhee, Chung Sei
    • Convergence Security Journal
    • /
    • v.15 no.3_1
    • /
    • pp.75-82
    • /
    • 2015
  • Recently, lot of researches on multi-level protocol have been done to balance the sensor node energy consumption of WSN and to improve the node efficiency to extend the life of the entire network. Especially in multi-hop protocol, a variety of models have been studied to improve energy efficiency and apply it in real system. In multi-hop protocol, we assume that energy consumption can be adjusted based on the distance between the sensor nodes. However, according to the physical property of the actual WSN, it's hard to establish this. In this paper, we propose low-power sub-cluster protocol to improve the energy efficiency based on the spread of distance. Compared with the previous protocols, the proposed protocol is energy efficient and can be effectively used in the wireless sensing network.

CAMR: Congestion-Aware Multi-Path Routing Protocol for Wireless Mesh Networks

  • Jang, Seowoo;Kang, Seok-Gu;Yoon, Sung-Guk
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.411-419
    • /
    • 2017
  • The Wireless Mesh Network (WMN) is a multi-hop wireless network consisting of mesh routers and clients, where the mesh routers have minimal mobility and form the backbone. The WMN is primarily designed to access outer network to mesh clients through backhaul gateways. As traffic converges on the gateways, traffic hotspots are likely to form in the neighborhood of the gateways. In this paper, we propose Congestion Aware Multi-path Routing (CAMR) protocol to tackle this problem. Upon congestion, CAMR divides the clients under a mesh STA into two groups and returns a different path for each group. The CAMR protocol triggers multi-path routing in such a manner that the packet reordering problem is avoided. Through simulations, we show that CAMR improves the performance of the WMN in terms of throughput, delay and packet drop ratio.