Leveraging multiple channels in ad hoc networks

Halldórsson, Magnús M.; Wang, Yuexuan; Yu, Dongxiao

doi:10.1007/s00446-018-0329-3

Cited by 5 publications

(3 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In real networks, whether one node can communicate with a neighboring node successfully is dependent on many factors, such as environment noises, the sending power energy, the path-loss exponent during transmission, beaconing, and handshaking. The signal-to-interference-plus-noise ratio (SINR) model is a realistic model that captures the collision among multiple transmissions [34]. It is also shown that the SINR model can be converted to the communication graph model that two nodes are neighbors if their distance is within the communication range.…”

Section: Preliminariesmentioning

confidence: 99%

A Practical Neighbor Discovery Framework for Wireless Sensor Networks

Wang

Shi

et al. 2019

Sensors

Self Cite

View full text Add to dashboard Cite

Neighbor discovery is a crucial operation frequently executed throughout the life cycle of a Wireless Sensor Network (WSN). Various protocols have been proposed to minimize the discovery latency or to prolong the lifetime of sensors. However, none of them have addressed that all the critical concerns stemming from real WSNs, including communication collisions, latency constraints and energy consumption limitations. In this paper, we propose Spear, the first practical neighbor discovery framework to meet all these requirements. Spear offers two new methods to reduce communication collisions, thus boosting the discovery rate of existing neighbor discovery protocols. Spear also takes into consideration latency constraints and facilitates timely adjustments in order to reduce the discovery latency. Spear offers two practical energy management methods that evidently prolong the lifetime of sensor nodes. Most importantly, Spear automatically improves the discovery results of existing discovery protocols, on which no modification is required. Beyond reporting details of different Spear modules, we also present experiment evaluations on several notable neighbor discovery protocols. Results show that Spear greatly improves the discovery rate from 33.0% to 99.2%, and prolongs the sensor nodes lifetime up to 6.47 times.

show abstract

Section: Preliminariesmentioning

confidence: 99%

A Practical Neighbor Discovery Framework for Wireless Sensor Networks

Wang

Shi

et al. 2019

Sensors

Self Cite

View full text Add to dashboard Cite

show abstract

“…The default assumption is that interference fades with a polynomial of the distance, and transmission succeeds only if the received signal strength is sufficiently larger than the total interference plus noise. Recently, the SINR model has attracted great attentions in the distributed community [6,5,12,21,25,26,27,29,33,34,36,47,51,53,54,55]. Most of these works focus on networks embedded in Euclidean space, while many of the results hold also for doubling or "bounded growth" metrics [5,12,33].…”

Section: A Other Related Workmentioning

confidence: 99%

“…When additionally ∆ is known, this was further improved recently to O(∆ + log n • log log n) in the spontaneous setting [4]. The speedup of multiple channels on local broadcast was considered in [29,55] Broadcast: The complexity of broadcasting is well understood in graph-based models. In the radio network model, Bar-Yehuda et al [3] presented the decay protocol which can accomplish non-spontaneous broadcast in O(D log n + log 2 n) rounds, where D is the diameter.…”

Section: A Other Related Workmentioning

confidence: 99%

Data Dissemination in Unified Dynamic Wireless Networks

Halldórsson¹,

Tonoyan²,

Wang³

et al. 2016

Preprint

Self Cite

View full text Add to dashboard Cite

We give efficient algorithms for the fundamental problems of Broadcast and Local Broadcast in dynamic wireless networks. We propose a general model of communication which captures and includes both fading models (like SINR) and graph-based models (such as quasi unit disc graphs, bounded-independence graphs, and protocol model). The only requirement is that the nodes can be embedded in a bounded growth quasi-metric, which is the weakest condition known to ensure distributed operability. Both the nodes and the links of the network are dynamic: nodes can come and go, while the signal strength on links can go up or down.The results improve some of the known bounds even in the static setting, including an optimal algorithm for local broadcasting in the SINR model, which is additionally uniform (independent of network size). An essential component is a procedure for balancing contention, which has potentially wide applicability. The results illustrate the importance of carrier sensing, a stock feature of wireless nodes today, which we encapsulate in primitives to better explore its uses and usefulness.

show abstract