• Title/Summary/Keyword: Wireless mesh

Search Result 329, Processing Time 0.023 seconds

Heuristic Algorithms for Constructing Interference-Free and Delay-Constrained Multicast Trees for Wireless Mesh Networks

  • Yang, Wen-Lin;Kao, Chi-Chou;Tung, Cheng-Huang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.2
    • /
    • pp.269-286
    • /
    • 2011
  • In this paper, we study a problem that is concerning how to construct a delay-constrained multicast tree on a wireless mesh network (WMN) such that the number of serviced clients is maximized. In order to support high-quality and concurrent interference-free transmission streams, multiple radios are implemented in each mesh node in the WMNs. Instead of only orthogonal channels used for the multicast in the previous works, both orthogonal and partially overlapping channels are considered in this study. As a result, the number of links successfully allocated channels can be expected to be much larger than that of the approaches in which only orthogonal channels are considered. The number of serviced subscribers is then increased dramatically. Hence, the goal of this study is to find interference-free and delay-constrained multicast trees that can lead to the maximal number of serviced subscribers. This problem is referred as the MRDCM problem. Two heuristics, load-based greedy algorithm and load-based MCM algorithm, are developed for constructing multicast trees. Furthermore, two load-based channel assignment procedures are provided to allocate interference-free channels to the multicast trees. A set of experiments is designed to do performance, delay and efficiency comparisons for the multicast trees generated by all the approximation algorithms proposed in this study.

Secure and Efficient Key Management Scheme for Wireless Mesh Network (무선 메쉬망에서의 안전하고 효율적인 키관리 스킴)

  • Salam, Md. Iftekhar;Singh, Madhusudan;Lee, Sang-Gon;Lee, Hoon-Jae
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.844-847
    • /
    • 2011
  • Wireless mesh network (WMN) is a type of mobile ad-hoc network consists of wireless router, mobile clients and gateway which connects the network with the Internet. To provide security in the network it is required to encrypt the message sent among the communicating nodes in such way so that only legitimate user can retrieve the original data. Several security mechanisms have been proposed so far to enhance the security of WMN. However, there still exists a need for a comprehensive mechanism to prevent attacks in data communication. Considering the characteristic of mesh network, in this paper we proposed a public key cryptography based security architecture to establish a secure key agreement among communicating nodes in mesh network. The proposed security architecture consists of two major sections: client data protection and network data protection. Client data protection deals with the mutual authentication between the client and the access router and provide client to access router encryption for data confidentiality using standard IEEE 802.11i protocol. On the other hand, network data protection ensures encrypted routing and data transfer in the multi hop backbone network. For the network data protection, we used the pre-distributed public key to form a secure backbone infrastructure.

Distributed Routing Based on Minimum End-to-End Delay for OFDMA Backhaul Mobile Mesh Networks

  • Chung, Jong-Moon;Lee, Daeyoung;Park, Jong-Hong;Lim, Kwangjae;Kim, HyunJae;Kwon, Dong-Seung
    • ETRI Journal
    • /
    • v.35 no.3
    • /
    • pp.406-413
    • /
    • 2013
  • In this paper, an orthogonal frequency division multiple access (OFDMA)-based minimum end-to-end delay (MED) distributed routing scheme for mobile backhaul wireless mesh networks is proposed. The proposed scheme selects routing paths based on OFDMA subcarrier synchronization control, subcarrier availability, and delay. In the proposed scheme, OFDMA is used to transmit frames between mesh routers using type-I hybrid automatic repeat request over multipath Rayleigh fading channels. Compared with other distributed routing algorithms, such as most forward within radius R, farthest neighbor routing, nearest neighbor routing, and nearest with forwarding progress, simulation results show that the proposed MED routing can reduce end-to-end delay and support highly reliable routing using only local information of neighbor nodes.

Improving Overall WMN Performance in Peak Times Using Load-sharing Aware Gateways

  • Vo, Hung Quoc;Dai, Tran Thanh;Hong, Choong-Seon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.855-857
    • /
    • 2007
  • In recent years, Wireless Mesh Network (WMN) is a compelling topic to many network researchers due to its low cost in deployment, ease and simplicity in installation and scalability and robustness in operation. In WMN, Gateway nodes (Access Point-AP) are in charge of steering the traffic from the external network (e.g. Internet...) to client devices or mesh clients. The limited bandwidth of wireless links between Gateways and intermediate mesh routers makes the Gateways becomes the bottleneck of the mesh network in both uplink stream and downlink stream. In this paper, we propose a mechanism to permit Gateways collaboratively work to manipulate the traffic to fit our network. They will move the traffic from congested links to the unused capacity on other links.

  • PDF

Cluster-Based Channel Assignment for Multi-Channel Wireless Mesh Networks (멀티 채널 무선 메쉬 네트워크를 위한 클러스터 기반 채널 할당)

  • Cha, Si-Ho
    • Proceedings of the KAIS Fall Conference
    • /
    • 2009.05a
    • /
    • pp.57-59
    • /
    • 2009
  • 무선 메쉬 네트워크(Wireless Mesh Networks, WMNs)는 유비쿼터스 환경 및 무선 브로드밴드 액세스를 제공하기 위한 핵심적인 미래 기술로 대두되고 있다. WMN에서의 전체적인 성능은 채널의 간섭을 최소화함으로써 개선될 수 있다. 효율적인 채널 할당을 위해서는 채널 스캐닝 지연과 채널 의존성 문제를 고려해야 한다. 본 논문에서는 멀티채널 WMN에서의 이러한 문제점들을 해결하기 위해 클러스터 기반의 채널 할당(Cluster-Based Channel Assignment, CB-CA)을 제안한다. CB-CA에서는 클러스터 헤드 메쉬 라우터(Cluster Head Mesh Router, CHMR)들 간에는 동일 채널을 사용함으로써 채널 스캐닝과 채널 스위칭을 수행하지 않는다. 해당 클러스터 멤버 라우터(Cluster Member Mesh Router, CMMR)들과의 통신에는 CHMR들 간의 통신 채널에 영향을 미치지 않는 채널을 할당함으로써 멀티채널에서 발생할 수 있는 간섭을 최소화 할 수 있다.

  • PDF

Indoor Link Quality Comparison of IEEE 802.11a Channels in a Multi-radio Mesh Network Testbed

  • Bandaranayake, Asitha U;Pandit, Vaibhav;Agrawal, Dharma P.
    • Journal of Information Processing Systems
    • /
    • v.8 no.1
    • /
    • pp.1-20
    • /
    • 2012
  • The most important criterion for achieving the maximum performance in a wireless mesh network (WMN) is to limit the interference within the network. For this purpose, especially in a multi-radio network, the best option is to use non-overlapping channels among different radios within the same interference range. Previous works that have considered non-overlapping channels in IEEE 802.11a as the basis for performance optimization, have considered the link quality across all channels to be uniform. In this paper, we present a measurement-based study of link quality across all channels in an IEEE 802.11a-based indoor WMN test bed. Our results show that the generalized assumption of uniform performance across all channels does not hold good in practice for an indoor environment and signal quality depends on the geometry around the mesh routers.

A Mesh Router Placement Scheme for Minimizing Interference in Indoor Wireless Mesh Networks (실내 무선 메쉬 네트워크에서의 간섭 최소화를 위한 메쉬 라우터 배치 기법)

  • Lee, Sang-Hwan
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.4
    • /
    • pp.421-426
    • /
    • 2010
  • Due to the ease of deployment and the extended coverage, wireless mesh networks (WMNs) are gaining popularity and research focus. For example, the routing protocols that enhance the throughput on the WMNs and the link quality measurement schemes are among the popular research topics. However, most of these works assume that the locations of the mesh routers are predetermined. Since the operators in an Indoor mesh network can determine the locations of the mesh routers by themselves, it is essential to the WMN performance for the mesh routers to be initially placed by considering the performance issues. In this paper, we propose a mesh router placement scheme based on genetic algorithms by considering the characteristics of WMNs such as interference and topology. There have been many related works that solve similar problems such as base station placement in cellular networks and gateway node selection in WMNs. However, none of them actually considers the interference to the mesh clients from non-associated mesh routers in determining the locations of the mesh routers. By simulations, we show that the proposed scheme improves the performance by 30-40% compared to the random selection scheme.

Implementation of Wireless ECG Measurement System Attaching in Chair for Ubiquitous Health Care Environment (유비쿼터스 헬스 케어 적용을 위한 의자 부착형 무선 심전도 측정 시스템 구현)

  • Ye, Soo-Young;Baik, Seong-Wan;Kim, Jee-Chul;Jeon, Gye-Rok
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.21 no.8
    • /
    • pp.776-781
    • /
    • 2008
  • In this study, ubiquitous health care system attaching in chair to monitor ECG for health care was developed at the unconsciousness state. The system conveniently and simple measured ECG at non-consciousness. We measured the contact impedance to skin-electrode of metal mesh electrodes of the system. Contact impedance enable the electrode to use for ECG measurement. The results are that the impedance of the metal mesh electrodes according to sizes is low when the size is 4$cm^2$. As the result, when the size of the metal mesh electrode is 4$cm^2$, the electrode is fit for ECG measurement. We can acquired by positing the arm on the metal mesh electrode. The ECG signal was detected using a high-input-impedance bio-amplifier, and then passed filter circuitry. The measured signal transmitted to a PC through the bluetooth wireless communication and monitored. Data of the non-constrained ECG system attaching in chair is noise-data when comparing metal mesh electrode with the Ag/Agcl electrode but the data is significant to monitor ECG for check the body state.

LTRE: Lightweight Traffic Redundancy Elimination in Software-Defined Wireless Mesh Networks (소프트웨어 정의 무선 메쉬 네트워크에서의 경량화된 중복 제거 기법)

  • Park, Gwangwoo;Kim, Wontae;Kim, Joonwoo;Pack, Sangheon
    • Journal of KIISE
    • /
    • v.44 no.9
    • /
    • pp.976-985
    • /
    • 2017
  • Wireless mesh network (WMN) is a promising technology for building a cost-effective and easily-deployed wireless networking infrastructure. To efficiently utilize limited radio resources in WMNs, packet transmissions (particularly, redundant packet transmissions) should be carefully managed. We therefore propose a lightweight traffic redundancy elimination (LTRE) scheme to reduce redundant packet transmissions in software-defined wireless mesh networks (SD-WMNs). In LTRE, the controller determines the optimal path of each packet to maximize the amount of traffic reduction. In addition, LTRE employs three novel techniques: 1) machine learning (ML)-based information request, 2) ID-based source routing, and 3) popularity-aware cache update. Simulation results show that LTRE can significantly reduce the traffic overhead by 18.34% to 48.89%.

Studying Route Optimality in Multi-Hop Wireless Mesh Networks (다중 홉 무선 메쉬 네트워크에서 최적 경로에 관한 연구)

  • Kim, Seong-Kwan;Lee, Ok-Hwan;Lee, Sung-Ju;Choi, Sung-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1B
    • /
    • pp.16-23
    • /
    • 2009
  • This paper investigates how many optimal routes can be established in terms of a given wireless mesh routing metric. Although many of routing metrics have been devised to precisely derive the wireless link quality in mesh, most (if not all) metrics have not been evaluated their optimality along with routing protocols. We consider stateof-the-art routing metrics and a widely accepted routing protocol in order to observe the optimality of established routes varying the number of source nodes. Also, we propose a unidirectional routing to deal with possible link asymmetry feature in wireless links. Through comparative simulation evaluations, we show that the portion of optimally established routes becomes less as the network traffic load increases, regardless of employed metrics, network topologies, and routing protocols.