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
01 Jul 2016
TL;DR: This paper compares the performance for Normal, Uniform, Exponential and Weibull distributions of mesh clients by sending multiple constant bit rate flows in the network and shows that for HWM protocol the throughput of Uniform distribution is higher than other distributions, however, for OLSR protocol,The throughput of Exponential distribution is better than other distribution.
Abstract: Wireless mesh networks (WMNs) are attracting a lot of attention from wireless network researchers. Node placement problems have been investigated for a long time in the optimization field due to numerous applications in location science. In our previous work, we evaluated WMN-GA system which is based on genetic algorithms (GAs) to find an optimal location assignment for mesh routers. In this paper, we evaluate the performance of four different distributions of mesh clients for two WMN architectures considering throughput, delay and energy metrics. For simulations, we used ns-3, optimized link state routing (OLSR) and hybrid wireless mesh protocols (HWMP). We compare the performance for Normal, Uniform, Exponential and Weibull distributions of mesh clients by sending multiple constant bit rate flows in the network. The simulation results show that for HWM protocol the throughput of Uniform distribution is higher than other distributions. However, for OLSR protocol, the throughput of Exponential distribution is better than other distributions. For both protocols, the delay and remaining energy are better for Weibull distribution.

58 citations

Patent
20 Jun 2007
TL;DR: In this paper, a method for a particular multi-radio meshed node to discover a route to a peer-to-peer node in a wireless multi-hop network including a plurality of multiradio meshed nodes is presented.
Abstract: A method is provided for a particular multi-radio meshed node to discover a route to a peer multi-radio meshed node in a wireless multi-hop network including a plurality of multi-radio meshed nodes Each of the multi-radio meshed nodes each includes a plurality of radio modules, and each radio module comprises an interface The particular multi-radio meshed node transmits route request (RREQ) messages from each interface of a particular multi-radio meshed node When a particular recipient multi-radio meshed node receives at least one of the route request (RREQ) messages, it generates a reverse route to the particular multi-radio meshed node A peer-to-peer route is established when the particular multi-radio meshed node receives a route reply (RREP) message and can then be used to forward traffic to and from the destination node

58 citations

Patent
28 Jul 2005
TL;DR: In this article, the authors proposed a method to assure node connectivity in an ad hoc wireless network comprising a wireless main controller, a plurality of wireless nodes having a pluralityof neighboring nodes and a link connecting the wireless main controllers, the wireless nodes and the plurality of neighboring nodes.
Abstract: In accordance with the present invention is provided, a method to assure node connectivity in an ad hoc wireless network comprising a wireless main controller, a plurality of wireless nodes having a plurality of neighboring nodes and a plurality of wireless links connecting the wireless main controller, the plurality of wireless nodes and the plurality of neighboring nodes. The proposed method includes, computing a composite threshold for each of a plurality of neighboring nodes of a plurality of nodes, assigning a mobility to each of the plurality of nodes based on the composite threshold for each of the plurality of neighboring node and using the mobility assigned to each of the plurality of nodes to assure node connectivity in the ad hoc network.

58 citations

Journal ArticleDOI
TL;DR: The performance of the architecture is studied and it is concluded that mesh-based architectures are well suited to provide highly scalable, dynamic radio access networks with carrier-class features at significantly low system costs.
Abstract: With fourth-generation wireless technologies envisioned to provide high bandwidth for content-rich multimedia applications, next-generation mobile communication systems are well poised to lead the technology march. Incumbent with the new technology is the challenge of providing flexible, reconfigurable architectures capable of catering to the dynamics of the network, while providing cost-effective solutions for service providers. In this article we focus on IP-based radio access network architectures for next-generation mobile systems. We provide an insight into wireless mesh-based connectivity for the RAN network elements - using short high-bandwidth links to interconnect the network entities in a multihop mesh network for backhauling traffic to the core. A generic self-similar fractal topology, using optical wireless transmission technology, is described. We study the performance of the architecture and conclude that mesh-based architectures are well suited to provide highly scalable, dynamic radio access networks with carrier-class features at significantly low system costs.

58 citations

Proceedings ArticleDOI
01 May 2007
TL;DR: The Fair End-to-end Bandwidth Allocation (FEBA) algorithm is introduced and is shown to provide fairness by balancing the bandwidth among traffic flows.
Abstract: In wireless mesh networks, the end-to-end throughput of traffic flows depends on the path length, i.e. the higher the number of hops, the lower becomes the throughput. In this paper, a Fair End-to-end Bandwidth Allocation (FEBA) algorithm is introduced to solve this problem. FEBA is implemented at the Medium Access Control (MAC) layer of single-radio, multiple channels IEEE 802.16 mesh nodes, operated in a distributed coordinated scheduling mode. FEBA negotiates bandwidth among neighbors to assign a fair share to each end-to-end traffic flow. This is carried out in two steps. First, bandwidth is requested and granted in a round-robin fashion where heavily loaded links are provided with a proportionally higher amount of service than the lightly loaded links at each round. Second, at each output link, packets from different traffic flows are buffered in separate queues which are served by the Deficit Round Robin (DRR) scheduling algorithm. If multiple channels are available, all of them are shared evenly in order to increase the network capacity due to frequency reuse. The performance of FEBA is evaluated by extensive simulations and is shown to provide fairness by balancing the bandwidth among traffic flows.

58 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