• Title/Summary/Keyword: Wireless mesh

Search Result 329, Processing Time 0.025 seconds

An Optimal Path Routing in Wireless Mesh Network (무선 메쉬 네트워크에서 최적화된 경로선정을 위한 라우팅)

  • Lee, Ae-Young;Roh, II-Soon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.6
    • /
    • pp.43-48
    • /
    • 2009
  • Wireless mesh networks, unlike Ad-hoc network, has low mobility and multi-path communication between terminals and other networks because it has the backbone structures. Most studies are advanced on finding the optimal routing path in multi-hop wireless mesh network environment. Various routing metric, minimum number of hops(Hop_count) and ETX, ETT metric, are proposed to wireless mesh networks. However, most metrics cannot identify the high throughput routing paths because this metric uses a different measurement parameters in each direction. So actual delivery rate does not provide to this metric. This paper describes the metric and implementation of IETC as a metric. This paper shows the improvement in performance.

  • PDF

A Seamless Layer-2 Handover Scheme for mobile WiMAX based Wireless Mesh Networks (Mobile WiMAX 기반의 무선 메쉬 네트워크에서 끊김없는 2계층 핸드오버 방안)

  • Kim, Min;Kim, Hwa-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.2A
    • /
    • pp.113-123
    • /
    • 2009
  • Wireless mesh networks have been studied as the next generation technology to solve problems of conventional wireless networks. Particularly, mobile WiMAX based wireless mesh networks are noticed due to many advantages. In this paper, we propose a layer-2 handover scheme for mobile WiMAX based wireless mesh networks. A layer-2 handover scheme based on mobile WiMAX causes many handover failures over mobile WiMAX based wireless mesh networks because it does not consider the characteristics of wireless mesh networks. The proposed scheme does not bring about packet losses achieving lower handover latency than a conventional handover scheme. Simulation results show that the proposed scheme achieves loss-free and low handover latency during the layer-2 handover.

Multi-layer Surveillance System based on Wireless Mesh Networks (무선 메쉬 네트워크 기반의 다층구조 감시 시스템 구축)

  • Yoon, Tae-Ho;Song, Yoo-Seoung
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.7 no.5
    • /
    • pp.209-217
    • /
    • 2012
  • In the present, Wireless Sensor Network(WSN) has been used for the purpose of the military operation with surveillance systems and for collecting useful information from the natural environment. Basically, low-power, easy deployment and low cost are the most important factors to be deployed for WSNs. Lots of researches have been studied to meet those requirements, especially on the node capacity and battery lifetime improvements. Recently, the study of wireless mesh networks applied into the surveillance systems has been proceeded as a solution of easy deployment. In this paper, we proposed large-scale intelligent multi-layer surveillance systems based on QoS assuring Wireless Mesh Networks and implemented them in the real testbed environment. The proposed system explains functions and operations for each subsystem as well as S/W and H/W architectures. Experimental results are shown for the implemented subsystems and the performance is satisfactory for the surveillance system. We can identify the possibility of the implemented multi-layer surveillance system to be used in practice.

The Optimal Link Scheduling in Half-Duplex Wireless Mesh Networks Using the Constraint Programming (제약식 프로그래밍을 이용한 일방향 전송 무선 메쉬 네트워크에서의 최적 링크 스케쥴링)

  • Kim, Hak-Jin
    • Journal of Information Technology Applications and Management
    • /
    • v.23 no.2
    • /
    • pp.61-80
    • /
    • 2016
  • The wireless mesh network (WMN) is a next-generation technology for data networking that has the advantage in cost and the flexibility in its construction because of not requiring the infra-structure such as the ethernet. This paper focuses on the optimal link scheduling problem under the wireless mesh network to effectuate real-time streaming by using the constraint programming. In particular, Under the limitation of half-duplex transmission in wireless nodes, this paper proposes a solution method to minimize the makespan in scheduling packet transmission from wireless nodes to the gateway in a WMN with no packet transmission conflicts due to the half-duplex transmission. It discusses the conflicts in packet transmission and deduces the condition of feasible schedules, which defines the model for the constraint programming. Finally it comparatively shows and discusses the results using two constraint programming solvers, Gecode and the IBM ILOG CP solver.

Adaptive Wireless Network Coding for Infrastructure Wireless Mesh Networks

  • Carrillo, Ernesto;Ramos, Victor
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3470-3493
    • /
    • 2019
  • IEEE 802.11s-based infrastructure Wireless Mesh Networks (iWMNs) are envisaged as a promising solution to provide ubiquitous wireless Internet access. The limited network capacity is a problem mainly caused by the medium contention between mesh users and the mesh access points (MAPs), which gets worst when the mesh clients employ the Transmission Control Protocol (TCP). To mitigate this problem, we use wireless network coding (WNC) in the MAPs. The aim of this proposal is to take advantage of the network topology around the MAPs, to alleviate the contention and maximize the use of the network capacity. We evaluate WNC when is used in MAPs. We model the formation of coding opportunities and, using computer simulations, we evaluate the formation of such coding opportunities. The results show that as the users density grows, the coding opportunities increase up to 70%; however, at the same time, the coding delay increments significantly. In order to reduce such delay, we propose to adaptively adjust the time that a packet can wait to catch a coding opportunity in an MAP. We assess the performance of moving-average estimation methods to forecast this adaptive sojourn time. We show that using moving-average estimation methods can significantly decrease the coding delay since they consider the traffic density conditions.

Male-Silkmoth-Inspired Routing Algorithm for Large-Scale Wireless Mesh Networks

  • Nugroho, Dwi Agung;Prasetiadi, Agi;Kim, Dong-Seong
    • Journal of Communications and Networks
    • /
    • v.17 no.4
    • /
    • pp.384-393
    • /
    • 2015
  • This paper proposes an insect behavior-inspired routing algorithm for large-scale wireless mesh networks. The proposed algorithm is adapted from the behavior of an insect called Bombyx mori, a male silkmoth. Its unique behavior is its flying technique to find the source of pheromones. The algorithm consists of two steps: the shortest-path algorithm and the zigzag-path algorithm. First, the shortest-path algorithm is employed to transmit data. After half of the total hops, the zigzag-path algorithm, which is based on the movement of the male B. mori, is applied. In order to adapt the biological behavior to large-scale wireless mesh networks, we use a mesh topology for implementing the algorithm. Simulation results show that the total energy used and the decision time for routing of the proposed algorithm are improved under certain conditions.

MA(Mesh Adaptive)-CBRP Algorithm for Wireless Mesh Network (Wireless Mesh Network를 위한 MA(Mesh Adaptive)-CBRP 알고리즘의 제안)

  • Kim, Sung-Joon;Cho, Gyu-Seob
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.11B
    • /
    • pp.1607-1617
    • /
    • 2010
  • In this paper we propose MA-CBRP, mesh adaptive algorithm for wireless mesh networks. MA-CBRP is a hybrid algorithm based on ad-hoc CBRP protocol. In MA-CBRP, the mesh router periodically sends the ANN message as like Hello-message in CBRP. ANN message allows to all clients periodically store a route towards the mesh-router and renewal information in their routing cache. While CBRP periodically reply Hello-message, MA-CBRP does not reply to achieve less overhead. After receiving ANN message, mesh client send JOIN message to mesh router when the route towards mesh router changed. at the same time Register the entry to mesh router, it can achieve to reduce overhead of control the route and shorten the time to find route. consequently, MA-CBRP shows 7% reduced overhead and shortened time to find route than CBRP with regardless of clients number.

Improving the Reliability of IEEE 802.11s Based Wireless Mesh Networks for Smart Grid Systems

  • Kim, Jaebeom;Kim, Dabin;Lim, Keun-Woo;Ko, Young-Bae;Lee, Sang-Youm
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.629-639
    • /
    • 2012
  • A challenge faced by smart grid systems is providing highly reliable transmissions to better serve different types of electrical applications and improve the energy efficiency of the system. Although wireless networking technologies can provide high-speed and cost-effective solutions, their performance may be impaired by various factors that affect the reliability of smart grid networks. Here, we first suggest the use of IEEE 802.11s-based wireless LAN mesh networks as high-speed wireless backbone networks for smart grid infrastructure to provide high scalability and flexibility while ensuring low installation and management costs. Thereafter, we analyze some vital problems of the IEEE 802.11s default routing protocol (named hybrid wireless mesh protocol; HWMP) from the perspective of transfer reliability, and propose appropriate solutions with a new routing method called HWMP-reliability enhancement to improve the routing reliability of 802.11s-based smart grid mesh networking. A simulation study using ns-3 was conducted to demonstrate the superiority of the proposed schemes.

An adaptive MAC protocol exploiting multiple paths in wireless mesh networks

  • Lee, Hyung-Keun;Yi, Joon-Hwan
    • Journal of IKEEE
    • /
    • v.13 no.1
    • /
    • pp.94-100
    • /
    • 2009
  • In recent years, the wireless mesh network (WMN) has been an emerging technology to provide Internet access to fixed and mobile wireless devices. The main goal of this paper is the design and simulation of a new MAC protocol based on the multi-path routing information for wireless mesh networks. The information about multiple paths discovered in the network layer is exploited by the MAC layer in order to forward a frame over the best hop out of multiple hop choices. The performance of our approach is compared with conventional 802.11 MAC through the simulation. The results show that our scheme exhibits a significantly better performance rather than conventional 802.11 MAC protocol in terms of packet overhead, end-to-end throughput and delay.

  • PDF

Efficient Multicast Tree Construction in Wireless Mesh Networks

  • Nargesi, Amir-Abbas;Bag-Mohammadi, Mozafar
    • Journal of Communications and Networks
    • /
    • v.16 no.6
    • /
    • pp.613-619
    • /
    • 2014
  • Multicast routing algorithms designed for wireline networks are not suitable for wireless environments since they cannot efficiently exploit the inherent characteristics of wireless networks such as the broadcast advantage. There are many routing protocols trying to use these advantages to decrease the number of required transmissions or increase the reception probability of data (e.g., opportunistic routing).Reducing the number of transmissions in a multicast tree directly decreases the bandwidth consumption and interference and increases the overall throughput of the network. In this paper, we introduce a distributed multicast routing protocol for wireless mesh networks called NCast which take into account the data delivery delay and path length when constructing the tree. Furthermore, it effectively uses wireless broadcast advantage to decrease the number of forwarding nodes dynamically when a new receiver joins the tree.Our simulation results show that NCast improves network throughput, data delivery ratio and data delivery delay in comparison with on demand multicast routing protocol. It is also comparable with multichannel multicast even though it does not use channeling technique which eliminates the interference inherently.