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
••
19 May 2008TL;DR: This paper studies the joint routing and scheduling optimization problem in Wireless Mesh Networks where nodes are equipped with directional antennas and provides column generation-based heuristic approaches for the proposed models in a set of realistic-size instances and discusses the impact of different parameters on the network performance.
Abstract: Wireless Mesh Networks (WMNs) have recently emerged as a technology for next-generation wireless networking. WMNs partially replace wired backbone networks, and it is therefore reasonable to plan carefully radio resource assignment to provide quality guarantees to traffic flows. Directional transmissions allow to reduce radio interference, thus exploiting spatial reuse. Therefore, as a main contribution, in this paper we study the joint routing and scheduling optimization problem in Wireless Mesh Networks where nodes are equipped with directional antennas. To this aim, we assume a Spatial reuse Time Division Multiple Access (STDMA) scheme, a dynamic power control able to vary the emitted power slot-by-slot, and a rate adaptation mechanism that sets transmission rates according to the Signal- to-Interference-and-Noise Ratio (SINR). We provide column generation-based heuristic approaches for the proposed models in a set of realistic-size instances and discuss the impact of different parameters on the network performance. The results show that our schemes increase considerably the total traffic accepted by the network, providing bounds to the achievable performance.
52 citations
•
21 Sep 2007TL;DR: In this article, a modified link-state routing algorithm is proposed for selecting a route in a wireless network for the transmission of a data packet between wireless nodes in said network using a modified Link State Routing algorithm wherein only a limited number of broadcast messages are generated to synchronize the link state database throughout the wireless network.
Abstract: A method and system for selecting a route in a wireless network for the transmission of a data packet between wireless nodes in said network using a modified link-state routing algorithm wherein only a limited number of broadcast messages are generated to synchronize the link-state database throughout the wireless network. A subset of nodes called portal nodes within the network are elected to do the broadcasting for the entire network. Each portal node broadcasts an announcement of its identity to all of the wireless nodes. Each wireless node responds to these broadcasts to select one of the portal nodes as its root portal node. It then identifies a unicast route back to its root portal node, and sends a link-state register message to this portal node. These link-state register messages received by each portal node are aggregated by them and are broadcast to each of the wireless nodes for storage. When a data packet is thereafter received by a wireless node from a neighboring node, it detects if the data packet satisfies one of a plurality of predetermined conditions and rebroadcasts the data packet to neighboring wireless nodes if none of the conditions is satisfied.
52 citations
••
28 May 2008TL;DR: A new management architecture for heterogeneous wireless sensor networks (WSNs) called MARWIS, which supports common management tasks such as monitoring, (re)configuration, and updating program code in a WSN and considers specific characteristics of WSNs and restricted physical resources of the nodes.
Abstract: In this paper we present a new management architecture for heterogeneous wireless sensor networks (WSNs) called MARWIS. It supports common management tasks such as monitoring, (re)configuration, and updating program code in a WSN and considers specific characteristics of WSNs and restricted physical resources of the nodes such as battery, computing power, memory or network bandwidth and link quality. To handle large heterogeneous WSN we propose to subdivide it into smaller sensor subnetworks (SSNs), which contains sensor node of one type. A wireless mesh network (WMN) operates as backbone and builds the communication gateway between these SSNs. We show that the packet loss and the round trip time are decreased significantly in such an architecture. The mesh nodes operate also as a communication gateway between the different SSNs and perform the management tasks. All management tasks are controlled by a management station located in the Internet.
52 citations
••
14 Mar 2010TL;DR: This paper attempts to find out what a heterogeneous wireless network with general network settings can do by deriving a lower bound on the capacity by considering a dense network with n normal nodes and m = n^b more powerful helping nodes in a rectangular area.
Abstract: Although capacity has been extensively studied in wireless networks, most of the results are for homogeneous wireless networks where all nodes are assumed identical. In this paper, we investigate the capacity of heterogeneous wireless networks with general network settings. Specifically, we consider a dense network with n normal nodes and m = n^b (0 < b < 1) more powerful helping nodes in a rectangular area with width b(n) and length 1/b(n), where b(n) = n^w and -1/2 < w ≤ 0. We assume there are n flows in the network. All the n normal nodes are sources while only randomly chosen n^d (0 < d < 1) normal nodes are destinations. We further assume the n normal nodes are uniformly and independently distributed, while the m helping nodes are either regularly placed or uniformly and independently distributed, resulting in two different kinds of networks called Regular Heterogeneous Wireless Networks and Random Heterogeneous Wireless Networks, respectively. In this paper, we attempt to find out what a heterogeneous wireless network with general network settings can do by deriving a lower bound on the capacity. We also explore the conditions under which heterogeneous wireless networks can provide throughput higher than traditional homogeneous wireless networks.
51 citations
••
TL;DR: Simulation results show that proposed scheme outperforms the earlier approaches with respect to packet delivery fraction, end-to-end delay, aggregate throughput, fairness index and packet loss rate.
51 citations