681 research outputs found
Communication Primitives in Cognitive Radio Networks
Cognitive radio networks are a new type of multi-channel wireless network in
which different nodes can have access to different sets of channels. By
providing multiple channels, they improve the efficiency and reliability of
wireless communication. However, the heterogeneous nature of cognitive radio
networks also brings new challenges to the design and analysis of distributed
algorithms.
In this paper, we focus on two fundamental problems in cognitive radio
networks: neighbor discovery, and global broadcast. We consider a network
containing nodes, each of which has access to channels. We assume the
network has diameter , and each pair of neighbors have at least ,
and at most , shared channels. We also assume each node has at
most neighbors. For the neighbor discovery problem, we design a
randomized algorithm CSeek which has time complexity
. CSeek is flexible and robust,
which allows us to use it as a generic "filter" to find "well-connected"
neighbors with an even shorter running time. We then move on to the global
broadcast problem, and propose CGCast, a randomized algorithm which takes
time. CGCast uses
CSeek to achieve communication among neighbors, and uses edge coloring to
establish an efficient schedule for fast message dissemination.
Towards the end of the paper, we give lower bounds for solving the two
problems. These lower bounds demonstrate that in many situations, CSeek and
CGCast are near optimal
Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey
Wireless sensor networks (WSNs) consist of autonomous and resource-limited
devices. The devices cooperate to monitor one or more physical phenomena within
an area of interest. WSNs operate as stochastic systems because of randomness
in the monitored environments. For long service time and low maintenance cost,
WSNs require adaptive and robust methods to address data exchange, topology
formulation, resource and power optimization, sensing coverage and object
detection, and security challenges. In these problems, sensor nodes are to make
optimized decisions from a set of accessible strategies to achieve design
goals. This survey reviews numerous applications of the Markov decision process
(MDP) framework, a powerful decision-making tool to develop adaptive algorithms
and protocols for WSNs. Furthermore, various solution methods are discussed and
compared to serve as a guide for using MDPs in WSNs
Energy-aware Randomized Neighbor Discovery Protocol based on Collision Detection in Wireless Ad Hoc Networks
[EN] In wireless ad hoc networks, neighbor discovery is necessary as an initial step. In this work we present LECDH (Low Energy Collision Detection Hello), an energy-aware randomized handshake-based neighbor discovery protocol for static environments. We carried out simulations through Castalia 3.2 simulator and compared LECDH with an existing protocol EAH (Energy Aware Hello) used as reference. We conclude that the proposal outperforms the reference protocol both in one-hop and multi-hop environments in terms of Energy consumption, Discovery time, Number of discovered neighbors, Throughput, and Discoveries per packet sent, for high duty cycles. Moreover, for low number of nodes in LECDH, as the duty cycle is reduced the performance is better according to all 5 metrics in both environments. Overall, we found that our proposal follows more realistic assumptions and still allows nodes to succeed at discovering all their neighbors almost with probability 1. Moreover, a qualitative comparison of the reference solution and our proposal is included in this paper.This work has been partially supported by the "Ministerio de Economia y Competitividad" in the "Programa Estatal de Fomento de la Investigacion Cientifica y Tecnica de Excelencia, Subprograma Estatal de Generacion de Conocimiento" within the project under Grant TIN2017-84802-C2-1-P. This work has also been partially supported by European Union through the ERANETMED (Euromediterranean Cooperation through ERANET joint activities and beyond) project ERANETMED3-227 SMARTWATIR. This work has also been partially founded by the Universitat Politecnica de Valencia through the post-doctoral PAID-10-20 program.Sorribes, JV.; Peñalver Herrero, ML.; Jimenez, JM.; Sendra, S. (2022). Energy-aware Randomized Neighbor Discovery Protocol based on Collision Detection in Wireless Ad Hoc Networks. Mobile Networks and Applications (Online). 28:31-48. https://doi.org/10.1007/s11036-022-01995-731482
Collision Avoidance Based Neighbor Discovery in Ad Hoc Wireless Networks
[EN] Neighbor discovery is an important first step after the deployment of ad hoc wireless networks since they are a type of network that do not provide a communications infrastructure right after their deployment, the devices have radio transceivers which provide a limited transmission range, and there is a lack of knowledge of the potential neighbors. In this work two proposals to overcome the neighbor discovery in static one-hop environments in the presence of collisions, are presented. We performed simulations through Castalia 3.2, to compare the performance of the proposals against that for two protocols from the literature, i.e. PRR and Hello, and evaluate them according to six metrics. According to simulation results, the Leader-based proposal (O(N)) outperforms the other protocols in terms of neighbor discovery time, throughput, discoveries vs packets sent ratio, and packets received vs sent ratio, and the TDMA-based proposal is the slowest (O(N-2)) and presents the worst results regarding energy consumption, and discoveries vs packets sent ratio. However, both proposals follow a predetermined transmission schedule that allows them to discover all the neighbors with probability 1, and use a feedback mechanism. We also performed an analytical study for both proposals according to several metrics. Moreover, the Leader-based solution can only properly operate in one-hop environments, whereas the TDMA-based proposal is appropriate for its use in multi-hop environments.This work has been partially supported by the "Ministerio de Economia y Competitividad" in the "Programa Estatal de Fomento de la Investigacion Cientifica y Tecnica de Excelencia, Subprograma Estatal de Generacion de Conocimiento" within the project under Grant TIN2017-84802-C2-1-P. This work has also been partially supported by European Union through the ERANETMED (Euromediterranean Cooperation through ERANET joint activities and beyond) project ERANETMED3-227 SMARTWATIR.Sorribes, JV.; Peñalver Herrero, ML.; Lloret, J.; Tavares De Araujo Cesariny Calafate, CM. (2022). Collision Avoidance Based Neighbor Discovery in Ad Hoc Wireless Networks. Wireless Personal Communications. 125(2):987-1011. https://doi.org/10.1007/s11277-021-09091-x9871011125
Airborne Directional Networking: Topology Control Protocol Design
This research identifies and evaluates the impact of several architectural design choices in relation to airborne networking in contested environments related to autonomous topology control. Using simulation, we evaluate topology reconfiguration effectiveness using classical performance metrics for different point-to-point communication architectures. Our attention is focused on the design choices which have the greatest impact on reliability, scalability, and performance. In this work, we discuss the impact of several practical considerations of airborne networking in contested environments related to autonomous topology control modeling. Using simulation, we derive multiple classical performance metrics to evaluate topology reconfiguration effectiveness for different point-to-point communication architecture attributes for the purpose of qualifying protocol design elements
- …