KR20140134241A - Method for generating of peer service group and accessing of link resources - Google Patents

Method for generating of peer service group and accessing of link resources Download PDF

Info

Publication number
KR20140134241A
KR20140134241A KR1020140057465A KR20140057465A KR20140134241A KR 20140134241 A KR20140134241 A KR 20140134241A KR 1020140057465 A KR1020140057465 A KR 1020140057465A KR 20140057465 A KR20140057465 A KR 20140057465A KR 20140134241 A KR20140134241 A KR 20140134241A
Authority
KR
South Korea
Prior art keywords
peer
service group
link
search
service
Prior art date
Application number
KR1020140057465A
Other languages
Korean (ko)
Inventor
주성순
Original Assignee
한국전자통신연구원
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 한국전자통신연구원 filed Critical 한국전자통신연구원
Priority to US14/276,637 priority Critical patent/US20140334338A1/en
Publication of KR20140134241A publication Critical patent/KR20140134241A/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1044—Group management mechanisms 
    • H04L67/1046—Joining mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
    • H04W74/0808—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA
    • H04W74/0816—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA carrier sensing with collision avoidance

Abstract

Determining whether a first peer service group providing a requested peer service from a user is present in the vicinity, participating in a first peer service group if a first peer service group exists, The method comprising: generating a second peer service group that provides a peer service if the peer service group does not exist; Lt; RTI ID = 0.0 > accessing < / RTI >

Description

FIELD OF THE INVENTION [0001] The present invention relates to a method for generating a peer service group,

The present invention relates to a method of creating a peer service group and a method of accessing a link resource of a peer service group.

In the internet of things (IoT), it is required to group objects between objects and to collaborate with grouped objects in order to recognize objects in the same space and adaptively respond to events.

A plurality of objects included in the same space belong to at least one group and operate as a client or a server in a peer-to-peer (P2P) system, and transmit and receive control information, sensing information, position information, advertisement, . To do this, a plurality of objects must be configured with peer service groups to access various resources.

There is a prior art IEEE 802.15.4 family standard for network configuration based on low power wireless links. Conventional wireless personal area network (WPAN) technologies can configure a P2P link between a full function device and a master coordinator and network for network configuration.

However, it is difficult for one apparatus to participate in a plurality of networks at the same time, and to provide a plurality of P2P links without total control in a plurality of networks.

SUMMARY OF THE INVENTION The present invention provides a method of creating a peer service group and a method of accessing a link resource of a peer service group.

According to one aspect of the invention, a method is provided for a peer to create a peer service group. The method of generating a peer service group includes: checking if a first peer service group providing a requested peer service exists from a user, if the first peer service group exists, joining a first peer service group And if the first peer service group does not exist, generating a second peer service group that provides the peer service.

The method of generating a peer service group may further include a step of searching for a frame transmitted from a neighboring peer service group before confirming and synchronizing using a synchronous frame among the frames if the frame exists .

The method of generating a peer service group may further include re-adjusting an interval at which a frame is received if the frame does not exist, and searching again for a frame transmitted from a neighboring peer service group.

The method of generating a peer service group may further include, if the frame does not exist, checking whether the peer can broadcast the synchronous frame through the device availability information stored in the peer.

The step of verifying that the peer is capable of broadcasting a synchronous frame in the method of creating a peer service group includes the step of confirming that the peer is master clock capable and main powered through the device usable information can do.

The method of generating a peer service group includes broadcasting a synchronous frame when the peer is able to broadcast a synchronous frame, checking if the peer can search for another peer through the network service available information stored in the peer, If it is possible to search for another peer, searching for another peer, and if the peer can not search for another peer, then set the next wake-up time and switch to sleep mode As shown in FIG.

Wherein the step of generating in the method of generating a peer service group comprises the steps of: checking whether a peer can search for another peer through network service availability information stored in the peer; searching for another peer if the peer can search for another peer And setting the next wake-up time and switching to a sleep mode if the peer is unable to search for another peer.

Wherein the step of searching for another peer in the method of generating a peer service group comprises the steps of transmitting a peer search request and data when the second peer service group is in a handshaking phase, Or re-transmitting the peer search request and data if it does not receive the acknowledgment (ACK), and completing the generation of the second peer service group upon receipt of the peer search response or ACK within the first time .

Wherein the step of searching for another peer in the method of generating a peer service group comprises the steps of: completing generation of a second peer service group upon receipt of a peer search response or an ACK within a second predetermined time after retransmission, And if it does not receive a response or an ACK, determining that the second peer service group has failed to be generated.

Wherein the step of searching for another peer in the method of generating a peer service group includes the steps of: determining whether peering is necessary when the second peer service group is not a handshaking phase; transmitting a peer search request , Retransmitting the peer search request if it fails to receive the peer search response within a predetermined first time, and completing the creation of the second peer service group upon receipt of the peer search response within the first time have.

Wherein the step of searching for another peer in the method of generating a peer service group comprises the steps of: completing generation of a second peer service group upon receipt of a peer search response within a second predetermined time after retransmission; And determining that the second peer service group has failed to be generated if the second peer service group fails to receive the second peer service group.

Wherein the step of searching for another peer in the method of generating a peer service group comprises the steps of: transmitting a peer search request when peering is required; retransmitting a peer search request if the peer search response is not received within a predetermined first time; If the peering request information is received, transmitting a first peering response, and completing creation of a second peer service group if the peering request information has been received can do.

The method of generating a peer service group comprises the steps of: sending a peering request if no peering request information has been received; sending a third peering response if a second peering response to the peering request has been received; The method comprising the steps of:

The method of generating a peer service group comprises: retransmitting a peering request if a second peering response is not received; transmitting a fifth peering response if a fourth peering response for the retransmitted peering request is received; and And completing the creation of the second peer service group.

Wherein the step of searching for another peer in the method of generating a peer service group comprises the steps of: transmitting a peer response and completing generation of a second peer service group upon receipt of a peer search response within a second predetermined time after retransmission, And if the peer search response is not received within the second peer service group, determining that the second peer service group has failed to be generated.

In the method of creating a peer service group, the peer may be a host peer performing a server role, defining a mission and a peer group of a peer service group, and authenticating another peer.

In the method of creating a peer service group, another peer may be a guest peer requesting creation of a peer service group in the host peer.

According to another aspect of the present invention, a method is provided for a peer to access link resources of a peer service group. The link resource access method includes receiving a service phase descriptor and accessing a link resource according to a service phase descriptor, wherein the service phase descriptor includes information about a service phase determined according to a peer service requested by the user do.

The information about the service phase in the link resource approach includes information about a search phase, a peering phase, a P2P data phase, and a handshaking phase, and each phase includes a group link, an idle link, , And a relay link.

Wherein the link resource approach further comprises determining a start time of a superframe when the service phase is a search phase and transmitting a search message to another peer in a first group link, It is possible to access the first host link by a carrier-sense multiple access / collision avoidance (prioritized slotted CSMA / CA) scheme.

Wherein the link resource access method further comprises receiving a first message from a first peer different from a peer in a first guest link after a first group link and wherein the peer accesses the first guest link in a slotted CSMA / can do.

The link resource approach further comprises receiving a second message from a second peer and a first peer from a first peer in a first relay link after a first guest link, wherein the peer is in a slotted CSMA / CA scheme The first relay link can be accessed.

The first group link, the first guest link, and the first relay link in the link resource access method include a target time required for creating a peer service group, a number of peers included in the peer service group, And may be a link resource in units of a first time slot determined based on the distance.

The link resource approach may further include accessing a first idle link prior to determining the superframe start time.

The link resource access method may further include sequentially accessing a second group link, a second guest link, a second dormant link, and a second relay link after the first relay link.

In the link resource approach, the second group link, the second guest link, the second relay link, and the second idle link are used to determine the size of the message of the second group link, the second guest link, the second relay link, , The mission of the peer service group, the number of peers included in the peer service group, and the second time slot determined based on the distance between the peer and the first peer or peer and the second peer or the first and second peers Lt; / RTI >

In the link resource access method, the search message may include a P2P service group ID, a service phase descriptor, and a frame transmission time.

Wherein the link resource approach comprises: determining a superframe start time if the service phase is a handshaking phase; sending a search message to another peer in a first group link; accessing a first idle link; Receiving a first message from a first peer different from the peer in the first guest link, and accessing a second dormant link.

The link resource access method includes repeating the steps of transmitting a search message, accessing a first dormant link, receiving a first message on a first guest link, and accessing a second dormant link .

In the link resource approach, the group link, the first dormant link, the first guest link, the second dormant link, the group link, the first dormant link, the first guest link, the size of the message of the second dormant link, A mission time of the peer service group, and a number of time slots determined on the basis of the number of peers included in the peer service group.

According to one embodiment of the present invention, each peer searches neighboring peer service groups according to a service request of a user to participate in a neighboring peer service group, or creates a new peer service group if there is no peer service group to participate have. At this time, it is possible to access each link resource in various ways according to the type of the requested service, and it is possible to increase resource utilization efficiency according to the mission of the peer service group, the scale of the peer service group, and the characteristics of the peer service group.

1 is a diagram showing a network in which each terminal is included in at least one group among a plurality of groups included in a space.
FIG. 2 is a diagram showing that each object shown in FIG. 1 creates peer service groups.
FIG. 3 is a diagram illustrating a new object participating in the peer service group of FIG. 2 and creating a new peer service group.
4 is a diagram illustrating a peer service group using a low power wireless link according to an embodiment of the present invention.
5 is a flowchart illustrating a process of initializing a peer included in a peer service group according to an embodiment of the present invention.
6 is a flowchart illustrating a method of generating a peer service group according to an embodiment of the present invention.
7 is a diagram illustrating a header of a message frame of a peer service group according to an embodiment of the present invention.
8 is a diagram illustrating a link displayed as a super frame according to an embodiment of the present invention.
9 is a diagram illustrating a method of configuring a phase according to a peer service according to an embodiment of the present invention.
10 is a diagram showing a super frame of each phase according to the peer service according to the embodiment of the present invention.
11 is a diagram illustrating a method of correcting time synchronization among peer service groups according to an embodiment of the present invention.
12 is a diagram illustrating a method of allocating link resources of a multi-peer service group according to an embodiment of the present invention.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those skilled in the art can easily carry out the present invention. The present invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. In order to clearly illustrate the present invention, parts not related to the description are omitted, and similar parts are denoted by like reference characters throughout the specification.

Also, when a part is referred to as "including " an element, it does not exclude other elements unless specifically stated otherwise. Also, the terms "part," "unit," "unit," "module," "block," and the like are used in the description to mean at least one unit for processing a function or an operation, Or a combination of software and hardware.

1 is a diagram showing a network in which each terminal is included in at least one group among a plurality of groups included in a space.

Referring to FIG. 1, there is a plurality of things in an arbitrary space. Object 1, object 2 and object 3 can constitute group 1 to perform service 1. Object 2, Object 3, Object 4, and Object 5 may constitute Group 2 to perform Service 2. Object 3, Object 4 and Object 6 may constitute Group 3 and perform Service 3.

FIG. 2 is a diagram showing that each object shown in FIG. 1 creates peer service groups.

Referring to FIG. 2, the object 2 and the object 4 simultaneously participate in the peer service group 1 and the peer service group 2, respectively. Item 3 participates in both peer service group 1, peer service group 2, and peer service group 3.

FIG. 3 is a diagram illustrating a new object participating in the peer service group of FIG. 2 and creating a new peer service group.

Referring to FIG. 3, objects included in a certain space are creating peer service groups, and a new object 7 is involved. Object 7 created object 1, object 3, object 5, object 6, and a new peer service group, and then escaped any space again.

4 is a diagram illustrating a peer service group using a low power wireless link according to an embodiment of the present invention.

The peer service group of FIG. 4 may include a PAC network, and in an embodiment of the present invention, each peer may search for a peer to create a peer service group or participate in a peer service group.

A peer service group according to an embodiment of the present invention includes a host component P2P network 410 and a guest P2P network component 420 as a main component and a proxy host peer proxy host of P2P network 430 and a relay of P2P network 440 and may include an observer of P2P network 450. [

The host peer 410 may provide peer-to-peer (P2P) services over a peer service group as a peer that creates a peer service group. That is, the host peer 410 may be an initiator, as an element that can start the peer service. In addition, the host peer 410 can define the mission and peer group of the peer service group and authenticate another peer that requested the subscription.

The guest peer 420 may be a peer participating in a peer service group, providing services to other peers included in the peer service group, or receiving services from other peers. That is, the guest peer is a participating component of the peer service group and may be a participant.

The proxy host peer 430 is a peer that can perform the role of the host peer 410. When the host peer 410 leaves the peer service group or is asked to act as a host peer from the host peer 410, And operates on behalf of the host peer 410.

Relay peer 440 is a peer that can relay messages in the peer service group. That is, the relay peer 440 can relay messages between the peers when a wireless link between the host peer 410 and the guest peer 420 or between the guest peer 420 is not connected.

The observer peer 450 can observe a message transmitted / received between the host peer 410 and the guest peer 420 without participating in the configuration of the peer service group.

The link of the peer service group includes a host-guest link, a host-proxy host link, a proxy host-guest link, a host-relay link, a guest-relay link, .

5 is a flowchart illustrating a process of initializing a peer included in a peer service group according to an embodiment of the present invention.

Each peer has device capability information and network service capability information as initial information. At this time, the device usable information may be master clock capable, proxy host capable, peer relay capable, main powered, security capable, A dedicated control channel, and an always on receiver. The network service availability information is information indicating the capability of the network to support the application service of the wireless peer service group, and includes host capable, real-time capable, reliable connection capable, Group connection capable, and burst traffic capable. The peer can determine the role in the peer service group and initialize itself according to the device availability information and the network service availability information.

First, the user requests a peer service from the peer (S501). At this time, if the power is turned on to the peer or the peer moves to another area, the peer receives the frame from the peripheral peer service group that was being monitored to synchronize with the surrounding peer service group (S502).

When the peer receives a frame from the neighboring peer service group, the peer synchronizes with the neighboring peer service group using a network clock synchronization frame of the received frame (S503).

Thereafter, the peer checks whether the peer service group providing the requested peer service is present around the received frame (S504). If there is a peer service group providing the requested peer service in the vicinity, the peer joins the peer service group (S505). However, if the peer service group providing the requested peer service does not exist in the vicinity, the peer confirms the network service available information to create a peer service group capable of providing the requested peer service. If the network service availability information is hostable (S506), the peer service group searches for another peer (S507). However, if the network service availability information is not hostable, the next wake-up time is set and the sleep mode is switched (S508).

On the other hand, if the peer does not receive the frame, the peer confirms whether the device usable information is master clock enable and main power supply (S509). If the device usable information is master clock enable and main power supply, the peer broadcasts the synchronous frame and confirms the network service available information (S510, S511). If the network service availability information is hostable, another peer is searched so as to create a peer service group (S512).

However, if the network service availability information is not hostable, the next wake-up time is set and the sleep mode is switched (S513).

On the other hand, if the device availability information of the peer does not have the master clock enable and the main power supply, the peer tries to synchronize by adjusting the sync listen interval (S514). If synchronization of clock synchronization is successful within the number of synchronization attempts (S515), the peer waits for frame reception (S516). However, if the determined number of synchronization attempts is exceeded, the peer relinquishes the synchronization (S517).

6 is a flowchart illustrating a method of generating a peer service group according to an embodiment of the present invention.

First, among the peers of the peer service group, the host peer 410 analyzes the service profile of the peer service group stored in the peer, and analyzes the information about the network service procedure, the type and minimum required number of devices constituting the network, Scheduling information for assigning link resources, and the like are prepared (S601).

The host peer 410 then monitors the neighboring peer service groups and performs clock synchronization with the neighboring peer service groups. At this time, the host peer 410 obtains a pre-peer list from the capability advertisement information of the peripheral device received through the network synchronization procedure, and detects the peer network start time is selected (S602).

Thereafter, the host peer 410 may proceed to generate the peer service group peer service group differently according to the phase of the peer service group (S603). At this time, the phase of the peer service group can be determined by the requested peer service group service.

First, with reference to FIG. 6 (A), a process of creating a peer service group starting from a handshaking phase will be described. In the handshaking phase, a peer discovery request of the host peer 410 and a data request from the guest peer can be simultaneously performed (S604). For example, in the handshaking phase, the host peer 410 may transmit the requested data along with the peer discovery request. Upon receipt of a peer discovery response or an acknowledgment (ACK) within a preset time (S605), the host peer 410 completes the creation of the peer service group (S606). However, if the peer search response or the peer data is not received within the preset time, the host peer 410 transmits the data again with the peer search request (S607). If there is no peer search response or peer data after a predetermined time (S608), the host peer 410 determines that the peer service group creation fails (S609).

Referring to FIG. 6B, when the peer service is not started in the handshaking phase, peering may or may not be required (S610). If peering is not required, the host peer 410 transmits a peer search request and waits for a response (S611). If there is no peer search response within a predetermined time (S612), the host peer 410 transmits a peer search request again (S613). If the peer search response is not received after the retransmission of the peer search request, the host peer 410 determines that the peer service group creation has failed (S614, S615). Upon receipt of the peer search response, the P2P data phase is entered immediately, that is, the peer service group creation is completed (S616).

If peering is required, the host peer 410 transmits a peer search request and waits for a response (S617). If there is no peer search response within a preset time, the host peer 410 transmits the peer search request again (S618, S619). If the peer search response is not received after retransmission of the peer search request, the host peer 410 determines that the peer service group creation has failed (S620, S621). Upon receiving the peer search response, the host peer 410 enters the peering phase. The following describes the peering phase.

When the guest peer 420 sends a peer search response, the guest peer 420 sends peering request information along with the service profile (S622), the host peer 410 sends a peering response (S623).

However, if a peering procedure is defined separately from the peer search procedure according to the service profile, the host peer 410 transmits a peering request to the guest peer 420 that has transmitted the peer search response and waits (S624) . If there is no response to the peering request from the guest peer 420 within the predetermined time, the host peer 410 transmits the peering request again (S625, S626). If the peering response is not received even after retransmission of the peering request, the host peer 410 determines that the peering has failed (S627). However, upon receiving a peering response within a preset time, the host peer 410 completes the peering by transmitting a peering response (S623, S628). The host peer 410 enters the P2P (data) phase after the peering phase.

7 is a diagram illustrating a MAC frame header of a peer service group according to an embodiment of the present invention.

7, a MAC frame header of a peer service group according to an exemplary embodiment of the present invention includes a peer service group ID, a destination peer device ID, a source peer device ID peer Device ID, a service phase descriptor, and a frame transmission time.

The peer service group identifier may include a service class of peer group, a peer service profile ID, and a local peer group ID.

The target peer identifier may include a type of the target peer (peer Device Type) and a local device ID.

The source peer identifier may include a type of the source peer (peer Device Type) and a local device ID.

The service phase descriptor includes a service phase configuration and a superframe structure and length information of a search phase, a peering phase, a P2P data phase, and a handshaking phase.

The frame transmission time includes a service phase identifier (Service Phase ID) and a superframe offset in a superframe.

The peer service group according to the embodiment of the present invention can gather peer-to-peer links for a specific mission to construct a peer-to-peer link. Thus, the peer service group identifier consists of the mission identifier of the peer service group and the multiple peer service group identifier. The mission identifier of the peer service group consists of the peer service class and the service profile identifier. Here, the multiple peer service group identifier is a local peer group identifier, which is used to distinguish a plurality of peer service groups from other peer service groups performing the same mission.

On the other hand, for the peer service, a service phase descriptor is passed to each peer. The service phase technician can display the service phase configuration according to the mission, the superframe structure for each phase, and the data transfer characteristics between the peers. Peer service group

 The peer identifier includes a destination peer identifier and a source peer identifier. The peer identifier may indicate a peer-to-peer connection relationship, and P2P relationship information indicating the relative location of the peer via the peer identifier may be collected. A P2P relationship map may then be provided to each peer included in the peer service group via the host peer 410. [

The frame transmission time may indicate a slot in the superframe of the service phase in which the frame is transmitted.

8 is a diagram illustrating a link displayed as a super frame according to an embodiment of the present invention.

The peer service group uses a fixed-length basic time slot as a unit of time resource. In FIG. 8, each link resource is represented by a relative length to a basic time slot, and the length of the basic time slot is a media access control (MAC) of a standard length based on a transmission rate of a physical layer (PHY) ) Can be displayed as to how many frames can be transmitted.

8, a group link is used when the host peer 410 or the proxy host peer 430 dedicatedly forwards a message or group-casts a message to all peers contained in the peer service group Link resources. The host peer 410 accesses the link resources with priority based slotted carrier sense multiple access / collision avoidance (CSMA / CA) and the proxy host peer 430 accesses the slotted carrier sense multiple access / slotted CSMA / CA. The guest peer 420 accesses the link resource with the slotted CSMA / CA. The back-off may be assigned a hashed value according to the peer identifier (device ID).

The contention link is a link resource used when a message is exchanged between the guest peer 420 and the host peer 410 or between the guest peer 420 and the guest peer 420 interactively. The host peer 410 and the guest peer 420 access the link resources with the slotted CSMA / CA. The backoff may be assigned a hashed value according to the device identifier of the peer.

A non-contention link is a pre-allocated link resource through the peer-to-peer peering procedure of the peer service group. A non-contention link may be established as a peer-to-peer unidirectional link or a bi-directional link. Each peer may access the link resources with a slotted CSMA / CA on a bi-directional link, and the backoff may be assigned a hashed value according to the peer's device identifier.

The relay link resource is a link resource used when relaying a message of the host peer 410 to the guest peer 420 or relaying the message of the guest peer 420 to the host peer 410. [ The relay from the host peer 410 to the guest peer 420 accesses the link resources with the prioritized slotted CSMA / CA and the relay between the guest peers 420 accesses the link with the slotted CSMA / CA.

An idle resource is a period during which each peer in a peer service group does not attempt to deliver a message concurrently. When idle resource is in a sleep mode for energy saving, or when a peer service group And the link resource used when allocating the resource to the user.

The peer service group according to the embodiment of the present invention can be operated through the allocation order of each link resource shown in FIG. 8, the number of time slots corresponding to link resources, and the like. In this case, the phase of the peer service group, which is a combination of link resources, may have various combinations depending on the mission of the peer service group and the characteristics of the components. Each service phase may be configured as a superframe, and each superframe may be repeated until the corresponding service phase is terminated.

9 is a diagram illustrating a method of configuring a phase according to a peer service according to an embodiment of the present invention.

The peer service group according to the embodiment of the present invention may be different in the link resource allocation method according to the step of the service, and may be expressed in the order of the phase composed of the superframe. At this time, the phase of the peer service group may include a discovery phase, a peering phase, a P2P phase, and a handshaking phase.

First, the search phase transmits an advertisement of the host peer 410 to constrain the peer service group when the peer service group is continuously operated and maintained, or transmits an advertisement of the peer service group to the peer service group And searching the constituent devices of the service group.

The peering phase is a step of allocating link resources to the peer to be joined in the peer service group after the search phase.

The handshaking phase is the step of allocating link resources for peer discovery and data exchange without peer peering.

In each service phase, the superframe structure can be determined for each phase according to the service profile.

FIG. 9A shows a service of a peer service group when the peer service group is continuously operated and maintained over a long period of time. In this case, the search phase, the peering phase and the P2P data phase are alternately arranged. The release of the peer service group is determined by the peer service group release command of the host peer 410.

FIG. 9B shows the service of the peer service group when the peer service group is operated and maintained for a short period of time. In this case, an extended P2P data phase is arranged after the search phase. The release of the peer service group is determined by the host peer 410 notifying that the particular P2P data phase is the last (end of P2P, EOP).

FIG. 9C shows a service of a peer service group when the mobile communication device instantaneously configures a peer service group and data transmission time is allowed for a short time. In this case, only the handshaking phase can be arranged.

FIG. 9D shows the service of the peer service group when the mobile communication device instantaneously configured the peer service group but the data transmission time is secured. In this case, the P2P data phase can be placed after the handshaking phase. The release of the peer service group may be determined if the host peer 410 informs that the particular P2P data phase is the last or if no P2P data is transmitted for a certain period of time.

10 is a diagram showing a super frame of each phase according to the peer service according to the embodiment of the present invention.

Referring to FIG. 10 (A), in the search phase, a dormant link, a group link, a competitive link, and a relay link are arranged in order, and a time slot length is determined for each link. At this time, depending on the target time required for creating the peer service group, the size of the peer member of the peer service group (for example, the number of peers included in the multiple peer service group), the transmission distance of the peer service group, The allocation pattern of the link resource and the length of the time slot may be different.

In the search phase, the host peer 410 determines the dormant link and searches the neighboring peer service group to determine the superframe start time. Next, the host peer 410 delivers a search message including a peer group descriptor, a discovery phase descriptor, a peering phase descriptor, and the like in the group link section. Upon receiving the search message, the relay peer 440 retransmits the search message in the relay interval.

In the search phase, the guest peer 420 may maintain a listening mode for a predetermined time slot according to a wake-up period by a quorum operation of the peer service group. At this time, the guest peer 420 can search the neighboring peer service group as the observer peer 450 to collect information. If the guest peer 420 finds the search message, it sends a search response with the neighboring peer information in the nearest guest link interval.

Referring to FIG. 10B, in the P2P data phase, a group link, a competitive link, a non-competitive link, a dormant link, and a relay link are sequentially arranged, and the length of a time slot is determined for each link. At this time, the pattern in which the link resource is allocated and the length of the time slot may vary depending on the mission of the peer service group, the size of the message generated between the peers, the number of peer service group peers, and the transmission distance reference of the peer service group. Link access can be based on existing link access methods, depending on the link usage device.

Referring to FIG. 10C, in the handshaking phase, a group link, a dormant link, a contention link, and a dormant link are sequentially arranged, and a length of a time slot is determined for each link. At this time, depending on the pattern in which the link resource is allocated and the length of the time slot depending on the target time required for collecting the information of the peer service group, the size of the peer member of the peer service group, the mission of the peer service group, . Link access can be based on existing link access methods, depending on the link usage device. A plurality of link resource allocation combinations can be repeated to form one handshaking phase.

In the handshaking phase, the host peer 410 receives a P2P network descriptor, a handshaking phase descriptor, a P2P data phase descriptor (which may not be included in some cases) And the like). If the link resource allocation method comprises only a handshaking phase, the guest peer 420 may send a data message. Relay does not work in handshaking phase.

11 is a diagram illustrating a method of correcting time synchronization among peer service groups according to an embodiment of the present invention.

Referring to FIG. 11, when a plurality of peer service groups are operated at the same time, the peer service group mutual time synchronization correction method can be known. The time synchronization method of the peer service group includes a method in which a plurality of peer service groups exchange messages with each other to correct time synchronization, and a time synchronization correction method by an external network.

Referring to FIG. 11A, a peer device (PD) included in a peer service group corrects the synchronization based on the time of the host peer 410. That is, the peer device can exchange the message with the host peer 410 and estimate the arrival time of the exchanged message to correct the time synchronization. When correcting the time synchronization among a plurality of peer service groups, the synchronization is corrected in another peer service group based on the host time of the first peer service group configured first. In this case, the host peer 410 of the other peer service group can correct the time synchronization by participating in the first peer service group with the observer peer 450 of the first peer service group. At this time, the start position of the actual time slot is designated in consideration of the correction error of the time synchronization.

Referring to FIG. 11B, when a device using a PAC capable network is connected to a different type of global network, both networks can be synchronized based on the time of the global network. In this case, a separate time synchronization procedure is not required for each of the peer service groups, and time synchronization can be performed even in a multi-peer service group.

12 is a diagram illustrating a method of allocating link resources of a multi-peer service group according to an embodiment of the present invention.

Referring to FIG. 12, each device in the multiple peer service group competing with each other to occupy the link resources of the multiple peer service group.

12A shows a case where there are a plurality of wireless channels (channel 0 to channel 3) capable of simultaneously operating peers included in a plurality of peer service groups. At this time, the host peer 410 scans the neighboring peer service group to select the peer service group channel. The search message transmitted by the host peer 410 may be propagated through a common channel.

FIG. 12B shows a case where there is one wireless channel (channel 0) capable of simultaneously operating peer devices included in a plurality of peer service groups. At this time, the host peer 410 scans the neighboring peer service group to find a pause slot, thereby avoiding maximum link access competition. When a peer device competes with another peer device, the peer device can operate according to the CSMA / CA access method specified for each link.

As described above, according to the embodiment of the present invention, each of the peers in the peer service group can actively generate a peer service group by analyzing the service profile. In addition, The resource utilization efficiency of the peer service group can be increased and the peer service group can be effectively operated according to the mission of the peer service group, the scale of the peer service group, and the characteristics of each of the peers included in the peer service group.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the invention is not limited to the disclosed exemplary embodiments, It belongs to the scope of right.

Claims (20)

A method for a peer to create a peer service group,
Confirming that a first peer service group providing a requested peer service from a user exists in the vicinity,
Participating in a first peer service group if there is a first peer service group, and
If the first peer service group does not exist, generating a second peer service group providing the peer service
/ RTI > The method of claim 1,
Before the confirming step,
Searching for a frame transmitted from a neighboring peer service group, and
If the frame exists, synchronizing using the synchronization frame among the frames
To the peer service group. 3. The method of claim 2,
If the frame does not exist, re-adjusting the interval of receiving the frame and searching again for the existence of a frame transmitted from the neighboring peer service group
To the peer service group. 3. The method of claim 2,
If the frame does not exist, checking whether the peer can broadcast the synchronous frame through the device availability information stored in the peer
To the peer service group. 5. The method of claim 4,
Wherein the step of verifying that the peer is capable of broadcasting the synchronization frame comprises:
Confirming via the device availability information that the peer is master clock capable and main powered
/ RTI > 5. The method of claim 4,
Broadcasting the synchronization frame if the peer is able to broadcast the synchronization frame,
Confirming whether the peer can search for another peer through the network service available information stored in the peer;
If the peer is able to search for the other peer, searching for the other peer, and
Setting the next wake-up time and switching to a sleep mode if the peer is unable to discover the other peer
To the peer service group. The method of claim 1,
Wherein the generating comprises:
Confirming whether the peer can search for another peer through the network service available information stored in the peer;
If the peer is able to search for the other peer, searching for the other peer, and
Setting the next wake-up time and switching to a sleep mode if the peer is unable to discover the other peer
/ RTI > 8. The method of claim 7,
Wherein the searching for the other peer comprises:
Sending a peer discovery request and data if the second peer service group is a handshaking phase,
If the peer search response or the acknowledgment (ACK) is not received within a first predetermined time, retransmitting the peer search request and data; and
Completing the creation of the second peer service group upon receiving the peer search response or the ACK within the first time period
/ RTI > 9. The method of claim 8,
Wherein the searching for the other peer comprises:
Completing the generation of the second peer service group upon receipt of the peer search response or the ACK within a second predetermined time after the retransmission; and
And if it fails to receive the peer search response or the ACK within the second time, determining that the second peer service group has failed to be generated
To the peer service group. 8. The method of claim 7,
Wherein the searching for the other peer comprises:
Determining if peering is necessary if the second peer service group is not a handshaking phase,
If the peering is not needed, sending a peer search request,
Retransmitting the peer search request if the peer search response is not received within a predetermined first time, and
And upon completion of the generation of the second peer service group upon receiving the peer search response within the first time period
/ RTI > 11. The method of claim 10,
Wherein the searching for the other peer comprises:
Completing the creation of the second peer service group upon receipt of the peer search response within a second predetermined time after retransmission; and
Determining that the second peer service group has failed to be generated if the peer search response is not received within the second time period
To the peer service group. 11. The method of claim 10,
Wherein the searching for the other peer comprises:
If the peering is required, sending a peer search request,
Retransmitting the peer search request if the peer search response is not received within a predetermined first time,
Confirming whether the peering request information is received when the peer search response is received within the first time,
If the peering request information has been received, transmitting a first peering response, and
Completing the creation of the second peer service group
To the peer service group. The method of claim 12,
If the peering request information has not been received, transmitting a peering request;
Sending a third peering response if a second peering response for the peering request is received, and
Completing the creation of the second peer service group
To the peer service group. The method of claim 13,
Retransmitting the peering request if the second peering response is not received,
Sending a fifth peering response when a fourth peering response for the retransmitted peering request is received, and
Completing the creation of the second peer service group
To the peer service group. 11. The method of claim 10,
Wherein the searching for the other peer comprises:
Transmitting the peer response and completing the creation of the second peer service group upon receipt of the peer search response within a second predetermined time after retransmission; and
Determining that the second peer service group has failed to be generated if the peer search response is not received within the second time period
To the peer service group. 8. The method of claim 7,
Wherein the peer performs a server role, defines a mission and a peer group of a peer service group, and is a host peer authenticating the other peer. 17. The method of claim 16,
Wherein the other peer is a guest peer requesting the host peer to create a peer service group. A method for a peer to access a link resource of a peer service group,
Receiving a service phase descriptor, and
Accessing the link resources according to the service phase descriptor
Lt; / RTI >
Wherein the service phase descriptor includes information about a service phase determined according to a peer service requested by a user. The method of claim 18,
The information on the service phase may include,
The search phase, the peering phase, the P2P data phase, and the handshaking phase,
Each of the phases being represented by a superframe comprising at least one of a group link, an idle link, a competing link, a non-competing link, and a relay link. 20. The method of claim 19,
Determining a start time of the superframe when the service phase is a search phase, and
Transmitting a search message from the first group link to another peer
Further comprising:
Wherein the peer accesses the first host link in a priority-based slotted carrier sense multiple access / collision avoidance (CSMA / CA) scheme.
KR1020140057465A 2013-05-13 2014-05-13 Method for generating of peer service group and accessing of link resources KR20140134241A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US14/276,637 US20140334338A1 (en) 2013-05-13 2014-05-13 Method of generating peer service group and accessing link resources in peer service group

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
KR20130053893 2013-05-13
KR1020130053893 2013-05-13
KR1020130083896 2013-07-17
KR20130083896 2013-07-17

Publications (1)

Publication Number Publication Date
KR20140134241A true KR20140134241A (en) 2014-11-21

Family

ID=52455422

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020140057465A KR20140134241A (en) 2013-05-13 2014-05-13 Method for generating of peer service group and accessing of link resources

Country Status (1)

Country Link
KR (1) KR20140134241A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112543233A (en) * 2020-12-04 2021-03-23 国网信息通信产业集团有限公司 Intranet penetrating system

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112543233A (en) * 2020-12-04 2021-03-23 国网信息通信产业集团有限公司 Intranet penetrating system

Similar Documents

Publication Publication Date Title
JP7020548B2 (en) On-demand route synchronization and beamforming in wireless networks
CN105103644B (en) Method, equipment and readable medium for the conflict management in neighborhood aware network
EP2617258B1 (en) D2d communication procedures: beaconing; broadcast; conflict resolution
KR101594559B1 (en) Directional discovery protocol with coordinated channel selection
JP2021509241A (en) Discovery of multi-band millimeter waves in a WLAN distributed network
EP3782389B1 (en) Scheduled and triggered mmw discovery assistance by lower band signaling
US20140334338A1 (en) Method of generating peer service group and accessing link resources in peer service group
KR20140096317A (en) Method for supporting device to device synchronization and identification in wireless access system that supports device to device communication
RU2769960C2 (en) Media access control for full-duplex communication
US9155115B2 (en) Method and apparatus for generating connection identifier for device-to-device communication
KR101692661B1 (en) Slot-based d2d communication method and apparatus
KR20140134241A (en) Method for generating of peer service group and accessing of link resources
JP5506651B2 (en) Wireless network having star topology and method for operating the wireless network
EP3942888B1 (en) Optimized unicast and broadcast communication in time-slotted channel hopping primary and secondary networks
WO2014126444A1 (en) Method and apparatus for device-to-device communication in wireless communication system
US10491512B2 (en) Supporting packet query-response transactions at lower layer
Kang et al. A fast ad-hoc neighbor discovery algorithm based on a friend trust mechanism
KR20050066275A (en) Access method between mobile terminals in mobile ad hoc network and mobile terminal therefor
Uemura An efficient multicasting method without a base station

Legal Events

Date Code Title Description
WITN Withdrawal due to no request for examination