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 published on a yearly basis
Papers
More filters
••
18 Aug 2008TL;DR: It is demonstrated, for the first time, that there is a local-control MAC protocol requiring only very limited knowledge about the adversary and the network that achieves a constant throughput for the non-jammed time steps under any adversarial strategy above.
Abstract: In this paper we consider the problem of designing a medium access control (MAC) protocol for single-hop wireless networks that is provably robust against adaptive adversarial jamming. The wireless network consists of a set of honest and reliable nodes that are within the transmission range of each other. In addition to these nodes there is an adversary. The adversary may know the protocol and its entire history and use this knowledge to jam the wireless channel at will at any time. It is allowed to jam a (1-epsilon)-fraction of the time steps, for an arbitrary constant epsilon>0, but it has to make a jamming decision before it knows the actions of the nodes at the current step. The nodes cannot distinguish between the adversarial jamming or a collision of two or more messages that are sent at the same time. We demonstrate, for the first time, that there is a local-control MAC protocol requiring only very limited knowledge about the adversary and the network that achieves a constant throughput for the non-jammed time steps under any adversarial strategy above. We also show that our protocol is very energy efficient and that it can be extended to obtain a robust and efficient protocol for leader election and the fair use of the wireless channel.
177 citations
••
TL;DR: This paper classify wireless networks with orthogonal channels into two types, half duplex and full duplex, and considers the problem of jointly routing the flows and scheduling transmissions to achieve a given rate vector, and develops tight necessary and sufficient conditions for the achievability of the rate vector.
Abstract: This paper considers the problem of determining the achievable rates in multi-hop wireless mesh networks with orthogonal channels. We classify wireless networks with orthogonal channels into two types, half duplex and full duplex, and consider the problem of jointly routing the flows and scheduling transmissions to achieve a given rate vector. We develop tight necessary and sufficient conditions for the achievability of the rate vector. We develop efficient and easy to implement Fully Polynomial Time Approximation Schemes for solving the routing problem. The scheduling problem is a solved as a graph edge-coloring problem. We show that this approach guarantees that the solution obtained is within 50% of the optimal solution in the worst case (within 67% of the optimal solution in a common special case) and, in practice, is close to 90% of the optimal solution on the average. The approach that we use is quite flexible and can be extended to handle more sophisticated interference conditions, and routing with diversity requirements.
176 citations
••
25 May 2005TL;DR: This work develops a stochastic model for the distributed scheduler of the mesh mode of the IEEE 802.16 protocol and analyzes the scheduler performance under various conditions, and the analytical results match very well with the ns-2 simulation results.
Abstract: To meet the needs of wireless broadband access, the IEEE 80216 protocol for wireless metropolitan networks (WirelessMAN) has been recently standardized The medium access control (MAC) layer of the IEEE 80216 has point-to-multipoint (PMP) mode and mesh mode Previous works on the IEEE 80216 have primarily focused on the PMP mode In the mesh mode, all nodes are organized in an ad hoc fashion and use a pseudo-random function to calculate their transmission time based on the scheduling information of the two-hop neighbors In this paper, we develop a stochastic model for the distributed scheduler of the mesh mode With this model, we analyze the scheduler performance under various conditions, and the analytical results match very well with the ns-2 simulation results The analytical model developed in this paper is instrumental in optimizing the IEEE 80216 mesh mode system performance To the best of our knowledge, this work is the first one theoretically investigating the IEEE 80216 mesh mode scheduling performance
176 citations
01 Oct 2008
TL;DR: 2nd IFIP International Symposium on Wireless Communications and Information Technology in Developing Countries, CSIR, Pretoria, South Africa, 6-7 October 2008.
Abstract: 2nd IFIP International Symposium on Wireless Communications and Information Technology in Developing Countries, CSIR, Pretoria, South Africa, 6-7 October 2008
175 citations
••
29 Sep 2006
TL;DR: This paper presents a novel approach that takes advantage of the inherent multi-radio capability of WMNs and shows that this capability can enable partitioning of the network into subnetworks in which simple distributed scheduling algorithms can achieve 100% throughput.
Abstract: This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distributed scheduling algorithms for wireless networks have emerged. Due to their distributed operation, these algorithms can achieve only a fraction of the maximum possible throughput. As an alternative to increasing the throughput fraction by designing new algorithms, in this paper we present a novel approach that takes advantage of the inherent multi-radio capability of WMNs. We show that this capability can enable partitioning of the network into subnetworks in which simple distributed scheduling algorithms can achieve 100% throughput. The partitioning is based on the recently introduced notion of Local Pooling. Using this notion, we characterize topologies in which 100% throughput can be achieved distributedly. These topologies are used in order to develop a number of channel assignment algorithms that are based on a matroid intersection algorithm. These algorithms partition a network in a manner that not only expands the capacity regions of the subnetworks but also allows distributed algorithms to achieve these capacity regions. Finally, we evaluate the performance of the algorithms via simulation and show that they significantly increase the distributedly achievable capacity region.
175 citations