Neighbor discovery in wireless networks with multipacket reception

Zeng, Wei; Vasudevan, Subramanyan; Chen, Xian; Wang, Bing; Russell, Alexander; Wei, Wei

doi:10.1145/2107502.2107506

Cited by 38 publications

(63 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…major work in this category [15], [18], [22], [27], [31]) adopt probabilistic strategies at each node. Specifically, each node remains active or asleep with different probabilities.…”

Section: Related Workmentioning

confidence: 99%

“…A representative one is the birthday protocol [18] where nodes transmit/receive or sleep with different probabilities. The work in [31] further addresses the case with multi-packet reception and directional antennas. Probabilistic protocols have the advantages of being memoryless and stationary and thus are especially robust and suitable for in decentralized environments where no prior knowledge or coordination is available.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Never Live Without Neighbors: From Single- to Multi-Channel Neighbor Discovery for Mobile Sensing Applications

Chen¹,

Bian²,

Zheng³

2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-Neighbor discovery is of paramount importance in mobile sensing applications and is particularly challenging if the operating frequencies of mobile devices span multiple channels. In this paper, we formulate the multi-channel neighbor discovery problem and establish a theoretical framework of it, under which we derive the performance bound of any neighbor discovery protocol guaranteeing discovery. We then develop a multi-channel discovery protocol that achieves guaranteed discovery with orderminimum worst-case discovery delay and fine-grained control of energy conservation levels.

show abstract

“…major work in this category [15], [18], [22], [27], [31]) adopt probabilistic strategies at each node. Specifically, each node remains active or asleep with different probabilities.…”

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Never Live Without Neighbors: From Single- to Multi-Channel Neighbor Discovery for Mobile Sensing Applications

Chen¹,

Bian²,

Zheng³

2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…In addition, the requirement of this received SINR depends on the physical transceiving scheme, such as the receiver structure and level of modulation and coding scheme (MCS). Based on this, there have been attempts to understand the effect of physical layer characteristics including the receiver structure and wireless channel [12], [13]. In [12], a joint iterative decoding method for multiuser detection was applied to peer discovery but its system performance improvement was only evaluated using simulation.…”

Section: A Related Workmentioning

confidence: 99%

“…In [12], a joint iterative decoding method for multiuser detection was applied to peer discovery but its system performance improvement was only evaluated using simulation. The work of [13] analyzed the performance of multipacket reception based on the conventional packet collision model. These approaches remains insufficient to reveal the implications of the randomness of wireless channels and peer locations.…”

Section: A Related Workmentioning

confidence: 99%

Spatial Performance Analysis and Design Principles for Wireless Peer Discovery

Kwon

Choi

2014

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-In wireless peer-to-peer networks that serve various proximity-based applications, peer discovery is the key to identifying other peers with which a peer can communicate and an understanding of its performance is fundamental to the design of an efficient discovery operation. This paper analyzes the performance of wireless peer discovery through comprehensively considering the wireless channel, spatial distribution of peers, and discovery operation parameters. The average numbers of successfully discovered peers are expressed in closed forms for two widely used channel models, i.e., the interference limited Nakagami-m fading model and the Rayleigh fading model with nonzero noise, when peers are spatially distributed according to a homogeneous Poisson point process. These insightful expressions lead to the design principles for the key operation parameters including the transmission probability, required amount of wireless resources, level of modulation and coding scheme (MCS), and transmit power. Furthermore, the impact of shadowing on the spatial performance and suggested design principles is evaluated using mathematical analysis and simulations.Index Terms-Peer discovery, neighbor discovery, stochastic geometry, D2D networks, random access protocol.

show abstract

“…The neighbor discovery phase hence only requires that a single hello frame be received correctly from each neighbor. Wireless broadcasting instead, causes a frame to be received also by BNs that are not physical neighbors, making the detection of physical neighbors challenging [9]. This effect is compounded by the fact that, due to fading and interference, there is a non-zero probability that decoding errors impair the transmission from physical neighbors more significantly than the transmission from further nodes.…”

Section: Introductionmentioning

confidence: 99%

Topology Discovery for Linear Wireless Networks With Application to Train Backbone Inauguration

Liu

Feng

Simeone

et al. 2016

IEEE Trans. Intell. Transport. Syst.

View full text Add to dashboard Cite

Abstract-A train backbone network consists of a sequence of nodes arranged in a linear topology. A key step that enables communication in such a network is that of topology discovery, or train inauguration, whereby nodes learn in a distributed fashion the physical topology of the backbone network. While the current standard for train inauguration assumes wired links between adjacent backbone nodes, this work investigates the more challenging scenario in which the nodes communicate wirelessly. The key motivations for this desired switch from wired topology discovery to wireless one are the flexibility and capability for expansion and upgrading of a wireless backbone. The implementation of topology discovery over wireless channels is made difficult by the broadcast nature of the wireless medium, and by fading and interference. A novel topology discovery protocol is proposed that overcomes these issues and requires relatively minor changes to the wired standard. The protocol is shown via analysis and numerical results to be robust to the impairments caused by the wireless channel including interference from other trains.

show abstract

Neighbor discovery in wireless networks with multipacket reception

Cited by 38 publications

References 24 publications

Never Live Without Neighbors: From Single- to Multi-Channel Neighbor Discovery for Mobile Sensing Applications

Never Live Without Neighbors: From Single- to Multi-Channel Neighbor Discovery for Mobile Sensing Applications

Spatial Performance Analysis and Design Principles for Wireless Peer Discovery

Topology Discovery for Linear Wireless Networks With Application to Train Backbone Inauguration

Contact Info

Product

Resources

About