diff --git a/p2p/discover/lookup.go b/p2p/discover/lookup.go
index ff2dc907cd..684067a619 100644
--- a/p2p/discover/lookup.go
+++ b/p2p/discover/lookup.go
@@ -189,7 +189,7 @@ func (it *lookupIterator) Next() bool {
 			if it.lookup.empty() {
 				// If the lookup is empty right after creation, it means the local table
 				// is in a degraded state, and we need to wait for it to fill again.
-				it.lookupFailed(it.lookup.tab)
+				it.lookupFailed(1 * time.Minute)
 				it.lookup = nil
 				continue
 			}
@@ -209,30 +209,30 @@ func (it *lookupIterator) Next() bool {
 
 // lookupFailed handles failed lookup attempts. This can be called when the table has
 // exited, or when it runs out of nodes.
-func (it *lookupIterator) lookupFailed(tab *Table) {
-	timeout, cancel := context.WithTimeout(it.ctx, 1*time.Minute)
+func (it *lookupIterator) lookupFailed(timeout time.Duration) {
+	ctx, cancel := context.WithTimeout(it.ctx, timeout)
 	defer cancel()
 
 	// Wait for Table initialization to complete, in case it is still in progress.
 	select {
-	case <-tab.initDone:
-	case <-timeout.Done():
+	case <-it.lookup.tab.initDone:
+	case <-ctx.Done():
 		return
 	}
 
 	// Wait for ongoing refresh operation, or trigger one.
 	if it.tabRefreshing == nil {
-		it.tabRefreshing = tab.refresh()
+		it.tabRefreshing = it.lookup.tab.refresh()
 	}
 	select {
 	case <-it.tabRefreshing:
 		it.tabRefreshing = nil
-	case <-timeout.Done():
+	case <-ctx.Done():
 		return
 	}
 
 	// Wait for the table to fill.
-	tab.waitForNodes(timeout, 1)
+	it.lookup.tab.waitForNodes(ctx, 1)
 }
 
 // Close ends the iterator.