Fig 2 - available via license: Creative Commons Attribution 4.0 International
Content may be subject to copyright.
Sample of network ontology Summarizing without full FSCS can also cause misleading discovery query routing. Consider < = ( ] ) = Wo 9,r , 1 ≤ s ≤ 4Y. Also, consider 4 data streams (% , (% . , (% { , and (% ˆ , where 0 12 ‰ = 8( 9 : ) Š ): , 0 12 ‹ = 8( 9 : ) a ): , 0 12 OE = 8( 9 : ) > ):, and 0 12 • = 8( 9 : ) Ž ):. The code for attribute values ) Š , ) a , ) > , and ) Ž in I a 80; < = 2>2
Source publication
In this paper, we consider the IoT data discovery data objects to specific nodes in the network. They are very problem in very large and growing scale networks. Specifically, we investigate in depth the routing table summarization techniques to support effective and space-efficient IoT data discovery routing. Novel summarization algorithms, includi...
Context in source publication
Context 1
... let ") denote the "coverage threshold", 0 ≤ ") ≤ 1. For a given st-children code set < = ( ] ), if HI J only has entries that match the codes in < = ( ] ), we still summarize them to the corresponding st-parent code o 9 ] as long as ≥ ") × | < = ( ] )|. : are o 9, , o 9,. , o 9,{ , and o 9,• , respectively. Consider the network topology in Fig. 2. Assume that nodes & , & . , & { , and & ˆ host (% , (% . , (% { , and (% ˆ , respectively. & , & . and & { send the descriptors of (% , (% . and (% { to & • . HI J • , thus, will have 8 9 : o 9, : , 8 9 : o 9,. : and 8 9 : o 9,{ :. Assume that the coverage threshold ") is set to 0.7. which is converted into 8 9 : o 9,• : , misleading ...
