9,865 research outputs found
Insights into the Design of Congestion Control Protocols for Multi-Hop Wireless Mesh Networks
The widespread deployment of multi-hop wireless mesh networks will depend on the performance seen by the user. Unfortunately, the most predominant transport protocol, TCP, performs poorly over such networks, even leading to starvation in some topologies. In this work, we characterize the root causes of starvation in 802.11 scheduled multi-hop wireless networks via simulations. We analyze the performance of three categories of transport protocols. (1) end-to-end protocols that require implicit feedback (TCP SACK), (2) Explicit feedback based protocols (XCP and VCP) and (3) Open-loop protocol (UDP). We ask and answer the following questions in relation to these protocols: (a) Why does starvation occur in different topologies? Is it intrinsic to TCP or, in general, to feedback-based protocols? or does it also occur in the case of open-loop transfers such as CBR over UDP? (a) What is the role of application behavior on transport layer performance in multi-hop wireless mesh networks? (b) Is sharing congestion in the wireless neighborhood essential for avoiding starvation? (c) For explicit feedback based transport protocols, such as XCP and VCP, what performance can be expected when their capacity estimate is inaccurate? Based on the insights derived from the above analysis, we design a rate-based protocol called VRate that uses the two ECN bits for conveying load feedback information. VRate achieves near optimal rates when configured with the correct capacity estimate
Support Service for Reciprocal Computational Resource Sharing in Wireless Community Networks
In community networks, individuals and local organizations from a geographic area team up to create and run a community-owned IP network to satisfy the community's demand for ICT, such as facilitating Internet access and providing services of local interest. Most current community networks use wireless links for the node interconnection, applying off-the-shelf wireless equipment. While IP connectivity over the shared network infrastructure is successfully achieved, the deployment of applications in community networks is surprisingly low. To address the solution of this problem, we propose in this paper a service to incentivize the contribution of computing and storage as cloud resources to community networks, in order to stimulate the deployment of services and applications. Our final goal is the vision that in the long term, the users of community networks will not need to consume applications from the Internet, but find them within the wireless community network
Survey on wireless technology trade-offs for the industrial internet of things
Aside from vast deployment cost reduction, Industrial Wireless Sensor and Actuator Networks (IWSAN) introduce a new level of industrial connectivity. Wireless connection of sensors and actuators in industrial environments not only enables wireless monitoring and actuation, it also enables coordination of production stages, connecting mobile robots and autonomous transport vehicles, as well as localization and tracking of assets. All these opportunities already inspired the development of many wireless technologies in an effort to fully enable Industry 4.0. However, different technologies significantly differ in performance and capabilities, none being capable of supporting all industrial use cases. When designing a network solution, one must be aware of the capabilities and the trade-offs that prospective technologies have. This paper evaluates the technologies potentially suitable for IWSAN solutions covering an entire industrial site with limited infrastructure cost and discusses their trade-offs in an effort to provide information for choosing the most suitable technology for the use case of interest. The comparative discussion presented in this paper aims to enable engineers to choose the most suitable wireless technology for their specific IWSAN deployment
Rate Optimal design of a Wireless Backhaul Network using TV White Space
The penetration of wireless broadband services in remote areas has primarily
been limited due to the lack of economic incentives that service providers
encounter in sparsely populated areas. Besides, wireless backhaul links like
satellite and microwave are either expensive or require strict line of sight
communication making them unattractive. TV white space channels with their
desirable radio propagation characteristics can provide an excellent
alternative for engineering backhaul networks in areas that lack abundant
infrastructure. Specifically, TV white space channels can provide "free
wireless backhaul pipes" to transport aggregated traffic from broadband sources
to fiber access points. In this paper, we investigate the feasibility of
multi-hop wireless backhaul in the available white space channels by using
noncontiguous Orthogonal Frequency Division Multiple Access (NC-OFDMA)
transmissions between fixed backhaul towers. Specifically, we consider joint
power control, scheduling and routing strategies to maximize the minimum rate
across broadband towers in the network. Depending on the population density and
traffic demands of the location under consideration, we discuss the suitable
choice of cell size for the backhaul network. Using the example of available TV
white space channels in Wichita, Kansas (a small city located in central USA),
we provide illustrative numerical examples for designing such wireless backhaul
network
Max-min Fairness in 802.11 Mesh Networks
In this paper we build upon the recent observation that the 802.11 rate
region is log-convex and, for the first time, characterise max-min fair rate
allocations for a large class of 802.11 wireless mesh networks. By exploiting
features of the 802.11e/n MAC, in particular TXOP packet bursting, we are able
to use this characterisation to establish a straightforward, practically
implementable approach for achieving max-min throughput fairness. We
demonstrate that this approach can be readily extended to encompass time-based
fairness in multi-rate 802.11 mesh networks
Identifying Design Requirements for Wireless Routing Link Metrics
In this paper, we identify and analyze the requirements to design a new
routing link metric for wireless multihop networks. Considering these
requirements, when a link metric is proposed, then both the design and
implementation of the link metric with a routing protocol become easy.
Secondly, the underlying network issues can easily be tackled. Thirdly, an
appreciable performance of the network is guaranteed. Along with the existing
implementation of three link metrics Expected Transmission Count (ETX), Minimum
Delay (MD), and Minimum Loss (ML), we implement inverse ETX; invETX with
Optimized Link State Routing (OLSR) using NS-2.34. The simulation results show
that how the computational burden of a metric degrades the performance of the
respective protocol and how a metric has to trade-off between different
performance parameters
- …