scispace - formally typeset
Search or ask a question
Topic

Wireless mesh network

About: Wireless mesh network is a research topic. Over the lifetime, 13600 publications have been published within this topic receiving 221035 citations. The topic is also known as: WMN.


Papers
More filters
Journal ArticleDOI
TL;DR: A security architecture to ensure unconditional anonymity for honest users and traceability of misbehaving users for network authorities in WMNs is proposed, guaranteeing fundamental security requirements including authentication, confidentiality, data integrity, and nonrepudiation.
Abstract: Anonymity has received increasing attention in the literature due to the users' awareness of their privacy nowadays. Anonymity provides protection for users to enjoy network services without being traced. While anonymity-related issues have been extensively studied in payment-based systems such as e-cash and peer-to-peer (P2P) systems, little effort has been devoted to wireless mesh networks (WMNs). On the other hand, the network authority requires conditional anonymity such that misbehaving entities in the network remain traceable. In this paper, we propose a security architecture to ensure unconditional anonymity for honest users and traceability of misbehaving users for network authorities in WMNs. The proposed architecture strives to resolve the conflicts between the anonymity and traceability objectives, in addition to guaranteeing fundamental security requirements including authentication, confidentiality, data integrity, and nonrepudiation. Thorough analysis on security and efficiency is incorporated, demonstrating the feasibility and effectiveness of the proposed architecture.

49 citations

Proceedings ArticleDOI
01 Mar 2007
TL;DR: This paper describes the design of a novel network-based local mobility management scheme for wireless mesh networks that achieves low-latency handover when users move from one access router to the next within a network domain, and can thus be supported without any service interruption during handover.
Abstract: Providing mobility support in the Internet has become increasingly important since more and more users are on the go. To address this need, many schemes, including IETF mobile IP, HAWAII, cellular IP and others, have been developed. However, each of these proposals has its own weakness, such as large handover latency, or relatively high deployment cost. Recently, wireless mesh networks are emerging as a quick-and-cheap solution for wide wireless coverage, a necessary first-step to enable pervasive mobility service. In this paper, we describe the design of a novel network-based local mobility management scheme for wireless mesh networks. Our scheme achieves low-latency handover (usually less than 20 milliseconds of network-layer handover time) when users move from one access router to the next within a network domain. Real-time voice and video applications can thus be supported without any service interruption during handover. Our scheme requires no software upgrade on mobile hosts and can work with future MAC-layer technologies and routing protocols. This further reduces the deployment cost of wireless mesh networks.

49 citations

Journal ArticleDOI
TL;DR: A wrapper-based approach using the modified whale optimization algorithm, in which the genetic algorithm operators were combined with the WOA to improve the search space of whales, and the mutation operator helped to avoid being stuck in the local optimum.
Abstract: Machine learning–based intrusion detection system (IDS) is an important requirement for securing data traffic in wireless mesh networks. The noisy and redundant features of network data tend to degrade the performance of the attack detection classifiers. Therefore , the selection of informative features plays a vital role in the enhancement to the IDS. In this paper, we propose a wrapper-based approach using the modified whale optimization algorithm (WOA). One drawback of WOA is that premature convergence results in a local optimal solution. To overcome this limitation, we proposed a method in which the genetic algorithm operators were combined with the WOA. The crossover operator was used to further improve the search space of whales, and the mutation operator helped to avoid being stuck in the local optimum. The proposed method selects the informative features in the network data, which helps to accurately detect intrusions. Using a support vector machine (SVM), we identified the types of intrusions based on the selected features. The performance of the improved method was analyzed by using the CICIDS2017 and ADFA-LD standard datasets. Our proposed method had better attack detection rate than the standard WOA and other evolutionary algorithms; it also had good accuracy and was suitable for IDS in the wireless mesh networks. The performance of the IDS was increased by selecting the informative features with the improved whale optimization algorithm. The attack detection ratio was higher than that of the standard WOA.

49 citations

Journal ArticleDOI
01 Feb 2014
TL;DR: In this paper, a general way of solving the max-min fairness (MMF) traffic objective for wireless mesh networks (WMN) through mixed-integer programming (MIP) formulations that allow to precisely characterize the link data rate capacity and transmission scheduling using the notion of time slots.
Abstract: The paper is devoted to modeling wireless mesh networks (WMN) through mixed-integer programming (MIP) formulations that allow to precisely characterize the link data rate capacity and transmission scheduling using the notion of time slots. Such MIP models are formulated for several cases of the modulation and coding schemes (MCS) assignment. We present a general way of solving the max-min fairness (MMF) traffic objective for WMN using the formulated capacity models. Thus the paper combines WMN radio link modeling with a non-standard way of dealing with uncertain traffic, a combination that has not, to our knowledge, been treated so far by exact optimization models. We discuss several ways, including a method based on the so called compatible or independent sets, of solving the arising MIP problems. We also present an extensive numerical study that illustrates the running time efficiency of different solution approaches, and the influence of the MCS selection options and the number of time slots on traffic performance of a WMN. Exact joint optimization modeling of the WMN capacity and the MMF traffic objectives forms the main contribution of the paper.

48 citations

Proceedings ArticleDOI
03 Sep 2001
TL;DR: This paper considers energy efficient one- to-all and all-to-all broadcast communications in power constrained networks and presents schemes for situation awareness, which significantly improve the life of the network compared to schemes with direct transmissions.
Abstract: Ad hoc wireless networks and sensor networks have nodes with limited battery power, and broadcasting is an important operation in such networks. In this paper, we consider energy efficient one-to-all and all-to-all broadcast communications in such power constrained networks. It is assumed that nodes have power control and can adjust the range of their transmissions. Given a network of N nodes in a playing field of size D/spl times/D, we establish a lower bound and present a simple scheme for a source-to-all broadcast operation. Using simulations we show that the average energy cost of broadcasting from any source is within 25% of this lower bound in a network of 100 nodes in a 500 m/spl times/500 m and a 1000 m/spl times/1000 m area. In the situation awareness application, each node periodically transmits a small packet of 60 bytes to all other nodes in the network. For this all-to-all broadcast communication, we present a cluster scheme when nodes are allowed to transmit long distances, and a chain based scheme when nodes are limited to short distances. Our schemes for situation awareness significantly improve the life of the network compared to schemes with direct transmissions.

48 citations


Network Information
Related Topics (5)
Wireless ad hoc network
49K papers, 1.1M citations
97% related
Wireless network
122.5K papers, 2.1M citations
96% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
95% related
Network packet
159.7K papers, 2.2M citations
94% related
Wireless sensor network
142K papers, 2.4M citations
94% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202363
2022163
2021138
2020281
2019332
2018400