Neighbor discovery in wireless networks using compressed sensing with Reed-Muller codes

Zhang, Lei; Guo, Dongning

doi:10.1109/wiopt.2011.5930008

Cited by 23 publications

(14 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The key assumption used here is that each node knows the locations of its neighbors within its local set S. Such information can be obtained via neighbor discovery [17]. Each node z then determines its transmit probability based on its local spatial information S z .…”

Section: B Optimum Adaptive Alohamentioning

confidence: 99%

A Throughput-Optimum Adaptive ALOHA MAC Scheme for Full-Duplex Wireless Networks

Tong

Haenggi

2015

2015 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

This paper proposes an adaptive and distributed MAC scheme for wireless networks with full-duplex radios. Fullduplex (FD) radios can exchange data simultaneously using the same frequency band and potentially double the throughput. On the other hand, it will inevitably cause extra interference to the network to use FD transmission instead of half-duplex (HD) transmission. Hence, there is a tradeoff between interference and throughput for wireless networks with FD radios. In order to mitigate the interference and maximize the network throughput, we propose the Optimum Adaptive ALOHA (OA-ALOHA) MAC scheme based on the nodes' local information about their neighbors. We derive each node's optimal transmit probability that maximizes the throughput and achieves proportional fairness. Our numerical results show that if the network is using the proposed adaptive MAC scheme, significantly better network throughput can be achieved than with the non-adaptive MAC schemes. HD can achieve around 50% maximum throughput gain using adaptive ALOHA while FD more than 70%. Moreover, a Simplified Adaptive ALOHA (SA-ALOHA) MAC scheme is also included that is based on an approximation of the optimum transmit probability and achieves comparable performance.

show abstract

Section: B Optimum Adaptive Alohamentioning

confidence: 99%

A Throughput-Optimum Adaptive ALOHA MAC Scheme for Full-Duplex Wireless Networks

Tong

Haenggi

2015

2015 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

show abstract

“…Two recent studies [29,12] propose neighbor discovery schemes on mobile duty-cycled devices. Both of them however require clock synchronization, and hence are not applicable to asynchronous settings.…”

Section: Related Workmentioning

confidence: 99%

Asynchronous Neighbor Discovery on Duty-cycled Mobile Devices

Chen

Russell

Jin

et al. 2015

Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing

View full text Add to dashboard Cite

Neighbor discovery is a fundamental problem in wireless networks. In this paper, we study asynchronous neighbor discovery between duty-cycled mobile devices. Each node is duty-cycled, i.e., its radio may only be active for a small fraction of the time. The duty cycles of the nodes can be the same or different, leading to symmetric or asymmetric cases of the neighbor discovery problem. In addition, the setting is asynchronous, i.e., clocks of different nodes may not be synchronized. Most existing studies assume an integer model (where time proceeds in discrete steps); two recent studies break away from this assumption, which allows them to develop significantly more efficient schemes. Our study improves the state-of-the-art in three main fronts. Firstly, we develop a generalized non-integer model (where time is continuous) that permits unified treatment of the assumptions in existing studies. We also provide a reduction that transforms any schedule in the basic integer model to a corresponding schedule in the generalized non-integer model while improving the performance by a factor of two. Applying this reduction, an optimal schedule in the integer model becomes an optimal schedule in the non-integer model. Thirdly, we establish a new family of lower bounds for the best achievable latency guarantee in the non-integer model. They are applicable to both symmetric and asymmetric settings, and encompass the lower bounds for the integer model as special cases. Finally, we develop a novel optimal construction based on Sidon sets for the symmetric setting. Our approach differs from the approaches taken by all existing studies, and provides a new direction for constructing neighbor discovery schedules.

show abstract

“…One solution is to let the codebook of each node be generated using a pseudo-random number generator using its network interface address (NIA) as the seed, so that it suffices to acquire all neighbors' NIAs. This, in turn, is a neighbor discovery problem, which has been studied in [8]- [10]. The discovery scheme proposed in [9], [10] uses similar on-off signalling and also solves a compressed sensing problem.…”

Section: Encoding For Mutual Broadcastmentioning

confidence: 99%

“…This, in turn, is a neighbor discovery problem, which has been studied in [8]- [10]. The discovery scheme proposed in [9], [10] uses similar on-off signalling and also solves a compressed sensing problem.…”

Section: Encoding For Mutual Broadcastmentioning

confidence: 99%

Wireless peer-to-peer mutual broadcast via sparse recovery

Zhang

Guo

2011

2011 IEEE International Symposium on Information Theory Proceedings

Self Cite

View full text Add to dashboard Cite

This paper studies a problem frequently seen in wireless networks: Every node wishes to broadcast information to nodes within a single hop, which are referred to as its peers. We call this problem mutual broadcast. A novel solution is proposed, which exploits the multiaccess nature of the wireless medium and addresses the half-duplex constraint at the fundamental level. The defining feature of the scheme is to let all nodes send their messages at the same time, where each node broadcasts a codeword (selected from its unique codebook) consisting of onslots and off-slots, where it transmits only during its on-slots, and listens to its peers through its own off-slots. Decoding can be viewed as a problem of sparse support recovery based on linear measurements. In case each message consists of a small number of bits, an iterative message-passing algorithm based on belief propagation is developed, the performance of which is characterized using a state evolution formula in the limit where each node has a large number of peers. Numerical results demonstrate that, to achieve the same reliability for mutual broadcast, the proposed scheme achieves three to five times the rate of ALOHA and carrier-sensing multiple-access (CSMA) in typical scenarios.

show abstract

Neighbor discovery in wireless networks using compressed sensing with Reed-Muller codes

Cited by 23 publications

References 19 publications

A Throughput-Optimum Adaptive ALOHA MAC Scheme for Full-Duplex Wireless Networks

A Throughput-Optimum Adaptive ALOHA MAC Scheme for Full-Duplex Wireless Networks

Asynchronous Neighbor Discovery on Duty-cycled Mobile Devices

Wireless peer-to-peer mutual broadcast via sparse recovery

Contact Info

Product

Resources

About