588 research outputs found
Joint Concurrent Routing and Multi-Pointer Packet Scheduling in IEEE 802.16 Mesh Networks
IEEE 802.16, also known as Worldwide Interoperability for Microwave Access
(WiMAX), is a standardization effort carried out by the IEEE to provide last-mile
broadband access to end users. The IEEE 802.16 standard
supports two medium access control (MAC) modes - a mandatory point to multipoint
(PMP) mode and an optional mesh mode. In this paper, we propose an
asymmetric interference aware routing algorithm and a new multipointer approach in
implementing scheduling algorithms for IEEE 802.16 mesh networks. We modify three
different centralized scheduling algorithms, fixed scheduling,
ordered scheduling and per-slot scheduling using multipointer approach to allow for
spatial reuse (SR) in IEEE 802.16 mesh networks. Simulation results
reveal that fixed scheduling with SR provides the best performance
Adaptive load balancing routing algorithms for the next generation wireless telecommunications networks
This thesis was submitted for the degree of Doctor of Philosophy and was awarded by Brunel UniversityWith the rapid development of wireless networks, mesh networks are evolving as a new important technology, presenting a high research and commercial interest. Additionally, wireless mesh networks have a wide variety of applications, offering the ability to provide network access in both rural and urban areas with low cost of maintenance. One of the main functionalities of a wireless mesh network is load balancing routing, which is the procedure of finding the best, according to some criteria, routes that data need to follow to transfer from one node to another. Routing is one of the state-of-the-art areas of research because the current algorithms and protocols are not efficient and effective due to the diversity of the characteristics of these networks. In this thesis, two new routing algorithms have been developed for No Intra-Cell Interference (NICI) and Limited Intra-Cell Interference (LICI) networks based on WiMAX, the most advanced wireless technology ready for deployment. The algorithms created are based on the classical Dijkstra and Ford-Fulkerson algorithms and can be implemented in the cases of unicast and multicast transmission respectively.State scholarships foundation of Greece
A Survey on Scheduling in IEEE 802.16 Mesh Mode
Cataloged from PDF version of article.IEEE 802.16 standard (also known as WiMAX)
defines the wireless broadband network technology which aims
to solve the so called last mile problem via providing high
bandwidth Internet even to the rural areas for which the cable
deployment is very costly. The standard mainly focuses on the
MAC and PHY layer issues, supporting two transmission modes:
PMP (Point-to-Multipoint) and mesh modes. Mesh mode is an
optional mode developed as an extension to PMP mode and it
has the advantage of having an improving performance as more
subscribers are added to the system using multi-hop routes. In
802.16 MAC protocol, mesh mode slot allocation and reservation
mechanisms are left open which makes this topic a hot research
area. Hence, the focus of this survey will mostly be on the mesh
mode, and the proposed scheduling algorithms and performance
evaluation methods
Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network
In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11),
each node should help to relay packets of neighboring nodes toward gateway
using multi-hop routing mechanisms. Wireless mesh networks usually intensively
deploy mesh nodes to deal with the problem of dead spot communication. However,
the higher density of nodes deployed, the higher radio interference occurred.
This causes significant degradation of system performance. In this paper, we
first convert network problems into geometry problems in graph theory, and then
solve the interference problem by geometric algorithms. We first define line
intersection in a graph to reflect radio interference problem in a wireless
mesh network. We then use plan sweep algorithm to find intersection lines, if
any; employ Voronoi diagram algorithm to delimit the regions among nodes; use
Delaunay Triangulation algorithm to reconstruct the graph in order to minimize
the interference among nodes. Finally, we use standard deviation to prune off
those longer links (higher interference links) to have a further enhancement.
The proposed hybrid solution is proved to be able to significantly reduce
interference in a wireless mesh network in O(n log n) time complexity.Comment: 24 Pages, JGraph-Hoc Journal 201
- …