<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Investigating the scope of a thing in a multiple Internet of Things scenario</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Francesco Cauteruccio</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Luca Cinelli</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giorgio Terracina</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Domenico Ursino</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Luca Virgili</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>DEMACS, University of Calabria</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>DII, Polytechnic University of Marche</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper, we investigate the scope of a thing in a multiple IoT scenario. First we introduce the concept of scope in general, and we illustrate how it has been investigated and applied in social networking. Then, we de ne the scope of a thing in a Multi-IoT scenario, modeled as an extension of a Social Internetworking System, and we propose a formalization of scope allowing the computation of its values. Finally, we present a possible application of scope and describe some tests that we performed for evaluation purposes.</p>
      </abstract>
      <kwd-group>
        <kwd>Scope</kwd>
        <kwd>Social Object</kwd>
        <kwd>Internet of Things</kwd>
        <kwd>Multiple IoTs</kwd>
        <kwd>Trust Degree</kwd>
        <kwd>Neighborhood of a Thing</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        In the Concise Oxford Dictionary [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], scope is de ned as \the extent of the area
or subject matter that something deals with or to which it is relevant". Scope has
certainly some similitudes with several other concepts investigated in sociology,
such as in uence, power, centrality, impact, reliability, and so forth. However, it
goes beyond each of these terms and, at the same time, summarizes all of them
and is in uenced by each of them.
      </p>
      <p>
        In the past, scope has been studied in the context of social networks. For
instance, in [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], the authors investigate the scope of users and hashtags in Twitter,
whereas in [10, 13{15, 18, 19], the authors propose approaches to computing some
aspects of scope (e.g., in uence, trust, reliability) for users and/or hashtags. In
the meantime, the social network scenario has become increasingly complex and
we have passed from social networking to social internetworking [
        <xref ref-type="bibr" rid="ref17 ref7">17, 7</xref>
        ]. In this
last case, several social networks simultaneously coexist and cooperate through
speci c users, called bridges, who join more social networks.
      </p>
      <p>
        Parallel to the transition from social networking to social internetworking, in
the last few years, we are experiencing the presence of objects that are becoming
Copyright c 2019 for the individual papers by the papers authors. Copying
permitted for private and academic purposes. This volume is published and copyrighted by
its editors. SEBD 2019, June 16-19, 2019, Castiglione della Pescaia, Italy.
increasingly smart and social. This phenomenon is revolutionizing the Internet of
Things. As a proof of this, more and more authors are starting to study the
behavior of things, to talk about their pro les and their social interactions. In fact,
di erent architectures implementing these ideas are frequently proposed in the
current literature. Social Internet of Things (hereafter, SIoT [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]), Multiple IoT
Environment (hereafter, MIE [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]) and Multiple Internets of Things (hereafter,
MIoT [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]) are only three of the latest architectures with these characteristics.
In particular, MIoT is the latest of them and, therefore, takes into account the
most recent results obtained in the IoT research. A MIoT can be seen as a set of
Internets of Things interacting with each other through speci c objects, called
\cross objects", that belong to more IoTs. The MIoT paradigm represents the
extension of the ideas underlying social internetworking to the IoT.
      </p>
      <p>
        In spite of this enormous interest that increasingly numerous researchers are
posing on the IoT, to the best of our knowledge, no analysis about the scope of
a thing in a Multi-IoT, or at least in an IoT, scenario has been presented yet.
Certainly, several aspects someway related to the scope have been considered in
the IoT or, in limited cases, in the SIoT scenario. As an example, in [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], the
authors investigate information di usion in a narrowband IoT with the goal of
optimizing information ow at network level. In [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], the authors investigate the
adoption of context-aware information di usion to alert messages in 5G mobile
social networks. Context-aware information is collected from di erent devices
deployed in the environment. An interesting approach to content dissemination
in the Internet of Vehicles (IoV) is described in [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. Here, the authors analyze
how to combine the information coming from the physical layer with the one
regarding the social layer to perform a rapid content dissemination in IoV
networks. In [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], the authors present an IoT application in the context of smart
cities, a scenario in which an IoT system can reach large scale dimensions. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]
also introduces the concept of IoT hub. This aggregates the information coming
from related devices and, therefore, contributes to improve the interoperability
between things in a urban-scale IoT system. Furthermore, di erent approaches
on recommender systems and services in IoT have been proposed in the
literature; an overview of them is presented in [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In particular, in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], the authors
propose a multi-agent recommender system for the IoT aiming at producing
a set of signi cant suggestions for a user with speci c characteristics. Here,
things are represented through bit vectors, called thing descriptors, managed
by cyber-agents. Things can be linked together and, then, can be managed by
neighbor cyber-agents. In [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], the authors propose an approach that integrates
the concept of social networks of users and Internet of Things. It merges
information coming from social networks of users and correlation networks of things
by learning shared latent factors. To perform this task, it exploits a technique
for probabilistic matrix factorization.
      </p>
      <p>All the approaches mentioned above are extremely interesting; furthermore,
several other related approaches proposed in the past to evaluate the relevance
or the impact of a node in the Internet of Things could be mentioned. However,
none of them has been conceived to operate in a complex scenario consisting of
multiple IoTs, which interact with each other through smart and social objects
that simultaneously belong to more of them and act as \bridges".</p>
      <p>In this paper, we aim at providing a contribution in this setting by proposing
an approach to computing the scope of a thing in a MIoT. Speci cally, after
having provided an overview on the MIoT paradigm (Section 2), we present a
de nition of scope along with a formalization allowing the computation of the
corresponding values (Section 3). Then, we illustrate an application of scope in
the context of smart cities, where it can play a key role (Section 4). Thereafter, we
present some tests conceived to understand its main features (Section 5). Finally,
we draw our conclusions and have a look at some possible future developments
of our ideas (Section 6).
2</p>
    </sec>
    <sec id="sec-2">
      <title>The MIoT paradigm</title>
      <p>
        In this section, we provide an overview of the MIoT paradigm, described in detail
in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. A MIoT M consists of a set of m Internets of Things. Formally speaking:
M = fI1; I2;
; Img
where Ik is an IoT.
      </p>
      <p>Let oj be an object of M. We assume that, if oj belongs to Ik, it has an
instance jk , representing it in Ik. The instance jk consists of a virtual view
(or, better, a virtual agent) representing oj in Ik. For example, it provides all
the other instances of Ik, and the users who interact with this IoT, with all
the necessary information about oj . Information stored in jk is represented
according to the format and the conventions adopted in Ik.</p>
      <p>A MIoT M can be also represented by means of a graph-based notation. In
particular, a graph Gk = hNk; Aki can be associated with an IoT Ik of M. In
this case:
{ Nk is the set of the nodes of Gk; there is a node njk for each instance jk 2 Ik,
and vice versa. Since there is a biunivocal correspondence between a node and
an instance, in the following we shall use these two terms interchangeably.
{ Ak is the set of the arcs of Gk; there is an arc ajqk = (njk ; nqk ) if there exists
a link from njk to nqk . A label can be associated with ajqk ; it stores the set
tranSetjqk of the transactions performed from jk to qk in the past.</p>
      <sec id="sec-2-1">
        <title>Finally:</title>
      </sec>
      <sec id="sec-2-2">
        <title>Here:</title>
        <p>M = hN; Ai
{ N = Sm</p>
        <p>k=1 Nk;
{ A = AI [ AC , where AI = Sm</p>
        <p>k=1 Ak and AC = f(njk ; njq )jnjk 2 Nk; njq 2
Nq; k 6= qg.</p>
        <p>AI is the set of the inner arcs (hereafter, i-arcs) of M; they link instances
(of di erent objects) belonging to the same IoT. AC is the set of the cross arcs
(hereafter, c-arcs) of M; they link instances of the same object belonging to
di erent IoTs. A node connected to at least one c-arc is called c-node; otherwise,
it is called i-node.</p>
        <p>
          In M, an object oj has associated a set M Dj of metadata. Our metadata
model refers to the one of the IPSO (Internet Protocol for Smart Objects)
Alliance [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. Speci cally M Dj consists of three subsets, namely: (i) M DjD, i.e., the
set of descriptive metadata; (ii) M DjT , i.e., the set of technical metadata; (iii)
M DjB, i.e., the set of behavioral metadata. All details about these metadata can
be found in [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ].
        </p>
        <p>Now, we can de ne the set tranSetjk of the transactions activated by jk in
Ik. Speci cally, let 1k ; 2k ; ; wk be all the instances belonging to Ik. Then:
tranSetjk =</p>
        <p>[
q=1::w;q6=j
tranSetjqk</p>
        <p>In other words, tranSetjk is given by the union of the sets of the transactions
from jk to all the other instances of Ik.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Scope de nition</title>
      <p>In this section, we present the de nition of the scope of an instance jk in an
IoT Ik and of the scope of an object oj in a MIoT. For this purpose, we must
introduce some preliminary concepts.</p>
      <p>The rst of them is the one of neighborhood of an instance jk in Ik.
Specifically, the neighborhood nbh( jk ) of jk is de ned as:</p>
      <p>nbhjk = out nbhjk [ in nbhjk
in nbhjk = fnqk j(nqk ; njk ) 2 AI ; jtranSetqjk j &gt; 0g</p>
      <p>In other words, nbhjk comprises those instances directly connected to jk
through an incoming or an outgoing arc, which shared at least one transaction
with jk . In the following of this paper, we are interested only to out nbhjk ; as
a consequence, when we will use the term \neighborhood", we will implicitly
mean \out neighborhood".</p>
      <p>Now, we need to introduce the neighborhood of level t of an instance jk in its
IoT Ik. It is an extension of the concept of out nbhjk and is de ned as follows:
where:
and
out nbhjk = fnqk j(njk ; nqk ) 2 AI ; jtranSetjqk j &gt; 0g</p>
      <p>out nbhtjk =
out nbhjk
f rk j rk 2 out nbhqk ; qk 2 out nbhtjk 1; rk 62 out nbhjwk ; 0
if t = 0
w &lt; tg if t &gt; 0</p>
      <p>The concept of out nbhtjk will be extremely important later. In the
meantime, we introduce a new concept, namely the one of minimum path jqk from
an instance jk to an instance qk 2 nbhtjk . jqk is de ned as the succession
f 0k ; 1k ; : : : ; tk g of instances such that 0k = jk , tk = qk , wk 2 out nbh(w 1)k
for 1 w t.</p>
      <p>After this, we must introduce the de nition of the Trust Degree T Dqjk of an
instance qk in the instance jk in Ik. It can be de ned as the fraction of the
transactions sent by jk to qk that have been requested by qk or that qk did
not request but it has considered so interesting to repost or to elaborate them3.
In order to formalize T Dqjk , we must introduce:
{ the set repostedqk of the transactions received by qk of Ik and reposted by
it;
{ the set elaboratedqk of the transactions received by qk whose contents it
elaborated for its purposes;
{ the set requestedqk of the transactions explicitly requested by qk .</p>
      <p>If qk belongs to out nbhjk , T Dqjk can be expressed as:</p>
      <p>T Dqjk = jtranSetjqk \ (requestedqk [ repostedqk [ elaboratedqk )j
jtranSetjqk j</p>
      <p>Starting from this de nition and from the concept of out nbhtjk , we can
proceed with the transitive closure of T Dqjk in such a way as to extend it to the case
in which qk is indirectly connected to jk . In particular, the general de nition
of T Dqjk is as follows:</p>
      <p>8 jtranSetjqk \(requestedqk [repostedqk [elaboratedqk )j if qk 2 out nbhjk
T Dqjk = &lt;&gt;&gt;&gt; Qtw=1 T D((w 1)w)kjtranSetjqk j
&gt;
:
if qk 2 out nbhtjk ; t &gt; 0;
jqk = f 0k ; 1k ; ; tk g</p>
      <p>The next step regards the de nition of the concept of Impact Degree IDjk
of an instance jk in Ik. It is de ned as the average of the Trust Degrees that all
the instances belonging to out nbhjk have in jk . It can be formalized as follows:
IDjk =</p>
      <p>P
qk 2out nbhjk T Dqjk</p>
      <p>jout nbhjk j</p>
      <p>We are now able to de ne the Scope Sctjk of level t of an instance jk of Ik.
Speci cally, Sctjk is de ned as the weighted sum of the Impact Degrees of the
3 Clearly, it might happen that an unrequested transaction of tranSetjqk is not
considered interesting by qk . In this case, qk neither posts nor elaborates it.
instances belonging to out nbhtjk , where the weights are the trust values that
these instances have in jk . This sum is then averaged by the number of the
instances belonging to nbhtjk . Formally speaking:</p>
      <p>Sctjk =</p>
      <p>P
qk 2out nbhtjk T Dqjk IDqk</p>
      <p>jout nbhtjk j</p>
      <p>Now, we can de ne the Scope Sctj of level t of an object oj in the MIoT. It is
obtained by averaging the Scope of level t of its instances in the corresponding
IoTs. Speci cally, let Instj = f j1 ; j2 ; ; jl g be the instances of oj in the IoTs
of the MIoT. Then:</p>
      <p>Sctj =</p>
      <p>P
jk 2Instj Sctjk</p>
      <p>jInstj j</p>
      <p>From the de nitions of T Dqjk , IDqjk , Sctjk and Sctj it emerges that each of
these parameters belongs to the real interval [0; 1].
4</p>
    </sec>
    <sec id="sec-4">
      <title>Applications</title>
      <p>In a scenario characterized by the pervasive di usion of increasingly intelligent
and social objects, our approach can have a large variety of applications. Two
very interesting ones regard smart cities and shopping centers. Due to space
limitations, we describe in detail only the rst one.</p>
      <p>Consider some public areas (such as parks, squares, shopping centers, etc.) in
a (smart) city, and assume that a set of people actively visits these areas. Each
area is equipped with several smart objects for monitoring weather, air quality,
tra c conditions, level of noise, etc., along with several actuators, such as smart
lamps or information hubs provided as online services. Each person may be
provided with several smart devices, such as smartwatches, smartphones, other
wearable devices, and so forth. Persons and places can interact with each other
through the corresponding smart objects.</p>
      <p>Such a scenario can be modeled through a MIoT M consisting of a set
fI1; I2; ; Img of IoTs, each representing a public area. The set of the objects
of M comprises the smart objects installed in the public areas and the set of
personal devices of people visiting them. If an object oj of the MIoT is active in
the kth public area, it has an instance jk in the IoT Ik. Clearly, when a person
with a smart object oj moves around di erent public areas corresponding to
di erent IoTs, oj will have di erent instances, one for each IoT.</p>
      <p>Each visitor of an area is generally interested to a certain kind of activity; for
instance, she could be a tness runner. The nal goal of the MIoT is supporting
people to get the best experience from their activities. In this setting, scope can
play a role in reaching this objective. In the following, we report some possible
usage scenarios.</p>
      <p>Assume that a person wants to go out for a run. First, she needs to choose the
best area for the run, based on weather conditions, tra c and other parameters
that she considers relevant. To carry out her choices, she can check data provided
by the sensors of each public area of her interest, the information hubs or other
trusted runners. The choice of the data sources to consult is usually related to
the corresponding trustworthiness and the easiness of getting desired information
from them. These two properties are clearly strictly correlated to the scope of the
source; indeed, this scope can be seen as a \summary" of these two parameters
and some other related ones, such as accuracy, reputation, impact, etc. Once the
person has performed her choice, she can send information to the MIoT in such
a way as to serve, in her turn, as information provider for the community.</p>
      <p>A similar activity ow may happen in several other circumstances, in which
there is a decision to made, e.g., when a user must choose the best shopping
center where she can buy a given object, the best cinema where she can see a
movie, etc.</p>
      <p>In all these cases, data regarding user choices can be coupled with those
registered during the activities she performed therein (e.g., data coming from
personal smart wears) in such a way as to con rm the correctness of the choice
or, on the contrary, to alert the other users of the evaluation errors. For instance,
imagine a scenario in which a person veri es that the weather was actually too
cold for the clothes she had selected; interestingly, this information could be
automatically detected and sent by the sensors in her smart wears. In this case,
the scope of the smart wears is useful to understand how extended and how
strong is its capability of in uencing the decision of the other users. In other
words, the scope of an object oj in this scenario determines how many users are
impacted by the data sent by it and how much strong this impact is.</p>
      <p>It is worth pointing out the relevance of scope in this context. As a matter
of fact, knowing the objects with the highest impact in the MIoT allows the
improvement of the e ciency and the e ectiveness of the information disseminated
through the network. At a higher abstraction level, some smart objects of the
MIoT could assume the role of reliable information hubs for the whole MIoT if
their scope is particularly strong and large over time.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Experiments</title>
      <p>In order to perform our experiments, since real MIoTs with the dimension and
the variety handled by our model do not exist yet, we constructed a MIoT
simulator. This tool starts from real data and returns simulated MIoTs with
certain characteristics speci ed by the user.</p>
      <p>The MIoTs created by our simulator follow the paradigm described in Section
2. Our simulator is also provided with a suitable interface allowing a user to
\personalize" the MIoT to build by specifying the desired values for several
parameters, such as the number of nodes, the maximum number of instances of
an object, and so forth.</p>
      <p>To make \concrete" and \plausible" the created MIoTs, our simulator
leverages a real dataset. It regards the taxi routes in the city of Porto from July 1st
2013 to June 30th 2014. It can be found at the address http://www.geolink.pt/
ecmlpkdd2015-challenge/dataset.html. Each route contains several Points of
Interests corresponding to the GPS coordinates of the vehicle.</p>
      <p>We partitioned the city of Porto in six areas and associated a real IoT with
each area. Our simulator associates an object with a given route recorded in
the dataset and an object instance with each partition of a route belonging to
an area. It creates a MIoT node for each instance and a c-arc for each pair
of instances belonging to the same route. Furthermore, it creates an i-arc
between two nodes of the same IoT if the length of the time interval between the
corresponding routes is less than a certain threshold tht. The value of tht can
be speci ed through the constructor interface. Clearly, the higher tht the more
connected the constructed MIoT.</p>
      <p>The MIoT for this experiment, which we constructed through our simulator,
consisted of 1256 nodes. This number of nodes is much higher than the ones
presently characterizing real MIoTs. However, we preferred to construct such
a large MIoT because we think that, with the enormous development of the
IoT, in the future there could exist MIoTs consisting of thousands of nodes. On
the other side, we did not adopt larger MIoTs because they required excessive
computation times without providing more knowledge on scope than the one we
could have acquired with a MIoT of about 1000 nodes. The six IoTs of the MIoT
had 128, 362, 224, 280, 98 and 164 nodes, respectively. The constructed MIoT is
returned in a format that can be directly processed by the cypher-shell of Neo4J.
The interested reader can nd the MIoT adopted in the experiments described
here at the address http://daisy.dii.univpm.it/miot/datasets/scope.</p>
      <p>We carried out all the tests presented in this section on a server equipped
with an Intel I7 Quad Core 7700 HQ processor and 16 GB of RAM with the
Ubuntu 16.04 operating system. To implement our approach we adopted:
{ Python, as programming language;
{ Neo4J (Version 3.4.5), as underlying DBMS.</p>
      <p>In these experiments, we aimed at investigating the trend of the scope against
the neighborhood level t. In particular, for each instance jk of the MIoT, we
computed Sctjk when t increases from 1 to the diameter of Ik. After this, we
grouped the instances of our MIoT in several ways (one for each test), based on
some speci c rationales, and we computed the variation of the average values of
the scope for each group.</p>
      <p>As a rst task of this activity, we computed the variation of the average
values of the scope for each IoT of the MIoT. This is equivalent to say that the
instances of the MIoT were grouped in the corresponding IoTs (one group for
each IoT). The obtained results are reported in Figure 1. From the analysis of
this gure, we can observe that, in each IoT, the scope decreases quite quickly.
Indeed, it is extremely high when t = 1 in all the IoTs. When t = 2, the scope
is high for the largest IoTs, whereas it has an intermediate value for the other
ones. In any case, the scope becomes very low when t is greater than or equal to
4 for small networks and when t is greater than or equal to 5 for the large ones.</p>
      <p>As a second task, we computed the variation of the average values of the
scope for the whole MIoT. This is equivalent to say that we had a unique group
comprising all the instances of the MIoT. The obtained results are reported
in Figure 2. From the analysis of this gure, we can conclude that the scope
presents a trend similar to the one of the largest IoTs of Figure 1. In particular,
it is very high for t = 1; it is high for t = 2; it has an intermediate value for
t = 3, whereas it is very low for t &gt; 5.</p>
      <p>As a nal task, we subdivided all the instances of the MIoT in two groups
containing i-nodes and c-nodes, respectively. Then, we computed the variation of
the average values of the scope for the two groups. The nal goal of this task was
to verify if i-nodes and c-nodes showed di erent behaviors as far as their scope
is concerned. The obtained results are reported in Figure 3. From the analysis
of this gure, we can observe that the scope decreases for both i-nodes and
cnodes. However, the trends are di erent. Indeed, the decrease is much smother
for i-nodes than for c-nodes. In particular, for c-nodes, the decrease is very steep
because the scope is less than 0.2 already for t = 3. This can be explained by
considering that, analogously to what was made in all the past approaches, our
de nition of neighborhood (which plays a key role in our de nition of scope)
considers as neighbors of a node only other nodes of the same IoT. In other
words, it takes only i-arcs into account. Actually, we believe (and the results of
Figure 3 represent a con rmation) that it is worthwhile to investigate the role
of c-arcs in the computation of the neighborhood of a node and we plan to make
this investigation in the future.</p>
      <p>As for the investigation of the values of the scope for objects, we observe
that they are obtained by averaging the values of the scope of the corresponding
instances. As a consequence, it does not make sense to perform the rst and the
nal tasks of the previous activity. The only task that makes sense is the second
one; in this case, the variation of the average values of the scope of objects for
the whole MIoT is reported in Figure 4. As we could have expected, this trend
is very similar (or, better almost identical) to the one of Figure 2.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>In this paper, we have seen that social internetworking and the Internet of Things
are becoming more and more contiguous and are giving rise to several social
and/or multiple IoTs paradigms. In this new scenario, we have introduced the
concept of scope of a thing in a MIoT, along with a formalization allowing the
computation of the corresponding values. Then we have illustrated one possible
application along with some experiments aiming at evaluating the variation of
scope against the value of the neighborhood level.</p>
      <p>This paper should not be considered as an ending point. Instead, it could
be the starting point of many researches in this eld. Indeed, there are several
future related investigations that could be made in this context. First, we would
like to analyze the role of possible constraints on network nodes or arcs in the
de nition of scope. Then, we plan to study the role of scope in the detection of
anomalies and, even more, for understanding the extension and the importance
of the damage caused by them. Finally, we would like to analyze the exploitation
of scope in predictive maintenance, that is currently one of the most important
research issues in the manufacturing industry.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. Concise Oxford Dictionary. https: // en. oxforddictionaries. com/ ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>IPSO</given-names>
            <surname>Alliance</surname>
          </string-name>
          . https: // www. ipso-alliance. org/ ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>G.</given-names>
            <surname>Araniti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Orsino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Militano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>A.</given-names>
            <surname>Iera</surname>
          </string-name>
          .
          <article-title>Context-aware information di usion for alerting messages in 5g mobile social networks</article-title>
          .
          <source>IEEE Internet of Things Journal</source>
          ,
          <volume>4</volume>
          (
          <issue>2</issue>
          ):
          <volume>427</volume>
          {
          <fpage>436</fpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>L.</given-names>
            <surname>Atzori</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Iera</surname>
          </string-name>
          , and
          <string-name>
            <surname>G. Morabito.</surname>
          </string-name>
          <article-title>SIoT: Giving a social structure to the Internet of Things</article-title>
          .
          <source>IEEE Communications Letters</source>
          ,
          <volume>15</volume>
          (
          <issue>11</issue>
          ):
          <volume>1193</volume>
          {
          <fpage>1195</fpage>
          ,
          <year>2011</year>
          . IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>G.</given-names>
            <surname>Baldassarre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Lo Giudice</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Musarella</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Ursino</surname>
          </string-name>
          .
          <article-title>A paradigm for the cooperation of objects belonging to di erent IoTs</article-title>
          .
          <source>In Proc. of the International Database Engineering &amp; Applications Symposium (IDEAS</source>
          <year>2018</year>
          ), pages
          <fpage>157</fpage>
          {
          <fpage>164</fpage>
          , Villa San Giovanni, Italy,
          <year>2018</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>G.</given-names>
            <surname>Baldassarre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Lo Giudice</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Musarella</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Ursino</surname>
          </string-name>
          .
          <article-title>The MIoT paradigm: main features and an \ad-hoc" crawler</article-title>
          .
          <source>Future Generation Computer Systems</source>
          ,
          <volume>92</volume>
          :
          <fpage>29</fpage>
          {
          <fpage>42</fpage>
          ,
          <year>2019</year>
          . Elsevier.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>F.</given-names>
            <surname>Buccafurri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.D.</given-names>
            <surname>Foti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Lax</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nocera</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Ursino</surname>
          </string-name>
          .
          <article-title>Bridge Analysis in a Social Internetworking Scenario</article-title>
          .
          <source>Information Sciences</source>
          ,
          <volume>224</volume>
          :1{
          <fpage>18</fpage>
          ,
          <year>2013</year>
          . Elsevier.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>A.</given-names>
            <surname>Felfernig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Polat-Erdeniz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Uran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Reiterer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Atas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.N.T.</given-names>
            <surname>Tran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Azzoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Kiraly</surname>
          </string-name>
          , and
          <string-name>
            <surname>Dolui</surname>
            <given-names>K.</given-names>
          </string-name>
          <article-title>An overview of recommender systems in the internet of things</article-title>
          .
          <source>Journal of Intelligent Information Systems</source>
          , pages
          <fpage>1</fpage>
          {
          <fpage>25</fpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>A.</given-names>
            <surname>Forestiero</surname>
          </string-name>
          <article-title>. Multi-agent recommendation system in internet of things</article-title>
          .
          <source>In Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing</source>
          ,
          <string-name>
            <surname>CCGRID</surname>
          </string-name>
          <year>2017</year>
          , Madrid, Spain, May
          <volume>14</volume>
          -17,
          <year>2017</year>
          , pages
          <fpage>772</fpage>
          {
          <fpage>775</fpage>
          . IEEE Computer Society / ACM,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>D.</given-names>
            <surname>Kempe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kleinberg</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Tardos</surname>
          </string-name>
          .
          <article-title>Maximizing the spread of in uence through a social network</article-title>
          .
          <source>In Proc. of the International ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD</source>
          <year>2003</year>
          ), pages
          <fpage>137</fpage>
          {
          <fpage>146</fpage>
          , Washington, DC, USA,
          <year>2003</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>R.</given-names>
            <surname>Lea</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Blackstock</surname>
          </string-name>
          .
          <article-title>Smart cities: an iot-centric approach</article-title>
          .
          <source>In Proceedings of the 2014 International Workshop on Web Intelligence and Smart Sensing</source>
          , IWWISS '14,
          <string-name>
            <surname>Saint</surname>
            <given-names>Etienne</given-names>
          </string-name>
          , France, September 1-
          <issue>2</issue>
          ,
          <year>2014</year>
          , pages
          <fpage>12</fpage>
          :
          <article-title>1{12:2</article-title>
          . ACM,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>D.</given-names>
            <surname>Leggio</surname>
          </string-name>
          , G. Marra, and
          <string-name>
            <given-names>D.</given-names>
            <surname>Ursino</surname>
          </string-name>
          .
          <article-title>De ning and investigating the scope of users and hashtags in Twitter</article-title>
          .
          <source>In Proc. of the International Conference on Ontologies, DataBases, and Applications of Semantics (ODBASE</source>
          <year>2014</year>
          ), pages
          <fpage>674</fpage>
          {
          <fpage>681</fpage>
          ,
          <string-name>
            <surname>Amantea</surname>
          </string-name>
          (CS),
          <source>Italy, 2014. Lecture Notes in Computer Science</source>
          . Springer.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sun</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Cong</surname>
          </string-name>
          . Will this #Hashtag be Popular Tomorrow?
          <source>In Proc. of the ACM SIGIR International Conference on Research and Development in Information Retrieval (SIGIR</source>
          <year>2012</year>
          ), pages
          <fpage>1173</fpage>
          {
          <fpage>1174</fpage>
          ,
          <string-name>
            <surname>Portland</surname>
            ,
            <given-names>OR</given-names>
          </string-name>
          , USA,
          <year>2012</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sun</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Cong</surname>
          </string-name>
          .
          <article-title>On Predicting the Popularity of Newly Emerging Hashtags in Twitter</article-title>
          .
          <source>Journal of the Association for Information Science and Technology</source>
          ,
          <volume>64</volume>
          (
          <issue>7</issue>
          ):
          <volume>1399</volume>
          {
          <fpage>1410</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>Z.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Dickinson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Deitrick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A. H.</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <article-title>Twitter Spammer Detection Using Data Stream Clustering</article-title>
          .
          <source>Information Sciences</source>
          ,
          <volume>260</volume>
          :
          <fpage>64</fpage>
          {
          <fpage>73</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Kong</surname>
          </string-name>
          , and
          <string-name>
            <given-names>W.</given-names>
            <surname>Hou</surname>
          </string-name>
          .
          <article-title>A social-aware group formation framework for information di usion in narrowband internet of things</article-title>
          .
          <source>IEEE Internet of Things Journal</source>
          ,
          <volume>5</volume>
          (
          <issue>3</issue>
          ):
          <volume>1527</volume>
          {
          <fpage>1538</fpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Okada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Masui</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kadobayashi</surname>
          </string-name>
          .
          <article-title>Proposal of Social Internetworking</article-title>
          .
          <source>In Proc. of the International Human.Society@Internet Conference (HSI</source>
          <year>2005</year>
          ), pages
          <fpage>114</fpage>
          {
          <fpage>124</fpage>
          ,
          <string-name>
            <surname>Asakusa</surname>
          </string-name>
          , Tokyo, Japan,
          <source>2005. Lecture Notes in Computer Science</source>
          , Springer.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>D.M. Romero</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Galuba</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Asur</surname>
            , and
            <given-names>B.A.</given-names>
          </string-name>
          <string-name>
            <surname>Huberman</surname>
          </string-name>
          .
          <article-title>In uence and passivity in social media</article-title>
          .
          <source>In Proc. of the International Conference on World Wide Web (WWW'11)</source>
          , pages
          <fpage>113</fpage>
          {
          <fpage>114</fpage>
          ,
          <string-name>
            <surname>Hyderabad</surname>
          </string-name>
          , India,
          <year>2011</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>J. Weng</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Lim</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Jiang</surname>
            , and
            <given-names>Q.</given-names>
          </string-name>
          <string-name>
            <surname>He</surname>
          </string-name>
          .
          <article-title>TwitterRank: Finding Topic-sensitive In uential Twitterers</article-title>
          .
          <source>In Proc. of the ACM International Conference on Web Search and Data Mining (WSDM</source>
          <year>2010</year>
          ), pages
          <fpage>261</fpage>
          {
          <fpage>270</fpage>
          , New York, NY, USA,
          <year>2010</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20. L.
          <string-name>
            <surname>Yao</surname>
            ,
            <given-names>Q. Z.</given-names>
          </string-name>
          <string-name>
            <surname>Sheng</surname>
            ,
            <given-names>A. H. H.</given-names>
          </string-name>
          <string-name>
            <surname>Ngu</surname>
            , and
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
          </string-name>
          .
          <article-title>Things of interest recommendation by leveraging heterogeneous relations in the internet of things</article-title>
          .
          <source>ACM Transaction on Internet Technology</source>
          ,
          <volume>16</volume>
          (
          <issue>2</issue>
          ):9:
          <issue>1</issue>
          {9:
          <fpage>25</fpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , S. Mumtaz, and
          <string-name>
            <given-names>J.</given-names>
            <surname>Rodriguez</surname>
          </string-name>
          .
          <article-title>Social bigdata-based content dissemination in internet of vehicles</article-title>
          .
          <source>IEEE Transaction on Industrial Informatics</source>
          ,
          <volume>14</volume>
          (
          <issue>2</issue>
          ):
          <volume>768</volume>
          {
          <fpage>777</fpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>