17,048 research outputs found
Talk More Listen Less: Energy-Efficient Neighbor Discovery in Wireless Sensor Networks
Neighbor discovery is a fundamental service for initialization and managing
network dynamics in wireless sensor networks and mobile sensing applications.
In this paper, we present a novel design principle named Talk More Listen Less
(TMLL) to reduce idle-listening in neighbor discovery protocols by learning the
fact that more beacons lead to fewer wakeups. We propose an extended neighbor
discovery model for analyzing wakeup schedules in which beacons are not
necessarily placed in the wakeup slots. Furthermore, we are the first to
consider channel occupancy rate in discovery protocols by introducing a new
metric to trade off among duty-cycle, latency and channel occupancy rate.
Guided by the TMLL principle, we have designed Nihao, a family of
energy-efficient asynchronous neighbor discovery protocols for symmetric and
asymmetric cases. We compared Nihao with existing state of the art protocols
via analysis and real-world testbed experiments. The result shows that Nihao
significantly outperforms the others both in theory and practice.Comment: 9 pages, 14 figures, published in IEEE INFOCOM 201
On Heterogeneous Neighbor Discovery in Wireless Sensor Networks
Neighbor discovery plays a crucial role in the formation of wireless sensor
networks and mobile networks where the power of sensors (or mobile devices) is
constrained. Due to the difficulty of clock synchronization, many asynchronous
protocols based on wake-up scheduling have been developed over the years in
order to enable timely neighbor discovery between neighboring sensors while
saving energy. However, existing protocols are not fine-grained enough to
support all heterogeneous battery duty cycles, which can lead to a more rapid
deterioration of long-term battery health for those without support. Existing
research can be broadly divided into two categories according to their
neighbor-discovery techniques---the quorum based protocols and the co-primality
based protocols.In this paper, we propose two neighbor discovery protocols,
called Hedis and Todis, that optimize the duty cycle granularity of quorum and
co-primality based protocols respectively, by enabling the finest-grained
control of heterogeneous duty cycles. We compare the two optimal protocols via
analytical and simulation results, which show that although the optimal
co-primality based protocol (Todis) is simpler in its design, the optimal
quorum based protocol (Hedis) has a better performance since it has a lower
relative error rate and smaller discovery delay, while still allowing the
sensor nodes to wake up at a more infrequent rate.Comment: Accepted by IEEE INFOCOM 201
Neighbor discovery for industrial wireless sensor networks with mobile nodes
Industrial wireless sensor networks can facilitate the deployment of a wide range of novel industrial applications, including mobile applications that connect mobile robots, vehicles, goods and workers to industrial networks. Current industrial wireless sensor standards have been mainly designed for static deployments, and their performance significantly degrades when introducing mobile devices. One of the major reasons for such degradation is the neighbor discovery process. This paper presents and evaluates two novel neighbor discovery protocols that improve the capability of mobile devices to remain connected to the industrial wireless sensor networks as they move. The proposed protocols exploit topology information and the nature of devices (static or mobile) to reliably and rapidly discover neighbor devices. This is achieved in some cases at the expense of increasing the number of radio resources utilized and the energy consumed in the discovery process. The proposed solutions have been designed and evaluated considering the WirelessHART standard given its widespread industrial adoption. However, they can also be adapted for the ISA100.11a and IEEE 802.15.4e standards.This work was supported in part by the Spanish Ministry of Economy and Competitiveness and FEDER funds under the project TEC2014-57146-Rby the Local Government of Valencia with reference ACIF/2013/060 and by the European Union's Horizon 2020 Research and Innovation Programme under Grant Agreement No 723909 (AUTOWARE project)
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
Randomized neighbor discovery protocols with collision detection for static multi-hop wireless ad hoc networks
[EN] Neighbor discovery represents a first step after the deployment of wireless ad hoc networks, since the nodes that form them are equipped with limited-range radio transceivers, and they typically do not know their neighbors. In this paper two randomized neighbor discovery approaches, called CDH and CDPRR, based on collision detection for static multi-hop wireless ad hoc networks, are presented. Castalia 3.2 simulator has been used to compare our proposed protocols against two protocols chosen from the literature and used as reference: the PRR, and the Hello protocol. For the experiments, we chose five metrics: the neighbor discovery time, the number of discovered neighbors, the energy consumption, the throughput and the number of discovered neighbors versus packets sent ratio. According to the results obtained through simulation, we can conclude that our randomized proposals outperform both Hello and PRR protocols in the presence of collisions regarding all five metrics, for both one-hop and multi-hop scenarios. As novelty compared to the reference protocols, both proposals allow nodes to discover all their neighbors with probability 1, they are based on collision detection and know when to terminate the neighbor discovery process. Furthermore, qualitative comparisons of the existing protocols and the proposals are available in this paper. Moreover, CDPRR presents better results in terms of time, energy consumption and number of discovered neighbors versus packets sent ratio. We found that both proposals achieve to operate under more realistic assumptions. Furthermore, CDH does not need to know the number of nodes in the network.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.; Tavares De Araujo Cesariny Calafate, CM.; Lloret, J. (2021). Randomized neighbor discovery protocols with collision detection for static multi-hop wireless ad hoc networks. Telecommunication Systems. 77(3):577-596. https://doi.org/10.1007/s11235-021-00763-457759677
- …