KR20080014529A - The apparatus and method of wipi mobile community network by using grouping and searching - Google Patents

Abstract

An apparatus for implementing a WIPI mobile community network by using a P2P grouping and searching scheme and a method thereof are provided to guarantee real time interrelation and to perform real time one to group message exchange in a WMC(WIPI Mobile Community) network by searching or sharing resources of an I-node or an F-node having a trusted relation or searching friend resources of an F-node having a partially trusted relation. An apparatus for implementing a WIPI mobile community network by using a P2P grouping and searching scheme comprises a WMC network(10), a P2P runtime engine(20), a WIPI-P2P library(30) and a WIPI-P2P service API(40). The WMC network(10) forms a P2P overlay network, which is a virtual network, among mobile peers via a WIPI based P2P grouping and searching scheme. The P2P runtime engine(20) receives a remote operating code set and sets the received operating code set to execute an execution type instruction set for operating the MC(Mobile Community) network on a WIPI platform. The WIPI-P2P library(30) provides an MC library which can be operated in the P2P runtime engine(20). The WIPI-P2P service API(40) provides a service API which can use a system library among the WIPI-P2P library(30).

Description

APPLICATION AND METHOD OF WIPI MOBILE COMMUNITY NETWORK BY USING GROUPING AND SEARCHING}

1 is a hierarchical structure diagram of a wireless communication terminal adopting the WIPI standard;

2 is a block diagram of an apparatus for implementing a WIPI mobile community network through a P2P grouping & searching method according to the present invention;

3 is a block diagram of a P2P runtime engine unit among WIPI mobile community network implementing apparatuses using a P2P grouping & searching method according to the present invention;

4 is a block diagram of a WIPI-P2P library unit among WIPI mobile community network implementation apparatuses using a P2P grouping & searching method according to the present invention;

5 is a block diagram of a WIPI-P2P service API unit among WIPI mobile community network implementing apparatuses through a P2P grouping & searching method according to the present invention;

6 is a diagram of a mobile community network structure on a WIPI platform according to the present invention;

7 is a diagram illustrating a grouping process in an overall structure of a mobile community consisting of a P2P overlay network according to the present invention;

FIG. 8 is a grouping for forming a primary search permission group or a secondary search permission group by allowing first search and second search in My Community according to the present invention. An embodiment showing the (Grouping) process,

FIG. 9 is a search & routing for forming a method for searching resources within a mobile community and a method for shortening a search step through dynamic relations between nodes in a WMC network according to the present invention. An embodiment showing a Searching & Routing process,

FIG. 10 is a diagram illustrating a re-grouping & routing process for applying a social network model according to the present invention to a WMC network to implement growth and decline of a mobile community.

FIG. 11 is a diagram illustrating a node relationship table update process for ensuring search availability through real-time updating of a friend list (F Table) according to the present invention; FIG.

FIG. 12 is a diagram illustrating another example of a process of registering an I node friend list (F Table) in a partially trusted relationship, as another example of updating a node relationship table according to the present invention; FIG.

FIG. 13 is a diagram illustrating a process of changing a partially trusted relationship to a trusted relationship according to the present invention and registering it in an I node friend list (F Table). FIG.

14 illustrates a secondary search permission group node F (n) in a trusted relationship with me according to the present invention, and a primary search permission group node f (n) in a trusted relationship with me. According to one embodiment of the present invention, a process of registering a user list in an I node list by changing to

15 is a diagram illustrating a node relationship table update process by deleting a node registered in an I node friend list (F Table) according to the present invention;

FIG. 16 is a diagram illustrating a mobile hard-disk service process between a user mobile terminal and a file server through an apparatus for implementing a WIPI mobile community network according to the present invention; FIG.

FIG. 17 is a diagram illustrating a mobile messenger service (Phone-to-Phone) type mobile messenger process through a WIPI mobile community network implementing apparatus according to the present invention; FIG.

18 is a view illustrating a mobile file pushing service process of directly delivering a message and a file to community members through an apparatus for implementing a WIPI mobile community network according to the present invention;

19 shows a virtual message attached to a file on a mobile hard disk through a WIPI mobile community network implementing apparatus according to the present invention to transmit a message, and a file to which a receiver is attached is opened. An embodiment showing a retrieve service process of downloading directly from the mobile hard disk (Mobile Hard-disk).

20 is a flowchart illustrating a method of implementing a WIPI mobile community network through a P2P grouping & searching method according to the present invention;

FIG. 21 is a flowchart illustrating a process of participating in a global community of an I node (I) according to the present invention; FIG.

FIG. 22 is a flowchart illustrating a process in which an I Node (I) or an F Node (Friends) participates and participates in a My Community according to the present invention. FIG.

FIG. 23 is a flowchart illustrating a method of grouping in My Community according to the present invention; FIG.

24 is a flowchart illustrating a method for re-grouping in My Community according to the present invention;

25 is a flowchart illustrating a search method in My Community according to the present invention;

FIG. 26 is a flowchart illustrating a method of registering a trusted relation node during a F table update in My Community according to the present invention; FIG.

FIG. 27 is a flowchart illustrating a method for registering a Partially Trusted Relation Node during a F List update in My Community according to the present invention; FIG.

FIG. 28 is a flowchart illustrating a method of changing a partially trusted relationship of a friend list (F Table) into a trusted relationship according to the present invention; FIG.

29 is a flowchart illustrating a method of changing a second search trust relationship in a friend list F table to a first search trust relationship according to the present invention;

30 is a flowchart illustrating a method of deleting node information of a friend list (F Table) according to the present invention.

※ Brief description of reference numerals ※

10: WMC Network 20: P2P Runtime Engine

21: P2P Network Connection Manager 22: User / Group / Community Manager

23: Pipe I / O 24: WMC Ad Manager Module

30: WIPI-P2P library section 31: P2P network search library

32: Library for user / group / community extension

33: WMC Pipe I / O Library

34: WMC Ad Manager Library

40: WIPI-P2P Service API

The present invention implements a WIPI mobile community network by applying a P2P Grouping & Searching method based on the domestic standard Wireless Internet Platform for Interoperability (WIPI) platform to a light and portable mobile device. It can be configured to search for and share resources, or to search for and share resources of Trusted Relations (F Node), or to search for friend resources of Partially Trusted Relations. WIPI mobile community network implementation device and method through P2P grouping & search method that can guarantee real-time correlation in WMC network (WIPI Mobile Community Network) and exchange messages one-n-n (group) in real time without restriction of places like wire. It is about.

Currently, community sites through web sites consisting of wired and internet are in fashion.

For example, sites such as Cyworld, Pretzel, and I Love School are representative examples, and they are building a web server-oriented community based on off-line connections and mutual interests.

Nowadays, the mobile technology (P2P: Peer to Peer) function is applied to the internet and wired community by applying the mobile technology based on the domestic standard, the Wireless Internet Platform for Interoperability (WIPI) platform. Development of new services and services suitable for the ubiquitous environment is being activated.

The WIPI (Wireless Internet Platform for Interoperability) is a mobile standard platform that is mounted on a mobile communication terminal and provides an environment in which an application can be executed. It aims to provide portability and provides a variety of rich content services to general users.

The WIPI-based wireless Internet platform ensures that application software works regardless of operating system (OS) in a mobile communication terminal.

Hereinafter, the structure of the WIPI platform will be described.

As shown in FIG. 1, the WIPI standard wireless Internet standard platform 1 provides a standardized platform compatibility with the HAL (Handset Adaptation Layer), which is a standardized hardware abstraction layer to increase platform portability. Basic Application Programming Interface (Basic API) to facilitate this, and Dynamic Component (Dynamic) that provides differentiated API dynamically according to dynamic API (Application Programming Interface) add / update function Component), and WIPI Application Manager (WIPI App. Manager) that manages applications and HEAP memory, such as downloading, installing, and deleting applications.

The platform development language is standardized to support both C and Java languages, maximizing developer participation.

WIPI platform composed of this configuration can add / update API (Application Programming Interface) through wireless network and add / update through DLL.

However, the application of mobile technology (P2P: Peer to Peer) service is activated by applying mobile technology based on WIPI (Wireless Internet Platform for Interoperability) platform, but the data between mobile users (P2P: Peer to Peer) For sharing (e.g. Gnutella, Napster, Sori), collaboration (e.g. Groove (2000)), resource sharing (e.g. distributed computing-SETI @ home (1995 ~), Korea @ home (2002 ~)) In order to share information, you must be connected to a peer computer with a personal friend, or to a server connected to a peer connected to the server via Internet IP. There is a problem that it takes a lot of time to download the location constraints and downloads.

In addition, although ubiquitous service-based technologies such as wireless Internet (Wibro) and digital multimedia broadcasting (DMB) are currently being provided to mobile devices, various mobile users (P2P) among mobile users (P2P) are lacking due to lack of mobile community function through mobile P2P. It was difficult to share data and explore resources.

In order to solve the above problems, the present invention constitutes a community similar to real life in various wireless environments, P2P based on the WIPI (Wireless Internet Platform for Interoperability), a national standard for resource discovery within the community By applying the Grouping & Searching method to form a P2P overlay network, a virtual network between mobile users (Peer),

Resource search and sharing of (I Node) resources or resource search and sharing of F (Trusted Relation) friends, or search for friend resources of friends with Partially Trusted Relation WIPI mobile community through P2P grouping & search method that enables real-time interworking in WMC network (WIPI Mobile Community Network) and message exchange of one-to-n (group) in real time without restriction of places like wired It is an object of the present invention to provide an apparatus and method for implementing a network.

In order to achieve the above object, the apparatus for implementing WIPI mobile community network through P2P grouping & searching method according to the present invention,

WIPI Mobile Community Network (10), which forms a P2P overlay network, a virtual network between peers, through P2P Grouping & Searching based on the Wireless Internet Platform for Interoperability (WIPI). ,

A P2P run-time engine 20 for receiving a set of remote operation codes and executing a set of executable instructions so that a mobile community network can operate on a WIPI platform;

WIPI-P2P Library unit (WIPI-P2P Library) 30, which provides a Mobile Community (MC) library that can operate in the P2P runtime engine unit,

The WIPI-P2P library unit (WIPI-P2P Library) is achieved by including a WIPI-P2P service API unit 40 that provides a service API (Application Programming Interface) that can use the system library.

In addition, the WIPI mobile community network implementation method through the P2P grouping & search method according to the present invention,

Grouping step (S100) to form a mobile community configuration method in the WMC network,

Searching & Routing step to form a method of searching for resources in the mobile community in the MC network and a method for shortening the searching step through dynamic relations between nodes ( S200),

Re-Grouping & Routing step (S300) to apply the social network model to the WMC network to implement the growth and decline of the mobile community (Mobile Community),

Node relationship table update step (S400) to ensure the search availability (Searching Availability) through a real-time update of the node (friends) list,

This is achieved by the information exchange step (S500) between the mobile user nodes within the global community through the WMC network.

Hereinafter, described in detail by the accompanying drawings as follows.

2 is a block diagram of a device for implementing a WIPI mobile community network through a P2P grouping & searching method according to the present invention, which is a WMC network (WIPI Mobile Community Network) 10, a P2P run-time engine unit (P2P Run-time) Engine 20, a WIPI-P2P library unit 30, and a WIPI-P2P service API unit 40.

The WMC network (WIPI Mobile Community Network) 10 is a P2P which is a virtual network (Overlay Network) between mobile users (Peer) through the P2P Grouping & Searching method based on the Wireless Internet Platform for Interoperability (WIPI) It forms an overlay network, in which a mobile user and its mobile users are gathered to form a user group, that is, a group, and the user groups are gathered to form a social community (community: A community is formed, and a plurality of pipe input / output units connecting both ends are formed by connecting a plurality of groups so that groups and users constituting a community can communicate with each other.

Such a mobile user, a group, a community, and a pipe input / output unit form a WMC network.

The overlay network refers to a virtual network composed of nodes and logical links established on an existing network for the purpose of performing network services not provided by the existing network. In this context, neighbor nodes are logically organized rather than physical neighbors.

And, when users (Peer) existing on the physical network registers to the P2P service, a virtual network (P2P Overlay Network) between the registered users (Peer) is created. On this P2P overlay network, peers can share and exchange information directly with other peers without the help of a server.

Here, the P2P concept according to the present invention not only means that the computer is connected to the computer, but also means that the human is directly connected to the human being in a 1: 1 connection.

Where the P2P run-time engine (P2P run-time engine) 20 is configured to receive a set of remote operation code and to execute a set of executable commands so that a mobile community (MC) network can operate on the WIPI platform 3, a peer-to-peer network communication manager 21, a user / group / community manager 22, and a pipe entry / exit unit as shown in FIG. 3. I / O) 23 and WMC Advertisement Management Module 24.

Peer to Peer Network Communication Manager (21) plays a role in setting up the WMC Network (WIPI Mobile Community Network) protocol protocol so that a mobile community network is formed on the WIPI platform to form a connection network among mobile users. .

The user / group / community manager 22 creates and deletes a user, a group, and a community on a WMC network formed through the P2P network connection manager. At the same time, it manages group, community, and user information in the WMC network so that it can be discovered during discovery commands of mobile users.

Pipe I / O 23 is a pipe I / O 23 that forms a pipe I / O network that connects both endpoints to communicate / connect between users, groups, and communities within the WMC network. It has a role of managing to expand while having an organic connection between, groups, and communities.

The WMC Advertisement Management Module 24 sets the information of the Peer, Group, Community, and Pipe I / O in the WMC network to inform other devices that it is connected. Consists of WMC Advertisement, based on the existing Peer, Group, Community, and Pipe I / O Unit, Another Peer, Group, Community, Pipe I / O It is responsible for managing the expansion and creation of wealth.

Mobile Community (MC) network structure on the WIPI platform operated through the configuration of the P2P run-time engine unit (P2P Run-time Engine) 20, as shown in Figure 6 (Advertisement), Discovery (Discovery) ), Pipe, resolver.

The advertisement is a means of informing a mobile user, a peer group, a pipe, and other information (message, etc.).

Discovery is a feature that allows two users to discover each other without a physical address. It is used to discover a group of users, a pipe, and so on.

Pipe is a function that allows users to connect both endpoints to communicate with each other and manages the pipe created by the user and makes it easy to send a message through the pipe. It consists of a Pipe Input and a Pipe Output.

The resolver sends a general query to a handler located at another peer, and provides a general response to the query and a delivery service to a query request in a peer group.

The WIPI-P2P Library unit (WIPI-P2P Library) 30 provides a Mobile Community (MC) library that can operate in the P2P runtime engine unit, as shown in FIG. 4, which is a P2P network. Discovery Library (31), Peer / Group / Community Library (32), WMC Pipe I / O Library (33), WMC Ad Manager Library (34) It consists of.

The P2P network discovery library 31 detects and responds to WMC Discovery Requests and Responses to discover Peers, Groups, Communities in the WMC Network, or additionally discover other Communities. It handles (WMC Discovery Response) and handles discovery event occurrence (WMC Discovery Listener, WMC Discovery Event).

The user / group / community library 32 is a peer in a WMC network, a user group formed by gathering users, and a community formed by gathering the user groups. It extends or allows other communities to be added.

The WMC Pipe I / O Library 33 is a WMC Input Pipe and an Output Pipe that connects Peers, Groups, and Communities on a WMC Network. The pipe I / O is set to be expanded through the pipe, and the pipe input / output unit is used to handle transmission / reception message events (WMC Pipe Msg Listener, WMC Pipe Msg Event).

The WMC Ad Manager Library 34 extends the WMC Advertisement, which informs other devices that it is connected by setting information of Peer, Group, Community, and Pipe I / O in the WMC network. It serves to set the advertisement of the specified standard.

Such advertisements include WMC user group advertisements, WMC community advertisements, WMC pipe advertisements, WMC user advertisements, and WMC endpoint advertisements.

The WIPI-P2P service API unit 40 provides a service API (Application Programming Interface) that can use a system library of the WIPI-P2P library unit (WIPI-P2P Library), as shown in FIG. It provides a service library 41 between Peers, Groups, and Communities in the WMC network, and the I Node for searching between Peers, Groups, and Communities. , Search service library 42 according to the search type consisting of Trusted Relation and Partially Trusted Relation, and the pipe communication service library to be used during composing and pipe messages. 43) and a WIPI-P2P service library 44 which generates pipes for WMC input and pipes for WMC output to provide transmit and receive libraries via WMC messages. It is configured.

The WIPI-P2P service library 40 is to virtualize the P2P Grouping & Searching method based on the Wireless Internet Platform for Interoperability (WIPI), and the model for Grouping & Searching is illustrated in FIG. As shown in Fig. 7, it represents a copy of a social network.

[Grouping ( Grouping )]

Grouping according to the present invention defines a connection relationship between a user node and a user node, which is divided into a trusted relationship and a partially trusted relationship.

That is, My Community is formed, which is a virtual group consisting of I Node (I) and F Node (Friends). At this time, the relationship between the I node (I) and the F node (friend) is basically a trusted relationship.

In addition, My Sub-Community, which is a virtual group that allows resource search even for a friend (FF Node) of a friend (F Node) among nodes in My Community, is formed. In addition, My Sub-Community, which is a virtual group that does not allow resource search for a friend (FF Node) of a friend (F Node), may also be formed. At this time, the relationship except for the relationship between the I node (I) and the F node (friend) is a partially trusted relationship.

[Searching ( Searching )]

Searching according to the present invention is to set the search type according to the connection between the user node (Node) and the user node (Node), which is a search for the I node (b) that can search and share their resources ( 0th search), search for F node (friend), which is a trusted relation that can be searched and shared by a friend (F Node) (first search: 1st Searching), and a friend of F node (FF Node) It is divided into a search for a FF node (a friend of a friend), which is a partially trusted relationship that can only search for resources.

Through this configuration, the process of participating in the global community of the I node (I) according to the present invention will be described.

As shown in FIG. 21, first, I node (I) advertises participation in a global community (S120).

Subsequently, the global master, which is an administrator of the global community, checks whether the I node (I) is an existing registration node (Peer) (S121).

Subsequently, if an existing registration node (Peer), I node (I) participates in the global community and registers the fact (S122).

Through this process, I participate in the global community of the I node (I) (S123).

Next, a process in which an I node (or I) or an F node (a friend) according to the present invention participates to participate in My Community will be described.

As shown in FIG. 22, first, My Community is found by participating in My Community (S130).

At this time, if not found My Community (My Community) creates a My Community (Advertisement) to the Global Community (Global Community) (S131).

Subsequently, the user participates in My Community, and when the participation is completed, the communication state is maintained between nodes in the My Community (S132 to S133).

Subsequently, a node to join the My Community is found (S134).

Subsequently, a request is made to join a My Community to the found Node to participate in My Community (S135).

At this time, if rejected to be in the communication standby state between nodes (My Community) (My Community) (S136).

Subsequently, a node other than My Community (F node) requests participation in My Community (S137).

At this time, if agreed to participate in the My Community, if not agreed to be in a communication standby state between nodes in the My Community (My Community) (S138).

Subsequently, if participation in My Community is allowed, node information is updated in the F Table and another community (F Node) is notified to My Community. (S139-S139-1).

Through this process, I Node (I) or F Node (Friends) participates in My Community.

Next, a method of grouping in My Community according to the present invention will be described.

As shown in FIG. 23, first, the characteristics of the node are referred to (S110).

Subsequently, if the node is a trusted relationship and allows the first search, a first search trust relationship sub-group is formed (S111).

Subsequently, if the node is a trusted relationship and allows the second search, a second search trust relationship sub-group is formed (S112).

Subsequently, the secondary discovery trust relationship sub-group information is collected at the node of the secondary discovery trust relationship to form a secondary discovery partial trust relationship sub-group of My Community (S113). ).

Subsequently, each sub-group information is updated to a friend list (F Table) of My Community (S114 to S115).

Through this process, you can group within My Community.

Next, a method of re-grouping in My Community according to the present invention will be described.

As shown in FIG. 24, first, the property of an updated node is referred to (S310).

Subsequently, if the node is a trusted relationship and allows the first search, a first search trusted relationship sub-group is formed (S311).

Subsequently, if the node is a trusted relationship and allows the second search, a second search trusted relationship sub-group is formed (S312).

Subsequently, the secondary discovery trust relationship sub-group information is collected at the node of the secondary discovery trust relationship to form a secondary discovery partial trust relationship sub-group of My Community (S313). ).

Subsequently, each sub-group information is updated to a friend list (F Table) of My Community (S314).

Through this process, it is possible to re-group in My Community.

Next, a search method in My Community according to the present invention will be described.

As shown in FIG. 25, first, an item in an I Node (I) area within an I Node or a Global Master is searched (S210).

At this time, the item found in the I node (terminal, global master, etc.) is output and transmitted.

Subsequently, a friend list (F Table) of My Community is referred to (S211).

Subsequently, a search request is made to a sub-group of nodes of a friend list F table (S212 to S214).

That is, if the node is a trusted relationship and allows the first search, the node requests the search of the first search trusted relationship sub-group (S212).

Or, if the node is a trusted relationship and allows the second search, the second server searches for a search of the second search trusted relationship sub-group (S213).

Or, if the node is a partial trust relationship (Partially Trusted Relation) and allows the second search, a request is made to search for the secondary search partially trusted relation sub-group of My Community (S214). ).

Subsequently, the received search result is collected (S215).

Subsequently, the search is output to complete the search (S216).

Through this process, you can perform a search method in My Community.

Next, a description will be given of a method of registering a trusted relation node during a F list update in My Community according to the present invention.

As shown in FIG. 26, first, a node that is not registered in My Community is discovered (S410).

In this case, it is assumed that a node occurs when a node requesting a new relationship is generated.

Subsequently, the group characteristic of the corresponding node (Node) is checked (S411).

In this case, it is assumed that the group property is set to a trusted relation.

Subsequently, when the first search is allowed, the first search is updated to the first search trusted relation sub-group of the friend list (F Table) (S412).

Subsequently, when the second search is allowed, the second search is updated to the second search trusted relation sub-group of the friend list (F Table) (S413).

Subsequently, registration of the trust relationship node of the My Community friend list F Table is completed (S414).

Through this process, it is possible to perform a method of registering a Trusted Relation Node during F Table update in My Community.

Next, a method of registering a Partially Trusted Relation Node during a F List update in My Community according to the present invention will be described.

As illustrated in FIG. 27, first, a search is performed to see if there is a secondary discovery trust relationship node among nodes of the secondary discovery trust relationship sub-group of the friend list F table (S420).

Subsequently, when there is no second trusted search relation list of the friend list F table, the partial trust relationship node is updated (S421).

Subsequently, if there is a secondary search trust relationship (F Table) of the friend list (F Table), the secondary search trust relationship of the friend (F Node) in the friend list (F Table) is displayed. Request group information (S422).

Subsequently, the second search trusted relation sub-group information of the friend F node in the friend list F table is received (S423).

Subsequently, the requested secondary search trusted relation node information is compared with the contents of the second search partial trusted relationship in the friend list (F table), and duplicated and registered, and the information is registered (S424 ~). S425).

Subsequently, the search target of the friend list F table is repeated from the first item of change (S426).

Through this process, it is possible to perform a method of registering a Partially Trusted Relation Node during the F Table update of My Community.

Next, a method of changing a partially trusted relationship of a friend list F table to a trusted relationship according to the present invention will be described.

As shown in FIG. 28, first, a node having a second search partially trusted relation requests a change to a second search trusted relation (S430).

Subsequently, the corresponding node (Node) in the friend list (F table) is replaced by the second search partial trust relationship column (vertical column: Column) from the second search trusted relation column (vertical column: Column). In step S431, the information is moved.

Subsequently, the fact is advertised to all nodes of the secondary search trust relation sub-group and the secondary search partial trust relation sub-group (S432).

Subsequently, all nodes that receive the advertisement delete the node or update information (S433).

Subsequently, the friend list F table is updated and the node relationship change is completed (S434 to S435).

Through this process, a method of changing a partially trusted relationship from a F list to a trusted relationship can be performed.

Next, a description will be given of a method for changing a second search trust relation in a friend list F table to a first search trust relation according to the present invention.

As shown in FIG. 29, first, a node, which is a second search trust relationship, requests a change to a first search trust relationship (S440).

Subsequently, the node in the friend list (F Table) is mapped from the secondary search trust relation column (vertical line) to the primary search trust relation column (vertical line: column). Node information is moved (S441).

Subsequently, the fact is advertised to all nodes of the secondary search trusted relation sub-group and the second search partial trusted relation sub-group (S442).

Subsequently, all nodes that receive the advertisement delete the node or update information (S443).

Subsequently, the friend list F table is updated and the node relationship change is completed (S444 to S445).

Through this process, a method of changing a second search trust relationship in a friend list (F table) to a first search trust relationship can be performed.

In addition, a method of changing a first search trust relationship in a friend list (F table) to a second search trust relationship may also be performed through the above process.

Next, a method of deleting node information of a friend list (F Table) according to the present invention will be described.

As shown in FIG. 30, a node first requests deletion of a trusted relation and a partially trusted relation (S450).

Subsequently, corresponding node information is deleted from the friend list F table (S451).

Subsequently, the fact is advertised to all nodes of the secondary search trusted relation sub-group and the second search partial trusted relation sub-group (S452).

Subsequently, all nodes that receive the advertisement delete corresponding node information (S453).

Subsequently, the friend list (F Table) update and node information are deleted (S454) to S455.

Through this process, a method of deleting node information of a friend list (F table) can be performed.

Hereinafter, a method for implementing a WIPI mobile community network through a P2P grouping & searching method according to the present invention will be described with reference to a specific example.

As shown in FIG. 20, there is a grouping step S100 of forming a mobile community composition method in a first WMC network.

This forms My Sub-Community, which is a Trusted Relation between I Node and F Node, or a friend (FF) of F Node among Nodes in My Community. Nodes) to form a My Sub-Community consisting of Partially Trusted Relations.

For example, FIG. 7 illustrates a grouping process in the entire mobile community structure of a P2P overlay network, which includes all nodes as the highest virtual community including virtual communities. It is about grouping in the global community, which is a real group.

As shown in FIG. 7, My Community consisting of I (I Node) and my friend (F Node) and a community of i that do not include I Node (I) form a grouping. .

Here, I Node (I) is a community constituent or a search entity in and out of a community. And, the F Node (friend) is a community component, and forms a primary subgroup to allow only I (I Node) and a friend (F Node) to search for itself, or forms a secondary subgroup. It serves to allow search between (I Node) and friend (F Node) and search of friend (FF Node) of friend (F Node).

As another example, FIG. 8 illustrates a grouping process of forming a primary search permission group or a secondary search permission group by allowing a primary search and a second search in My Community. This means that if resources are allowed to be searched only between I Node (I) and F Node (Friends), which are the primary search permission, My Community as a whole forms a primary search permission group, and the second search permission is I. Not only between Node (I) and F Node (friend), but also F Node (friend) of I Node (friend) can search each other and FF Node (friend) of F Node (friend). My Community) will form a secondary search allowance group.

8 shows a relationship between the I node (I) and the F node (friend) when the first search is allowed, and shows the 1st Searching Trusted Relation, and the I node (I) and F when the second search is allowed. The relationship between a node (friend) represents a 2nd Searching Trusted Relation, and the FF Node (friend) relationship between I Node (I) and F Node (friend), or F Node (Friends) and F Node ( The relationship between friends represents a 2nd Searching Partially Trusted Relation.

Second, the search & routing step of forming a resource routing method in the mobile community in the WMC network and a dynamic routing method by changing the relation between nodes. There is (S200).

As shown in FIG. 9, My Community consists of I (I Node) and my friend (F Node), and a friend (FF Node) of a friend (F Node) among the nodes in my community. The configured My Sub-Community and the i Community which does not include I Node (I) are grouped.

In addition, a secondary search allowance group is formed that allows searching not only between I Node (I) and F Node (Friends) but also FF Nodes (Friends) of F Nodes (Friends) not directly belonging to My Community. .

Here, I Node (I) requests F Nodes (friends) in the secondary search permission group to request secondary search permission group information they have.

Subsequently, the F Node (friend) in the secondary search permission group returns the secondary search permission FF Node (friend) information directly connected to the secondary node.

Subsequently, I Node (I) updates the secondary search list.

As shown in FIG. 9 through this searching & routing step, the relationship between the I node (I) and the F node (friend F1) during the first search, and the F node (friend F1) during the second search. The relationship between F Nodes (friends F2, F3, F4, F5, F6) represents a Trusted Relation, and FF Nodes (friends) of I Node (I) and F Node (Friends F1) during the second search. The relationship between F21, F22, and F23 and the F nodes (friends F1, F2, F3, F4, and F5) represent a partially trusted relationship.

Third, there is a Re-Grouping & Routing step (S300) to apply the social network model to the WMC network to implement the growth and decline of the mobile community (Mobile Community).

 As shown in FIG. 10, this is My Community consisting of I Node and My Friend, and a Friend (FF Node) of F Node among Nodes in My Community. The configured My Sub-Community and the i Community which does not include I Node (I) are grouped.

In addition, a secondary search allowance group is formed that allows searching not only between the I node (I) and the F node (friend) but also the FF node (friend) of the F node (friend).

Here, I Node (I) and F Node 21 (Friends), which are existing Partially Trusted Relations, establish a new Trusted Relation.

Subsequently, F Node 21 (friend) becomes an element of My Sub-Community and a new friend (I Node) with I Node, and a 2nd Searching Trusted Relation is established. Partially Trusted Relation is established with all F Nodes (friends) of the existing secondary search allowance group (My Sub-Community).

Subsequently, as in the searching & routing step, the F Node (friend) (secondary search allowable node) information, which is a Trusted Relation of F Node 21 (friend), is updated.

Through this Re-Grouping & Routing step, as shown in Figure 10, the relationship between the I node (I) and F Node (friend F1) during the first search, F Node ( The relationship between friend F1) and F node (friend F1) of F node (friend F22, F23) represents a trusted relationship, and F of I node (I) and F node (friend F1) during the first search. The relationship between Node (friend F21) represents a new trusted relationship, and F Node (friend F21, F22) of F Node (friend F2, F3, F4, F5, F6) and F Node (friend F1). , The relationship between F23) and the F nodes (friends F1, F2, F3, F4, F5) represent a partially trusted relationship.

Fourth, there is a node relationship table (F Table) updating step (S400) to ensure search availability through real-time updating of a node (friend) list.

First, there is a step (S410) of registering a node list (F Table) of an I node in a partially trusted relationship so that the node relationship table (F Table) is updated.

 As shown in FIG. 11, this is My Community consisting of I Node and My Friend, and FF Node of F Node among Nodes in My Community. The configured My Sub-Community and the i Community which does not include I Node (I) are grouped.

In addition, a secondary search allowance group is formed that allows searching not only between the I node (I) and the F node (friend) but also the FF node (friend) of the F node (friend).

In FIG. 11, Table 1 is a table for registering an I node friend list (F Table) in a trusted relationship.

Here, f (n), which is in a trust relationship with me based on I node, indicates a primary search allowable group node such as f1, f2, f3, f4, f5, f6 ....., and F (n). n) represents the secondary search allowable group nodes such as F1, F2, F3, F4, F5, F6 ....., and FF (n) represents the nodes in Partially Trusted Relation. .

Nodes of Trusted Relation in My Community are listed through a table that lists nodes of I Node friends in Trusted Relation. It is possible to find and share information between advertisements and discovery nodes.

As another example of updating the node relation table (F Table) according to the present invention, there is a step (S420) of registering an I node friend list (F Table) in a partially trusted relation.

As shown in FIG. 12, this is My Community composed of I Node and My Friend and FF Node of F Node among Nodes in My Community. The configured My Sub-Community and the i Community which does not include I Node (I) are grouped.

In addition, a secondary search allowance group is formed that allows searching not only between the I node (I) and the F node (friend) but also the FF node (friend) of the F node (friend).

That is, as shown in Fig. 12, the relationship between I Node (I) and F Node (Friends F1, F2, F3, F4, F5, F6), F Node (Friends F1) and F Node ( The relationship between the FF nodes (friends F21, F22, F23) of friend F1) represents a trusted relationship, and the FF nodes (friends F21, F22, F23) of I Node (I) and F Node (friend F1). The relationship between these represents a partially trusted relationship.

As shown in Table 2 and Table 3 of FIG. 12, the I node friend list (F table) and the F1 node friend list (F table) in the partially trusted relationship can be registered. have.

In my (I Node) friend list (F Table), f (n) that is trusted by me based on I node is 1 such as f1, f2, f3, f4, f5, f6 ..... 1st Searching Trusted Relation node, F (n) is a 2nd Searching Trusted Relation node such as F1, F2, F3, F4, F5, F6 ..... FF (n) represents a node in 2nd Searching Partially Trusted Relation such as F21, F22, F23 ......

In addition, in the F1 node friend list (F Table) with respect to my (I Node) friend list (F Table), F (n) in a trust relationship with me based on I (I Node = F1) is I (I Node = F1), F21, F22, F23 ..... secondary search allowance group node, etc., FF (n) is F2, F3, F4, F5, F6 ..... etc. Represents a node that is in Partially Trusted Relation.

In the table where the I Node friend list (F Table) and the F1 node friend list (F Table) in this partially trusted relationship are registered, the advertisement and discovery are found. Information can be shared, and F (n) 's secondary search allowance group information that is trusted with me can be shared with each node, so that the relationship with the node that received the information is a partial trust relationship ( Set to Partially Trusted Relation, and duplicate nodes are removed to update the Node Relation Table.

As another example of updating the node relationship table according to the present invention, changing a partially trusted relationship to a trusted relationship and registering it in an I node friend list (F Table) (S430) There is).

As shown in FIG. 13, this is My Community composed of I (I Node) and my friend (F Node), and a friend (FF Node) of a friend (F Node) among the nodes in my community. The configured My Sub-Community and the i Community which does not include I Node (I) are grouped.

In addition, a secondary search allowance group is formed that allows searching not only between I Node (I) and F Node (friend) but also FF Node (friend) of F Node (friend).

That is, as shown in Fig. 13, the relationship between I Node (I) and F Node (friends F1, F2, F3, F4, F5, F6), F Node (friend F1) and F Node ( The relationship between the F Nodes (friends F21, F22, F23) of friend F1, and the relationship between the I Node (I) and the F Nodes (friend F21) of F Node (friend F1) represents a trusted relationship, The relationship between the I node (I) and the F node (friends F22 and F23) of the F node (friend F1) represents a partially trusted relationship.

As shown in Table 4 of FIG. 13, in the (I Node) friend list (F Table), the second search that is in a trust relationship with F21 in a partially trusted relationship with me based on I node. Change to the permission group node (F (n)) and register it in my (I Node) friend list (F Table).

Change this Partially Trusted Relation to Trusted Relation to allow a second search of F (n) in a trust relationship with you in a table registered in your (I Node) Friends list. You can configure the group so that it can discover (search) and share information, or allow only the secondary search allowed group of FF (n) in Partially Trusted Relation with me.

As such, the change information is advertised to not only I Node and my friend's friend (F21 Node) but also to friends on my I Node friend list (F Table). I can update my (I Node) friend list (F Table).

As another example of the step of updating the node relationship table according to the present invention, the secondary search allowance group node F (n) in the trusted relationship with me is allowed to be the first search in the trusted relationship with the There is a step S440 of changing to a group node f (n) and registering it in an I node friend list F Table.

As shown in FIG. 14, this is My Community composed of I Node and My Friend and FFF Friend of Nodes within My Community. The configured My Sub-Community and the i Community which does not include I Node (I) are grouped.

In addition, a secondary search allowance group is formed that allows searching not only between the I node (I) and the F node (friend) but also the F node (friend) of the F node (friend).

That is, as shown in FIG. 14, the relationship between the I node (I) and the F node (friend F4) during the first search, the I node (I) and the F node (friends F1, F2, F3, Relationship between F5 and F6, F Node (friend F1) and F Node (friend F1) and F Node (friends F21, F22 and F23), I Node and F Node (friend F1) The relationship between Node (friend F21) represents a trusted relation, and the relationship between I Node (I) and F Node (Friends F22, F23) of F Node (friend F1) is a partially trusted relationship. ).

As shown in Table 5 of FIG. 14, in the (I Node) friend list (F Table), the secondary search permission group node (Trusted Relation) that is in trust relationship with I node based on I node Change F4) to the primary search permission group node (F (n)) in the trusted relation with I node and register it in the I node friend list (F Table) to search for a new primary search. Allowed groups can be formed.

Change the secondary search permission group node (F (n)) in trust relationship with me to the primary search permission group node (f (n)) in trust relationship with me (I Node through the table registered in the F Table, not only I (I Node) and my friend (F4 Node), but also friends on my (I Node) friend list (F Table) Nodes advertises the deletion of the secondary search permission group node (F4) and the change to the primary search permission group node (F4) in a trusted relationship with me (I Node). Node) You can update the F Table.

As another example of the node relationship table update step according to the present invention, there is a step S450 of deleting a node registered in an I node friend list F table.

As shown in FIG. 15, this is My Community composed of I Node and My Friend and FFF Friend of Nodes within My Community. The configured My Sub-Community and the i Community which does not include I Node (I) are grouped.

In addition, a secondary search allowance group is formed that allows searching not only between the I node (I) and the F node (friend) but also the FF node (friend) of the F node (friend).

That is, as shown in FIG. 15, the relationship between the I node (I) and the F node (friend F4) during the first search, the I node (I) and the F node (friends F1, F2, F3, Relationship between F5, F6), relationship between F Node (friend F1) and FF Node (friend F1) (friends F21, F22, F23), FF of I Node (I) and F Node (friend F1) The relationship between the Node (friend F21) represents a Trusted Relation, and the relationship between the I Node (I) and the FF Node (Friends F22, F23) of the F Node (Friends F1) is a Partially Trusted Relation. ).

Here, the F Node (friend F4) in the Trusted Relation with the I Node (I) is deleted.

As shown in Table 6 of FIG. 15, in the (I Node) friend list (F Table), the secondary search permission group node (Trusted Relation) that is in a trusted relationship with I node based on I node. F4) can be deleted immediately without change to form a new secondary search permission group.

Through the table that deletes any one of the secondary search permission group nodes (F (n)) in the trusted relationship with me and registers them in the I Node friend list (F Table), the change subject In addition to I Node and My Friend (F Node) as well as friends on my (I Node) Friends List (F Table), I have a trust relationship with I Node. The deletion information of the secondary search permission group node F4 may be advertised to update the I node friend list F table.

Fifth, there is an information exchange step between mobile user nodes in a global community through a WMC network.

First, we identify the mobile users (Peer) that are formed by participating in the global community.

This can be distinguished through URN management of the mobile community user node (Node).

The URN configuration consists of a global community user ID (UID), a login time (UTC), and local information (including local information selected by a node).

Here, the login time (UTC) and local information (including the local information connected to the node by selecting) may be designated as additional items for synchronization and local information search.

In the case where a mobile user (Peer) participates in the global community, the URN consists of a global community user ID (UID), a login time (UTC), and local information (a region where the node accesses the global community). ,

In the case where a mobile user (Peer) leaves the global community, the URN consists only of the global community user ID (UID).

The password can be added to the URN configuration.

Through such URN management, it is possible to distinguish a mobile user who is formed by participating in a global community.

Next, a communication method is set to share information between a user, a peer, or a user, and a community through URN management.

The user and peer communication, that is, peer-to-peer communicates between nodes, and performs one-way communication in case of notification, discovery, and status between users, and two-way communication when chatting and transferring files between users. Set the communication method to

The user communication with the peer, ie, peer-to-community, is a virtual channel for data transmission and reception, and a pipe communication is performed in the community to notify and search between the user and the community. In this case, the communication method is set to perform one-way communication in the state and to perform two-way communication in case of feedback, notification, and absence after the announcement between the user and the community.

At this time, in the case of feedback after notification during bidirectional communication, a user in the community may be set to allow communication, and in case of notification and absence, the user in the community may be set to disallow communication.

Next, the user searches for resources between a user and a peer, or between a user and a community, connected by one-way or two-way communication.

This consists of state discovery, user node discovery, and global master discovery.

The state search enables to search the state of the mobile user and the community by using peer-to-peer and peer-to-community search.

The discovery of the user node is limited to a discovery step of 0, 1, and 2, and the hop level 0 is configured to search and exchange resources within a peer, that is, an I node. , Step 1 (Hop 1) is set to search and exchange friends (F Node) resources in My Community, step 2 (Hop 2) is a sub-Community Set to search for a friend (FF Node) resource of a friend (F Node) in.

The global master search is configured to perform URN search and global resource search within the global community through a node that manages a global community.

Next, the mobile user (Peer), which is formed by participating in the global community and the my community, is additionally engaged or managed to terminate the existing mobile user.

Participation and termination of the global community is to authenticate by logging in with a URN and password to the global master, which is a node that manages the global community, and to log in or log out. Set it.

In addition, My Community Participation transmits a Participation message through P2P or Peer-to-Peer (Peer-to-Master) bidirectional communication. B) and set it to save in Global Master.

In addition, My Community is set to be deleted from the mobile user and the global master by deleting the URN from the community configuration information.

Next, it manages mobile user information that is formed by participating in the global community and my community.

The mobile user information includes user node state information and user node resource information.

The user node status information collects user (peer) status (global community participation and termination) information within a synchronization cycle and transmits the changed information to a user in a my community when a change is made. .

The user node resource information sets a sharing allowable file, user information, community information, and the like as a resource, and outputs a result of searching for a resource.

That is, in the case of peer search, the hop number [search order: 0,1,2] is output in ascending order of the buffer size allowed by the peer, and the global master In the case of searching, it outputs the search order as much as the buffer size allowed by the user (Peer).

As shown in FIG. 20, in the WMC network, a grouping step, a searching & routing step, a re-grouping & routing step, a node relationship table (F table) updating step, and a mobile user Through the method of implementing the WIPI mobile community network through the P2P grouping & searching method according to the present invention consisting of information exchange step between nodes, it can be applied to the following fields.

As shown in FIG. 16, a mobile hard disk service which can upload contents and files in a user's mobile terminal to a personal storage of a file server through the Internet and download them when necessary. ) Can be provided.

In addition, as shown in FIG. 17, a mobile messenger service of a phone-to-phone type that can exchange messages and files without passing through servers with multiple users may be provided. As shown in FIG. 18, a mobile file pushing service capable of directly delivering a message and a file using a P2P agent may be provided to community members registered in the server.

In addition, as shown in FIG. 19, when a file is virtually attached to a file on a mobile hard disk, a message is transmitted, and a recipient opens the attached file, the mobile hard disk (Retrieve) service can be provided to download directly from Mobile Hard-disk, reducing the size of mail message when sending mail, reducing traffic, and compensating for the inability to attach attachments when sending mail from mobile. There is a number.

As described above, according to the present invention, by implementing a WIPI mobile community network by applying the P2P Grouping & Searching method based on the domestic standard Wireless Internet Platform for Interoperability (WIPI) platform, It can be configured to search for and share resources, or to search for and share resources of a trusted node (F Node), or to search for friend resources of a friend who is partially trusted. This ensures real-time correlation in the WMC network (WIPI Mobile Community Network), exchanges messages one-to-one (group) in real time without restriction of places such as wired, and mobile hard-disk service. ), Mobile Messenger, Mobile-Pushing Service, and Retrieve Service There.

Claims (12)

WIPI Mobile Community Network (10), which forms a P2P overlay network, a virtual network between peers, through P2P Grouping & Searching based on the Wireless Internet Platform for Interoperability (WIPI). , A P2P run-time engine 20 for receiving a set of remote operation codes and executing a set of executable instructions so that a mobile community network can operate on a WIPI platform; WIPI-P2P Library unit (WIPI-P2P Library) 30, which provides a Mobile Community (MC) library that can operate in the P2P runtime engine unit, The WIPI-P2P service API unit 40, which provides a service API (Application Programming Interface) that can use the system library among the WIPI-P2P library unit (WIPI-P2P Library), characterized in that it comprises a P2P grouping & WIPI mobile community network implementation device using a search method. The P2P run-time engine 20 of claim 1, wherein Peer to Peer Network Communication Manager (21) for establishing a mobile community network on the WIPI platform to set the WMC network (WIPI Mobile Community Network) protocol protocol to form a connection network between mobile users, WMC allows users to create and delete users, groups, and communities on the WMC network formed through the P2P network connection manager, and to discover (search) the mobile user's discovery (search) commands. A user / group / community manager 22 that manages group, community, and user information in the network; A pipe I / O network is formed to tie the two endpoints together so that users / groups / communities in the WMC network can communicate / connect to each other. A pipe I / O 23 for managing expansion while having a connection relationship; It consists of a WMC advertisement that informs other devices that the user is connected by setting information of a user, a group, a community, and a pipe input / output unit in the WMC network. WMC Advertisement Management (WMC Advertisement Management) allows other users, groups, communities, and pipe I / O units to be created and expanded based on Group, Community, and Pipe I / O. Module (24), WIPI mobile community network implementation device through a P2P grouping & search method characterized in that consisting of. The method of claim 1, wherein the WIPI-P2P Library (WIPI-P2P Library) 30  Process WMC Discovery Requests and Responses (WMC Discovery Response) to discover Peers, Groups, Communities within the WMC Network, or discover additional Communities. A P2P network discovery library 31 for handling discovery event occurrences (WMC Discovery Listener, WMC Discovery Event), Library for user / group / community extension to expand the user in the WMC network, the user group formed by gathering users, and the community formed by gathering the user groups, or to add other communities (Peer / Group / Community Library) 32, Set up pipe I / O through input pipe and output pipe connecting user, group, community in WMC network, and send / receive message event through pipe input / output WMC Pipe I / O Library (33) to handle the generation, The standard of advertisement is extended to WMC advertisement that informs other devices that they are connected by setting information of Peer, Group, Community, Pipe I / O part in WMC network. WIPI mobile community network implementation device through the P2P grouping & search method, characterized in that consisting of the WMC advertising manager library (34) to be set. The WIPI-P2P service API unit 40 provides a service library 41 between a user, a group, and a community in a WMC network, and provides a user, a group ( In order to search between Groups and Communities, the search service library 42 is provided according to the type of search consisting of I (Node), Trusted Relation, and Partially Trusted Relation. WIPI-P2P service library (44), which provides a pipe communication service library (43) for use in creating messages to use and during pipe communication, and provides pipes for WMC input and pipes for WMC output to provide transmit and receive libraries via WMC messages. Apparatus for implementing WIPI mobile community network through the P2P grouping & search method, characterized in that is configured to include. The method of claim 1, wherein the P2P grouping & searching method is used. Form My Community, a trusted relationship between I Node and F Node, or friends of I Node and F Node in FF Node My Sub-Community, which consists of Partially Trusted Relations, and My Sub-Community, which is made up of F Nodes. Grouping step to form a), Exploring and sharing the resources of my I Node, or finding and sharing the resources of my F Node, which is a Trusted Relation, or FF Node, which is a Partially Trusted Relation. WIPI mobile through P2P grouping & search method, characterized in that the searching step of setting the search type according to the connection relationship to search the friend resources of the first and second search How to implement a community network. Grouping step (S100) to form a mobile community configuration method in the WMC network, Searching & Routing step to form a method of searching for resources in the mobile community in the MC network and a method for shortening the searching step through dynamic relations between nodes ( S200), Re-Grouping & Routing step (S300) to apply the social network model to the WMC network to implement the growth and decline of the mobile community (Mobile Community), Node relationship table update step (S400) to ensure the search availability (Searching Availability) through a real-time update of the node (friends) list, A method of implementing a WIPI mobile community network through a P2P grouping & searching method, characterized in that it comprises an information exchange step (S500) between mobile user nodes within a global community through a WMC network. 8. The node relationship table (F Table) updating step (S400) registers an I node friend list (F Table) in a trusted relationship, thereby updating the node relationship table (F Table). A method of implementing a WIPI mobile community network through the P2P grouping & searching method, characterized in that (S410). The method of claim 6, wherein the updating of the node relationship table (F Table) (S400) registers an I node friend list (F Table) in a partially trusted relationship to the node relationship table (F Table). How to implement the WIPI mobile community network through the P2P grouping & search method characterized in that the update (S420). The method of claim 6, wherein the updating of the node relationship table (F Table) (S400) changes the partially trusted relationship to a trusted relationship and registers it in the I node friend list (F Table). The node relationship table (F Table) is updated (S430), characterized in that the WIPI mobile community network implementation method using a P2P grouping & search method. The method of claim 6, wherein the updating of the node relationship table (F Table) (S400) exits the secondary search permission group node (F (n)) that is in a trust relationship (I Node) and the trust relationship ( Change to the primary search permission group node (f (n)) in Trusted Relation and register it in my (I Node) friend list (F Table) so that the node relation table (F Table) is updated (S440). A method of implementing a WIPI mobile community network using a P2P grouping & searching method. The node relationship table (F Table) updating step (S400) is performed so that the node relationship table (F Table) is updated by deleting a node registered in my (I Node) friend list (F Table). WIPI mobile community network implementation method using P2P grouping & search method characterized in that (S450). The method of claim 6, wherein the exchanging information between the mobile user nodes comprises: Identifying the peers that are forming by participating in the Global Community; Setting a communication method to share information between a divided user and a peer, or between a user and a community through URN management; Searching for resources between a user and a peer, or between a user and a community, connected by one-way or two-way communication; Additionally joining a mobile user formed by joining a global community and a my community, or managing to terminate an existing mobile user; A method of implementing a WIPI mobile community network through a P2P grouping & search method, comprising: managing mobile user information formed by participating a global community and a my community.

Images