#### DMCA

## On designing neighbor discovery protocols: a code-based approach (2014)

Venue: | In Proceedings of IEEE INFOCOM |

Citations: | 2 - 0 self |

### Citations

394 |
Convex optimization. Cambridge university press,
- Boyd, Vandenberghe
- 2004
(Show Context)
Citation Context ... i=0 ci(ci+j + ci+j+1) ≥ 1, ∀j ∈ {0, 1, · · · , ⌊n 2 ⌋ }, (9) ci ∈ {0, 1}, ∀i ∈ {0, 1, · · · , n − 1}. (10) The lower bound of the above primal problem can be calculated via the Lagrange dual problem =-=[4]-=- by relaxing constraint (10). We first define the Lagrangian L, L(c,λ,ω,ν) = (1 + ω − ν)Tc + 1Tλ− 1Tω − n2 ∑ j=0 λj [ cT(Aj + Aj+1)c ] , (11) IEEE INFOCOM 2014 - IEEE Conference on Computer Communi... |

170 | Power-saving protocols for IEEE 802.11-based multi-hop ad hoc networks
- Tseng, Hsu, et al.
- 2003
(Show Context)
Citation Context ... case. Whereas we prove that the bound in [20] can be further lowered. Besides, our designs fit for both symmetric and asymmetric cases with low complexity. In a class of quorum-based protocols [12], =-=[16]-=-, a cycle contains m2 consecutive slots, where m is a global parameter. A node is either awake or sleeping in a slot. Both transmitting and listening happen during awake slots, so that two neighboring... |

145 |
A theorem in finite projective geometry and some applications to number theory, Trans
- Singer
- 1938
(Show Context)
Citation Context ... [20]. We also propose a novel class of active-sleep patterns called Diff-Codes, and analyze its theoretical performance. The construction of DiffCodes takes advantage of perfect difference sets [2], =-=[15]-=-, and guarantees optimality when the Diff-Code is extended from a perfect difference set. Last, for comprehensiveness, we provide a heuristic algorithm for seeking the Diff-Code with a target duty cyc... |

145 | Asynchronous wakeup for ad hoc networks
- Zheng, Hou, et al.
- 2003
(Show Context)
Citation Context ...iming at high energy efficiency as well as low discovery latency. Most existing neighbor discovery protocols (e.g., Disco [6], U-Connect [9]) cannot realize the optimal worst-case latency provided in =-=[20]-=-. Furthermore, although Searchlight [1] is approximate to the optimum as in [20] with symmetric IEEE INFOCOM 2014 - IEEE Conference on Computer Communications 978-14799-3360-0/14/$31.00 ©2014 IEEE 168... |

131 | Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks
- McGlynn, Borbash
- 2001
(Show Context)
Citation Context ... protocol should not only guarantee successful discovery between neighboring nodes, but also realize a short latency at the same time. On one hand, the probabilistic approach (e.g., Birthday Protocol =-=[13]-=-) in static sensor networks does not meet this requirement, because it fails to provide a worst-case discovery latency bound, and thus leads to confusion between discovery failure and non-existence of... |

130 |
Optical orthogonal codes: Design, analysis and applications,”
- Chung, Salehi, et al.
- 1989
(Show Context)
Citation Context ...terministic Protocols A deterministic protocol establishes a pattern scheduling the periodical operations of each node. A code-based protocol is presented in [10] utilizing constant-weight codes [3], =-=[5]-=-, but it assumes synchronization among nodes. Moreover, Zheng et al. [20] applied optimal block designs in the case of symmetric duty cycle. The authors concluded that their approach reduces to an NP-... |

111 | On neighbor discovery in wireless networks with directional antennas
- Vasudevan, Kurose, et al.
- 2005
(Show Context)
Citation Context ...Coupon Collector’s Problem. In [11], Khalili et al. further realized the mechanism of channel status detection, and designed algorithms providing feedback of reception. Additionally, Vasudevan et al. =-=[17]-=- discussed probabilistic neighbor discovery with directional antennas. Later, Zeng et al. [19] extended the solution to multipacket reception networks. Birthday protocols support both symmetric and as... |

91 | Energy-efficient rate-adaptive gps-based positioning for smartphones. - Paek, Kim, et al. - 2010 |

77 | Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications
- Dutta, Culler
- 2008
(Show Context)
Citation Context ...scovery protocol. We consider asynchronous deterministic neighbor discovery, aiming at high energy efficiency as well as low discovery latency. Most existing neighbor discovery protocols (e.g., Disco =-=[6]-=-, U-Connect [9]) cannot realize the optimal worst-case latency provided in [20]. Furthermore, although Searchlight [1] is approximate to the optimum as in [20] with symmetric IEEE INFOCOM 2014 - IEEE ... |

64 |
Cyclic Difference Sets,
- Baumert
- 1971
(Show Context)
Citation Context ...ed in [20]. We also propose a novel class of active-sleep patterns called Diff-Codes, and analyze its theoretical performance. The construction of DiffCodes takes advantage of perfect difference sets =-=[2]-=-, [15], and guarantees optimality when the Diff-Code is extended from a perfect difference set. Last, for comprehensiveness, we provide a heuristic algorithm for seeking the Diff-Code with a target du... |

58 | Quorum-based asynchronous power-saving protocols for
- Jiang, Tseng, et al.
- 2005
(Show Context)
Citation Context ...j + 1]. $FWLYH $FWLYH %HDFRQ%HDFRQ $FWLYH %HDFRQ įį į Fig. 4. Two Aligned Active Slots Cover a Range of Slot Offsets Furthermore, when random slot offset is considered, works on quorum-systems (e.g., =-=[8]-=-) focus on such feasibility that a pattern should suffice the condition in Corollary 1 for any integer i. However, when active slots are overflowed, the constraint for a feasible pattern can be relaxe... |

39 |
U-Connect: A Low-Latency Energy-Efficient Asynchronous Neighbor Discovery Protocol
- Kandhalu, Lakshmanan, et al.
- 2010
(Show Context)
Citation Context ...l. We consider asynchronous deterministic neighbor discovery, aiming at high energy efficiency as well as low discovery latency. Most existing neighbor discovery protocols (e.g., Disco [6], U-Connect =-=[9]-=-) cannot realize the optimal worst-case latency provided in [20]. Furthermore, although Searchlight [1] is approximate to the optimum as in [20] with symmetric IEEE INFOCOM 2014 - IEEE Conference on C... |

29 | Manjeshwar.Energy-efficient link assessment in wireless sensor networks.In - Keshavarzian, Uysal-Biyikoglu, et al. - 2004 |

18 |
Searchlight: Won’t you be my neighbor
- Bakht, Trower, et al.
- 2012
(Show Context)
Citation Context ...as low discovery latency. Most existing neighbor discovery protocols (e.g., Disco [6], U-Connect [9]) cannot realize the optimal worst-case latency provided in [20]. Furthermore, although Searchlight =-=[1]-=- is approximate to the optimum as in [20] with symmetric IEEE INFOCOM 2014 - IEEE Conference on Computer Communications 978-14799-3360-0/14/$31.00 ©2014 IEEE 1689 duty cycle, its performance in the as... |

16 |
Neighbor discovery with reception status feedback to transmitters,” in
- Khalili, Goeckel, et al.
- 2010
(Show Context)
Citation Context ...varzian and Uysal-Biyikoglu [10] proposed a random protocol for link assessment. Vasudevan et al. [18] reduced the probabilistic algorithm for neighbor discovery to the Coupon Collector’s Problem. In =-=[11]-=-, Khalili et al. further realized the mechanism of channel status detection, and designed algorithms providing feedback of reception. Additionally, Vasudevan et al. [17] discussed probabilistic neighb... |

16 | Heterogenous Quorum-Based Wake-Up Scheduling in Wireless Sensor Networks
- Lai, Ravindran, et al.
- 2010
(Show Context)
Citation Context ...metric case. Whereas we prove that the bound in [20] can be further lowered. Besides, our designs fit for both symmetric and asymmetric cases with low complexity. In a class of quorum-based protocols =-=[12]-=-, [16], a cycle contains m2 consecutive slots, where m is a global parameter. A node is either awake or sleeping in a slot. Both transmitting and listening happen during awake slots, so that two neigh... |

14 |
Neighbor discovery in wireless networks with multipacket reception,‖ in
- Zeng, Chen, et al.
- 2011
(Show Context)
Citation Context ...status detection, and designed algorithms providing feedback of reception. Additionally, Vasudevan et al. [17] discussed probabilistic neighbor discovery with directional antennas. Later, Zeng et al. =-=[19]-=- extended the solution to multipacket reception networks. Birthday protocols support both symmetric and asymmetric cases, and have satisfying median case performance. However, because of the lack of w... |

13 | Constructions for Optimal Constant Weight Cyclically Permutable Codes and Difference Families
- BITAN, ETZION
- 1995
(Show Context)
Citation Context ...B. Deterministic Protocols A deterministic protocol establishes a pattern scheduling the periodical operations of each node. A code-based protocol is presented in [10] utilizing constant-weight codes =-=[3]-=-, [5], but it assumes synchronization among nodes. Moreover, Zheng et al. [20] applied optimal block designs in the case of symmetric duty cycle. The authors concluded that their approach reduces to a... |

2 | On simple difference sets,” Sankhyā: The Indian - Evans, Mann - 1951 |