• Title/Summary/Keyword: Wireless mesh

Search Result 329, Processing Time 0.022 seconds

Data Origin Authentication Scheme for Wireless Mesh Networks (무선 메쉬 네트워크를 위한 데이터 송신 인증 기술)

  • Kang, Nam-Hi
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.7
    • /
    • pp.135-142
    • /
    • 2010
  • Wireless mesh network, which is an access network technology, adopts ubiquitous features of ad-hoc network that includes capabilities of self-configuration and self-management. This paper proposes a scheme which enables nodes along route in wireless mesh network to authenticate data and verify data integrity. The scheme distinguishes infra-node, which is a network device used to form mesh network, and user node in ad-hoc network, which operates functions as a sender, receiver or relayer, to deploy different authentication scheme. That is, hop-based authentication scheme along route forming wireless backbone differs from authentication scheme for user nodes in route over MANET. The proposed scheme is less complex than previously proposed schemes from the repects of security setup procedures and managements. In addition, the scheme is able to reduce transmission delay from a source to a destination owing to fast authentication over wireless backbone.

Cross-layer Design and its Performance Evaluation of Joint Routing and Scheduling for Maximizing Network Capacity of Wireless Mesh Networks (무선 메쉬 네트워크의 최대 전송 성능을 위한 라우팅과 스케쥴링의 계층 교차적 설계 및 성능 분석)

  • Min, Seokhong;Kim, Byungchul;Lee, Jaeyong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.12
    • /
    • pp.30-45
    • /
    • 2014
  • Recently, multimedia application users who demand for ubiquitous computing environment are rapidly increasing, and wireless mesh network is receiving attention as a cost-effective key technology for next generation wireless networking. When multiple flows are transmitting data at the same time in the network, routing for path selection of each flow and link resource allocation for data transmission of each flow are one of the key factors that influence to the effectiveness of the network directly. In this paper, we consider problems for path discovery and resource allocation of links at the same time and we propose an algorithm based on mathematical modeling using a technique for cross-layer optimization design in STDMA-based wireless mesh networks that can enhance transfer performance for each flow. We show by performance analysis that the proposed algorithm can enhance the throughput performance by maximally utilizing given bandwidth resources when the number of flows increase in multi-hop wireless mesh networks.

Handoff Algorithm based on One-way Trip Time for Wireless Mesh Network (Wireless Mesh Network을 위한 OTT 기반 핸드오프 알고리즘)

  • Park, Cha-Hee;Yoo, Myung-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.5
    • /
    • pp.16-24
    • /
    • 2007
  • Wireless mesh network extends the limited coverage of conventional wireless service from one-hop access point to wider area. It is recognized as an important issue to provide seamless handoff in the wide coverage of wireless mesh network. A long handoff delay may cause high packet loss and disconnection of service, degrading the network performance. The handoff delay is mainly introduced from the channel scanning process obtaining information to make handoff decision and the unnecessary handoffs due to inaccurate handoff decision. In this paper, we propose the handoff algorithm based on one-way trip time (OTT) to expedite the handoff procedure. As compared to the handoff algorithm based on the receiving signal power, the proposed algorithm takes advantage of OTT to obtain the necessary handoff information in a relatively shorter time and reduce the unnecessary handoffs. The performance of proposed algorithm is evaluated through the simulations. It is verified that the proposed handoff algorithm can effectively enhance the handoff accuracy, and therefore reduce the handoff delay and unnecessary handoffs.

Using Genetic Algorithms for Routing Metric in Wireless Mesh Network (무선 메쉬 네트워크에서 유전 알고리즘을 이용한 라우팅 메트릭 기법)

  • Yoon, Chang-Pyo;Shin, Hyo-Young;Ryou, Hwang-Bin
    • Convergence Security Journal
    • /
    • v.11 no.1
    • /
    • pp.11-18
    • /
    • 2011
  • Wireless mesh network technology with transmission speeds similar to wired and wireless technology means to build, compared with wired networks, building a more efficient network to provide convenience and flexibility. The wireless mesh network router nodes in the energy impact of the mobility is less constrained and has fewer features entail. However, the characteristics of various kinds due to network configuration settings and the choice of multiple paths that can occur when the system overhead and there are many details that must be considered. Therefore, according to the characteristics of these network routing technology that is reflected in the design and optimization of the network is worth noting. In this paper, a multi-path setting can be raised in order to respond effectively to the problem of the router node data loss and bandwidth according to traffic conditions and links to elements of the hop count evaluation by using a genetic algorithm as a workaround for dynamic routing the routing metric for wireless mesh network scheme is proposed.

A novel ID-based multi-domain handover protocol for mesh points in WMNs

  • Zhang, Xue;Li, Guangsong;Han, Wenbao;Ji, Huifang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.7
    • /
    • pp.2512-2529
    • /
    • 2015
  • Wireless mesh networks (WMNs) provide an efficient and flexible method to the field of wireless networking, but also bring many security issues. A mesh point may lose all of its available links during its movement. Thus, the mesh point needs to handover to a new mesh point in order to obtain access to the network again. For multi-domain WMNs, we proposed a new ID-based signcryption scheme and accordingly present a novel ID-based handover protocol for mesh points. The mutual authentication and key establishment of two mesh points which belong to different trust domains can be achieved by using a single one-round message exchange during the authentication phase. The authentication server is not involved in our handover authentication protocol so that mutual authentication can be completed directly by the mesh points. Meanwhile, the data transmitted between the two mesh points can be carried by the authentication messages. Moreover, there are no restrictions on the PKG system parameters in our proposed multi-domain ID-based signcryption scheme so our handover scheme can be easily applied to real WMNs circumstances. Security of the signcryption scheme is proved in the random oracle model. It shows that our protocol satisfies the basic security requirements and is resistant to existing attacks based on the security of the signcryption. The analysis of the performance demonstrates that the protocol is efficient and suitable for the multi-domain WMNs environment.

SN-Protected Network Entry Process for IEEE 802.16 Mesh Network (IEEE 802.16 메쉬 네트워크에서의 SN-Protected 네트워크 엔트리 프로세스)

  • Lixiang, Lin;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.6B
    • /
    • pp.875-887
    • /
    • 2010
  • The workgroup of IEEE 802 proposed the IEEE 802.16 standard, also known as WiMAX, to provide broadband wireless access (BWA). The standard specifies two operational modes, one is popular PMP mode, and the other is optional mesh mode. In the mesh mode, the network entry process-NetEntry is the pivotal procedure for mesh network topology formulation and thus, influences the accessibility of whole mesh network. Unfortunately, the NetEntry process suffers from the hidden neighbor problem, in which new neighborship emerges after a new node comes in and results in possible collisions. In this paper, we propose a new SN-protected NetEntry process to address the problem. Simulation results show that the new proposed NetEntry process is more stable compared with the standard-based NetEntry process.

A Priority Time Scheduling Method for Avoiding Gateway Bottleneck in Wireless Mesh Networks (무선 메쉬 네트워크에서 게이트웨이 병목 회피를 위한 우선순위 타임 스케줄링 기법)

  • Ryu, Min Woo;Kim, Dae Young;Cha, Si Ho;Cho, Kuk Hyun
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.5 no.2
    • /
    • pp.101-107
    • /
    • 2009
  • In existing wireless ad-hoc networks, how to distribute network resources fairly between many users to optimize data transmission is an important research subject. However, in wireless mesh networks (WMNs), it is one of the research areas to avoid gateway bottleneck more than the fair network resource sharing. It is because WMN traffic are concentrated on the gateway connected to backhaul. To solve this problem, the paper proposes Weighted Fairness Time-sharing Access (WFTA). The proposed WFTA is a priority time scheduling scheme based on Weighted Fair Queuing (WFQ).

Joint Channel Assignment and Multi-path Routing in Multi-radio Multi-channel Wireless Mesh Network

  • Pham, Ngoc Thai;Choi, Myeong-Gil;Hwang, Won-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.6
    • /
    • pp.824-832
    • /
    • 2009
  • Multi-radio multi-channel Wireless Mesh Network requires an effective management policy to control the assignment of channels to each radio. We concentrated our investigation on modeling method and solution to find a dynamic channel assignment scheme that is adapted to change of network traffic. Multi-path routing scheme was chosen to overwhelm the unreliability of wireless link. For a particular traffic state, our optimization model found a specific traffic distribution over multi-path and a channel assignment scheme that maximizes the overall network throughput. We developed a simple heuristic method for channel assignment by gradually removing clique load to obtain higher throughput. We also presented numerical examples and discussion of our models in comparison with existing research.

  • PDF

Dual Mode-AODV for the Hybrid Wireless Mesh Network (하이브리드 무선 메시 네트워크를 위한 듀얼모드-AODV)

  • Kim, Hocheal
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.22 no.1
    • /
    • pp.1-9
    • /
    • 2017
  • With the Development of Wireless Network Technology and Wireless Link Technology, Wireless Mesh Network (WMN) is Attracting Attention as a Key Technology to Construct the Wireless Transit Network. The WMN has been Studied for a Long Time in Various Fields, however there are still many Problems that have not been solved yet. One of them is the Routing Problem to find an Optimal path in a Multi-hop Network Composed of Wireless Links. In the Hybrid-WMN, which is one of the Three Types of WMN, Optimal Path Selection Requires Research on Path Search Protocols that Effectively use the Infrastructure Mesh as a Transit Network, Together with Research for a Routing Metric with Excellent Performance. Therefore, this Paper Proposes a Dual Mode-AODV(Ad hoc On-demand Distance Vector) for Hybrid-WMN. Simulation result shows that the Path Selection Delay was Reduced by 52% than AODV when the Proposed Dual Mode-AODV was applied.

Energy-efficient Low-delay TDMA Scheduling Algorithm for Industrial Wireless Mesh Networks

  • Zuo, Yun;Ling, Zhihao;Liu, Luming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.10
    • /
    • pp.2509-2528
    • /
    • 2012
  • Time division multiple access (TDMA) is a widely used media access control (MAC) technique that can provide collision-free and reliable communications, save energy and bound the delay of packets. In TDMA, energy saving is usually achieved by switching the nodes' radio off when such nodes are not engaged. However, the frequent switching of the radio's state not only wastes energy, but also increases end-to-end delay. To achieve high energy efficiency and low delay, as well as to further minimize the number of time slots, a multi-objective TDMA scheduling problem for industrial wireless mesh networks is presented. A hybrid algorithm that combines genetic algorithm (GA) and simulated annealing (SA) algorithm is then proposed to solve the TDMA scheduling problem effectively. A number of critical techniques are also adopted to reduce energy consumption and to shorten end-to-end delay further. Simulation results with different kinds of networks demonstrate that the proposed algorithm outperforms traditional scheduling algorithms in terms of addressing the problems of energy consumption and end-to-end delay, thus satisfying the demands of industrial wireless mesh networks.