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

Search Result 333, Processing Time 0.025 seconds

QoS Routing for WiMedia-Based Wireless Mesh Networks (WiMedia 기반 무선 메쉬 네트워크에서 QoS를 고려한 경로 설정)

  • Park, Sung-Woo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.11 no.3
    • /
    • pp.317-324
    • /
    • 2016
  • WiMedia provides the data rate of up to 1Gbps, but the transmission range is restricted to approximately 10 meters. When constructing a multi-hop WiMedia network to extend its coverage, conventional hop-based routing may not guarantee satisfactorily the required QoS. We propose two QoS routing techniques for the WiMedia-based wireless mesh network. The proopsed QoS routing reflects the characteristics of TDMA-based WiMedia MAC and develops QoS extensions separately for on-demand routing and table-driven routing. Through simulations, we identify that the QoS routing shows better performance than the hop-based routing. It also turns out that the QoS on-demand routing and the QoS table-driven routing show conflicting performance results depending on the transmission power.

Partial multipath routing Protocol for multi-hop mesh network (멀티홉 메쉬 네트워크를 위한 부분다중경로 라우팅프로토콜)

  • Lee, Kang-Gun;Park, Hyung-Kun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.598-599
    • /
    • 2015
  • For the wireless mesh networks, efficient routing protocol is required to transmit data from source to destination node through multi-hop transmission. Multipath routing enable the stable data transmission even in the case of traffic congestion or unstable link. In this paper, we propose partial multipath routing which does not make a full multipath but partial for some parts of unstable links. This partial multipath routing reduce the number of nodes for routing and minimized the required power.

  • PDF

Data Aggregation Method Guaranteeing Minimum Traffic in Multi-hop Automatic Meter Reading Networks (다중 홉 원격검침망에서의 최소 트래픽 보장을 위한 데이터 수집기법에 관한 연구)

  • Hwang, Kwang-Il
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.7B
    • /
    • pp.848-857
    • /
    • 2011
  • Due to the advantages of a conveniet, inexpensive installation, flexibility, and scalability, Wireless AMR systems are recently preferred over wired AMR systems. However, a multi-hop supported AMR network, which generally covers large areas, may create energy wastage problem, energy unbalance, and high interference hazard due to a large amount of concurrent-intensive metering data in the network. Therefore in this paper we propose a novel data gathering method which can solve abovementioned problems as well as conserve energy, by reducing the traffic in the network. In addition, the experimental results demonstrate that the proposed scheme shows superior performance to the conventional data transmission method.

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 Reporting Interval Adaptive, Sensor Control Platform for Energy-saving Data Gathering in Wireless Sensor Networks

  • Choi, Wook;Lee, Yong;Kim, Sang-Chul
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.2
    • /
    • pp.247-268
    • /
    • 2011
  • Due to the application-specific nature of wireless sensor networks, the sensitivity to such a requirement as data reporting interval varies according to the type of application. Such considerations require an application-specific, parameter tuning paradigm allowing us to maximize energy conservation prolonging the operational network lifetime. In this paper, we propose a reporting interval adaptive, sensor control platform for energy-saving data gathering in wireless sensor networks. The ultimate goal is to extend the network lifetime by providing sensors with high adaptability to application-dependent or time-varying, reporting interval requirements. The proposed sensor control platform is based upon a two phase clustering (TPC) scheme which constructs two types of links within each cluster - namely, direct link and relay link. The direct links are used for control and time-critical, sensed data forwarding while the relay links are used only for multi-hop data reporting. Sensors opportunistically use the energy-saving relay link depending on the user reporting, interval constraint. We present factors that should be considered in deciding the total number of relay links and how sensors are scheduled for sensed data forwarding within a cluster for a given reporting interval and link quality. Simulation and implementation studies demonstrate that the proposed sensor control platform can help individual sensors save a significant amount of energy in reporting data, particularly in dense sensor networks. Such saving can be realized by the adaptability of the sensor to the reporting interval requirements.

Traffic Asymmetry Balancing in OFDMA-TDD Cellular Networks

  • Foutekova, Ellina;Sinanovic, Sinan;Haas, Harald
    • Journal of Communications and Networks
    • /
    • v.10 no.2
    • /
    • pp.137-147
    • /
    • 2008
  • This paper proposes a novel approach to interference avoidance via inter-cell relaying in cellular OFDMA-TDD (orthogonal frequency division multiple access - time division duplex) systems. The proposed scheme, termed asymmetry balancing, is targeted towards next-generation cellular wireless systems which are envisaged to have ad hoc and multi-hop capabilities. Asymmetry balancing resolves the detrimental base station (BS)-to-BS interference problem inherent to TDD networks by synchronizing the TDD switching points (SPs) across cells. In order to maintain the flexibility of TDD in serving the asymmetry demands of individual cells, inter-cell relaying is employed. Mobile stations (MSs) in a cell which has a shortage of uplink (UL) resources and spare downlink (DL) resources use free DL resources to off-load UL traffic to cooperating MSs in a neighboring cell using ad hoc communication. In an analogous fashion DL traffic can be balanced. The purpose of this paper is to introduce the asymmetry balancing concept by considering a seven-cell cluster and a single overloaded cell in the center. A mathematical model is developed to quantify the envisaged gains in using asymmetry balancing and is verified via Monte Carlo simulations. It is demonstrated that asymmetry balancing offers great flexibility in UL-DL resource allocation. In addition, results show that a spectral efficiency improvement of more than 100% can be obtained with respect to a case where the TDD SPs are adapted to the cell-specific demands.

Multi-Interface Multi-Channel R-HWMP Routing Protocol for End-to-End Bandwidth Reservation in IEEE 802.11s WMNs (IEEE 802.11s 무선 메쉬 네트워크에서 종단간 대역폭 예약을 위한 멀티 인터페이스 멀티 채널 R-HWMP 라우팅 프로토콜)

  • Jung, Whoi Jin;Kim, Bong Gyu;Lee, Jae Yong;Kim, Byung Chul
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.7
    • /
    • pp.37-48
    • /
    • 2014
  • Wireless mesh networks have emerged as a key technology in environment that needs wireless multi-hop communication without infrastructure and IEEE 802.11s mesh network standard have currently been established. One of big differences between this standard and the legacy IEEE 802.11 is that MCCA MAC is included to support QoS. MCCA supports bandwidth reservations between neighbors, so it can satisfy the QoS of bandwidth guarantee. However, MCCA has dis-advantages as follow; 1) it can not guarantee end-to-end bandwidth, 2) in multi-interface multi-channel wireless environments, the IEEE 802.11s does not provide a bandwidth reservation protocol and a wireless channel assignment etc. In this paper, we have proposed MIMC R-HWMP, which expands R-HWMP that was proposed in our previous work[3], to support multi-interface multi-channel. By simulation, we showed end-to-end bandwidth guarantee and the increase in the available bandwidth in multi-interface multi-channel wireless mesh networks.

Improving Hot Spot Problem in Layer of DL-LEACH

  • LEE, WooSuk;Jin, Seung Yeon;Jung, Kye-Dong;Lee, Jong-Yong
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.9 no.2
    • /
    • pp.64-69
    • /
    • 2017
  • The abstract should summarize the contents of the paper and written below the author information. Use th In Wide-area Wireless Sensor Networks, network lifetime is short due to energy consumption due to transmission distance. To improve this, we divide the sensor field into layers and reduce transmission distance through multi-hop transmission. However, there is a problem in that the transmission rate drops because there is no Cluster Head in the layer, or the transmission distance increases due to the layer, and energy is wasted. There are DL-LEACH and EDL-LEACH as Protocols to improve this. DL-LEACH uses either single-hop transmission or multi-hop transmission depending on the situation. As a result, the transmission distance is optimized, thereby reducing energy consumption. In case of EDL-LEACH, it is proposed to improve the data rate in DL-LEACH. It is the same as DL-LEACH, but the Cluster Head is mandatory for all layers to improve the transmission rate. Although there is no Cluster Head for each layer, the transmission rate is improved, but the network life is shortened. In this paper, we try to improve the network lifetime while maintaining the EDL-LEACH transmission rate. The shortened network lifetime is due to Cluster Head overload near the base station. To improve this, the Cluster Head distribution method is improved and the network lifetime is improved.

A Multi-level Energy Efficient Routing Algorithm on Fixed Radio Wave Radius in Wireless Sensor Network (고정 전파 파장 반경에 의한 무선 센서네트워크에서의 다단계 에너지 효율적인 라우팅 알고리즘)

  • Rhee, Chung Sei
    • Convergence Security Journal
    • /
    • v.13 no.6
    • /
    • pp.69-76
    • /
    • 2013
  • A lot of researches have been done to improve the energy efficiency of Wireless Sensor Networks. But all the current researches are based on the idea of direct communication between cluster head and sink node. Previous results assume that node can intelligently regulate signal energy according to the distance between nodes. It is difficult to implement algorithms based on this assumption. We present a multi-level routing algorithm from the sink node to all other nodes which have fixed radio wave radius. We also show the energy saving efficiency and the implementation in real WSN using the simulation result.

Performance Evaluation of On-Demand Routing Protocol using Look-ahead Selective Flooding in Ad-hoc Network (Ad-hoc 네트워크에서 Look-ahead Selective Flooding을 이용한 On-Demand 라우팅 프로토콜 성능 개선)

  • Yo-chan Ahn
    • Journal of Information Technology Applications and Management
    • /
    • v.10 no.2
    • /
    • pp.61-71
    • /
    • 2003
  • Ad-hoc networks are characterized by multi-hop wireless links, frequently changing network topology and the need for efficient dynamic routing protocols. In an Ad-hoc network, each host assumes the role of a router and relays packets toward final destinations Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. tn this paper 1 point out the more important cost factor than the number of links in the Ad-hoc network. A class routing protocols called on-demand protocols has recently found attention because of their low routing overhead since it performs a blind flooding to look for a path. In this paper, 1 propose the method which reduces overhead by using the information of neighboring nodes and doing a selective flooding. Simulation results demonstrate better reduction of routing overheads with this scheme.

  • PDF