Compressed neighbour discovery using sparse kerdock matrices
We study the network-wide neighbour discovery problem in wireless networks in which each node in a network must discovery the network interface addresses (NIAs) of its neighbour. We work within the rapid on-off division duplex framework proposed by Guo and Zhang in [5] in which all nodes are assigne...
Main Authors: | , |
---|---|
Format: | Conference item |
Published: |
Institute of Electrical and Electronics Engineers
2018
|