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...

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...

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...

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...

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...

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-...

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...

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 ...

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...

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...

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...

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...

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...

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...

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...

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...