14,159 research outputs found
PACE: Simple Multi-hop Scheduling for Single-radio 802.11-based Stub Wireless Mesh Networks
IEEE 802.11-based Stub Wireless Mesh Networks (WMNs) are a cost-effective and flexible solution to extend wired network infrastructures. Yet, they suffer from two major problems: inefficiency and unfairness. A number of approaches have been proposed to tackle these problems, but they are too restrictive, highly complex, or require time synchronization and modifications to the IEEE 802.11 MAC.
PACE is a simple multi-hop scheduling mechanism for Stub WMNs overlaid on the IEEE 802.11 MAC that jointly addresses the inefficiency and unfairness problems. It limits transmissions to a single mesh node at each time and ensures that each node has the opportunity to transmit a packet in each network-wide transmission round. Simulation results demonstrate that PACE can achieve optimal network capacity utilization and greatly outperforms state of the art CSMA/CA-based solutions as far as goodput, delay, and fairness are concerned
On the Experimental Evaluation of Vehicular Networks: Issues, Requirements and Methodology Applied to a Real Use Case
One of the most challenging fields in vehicular communications has been the
experimental assessment of protocols and novel technologies. Researchers
usually tend to simulate vehicular scenarios and/or partially validate new
contributions in the area by using constrained testbeds and carrying out minor
tests. In this line, the present work reviews the issues that pioneers in the
area of vehicular communications and, in general, in telematics, have to deal
with if they want to perform a good evaluation campaign by real testing. The
key needs for a good experimental evaluation is the use of proper software
tools for gathering testing data, post-processing and generating relevant
figures of merit and, finally, properly showing the most important results. For
this reason, a key contribution of this paper is the presentation of an
evaluation environment called AnaVANET, which covers the previous needs. By
using this tool and presenting a reference case of study, a generic testing
methodology is described and applied. This way, the usage of the IPv6 protocol
over a vehicle-to-vehicle routing protocol, and supporting IETF-based network
mobility, is tested at the same time the main features of the AnaVANET system
are presented. This work contributes in laying the foundations for a proper
experimental evaluation of vehicular networks and will be useful for many
researchers in the area.Comment: in EAI Endorsed Transactions on Industrial Networks and Intelligent
Systems, 201
Throughput Analysis for Wireless Networks with Full-Duplex Radios
This paper investigates the throughput for wireless network with full-duplex
radios using stochastic geometry. Full-duplex (FD) radios can exchange data
simultaneously with each other. On the other hand, the downside of FD
transmission is that it will inevitably cause extra interference to the network
compared to half-duplex (HD) transmission. In this paper, we focus on a
wireless network of nodes with both HD and FD capabilities and derive and
optimize the throughput in such a network. Our analytical result shows that if
the network is adapting an ALOHA protocol, the maximal throughput is always
achieved by scheduling all concurrently transmitting nodes to work in FD mode
instead of a mixed FD/HD mode or HD mode regardless of the network
configurations. Moreover, the throughput gain of using FD transmission over HD
transmission is analytically lower and upper bounded.Comment: 4 figure
Robotic Wireless Sensor Networks
In this chapter, we present a literature survey of an emerging, cutting-edge,
and multi-disciplinary field of research at the intersection of Robotics and
Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor
Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system
that aims to achieve certain sensing goals while meeting and maintaining
certain communication performance requirements, through cooperative control,
learning and adaptation. While both of the component areas, i.e., Robotics and
WSN, are very well-known and well-explored, there exist a whole set of new
opportunities and research directions at the intersection of these two fields
which are relatively or even completely unexplored. One such example would be
the use of a set of robotic routers to set up a temporary communication path
between a sender and a receiver that uses the controlled mobility to the
advantage of packet routing. We find that there exist only a limited number of
articles to be directly categorized as RWSN related works whereas there exist a
range of articles in the robotics and the WSN literature that are also relevant
to this new field of research. To connect the dots, we first identify the core
problems and research trends related to RWSN such as connectivity,
localization, routing, and robust flow of information. Next, we classify the
existing research on RWSN as well as the relevant state-of-the-arts from
robotics and WSN community according to the problems and trends identified in
the first step. Lastly, we analyze what is missing in the existing literature,
and identify topics that require more research attention in the future
Applications of Repeated Games in Wireless Networks: A Survey
A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. In wireless
networks, conflicts among wireless nodes can lead to selfish behaviors,
resulting in poor network performances and detrimental individual payoffs. In
this paper, we survey the applications of repeated games in different wireless
networks. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference
Coalition Formation Games for Collaborative Spectrum Sensing
Collaborative Spectrum Sensing (CSS) between secondary users (SUs) in
cognitive networks exhibits an inherent tradeoff between minimizing the
probability of missing the detection of the primary user (PU) and maintaining a
reasonable false alarm probability (e.g., for maintaining a good spectrum
utilization). In this paper, we study the impact of this tradeoff on the
network structure and the cooperative incentives of the SUs that seek to
cooperate for improving their detection performance. We model the CSS problem
as a non-transferable coalitional game, and we propose distributed algorithms
for coalition formation. First, we construct a distributed coalition formation
(CF) algorithm that allows the SUs to self-organize into disjoint coalitions
while accounting for the CSS tradeoff. Then, the CF algorithm is complemented
with a coalitional voting game for enabling distributed coalition formation
with detection probability guarantees (CF-PD) when required by the PU. The
CF-PD algorithm allows the SUs to form minimal winning coalitions (MWCs), i.e.,
coalitions that achieve the target detection probability with minimal costs.
For both algorithms, we study and prove various properties pertaining to
network structure, adaptation to mobility and stability. Simulation results
show that CF reduces the average probability of miss per SU up to 88.45%
relative to the non-cooperative case, while maintaining a desired false alarm.
For CF-PD, the results show that up to 87.25% of the SUs achieve the required
detection probability through MWCComment: IEEE Transactions on Vehicular Technology, to appea
RCFD: A Novel Channel Access Scheme for Full-Duplex Wireless Networks Based on Contention in Time and Frequency Domains
In the last years, the advancements in signal processing and integrated
circuits technology allowed several research groups to develop working
prototypes of in-band full-duplex wireless systems. The introduction of such a
revolutionary concept is promising in terms of increasing network performance,
but at the same time poses several new challenges, especially at the MAC layer.
Consequently, innovative channel access strategies are needed to exploit the
opportunities provided by full-duplex while dealing with the increased
complexity derived from its adoption. In this direction, this paper proposes
RTS/CTS in the Frequency Domain (RCFD), a MAC layer scheme for full-duplex ad
hoc wireless networks, based on the idea of time-frequency channel contention.
According to this approach, different OFDM subcarriers are used to coordinate
how nodes access the shared medium. The proposed scheme leads to efficient
transmission scheduling with the result of avoiding collisions and exploiting
full-duplex opportunities. The considerable performance improvements with
respect to standard and state-of-the-art MAC protocols for wireless networks
are highlighted through both theoretical analysis and network simulations.Comment: Submitted at IEEE Transactions on Mobile Computing. arXiv admin note:
text overlap with arXiv:1605.0971
- …