KR101470889B1 - Mobile apparatus, method of networking using the same and network system having the same - Google Patents

Abstract

The mobile device constructs a local community with neighboring nodes, tries to activate the pseudo-activation for the node added to the local community, and counts the number of nodes that succeeded in activating the pseudo-activation to determine the influence.

Description

TECHNICAL FIELD [0001] The present invention relates to a mobile device, a networking method using the same, and a network system including the same. BACKGROUND OF THE INVENTION [0002]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a mobile device, and more particularly, to a mobile device capable of determining an influence in a network, a networking method using the same, and a network system including the same.

Recently, research on the spread of influence in the network is under way. The effect is that the state or nature of a node changes with new data, and the affected node affects other nodes interacting with it, and such influence spreads continuously and spreads in the network.

In order to maximize the influence within the network, it is important to find an initial node set in which data is initially transmitted. For example, when the number of nodes to which data is transmitted is limited, or when it is necessary to propagate data as quickly as possible, it is important to select a node having a large influence in the network.

In recent years, not only conventional wired network but also mobile mobile network with mobility have been developed steadily. In a wireless mobile network where nodes and nodes are not guaranteed to be always connected through a wired network, the message propagation time can be unpredictably long. If the influence of each node can be accurately understood, when there is a message to be sent to another node by an arbitrary node, the node transmits the message to a node having a higher influence than the node, have.

However, since the influence measurement on an arbitrary node must be measured based on the entire network information, it can be a very difficult problem in a situation where each node can not know the entire network configuration.

In order to solve the above problems, an object of the present invention is to provide a mobile device which can relatively easily determine the influence using a local community.

It is another object of the present invention to provide a networking method using the mobile device.

It is still another object of the present invention to provide a network system including the mobile device.

According to an aspect of the present invention, there is provided a mobile device configured to establish a local community with neighboring nodes, to try to activate a node for a node added to the local community, Count the number and determine the influence.

In one embodiment of the present invention, when the mobile device contacts a first node, the mobile device may receive a Familiar set of the first node from the first node. And add the first node to the local community of the mobile device when the local community of the mobile device has more than X common nodes with the Familiar set of the first node.

일 수 있다.In one embodiment of the invention, the mobile device is i, the first node contacting the mobile device (i) is j, and the highest cumulative contact time among the nodes that have contacted the mobile device (i) is cdmax i) a probability that the mobile device i will attempt to activate the pseudo activation to the first node (j) when the cumulative contact time of the mobile device (i) and the first node (j) is cdij, (p (i, j)

Lt; / RTI >

In one embodiment of the present invention, when the first node (j) terminates contact with the mobile device (i), based on the cumulative contact time of the mobile device (i) and the first node (j) The pseudo activation success probability p (i, j) may be updated. The first node j may be added to the Familiar set of the mobile device i when the pseudo activation success probability p (i, j) is greater than or equal to the threshold value r.

In an embodiment of the invention, the first node j is added to the Familiar set of the mobile device i, and the first node j is present in the local community of the mobile device i. (J) to the local community of the mobile device (i) when the first node

In one embodiment of the present invention, when the pseudo activation success probability p (i, j) is smaller than the threshold value r and the first node j is in the Familiar set, the first node j ) From the Familiar set.

In one embodiment of the present invention, even if the first node j is deleted from the Familiar set, the local community may maintain the first node j.

In an embodiment of the invention, when a first node is added to the local community of the mobile device, it may determine whether to add a second node in the local community of the first node to the local community of the mobile device have.

In one embodiment of the present invention, the mobile device receives an estimated Familiar set of the second node from the first node, and the local community of the mobile device receives the estimated Familiar set of the second node and X or more When having a common node, the second node may be added to the local community of the mobile device.

According to another aspect of the present invention, there is provided a networking method comprising: configuring a local community of neighboring nodes and a mobile device; attempting to activate a node for a node added to the local community; And counting the number of successfully activated nodes to determine the influence.

In one embodiment of the present invention, configuring a local community of the mobile device comprises: when the mobile device contacts a first node, the mobile device receives a Familiar set of the first node from the first node And adding the first node to the local community of the mobile device when the local community of the mobile device has more than X common nodes with the Familiar set of the first node.

일 수 있다.In one embodiment of the invention, the mobile device is i, the first node contacting the mobile device (i) is j, and the highest cumulative contact time among the nodes that have contacted the mobile device (i) is cdmax i) a probability that the mobile device i will attempt to activate the pseudo activation to the first node (j) when the cumulative contact time of the mobile device (i) and the first node (j) is cdij, (p (i, j)

Lt; / RTI >

In one embodiment of the present invention, the networking method further comprises the step of, when the first node (j) terminates contact with the mobile device (i), the cumulative contact of the mobile device (i) Updating the pseudo activation success probability (p (i, j)) based on a time when the pseudo activation success probability p (i, j) is greater than or equal to a threshold value r; j) to the Familiar set of the mobile device (i).

According to another aspect of the present invention, there is provided a network system for establishing a local community with neighbors, attempting to activate a node for a node added to the local community, And a second mobile device for communicating with the first mobile device and determining a second influence independent of the first mobile device.

The mobile device, the networking method, and the network system according to an embodiment of the present invention may constitute a local community, and may easily determine influence by attempting activation of a node added to the local community. Therefore, the propagation range of the data and the propagation speed of the data can be increased.

1 is a block diagram showing an influence propagation model in a network system according to an embodiment of the present invention.
2 is a block diagram illustrating a method of attempting pseudo activation to a neighbor node newly added to a local community in a network system according to an embodiment of the present invention.
3 is a block diagram illustrating a method for adding a neighboring node to a local community in a network system according to an embodiment of the present invention.
4 is a block diagram illustrating a method for adding nodes to a first local community in a second local community of a neighbor node added to a first local community in a network system according to an embodiment of the present invention;
5 is a block diagram illustrating a mobile device in accordance with one embodiment of the present invention.

For the embodiments of the invention disclosed herein, specific structural and functional descriptions are set forth for the purpose of describing an embodiment of the invention only, and it is to be understood that the embodiments of the invention may be practiced in various forms, The present invention should not be construed as limited to the embodiments described in Figs.

The present invention is capable of various modifications and various forms, and specific embodiments are illustrated in the drawings and described in detail in the text. It should be understood, however, that the invention is not intended to be limited to the particular forms disclosed, but includes all modifications, equivalents, and alternatives falling within the spirit and scope of the invention. Similar reference numerals have been used for the components in describing each drawing.

The terms first, second, etc. may be used to describe various components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from another. For example, without departing from the scope of the present invention, the first component may be referred to as a second component, and similarly, the second component may also be referred to as a first component.

It is to be understood that when an element is referred to as being "connected" or "connected" to another element, it may be directly connected or connected to the other element, . On the other hand, when an element is referred to as being "directly connected" or "directly connected" to another element, it should be understood that there are no other elements in between. Other expressions that describe the relationship between components, such as "between" and "between" or "neighboring to" and "directly adjacent to" should be interpreted as well.

The terminology used in this application is used only to describe a specific embodiment and is not intended to limit the invention. The singular expressions include plural expressions unless the context clearly dictates otherwise. In the present application, the terms "comprise", "having", and the like are intended to specify the presence of stated features, integers, steps, operations, elements, components, or combinations thereof, , Steps, operations, components, parts, or combinations thereof, as a matter of principle.

Unless defined otherwise, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. Terms such as those defined in commonly used dictionaries are to be interpreted as having a meaning consistent with the contextual meaning of the related art and are to be interpreted as either ideal or overly formal in the sense of the present application Do not.

Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings. The same reference numerals are used for the same constituent elements in the drawings and redundant explanations for the same constituent elements are omitted.

1 is a block diagram showing an influence propagation model in a network system according to an embodiment of the present invention.

Referring to FIG. 1, a network system includes a plurality of nodes. For example, the network system may be a wire / wireless communication system. The node may be a mobile device.

For example, the network system may be a Delay Tolerant Network in which the network phase is dynamically changed due to a plurality of nodes having mobility. Assuming that the maximum communication range of any node is a, node va is able to deliver a message to a node at distance d <= a.

At this time, it can be assumed that there is no collision between messages, and that each message can be delivered successfully at one time. When the distance between node va and node vb approaches, and va receives a message broadcasted by node vb, it is judged that node va and node vb contact with each other.

In addition, when node va is within the communication range of node vb, node va receives periodically the message sent by node vb and if node a does not receive a predetermined number of messages (for example, 3 times), node va It is determined that the node vb leaves.

If the time at which another node contacts an arbitrary node is ta and the time at which the contact node has left is tb, the contact duration is tb-ta. Also, cdij means the total cumulative contact time at which node vi contacts node vj. The node vi accumulates and records the contact time from the time of contact with the node vj to the time of leaving the node vj to cdij every time the contact and departure occur repeatedly.

1 illustrates an influence propagation model of a network according to the present embodiment. For example, the influence propagation model may be an independent cascade influence propagation model.

The influence propagation model expresses a diffusion pattern by defining a probability that data is spread to each link to which a node and a node are connected. In the influence propagation model, each node has two states, an active state and an inactive state. The inactive node means a node that is not activated from the active node. The influence propagation model starts diffusing from the initial active node, and the active node can activate another inactive node. While it is possible to switch from inactive to active, conversely, it is not possible to switch from active to inactive.

The active node vi may try to activate at a probability of p (i, j) for a node vj inactive at time t, and when the activation is successful, the node vj is activated at time t + 1. Once a node fails to activate, it can not be re-activated. This process is repeated until no more influence spreading occurs in the network.

In FIG. 1, a hatched node means an active state, and a white node means an inactive state. As a result of activating from node 1 in active state at time t to node 2 - 5 in contact with node 1, activation is successful for nodes 2 and 3 at time t + 1, activation for nodes 4 and 5 Indicating failure. At time t + 2, nodes 2 and 3 perform an activation attempt on nodes 4 and 5, which contact nodes 2 and 3, respectively, although not shown.

The probability (p (i, j)) that node vi succeeds in attempting to activate node vj is defined as in Equation 1 below.

[Equation 1]

Here, cdmax (i) denotes the highest cumulative contact time among the nodes that have contacted the node vi, and cdij denotes the cumulative contact time of the node vi and the node vj. If we record a lot of contact time with node vi and node vj, p (i, j) will be higher and the activation success rate for node vj at node vi becomes higher.

Each node in the network system can configure its own local community. Each of the nodes can determine the influence of the node using the local community. Each of the nodes independently configures the local community and determines the influence of the node.

For example, the manner in which the node constructs the local community may be a k-clique distributed algorithm. The k-clique community structure has a strict formation criterion and high cohesiveness among nodes in the community. It can be expected that the nodes in the community will be in much contact with each other, thereby maximizing the influence within the community. On the other hand, contact with nodes outside the community is small and it is difficult to exert influence. Due to this characteristic, the influence of each node can be measured using the k-clique community, and the influence of the whole network can be determined.

Symbols used in this network system are shown in Table 1 below.

sign Explanation Fi Familiar Set of node vi fij Estimated Familiar Set for neighbor node vj of node vi r Threshold of Familiar Set k Size of Clique Ci Local community of node vi Pij A set that holds the estimated Familiar Set of each node vn in the local community Cj of the neighbor node vj of the node vi as an element Nci The number of nodes that node vi can physically activate within its local community

Assuming that each node keeps the nodes that have the most contact with itself based on the cumulative contact time as a Familiar Set, and when the probability p (i, j) that node vi activates node vj is greater than r, Include node vj in its Familiar Set Fi.

On the other hand, when an arbitrary node vi makes contact with another node vj, the node vi receives a Familiar Set fij of the node vj. Although the node vj can accurately grasp its own Familiar Set, the Familiar Set of the node vj received by the node vi is different from the Familiar Set of the node vj since the variation of the Familiar Set of the node vj is not reflected have. Therefore, the familar set of the node vj received by the node vi is called an estimated Familiar Set.

Further, the node vi may further receive, from the node vj, Pij, which is an aggregate having a Familiar Set of each node belonging to the local community Cj of the node vj as an element. A Familiar Set of each node belonging to the local community Cj of the node vj received by the node vi is also referred to as an estimated Familiar Set for the same reason as described above.

k denotes the size of clique which is a basic unit constituting the local community, and each node can have the same k value.

2 is a block diagram illustrating a method of attempting pseudo activation to a neighbor node newly added to a local community in a network system according to an embodiment of the present invention.

Referring to Figures 1 and 2, any node vi will attempt pseudo-activation whenever it adds a new node vj to its local community Ci. The physician activation follows the Independent Cascade model described with reference to FIG. For the node vj added to the local community Ci of the node vi, nodes in the active state among the respective neighbor nodes of the node vj try to activate the node vj. Each node is recording a pseudo activation attempt for another node and can not try pseudo activation again for the node that tried to activate the pseudo-activation.

For example, in FIG. 2, nodes vl and vm adjacent to the vj among the active nodes in the local community Ci of the node vi may try to pseudo-activate the node vj. The node vl attempts pseudo activation to the node vj with a probability of p (l, j), and the node vm tries to activate the node vj with probability of p (m, j).

If the node vi finds that the pseudo activation for the node vj is successful, it updates its Nci. Pseudo-activation, which is a pseudo activation procedure for the node vj newly added to the community Ci of the node vi, is defined as shown in Table 2 below.

Pseudo-Activation (vj)
1. Node vl, which is active among the neighbor nodes of node vj, tries to activate the node vj with probability of p (l, j). Node vm, which is active among the neighbor nodes of node vj, tries to activate the node vj with probability of p (m, j).
2. Node vj notifies node vi whether activation is successful.
3. When node vj finds that the doctor is active, vi updates Nci. (Nci = Nci + 1)

In FIG. 2, neighbor nodes activated for the node vj newly added to the local community Ci of the node vi succeed in attempting to activate the pseudo-node. In FIG. 2, a hatched node means an active state, and a white node means an inactive state.

The method of maintaining the Fi, which is the Familiar Set, and Ci, the local community, is explained below. The node vi may perform the initialization procedure as shown in Table 3 when participating in the network.

Procedure 0
Ci = {vi}, Fi = {}, Pi = {}

3 is a block diagram illustrating a method for adding a neighboring node to a local community in a network system according to an embodiment of the present invention.

Referring to Figures 1 to 3, when the node vi contacts another node vj, the node vi determines whether to add the node to its local community Ci. When the local community Ci of the node vi has more than X common nodes with the Familiar set of the node vj, it may add the node vj to the local community Ci of the node vi. For example, X may be k-1 minus one in the number of clique.

When the node vj is added to the local community Ci, the node vi attempts pseudo activation for the node vj. The operation of the node vi is shown in Table 4 below.

),
2-1. 국지적 커뮤니티 Ci와 노드 vi가 수신한 노드 vj의 Familiar Set fij가 공통으로 최소 k-1개의 노드를 공유(

)하고 있다면 노드 vj를 국지적 커뮤니티 Ci에 추가한다.
2-2. 노드 vj가 국지적 커뮤니티 Ci에 추가된 경우, 노드 vj에 대해 Pseudo-Activation(vj)을 수행한다.
2-3. Procedure 3을 수행한다.Procedure 1
For the contact node vj
1. Obtain fij and Pij information of node vj.
2. If node vj does not exist in the local community Ci of node vi

),
2-1. The local community Ci and the Familiar Set fij of node vj received by node vi share at least k-1 nodes in common

), Add node vj to the local community Ci.
2-2. When node vj is added to local community Ci, it performs pseudo-activation (vj) on node vj.
2-3. Perform Procedure 3.

When the node vj is added to the local community Ci of the node vi, the node vi can further determine whether to add the nodes in the local community Cj of the node vj to the local community Ci of the node vi 3). However, this step is not essential and may be omitted. If Procedure 3 is omitted, the node vi may not receive the information of Pij from the vj.

In FIG. 3, it is assumed that the number of clique k = 3. The local community Ci of the node vi and the Familiar Set Fj (or an Estimated Familiar Set fij) of the node vj in contact with the node vi share two (k-1) nodes with each other. Thus, the node vi adds the node vj to the local community Ci of the node vi.

When the community of the node vi is updated, the node vi performs pseudo activation for the added node. If the pseudo activation is successful, the node vi counts the number of pseudo activation success nodes.

Furthermore, the node vi may further perform Procedure 3 to determine whether to add the nodes in the local community Cj of the node vj to the local community Ci of the node vi.

Even when the node vj is not added to the local community Ci of the vi by the procedure 1 when the node vi is in contact with the other node vj, at the time when the node vj leaves the node vi due to the current contact situation, Node vj to the local community Ci. The operation of this node vi is shown in Table 5.

) 노드 vj를 노드 vi의 국지적 커뮤니티 Ci에 추가한다.
3-3. 노드 vj가 국지적 커뮤니티 Ci에 추가된 경우, 노드 vj에 대해 Pseudo-Activation(vj)을 수행한다.
3-4. Procedure 3을 수행한다.
4. 만약 p(i,j)<r이면, 노드 vi는 노드 vj를 Familiar Set Fi에서 삭제한다. (노드 vj를 국지적 커뮤니티 Ci에는 유지함)Procedure 2
About node vj left after contact
1. Update cdij and cdmax (i).
2. Update p (i, j).
3. If p (i, j) > = r,
3-1. Node vi adds node vj to Familiar Set Fi of node vi.
3-2. If node vj does not exist in the local community Ci of node vi

) Add node vj to the local community Ci of node vi.
3-3. When node vj is added to local community Ci, it performs pseudo-activation (vj) on node vj.
3-4. Perform Procedure 3.
4. If p (i, j) <r, node vi deletes node vj from Familiar Set Fi. (Keep node vj in local community Ci)

Through the procedure 2, the node vi keeps the Familiar Set Fi of the node vi as the latest information using the pseudo activation success probability p (i, j) with the other node vj. Also, the local community Ci of the node vi is kept to include the node belonging to the Familiar Set Fi of the node vi, and the node belonging to the local community Ci at least once remains in the local community Ci.

4 is a block diagram illustrating a method for adding nodes to a first local community in a second local community of a neighbor node added to a first local community in a network system according to an embodiment of the present invention;

Referring to FIGS. 1 to 4, if the node vi includes the node vj in the local community Ci of the node vi, each node vn in the local community Cj of the node vj using the Pij information indicated by the node vj It is possible to additionally determine whether or not to add to Ci. This operation of the node vi is described in Table 6.

)하고 있다면 노드 vn을 국지적 커뮤니티 Ci에 추가한다.
2. 노드 vn에 대해 Pseudo-Activation(vn)을 수행한다.
Procedure 3
1. For each node vn in the local community Cj of the node vj newly added to the local community Ci of the node vi, the estimated Familiar Set fjn of the node vn and the local community Ci of the node vi share at least k-1 Share node (

), Add the node vn to the local community Ci.
2. Perform pseudo-activation (vn) on node vn.

In Fig. 4, since the node vj is added to the local community Ci of the node vi by the procedure 1 or the procedure 2, fjn and Ci share two nodes by the procedure of the procedure 3, so that the local community Ci Lt; / RTI &gt; node vn.

Each participating node Nx in the network system can independently perform the above procedures to build an independent local community Cx and count the number of nodes Ncx that have successfully made a pseudo activation attempt independently in the local community . Each of the nodes Nx can determine the influence of each of the nodes Nx using the number of nodes Ncx succeeding the pseudo activation attempt.

5 is a block diagram illustrating a mobile device in accordance with one embodiment of the present invention.

Referring to Figs. 1-5, the mobile device may correspond to one node in the network system of Fig. For example, the mobile device may correspond to a node vi. The mobile device may include a transceiver 120, a local community management unit 140, a Familiar Set management unit 160, and a pseudo activation unit 180.

The transceiver 120 of the mobile device vi may receive from the contact node vj a set Fij which is a Familiar Set of the node vj and a set of estimated Familiar Sets of nodes in the local community Cj of the node vj .

The local community management unit 140 of the mobile device vi determines whether to add the contact node vj to the local community Ci of the mobile device vi. For example, the local community management unit 140 may perform the procedure 1 described above.

The local community management unit 140 of the mobile device vi may instruct the pseudo activation unit 180 to activate the pseudo activation unit when the local community Ci is updated.

The Familiar Set management unit 160 of the mobile device vi may determine that the cumulative contact of the mobile device vi with the node vj when contacted node vj ends contact with the mobile device vi, Updating the pseudo activation success probability p (i, j) based on a time when the pseudo activation success probability p (i, j) is greater than or equal to a threshold value r, vi) to the Familiar set. For example, the Familiar Set management unit 160 may perform the procedure 2 described above.

The Familiar Set management unit 160 of the mobile device vi may instruct the local community management unit 140 to update the local community when the Familiar Set Fi is updated. When the local community management unit 140 is updated by an instruction from the Familiar Set management unit 160 of the mobile device vi, the local community management unit 140 again instructs the pseudo activation unit 180 to activate the pseudo activation can do.

When the new node is added to the local community Ci, the pseudo activation unit 180 of the mobile device (vi) tries to activate the new node using the activated one of the nodes adjacent to the new node .

When the pseudo activation unit 180 succeeds in activating the pseudo activation, the pseudo activation unit 180 updates the number Nci of the pseudo activation success nodes. The mobile device vi can easily determine the influence of the mobile device vi using the number Nci of pseudo activation success nodes.

According to the present invention, the influence of each node can be relatively easily determined using the local community of each node. The influence of each node in the network can be judged to widen the transmission range of limited information or speed up the propagation of information.

Although the preferred embodiments of the present invention have been disclosed for illustrative purposes, those skilled in the art will appreciate that various modifications, additions and substitutions are possible, without departing from the scope and spirit of the invention as disclosed in the accompanying claims. It will be understood that the invention may be modified and varied without departing from the scope of the invention.

Claims (14)

delete Construct a local community with neighbors,
Attempting a pseudo activation for a node added to the local community,
Wherein the mobile device receives a Familiar set of the first node from the first node when the mobile device that counts the number of nodes that succeeded in activating the physician and determines the influence is in contact with the first node,
Wherein the mobile device adds the first node to the local community of the mobile device when the local community of the mobile device has at least X common nodes with the Familiar set of the first node. Construct a local community with neighbors,
Attempting a pseudo activation for a node added to the local community,
(I) a first node which has contacted the mobile device (i), j is a highest node among the nodes which have contacted the mobile device (i) When the cumulative contact time is cdmax (i), and cumulative contact time of the mobile device (i) and the first node (j) is cdij,
The probability (p (i, j)) that the mobile device (i) will succeed by attempting to activate the pseudo at the first node (j)

The mobile device is a mobile device. 4. The method of claim 3, further comprising: when the first node (j) terminates contact with the mobile device (i), based on the cumulative contact time of the mobile device (i) Updates the activation success probability (p (i, j)),
(I) to the Familiar set of the mobile device (i) when the pseudo activation success probability (p (i, j)) is greater than or equal to the threshold value r. 5. The method of claim 4 wherein the first node j is added to the Familiar set of the mobile device i and the first node j is not in the local community of the mobile device i time,
And adding the first node (j) to the local community of the mobile device (i). 5. The method of claim 4, wherein when the pseudo activation success probability p (i, j) is less than the threshold value r and the first node j is in the Familiar set,
And deletes the first node (j) from the Familiar set. 7. The mobile device of claim 6, wherein the local community maintains the first node (j) even if the first node (j) is deleted from the Familiar set. Construct a local community with neighbors,
Attempting a pseudo activation for a node added to the local community,
When the first node is added to the local community of the mobile device that counts the number of nodes that have successfully activated the pseudo-activation to determine the impact,
Determine whether to add a second node in the local community of the first node to the local community of the mobile device. 9. The method of claim 8, wherein the mobile device receives an estimated Familiar set of the second node from the first node,
Add the second node to the local community of the mobile device when the local community of the mobile device has at least X common nodes with the estimated Familiar set of the second node. delete Constructing a local community of mobile devices with neighboring nodes;
Attempting a pseudo activation for a node added to the local community; And
And counting the number of nodes that have successfully activated the pseudo-activation to determine the influence,
The step of configuring the local community of the mobile device
When the mobile device contacts a first node, the mobile device receives a Familiar set of the first node from the first node; And
Adding the first node to the local community of the mobile device when the local community of the mobile device has more than X common nodes with the Familiar set of the first node. Way. Constructing a local community of mobile devices with neighboring nodes;
Attempting a pseudo activation for a node added to the local community; And
And counting the number of nodes that have successfully activated the pseudo-activation to determine the influence,
(I), the highest cumulative contact time among the nodes having contacted the mobile device (i) is cdmax (i), the mobile device i ) And the cumulative contact time of the first node (j) is cdij,
The probability (p (i, j)) that the mobile device (i) will succeed by attempting to activate the pseudo at the first node (j)

Gt; networking method. &Lt; / RTI &gt; 13. The method of claim 12, further comprising: when the first node (j) terminates contact with the mobile device (i), based on the cumulative contact time of the mobile device (i) Updating the activation success probability (p (i, j)); And
Further comprising adding the first node (j) to the Familiar set of the mobile device (i) when the pseudo activation success probability p (i, j) is greater than or equal to a threshold value r Lt; / RTI &gt; A first mobile device for configuring a local community with neighboring nodes, attempting to activate a pseudo-node for a node added to the local community, and counting the number of nodes that succeeded in activating the pseudo-node to determine a first influence; And
A second mobile device communicating with the first mobile device and determining a second influence independent of the first mobile device,
When the first mobile device contacts a first node, the first mobile device receives a Familiar set of the first node from the first node,
And adds the first node to the local community of the first mobile device when the local community of the first mobile device has more than X common nodes with the Familiar set of the first node. system.

Images