KR102164060B1 - Method for operating of peer aware communication network - Google Patents

Abstract

In a peer aware communication network, a peer device determines a phase according to a peer service to be provided to another peer device, and accesses a link included in a superframe of a predetermined length according to the phase. A method of accessing a link, a method of reserving a resource of a peer device, and a method of avoiding interference by a peer device are provided.

Description

How to operate a peer aware communication network {Method for operating of peer aware communication network}

The present invention relates to a method of operating a peer-aware communication network, such as a link access method, a resource reservation method, and an interference avoidance method of a peer device included in a peer-aware communication network.

In the Internet of things (IoT), in order for objects located in the same space to recognize changes in space conditions and adaptively respond to events, grouping between objects and collaboration between grouped objects are required.

Multiple objects included in the same space belong to at least one group and operate as a client or server in peer-to-peer (P2P), and can transmit and receive control information, sensing information, location information, advertisements or multimedia contents with each other. I can. For this, a peer service group should be configured so that multiple things can access various resources.

There is an IEEE 802.15.4 series of standards as a prior art for network configuration based on a low-power wireless link. Conventional wireless personal area network (WPAN) technology can configure a P2P link between full function devices by controlling a master coordinator for network configuration and a network.

However, it is difficult for one device to simultaneously participate in a plurality of networks and to provide a plurality of P2P links in a plurality of networks without overall control.

In addition, when one device participates in multiple service groups at the same time, the link resources of all peer service groups included in the space without resource scheduling and access control of the master coordinator of the peer service group are communicated between peers. communication) should be used optimally. Therefore, there is a need for an autonomous link resource allocation method and an access control method capable of avoiding collision between messages. In addition, a protocol between devices included in a peer service group based on a low-power radio link is required to operate each peer service group included in the space.

An object of the present invention is to provide a link resource access method, a resource reservation method, and an interference avoidance method for operating a peer service group.

According to an aspect of the present invention, a method of accessing a link by a peer device in a peer-aware communication network is provided. The link access method includes determining a phase according to a service to be provided to another peer device, and accessing a link included in a superframe having a predetermined length according to the phase.

In the link access method, a superframe may include at least one synchronization interval.

In the link access method, the synchronization interval may include at least one of a synchronization interval, a search interval, a control interval, a CL interval, a CO interval, and an idle interval.

In the link access method, the synchronization interval may include at least one of a synchronization slot, a discovery slot, a control slot, a CA-Data slot, a CF-Data slot, and an idle slot.

In the link access method, the synchronization interval may include a predetermined number of subslots.

In the link access method, the length of the subslot is 12usec, and the synchronization interval may include 8,334 subslots.

In the link access method, a synchronization slot, a discovery slot, a control slot, a CA-data slot, a CF-data slot, and an idle slot may include at least one subslot.

In the link access method, the superframe may be a cyclic superframe including an active superframe and an inactive superframe.

In the link access method, when a phase is a search phase, an active superframe may include a synchronization interval and a search interval, and an inactive superframe may include a search interval.

In the link access method, when a phase is a peering phase, an active superframe may include a synchronization interval, a search interval, and a control interval, and an inactive superframe may include a control interval.

In the link access method, when the phase is a P2P data phase, the active superframe includes at least one of a synchronization period, a search period, a control period, a CL period, and a CO period, and the inactive superframe includes a synchronization period and an idle period. I can.

In the link access method, when the service is a one-way connectionless message transmission service, the peer device may transmit an advertisement frame or a discovery frame along with data, and the superframe includes a synchronization section, a discovery section, an idle section, a CL section and an idle section. It may include a synchronization interval to include.

In the link access method, when the service is a two-way connectionless message transmission service, the peer device may transmit a request frame or a response frame with data, and the superframe includes a synchronization period, a search period, a control period, a CL period, and an idle period. It may include a first synchronization interval and a second synchronization interval including a synchronization period, a search period, a pause period, a CL period, and a pause period.

In the link access method, when the service is a delay-allowing message transmission service, the peer device can create a CA link after searching for another peer device, and the superframe is a synchronization interval, a search interval, a control interval, a CL interval, and a pause. A synchronization interval including a section may be included.

In the case where the service is a mixed-type traffic service in the link access method, the superframe is a first synchronization interval and a synchronization interval including a synchronization interval, a search interval, a control interval, a CL interval, a CO interval, and an idle interval, a search interval, and a pause. It may include a second synchronization interval including a section, a CL section, and a pause section.

In the case where the service is a reliable message transmission service in the link access method, the peer device can create a CA link after searching for another peer device, and the superframe is a synchronization interval, a search interval, a control interval, a idle interval, and It may include a synchronization interval including the CO interval.

In the link access method, when the service is an open-configuration superframe service, the peer device can select the use of the slot and the length of the superframe included in the synchronization interval of the superframe, and the superframe is based on the superframe structure information element. Can be advertised.

According to another aspect of the present invention, a method for a peer device to reserve a resource in a peer-aware communication network is provided. The resource reservation method includes: scanning a control slot of another neighboring peer device, selecting a superframe and a slot included in the superframe based on a hashed value of the peer link ID, and requesting peering to another peer device And transmitting.

According to another aspect of the present invention, a method for a peer device to avoid interference between a plurality of peer groups in a peer-aware communication network is provided. The interference avoidance method includes, when a peer device is a participant of a first peer group among a plurality of peer groups, accessing a resource according to a priority of a type of service performed by the plurality of peer groups, and the peer device In the case of an initiator of a second peer group among peer groups, selecting a start time of a superframe and accessing a resource according to a priority of a type of service performed by the plurality of peer groups.

In the interference avoidance method, when the peer device is the initiator of the second peer group, the step of performing opportunistic transmission based on the planned statistical access may be further included.

According to an embodiment of the present invention, in a single peer group, a multi-peer group, or a temporary peer group, the peer device efficiently accesses the link resource according to the type of service and the required quality without resource scheduling and access control of the master coordinator, Reserve resources and avoid interference.

1 is a diagram illustrating a plurality of peer service groups located in a space and a plurality of objects included in a peer service group equipped with a wireless device.
2 is a diagram illustrating a peer service group using a low-power wireless link according to an embodiment of the present invention.
3 is a diagram illustrating an address frame indicating an address of a peer service group according to an embodiment of the present invention.
4 is a diagram illustrating an address frame indicating an address of a device according to an embodiment of the present invention.
5 is a diagram illustrating a peer service group device profile according to an embodiment of the present invention.
6 is a diagram illustrating a device advertisement frame transmitted by a peer according to an embodiment of the present invention.
7 is a diagram illustrating an MPDU frame according to an embodiment of the present invention.
8 is a diagram illustrating a MAC frame according to another embodiment of the present invention.
9 is a diagram illustrating a network topology of a peer service group according to an embodiment of the present invention.
10 is a diagram illustrating resource allocation according to an embodiment of the present invention.
11 is a diagram illustrating a method of configuring a phase of a peer service according to an embodiment of the present invention.
12 is a diagram illustrating a superframe of each phase according to an embodiment of the present invention.
13 is a diagram illustrating a link resource access method according to an embodiment of the present invention.
14 is a diagram showing a superframe structure according to an embodiment of the present invention.
15 is a diagram showing a superframe structure according to another embodiment of the present invention.
16 is a diagram illustrating a superframe of a cyclic structure according to another embodiment of the present invention.
17 is a diagram illustrating interference avoidance between heterogeneous superframes according to an embodiment of the present invention.
18 is a flowchart illustrating a peer initialization method according to an embodiment of the present invention.
19 is a flowchart illustrating a method of creating a peer service group by a host peer according to an embodiment of the present invention.
20 is a diagram illustrating a peer discovery request frame according to an embodiment of the present invention.
21 is a diagram illustrating a time slot of a PAC device synchronizing to a master clock of a peer service group according to an embodiment of the present invention.
22 is a diagram illustrating a synchronization frame transmitted by a peer according to an embodiment of the present invention.
23 is a diagram illustrating a resource allocation scheduling method of a peer service group according to an embodiment of the present invention.
24 is a diagram illustrating time slots allocated to a peer discovery phase and a P2P data phase according to an embodiment of the present invention.
25 is a diagram illustrating a time slot allocated to a peer discovery phase and a P2P data phase according to another embodiment of the present invention.
26 is a flowchart illustrating an interference mitigation method according to an embodiment of the present invention.
27 is a diagram illustrating a peer group created between peer service groups according to an embodiment of the present invention.
28 is a diagram illustrating broadcasting of a group of PAC devices according to an embodiment of the present invention.
29 is a diagram illustrating a multi-hop relay method according to an embodiment of the present invention.
30 is a diagram according to an embodiment of the present invention
31 is a diagram illustrating selection of a relative position according to an embodiment of the present invention.
32 is a diagram illustrating an interaction with an upper layer of a peer service group according to an embodiment of the present invention.
33 is a diagram illustrating a network service method and a link resource allocation method according to an embodiment of the present invention.
34 is a flowchart showing a PDME-START procedure according to an embodiment of the present invention.
35 is a flowchart illustrating a PDME-DISCOVER procedure according to an embodiment of the present invention.
36 is a flowchart illustrating a PDME-ADVERTISE procedure according to an embodiment of the present invention.
37 is a flowchart showing a PDME-PEER procedure according to an embodiment of the present invention.
38 is a flowchart illustrating a PD-DATA procedure according to an embodiment of the present invention.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those of ordinary skill in the art may easily implement the present invention. However, the present invention may be implemented in various forms and is not limited to the embodiments described herein. In the drawings, parts irrelevant to the description are omitted in order to clearly describe the present invention, and similar reference numerals are assigned to similar parts throughout the specification.

Throughout the specification, when a part "includes" a certain component, it means that other components may be further included rather than excluding other components unless otherwise stated. In addition, terms such as "...unit", "...unit", "...group", "module", and "block" described in the specification mean a unit that processes at least one function or operation, which is a software or microprocessor. It may be implemented by hardware such as, or a combination of software and hardware.

1 is a diagram illustrating a plurality of peer service groups located in a space and a plurality of objects included in a peer service group equipped with a wireless device. 1, a plurality of peer service groups exist in an arbitrary space A. In addition, each peer service group includes a plurality of objects, and wireless devices are mounted on the plurality of objects. Through the wireless device, a plurality of things can communicate with other things, and a peer service group can provide and receive services.

For example, in FIG. 1, thing 1, thing 2, and thing 3 may configure a peer service group 1 to perform service 1. Thing 2, Thing 3, Thing 4, and Thing 5 may form a peer service group 2 to perform service 2. Thing 3, Thing 4, and Thing 6 may form a peer service group 3 to perform service 3. In this case, each peer service group may be a peer service group. Referring to FIG. 1, things 2 and 4 are simultaneously included in peer service group 1 and peer service group 2, respectively. Thing 3 participates in Peer Service Group 1, Peer Service Group 2, and Peer Service Group 3.

2 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. 2 may include a peer aware communication (PAC) network, and in an embodiment of the present invention, each peer may discover a peer to create a peer service group or participate in a peer service group. have.

A peer service group according to an embodiment of the present invention includes a host peer 410 and a guest peer 420 as main components, and a proxy host peer 430 and a relay peer 440 as auxiliary components, It may include an observer peer 450.

The host peer 410 is a peer that creates a peer service group and may provide a P2P service through a peer service group. That is, the host peer 410 is a component capable of starting a peer service, and may be an initiator. In addition, the host peer 410 may define a mission and a peer group of a peer service group, and authenticate another peer that has requested to join.

The guest peer 420, as a peer participating in the peer service group, may provide a service to another peer included in the peer service group or receive a service from another peer. That is, the guest peer is a component that participates in 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 instead, and when the host peer 410 leaves the peer service group or receives a request for the role of the host peer from the host peer 410 Operates on behalf of the host peer 410.

The relay peer 440 is a peer capable of relaying messages in a peer service group. That is, when the wireless link between the host peer 410 and the guest peer 420 or between the guest peer 420 is not connected, the relay peer 440 may relay a message between peers.

Further, the observer peer 450 does not participate in the configuration of the peer service group, but may observe messages transmitted and received between the host peer 410 and the guest peer 420.

The links of the peer service group include host-guest link, host-proxy host link, proxy host-guest link, host-relay link, guest-relay link, etc., and each link has radio channel resources and time resources as communication resources. Are distributed.

3 is a diagram illustrating an address frame indicating an address of a peer service group according to an embodiment of the present invention.

Referring to FIG. 3, the peer service group ID may include a service class of a peer service group, a service profile identifier of a peer service group, and a local peer network identifier. . In this case, the service class refers to the service priority of the peer service group. And the peer service group service profile identifier is used to identify a service provided by the peer service group, and registration is required. The local peer service group identifier may be used to identify one of the neighboring peer service groups providing the same service.

4 is a diagram illustrating an address frame indicating an address of a device according to an embodiment of the present invention.

Referring to FIG. 4, the device ID includes a global device identifier and a local device identifier. The entire device identifier may be 64 bits, and the local device identifier may be 16 bits.

In addition, the local device identifier may include a group identifier, a local PAC device identifier, and a reserved local PAC device identifier for special purpose.

The group identifier '0x0' means a local device identifier included in the peer service group, and the group identifier '0xf' means broadcast for the peer service group.

The local PAC device identifier may be a unique identifier in the peer service group, and may be generated by hashing based on the entire device identifier, the capability of the device, and the peer service group service profile identifier.

If the reserved local PAC device identifier for special purpose is '0x000', it means the host of the peer service group, if it is '0x001', it means the proxy host of the peer service group, and if it is '0xfff', it means broadcast or groupcast.

In an embodiment of the present invention, a nearby PAC device may be identified through a combination of a'network ID', a'group ID', and a'local device ID'. One PAC device may have a plurality of peer IDs.

5 is a diagram illustrating a peer service group device profile according to an embodiment of the present invention.

In an embodiment of the present invention, the peer service group device profile is required because the PAC device may have a plurality of peer service group device addresses for each peer service group. The device capability of the device profile may indicate whether a master clock is possible and whether a host, a proxy host, and a relay are possible. Further, the device capability may indicate a dedicated control channel PHY and an always on receiver PHY. In addition, the device capability may indicate main powered and security capabilities.

Among the device profiles, service capability may represent a list of capable peer network service profiles.

6 is a diagram illustrating a device advertisement frame transmitted by a peer according to an embodiment of the present invention.

In an embodiment of the present invention, a device advertisement frame may be used to periodically report a status of a PAC device (ie, a peer device) that has successfully initialized.

A device advertisement frame according to an embodiment of the present invention includes device capability, device service capability, service profile list, and joined peer network list. It may include.

At this time, the device not participating in the peer service group may be omitted from the subscribed peer service group list field, and the transmission period of the device advertisement frame transmitted from the PAC device not participating in the peer service group is also another device included in the peer service group. Can be relatively short compared to

7 is a diagram illustrating an MPDU frame according to an embodiment of the present invention.

Referring to FIG. 7, an MPDU frame according to an embodiment of the present invention includes a link frame header, link frame information, a link frame payload, and a link frame tail. frame tail).

The link frame header may include a frame control field, a peer service group identifier, a peer service group address, and a peer service group authenticator.

In this case, the frame control field may include information on a version (3 bits), type (3 bits), and length (10 bits) of the frame. The frame types of the frame control field include broadcast, peer discovery, peer service group management, and peer service group data. In addition, the link frame type in the link frame header includes information on the pre-network formation and after-network formation of the network, and the control frame and data It also includes information on frames and broadcast frames (control frame, data frame, broadcast frame in proximity).

In addition, the link frame header may include a peer service group identifier including information on a service type and network profile, a PAC device address, and a peer network authenticator. have. The peer service group identifier is a peer service group service class (2 bits), a peer network service profile ID (10 bits), a peer service group number (6 bits), or a local peer service group. May include ID (local peer network ID). The peer service group number is a unique number that can be distinguished among peer service groups having the same service profile.

In addition, in the link frame header, the address of the PAC device means a destination address and a source address, and may include two types of addresses (a 64-bit address and an 8-bit address allocated to each peer service group). The peer service group prover included in the link frame header may include the 64-bit address of the PD with a pre-defined key.

The link frame information includes the type, length, and value of the link frame. In addition, the link frame information may include a peer network information element. In this case, the peer service group information element may include information on a type, a length, and a value. In addition, the peer service group information element includes pre-network management information and after-network management information of a subsequent network. Previous network management information includes peer network clock synchronization information, PAC device advertisement information, peer discovery information, and peer link connection information. . In this case, the peer discovery information may include a phase descriptor, a slot allocation descriptor, and a time remaining until the end of the phase or a start time of the next phase. Thereafter, the network management information may include information such as peer beacon, peer grouping, peer groupcast, peer relaying, and peer link release. I can.

8 is a diagram illustrating a MAC frame according to another embodiment of the present invention.

Referring to FIG. 8, the MAC frame according to another embodiment of the present invention includes a MAC frame header, MAC frame information elements, MAC frame payload, and MAC frame tail. Includes (MAC frame tail).

The frame control field of the MAC frame header includes a version, a frame type, a destination link ID indicator, a source link ID indicator, and an information element. It may include an indicator (information elements indicator, IE indicator). Depending on the frame type, advertisement request (Advertise Req.), discovery request/response (Discover Req./Resp.), peer request/response (Peer Req./Resp.), DePeer Req./Resp. .), a RePeer Req., and a data frame can be determined.

The peer group ID field of the MAC frame header may include a peer group service type (3 bits) and a local group ID (5 bits).

The peer link ID field of the MAC frame header may include a PAC device ID (12 bits) and a peer link ID (4 bits).

In addition, the MAC frame header may include a peer group authenticator field.

The MAC frame information element may include information about a frame type, length, and value, and a peer group information element according to a control and management command.

The MAC frame tail relates to a frame check sequence.

A frame used for an advertisement request or a discovery request is'header (3 bytes) + payload (variable) + tail (2 bytes)'. The frame used for peer request/response (peer req./resp.) is'hair (9 bytes) + information element (4 bytes) + tail (2 bytes)'. A frame used for data transmission may be'header (5 bytes) + information element (3 bytes) + payload (variable) + tail (2 bytes)'.

In an embodiment of the present invention, frame filtering for the MAC layer may be applied as follows.

-The first frame filtering

To check the peer group service type, all frames can be filtered. That is, if all received frames are examined and the peer group service types are different, the received frames may be ignored.

-The second frame filtering

This is to check the local group ID, and all frames except advertisements and search request/response frames can be filtered. That is, if the frame is not transmitted from the same group by the second frame filtering, it may be ignored.

-The third frame filtering

This is to check the PAC device ID and link ID, and if they match, the frame is transferred to the upper layer. If the PAC device ID and link ID do not match, it can be ignored, but if the relay information element is included, it is checked whether or not the relay is possible.

-The fourth frame filtering

This is to check the relay element, and if an outbound link capable of sending the received frame to the final destination can be found, the frame may be relayed to an external device by transmitting the frame to the outbound link.

9 is a diagram illustrating a network topology of a peer service group according to an embodiment of the present invention.

In an embodiment of the present invention, the link resource may be determined according to a physical layer (PHY). That is, it may be determined according to how many links physically separated are simultaneously operated. At this time, a dedicated PHY link for a control channel may be created (RF transmitters and spatial transmitters). In this case, the link resource must be adjustable according to a radio channel and a spatial channel, Can be assigned in the time domain.

In the present invention, access to link resources can be resolved through contention (resolve contention), and contention between PAC devices included in a single peer service group can be resolved through scheduling, and PAC devices included in multiple peer service groups The contention between them can be solved by interference avoidance.

10 is a diagram illustrating resource allocation according to an embodiment of the present invention.

10 shows link resources allocated in the time domain. Link resource allocation in the time domain requires a time scale for all components included in the peer service group and a clock synchronization source for the peer service group. Synchronized scheduling is possible, and each PAC device can avoid interference that may occur between peer service groups by advertising a resource allocation schedule to neighboring peer service groups.

The unit resource is a length of time for transmitting a clock synchronization frame (16-byte link frame), and the length of a unit timeslot may be an integer multiple of the length of a base timeslot.

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

A peer service group according to an embodiment of the present invention may have a different link resource allocation method for each service step, and may be expressed in the order of phases composed of superframes. In this case, the phase of the peer service group may include a discovery phase, a peering phase, a P2P data phase, and a handshaking phase.

First, in the discovery phase, when a peer service group is continuously operated and maintained, an advertisement of the host peer 410 is transmitted to statically configure a peer service group, or a peer for peer association. This is the step of searching for a device in the service group.

The peering phase is a step of allocating a link resource to a subscribed peer of the peer service group after the discovery phase.

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

In each service phase, a superframe structure may be determined for each phase according to a service profile.

11A shows the service of the 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 a peer service group release command of the host peer 410.

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

FIG. 11C shows a service of a peer service group when a mobile communication device momentarily configures a peer service group so that a data transfer time is allowed for a short time. In this case, only the handshaking phase can be arranged.

FIG. 11D shows a service of a peer service group when a mobile communication device momentarily configures a peer service group, but a margin is secured in a data transfer time. In this case, a P2P data phase may be arranged after the handshaking phase. The release of the peer service group may be determined when the host peer 410 informs that a specific P2P data phase is the last or when P2P data is not transmitted for a predetermined time.

12 is a diagram illustrating a superframe of each phase according to an embodiment of the present invention.

Referring to (A) of FIG. 12, an idle link period, a group link period, a contention link period, and a relay link period are sequentially arranged in a superframe of a discovery phase, and a time slot length is determined for each link period. At this time, the search phase depends on the target time required to create the peer service group, the size of the peer members of the peer service group (for example, the number of peers included in the multi-peer service group), and the transmission distance of the peer service group. E-link resource arrangement patterns and lengths of time slots may vary.

In the discovery phase, the host peer 410 determines an idle link period, searches for a neighboring peer service group, and determines a superframe start time. The next host peer 410 delivers a discovery message including a peer service group descriptor, a discovery phase descriptor, a peering phase descriptor, and the like in the group link period. The relay peer 440 receiving the discovery message retransmits the discovery message in the relay link section.

In the discovery phase, the guest peer 420 may maintain a listen mode for a predetermined time slot according to a wake-up period by a quorum operation of the peer service group. In this case, the guest peer 420 may search for a neighboring peer service group as the observer peer 450 and collect information. When the guest peer 420 finds a discovery message, it transmits a discovery response along with neighboring peer information in a nearby guest link section.

Referring to (B) of FIG. 12, in the P2P data phase, a group link section, a contention link section, a non-contention link section, an idle link section, and a relay link section are sequentially arranged, and the length of a time slot is determined for each link section. do. In this case, a pattern in which link resources are arranged and a length of a time slot may vary according to a mission of a peer service group, a size of a message generated between peers, a number of peers in a peer service group, and a transmission distance standard of a peer service group. Link access may follow an existing link access method depending on the device using the link.

Referring to FIG. 12C, in the handshaking phase, a group link period, an idle link period, a contention link period, and an idle link period are sequentially arranged, and the length of a time slot is determined for each link period. At this time, the pattern in which link resources are allocated and the length of time slots according to the target time required to collect the information of the peer service group, the size of the peer members of the peer service group, the mission of the peer service group, the size of messages generated between peers, etc. May be different. Link access may follow an existing link access method depending on the device using the link. A plurality of link resource allocation combinations may be repeated to constitute one handshaking phase.

In the handshaking phase, the host peer 410 is a peer service group descriptor (P2P network descriptor), a handshaking phase descriptor (handshaking phase descriptor), a P2P data phase descriptor (P2P data phase descriptor) (in some cases, not included in the host link period). May not), etc.). When the link resource allocation method consists of only the handshaking phase, the guest peer 420 may transmit a data message. The relay does not operate during the handshaking phase.

13 is a diagram illustrating a link resource access method according to an embodiment of the present invention.

As a link resource access method for the host slot and the guest slot, one of tx without clear channel assessment (CCA), tx with equal CCA, tx with prioritized CCA, and preemptive slot assign may be selectively applied.

The host slot includes a host portion that the host peer or proxy host peer can use with priority, and a proxy host connection portion for connection between the host and the proxy host. The host peer or proxy host peer can transmit a frame without CCA at the starting point of the host slot. The guest peer may transmit a frame to the host after performing CCA in the host part. At this time, the backoff of the CCA may be determined using a local device identifier reflecting the access priority of the device, and there is a difference in the contention access probability of each guest peer. have. In the proxy host connection part, the host peer is given a higher priority to secure a channel than the proxy host, and the host peer can access after performing CCA.

The guest slot includes a contention access portion and a preemptive access. In the contention access slot, the delay time until the CCA is attempted based on the starting point of the guest slot and the back-off time until the CCA is attempted again when channel congestion is detected through the local device identifier reflecting the access priority of each device. Can be determined. Even in the contention access slot, there is a difference in the contention access probability of each guest peer. The preemptive access slot targets a peer having a specific priority, and a local device identifier and the number of preemptive access slots are hashed to determine a slot number to be assigned to each device.

14 is a diagram showing a superframe structure according to an embodiment of the present invention.

According to another embodiment of the present invention, a PAC device included in a peer group may follow each link section designated in a superframe when competingly access a link resource. In another embodiment of the present invention, the length of a superframe may be expressed as an integer multiple of a sync interval. The sync interval refers to the interval between sync slots of concatenated PHY frames. The link resource allocation time and the link resource access method specified in the superframe may be differently designated for each service phase, and may be differently designated according to the service type. The superframe may be repeated periodically.

15 is a diagram illustrating a superframe structure and a cyclic structure superframe according to another embodiment of the present invention.

15, a superframe according to an embodiment of the present invention includes a synchronization slot, a discovery slot in which a peer is discovered, a control slot for a peer group, and contention access data. A synchronization interval (SI) including at least one of a channel slot (CA-Data slot), a contention free data channel slot (CF-Data slot), and an idle slot is used. The synchronization interval includes a fixed number of subslots. For example, one subslot may be 12 usec long, and one synchronization interval may include 8,334 subslots (SI=100.008msec).

In an embodiment of the present invention, the MAC layer superframe includes two synchronization intervals, and the superframe includes a synchronization period, a discovery period, a control period, and a non-connection link period as link resources. (connectionless link period, CL period), connection-oriented link period (CO period), synchronization period, search period, idle period, idle period, and connection-oriented link period may be allocated.

A superframe according to another embodiment of the present invention has a cyclic structure and may include a plurality of SIs. A superframe having a cyclic structure may be expressed as an active period including n superframes and an inactive period including m superframes. At this time, the m superframes included in the inactive period may consist of only the idle period. The superframe shown in FIG. 14 represents one superframe included in the active period.

In addition, the use of the slot included in the superframe may be determined according to a service type. For example, an idle slot is included between a plurality of slots (sync slot, discovery slot, control slot, CA-data slot, CF-data slot) included in a superframe according to the service type, and idle slots according to the service type The length of the can be adjusted.

The superframe according to the application service may follow at least one of the following seven superframe types.

1.Type 1: uni-directional connectionless message transmission service

-The PAC device may transmit an advertisement frame or a discovery frame with data.

-The superframe used for type 1 service may include an SI including a sync-discovery-idle-CL-idle period.

2. Type 2: bidirectional connectionless message transmission service

-The PAC device may transmit a request frame or a response frame together with data.

-The superframe used for the type 2 service is SI including a sync-discovery-control-CL-idle period and a sync-discovery-rest-CL-sync-discovery- The SI including the idle-CL-idle) section may be included.

3. Type 3: delay tolerant message transmission service

-The PAC device can make a CA link after discovery.

-The superframe used for the type 3 service may include an SI including a sync-discovery-control-CL-idle period.

4. Type 4: mixed type of traffic service

-It is a superframe to support mixed type traffic service.

-Superframes that can be used for type 4 service are SI including sync-discovery-control-CL-CO-idle and sync-search-pause-CL-pause The SI including the (sync-discovery-idle-CL-idle) section may be included.

5. Type 5: reliable message transmission service

-The PAC device can make a guaranteed CA link after discovery.

-A superframe that can be used for type 5 service may include an SI including a sync-discovery-control-idle-CO (sync-discovery-control-idle-CO) period.

6. Type 6: open configurable superframe service

-The PAC device can select the slot usage and superframe length of sequentially displayed slots included in the SI.

-The superframe of the type 6 service can be advertised by a superframe structure information element.

And, in the present invention, when a plurality of peer groups having different service types simultaneously attempt to transmit, the transmission priority in the same slot may be "Type 6> Type 5…> Type 1" according to the service type.

16 is a diagram illustrating a superframe of a cyclic structure according to another embodiment of the present invention.

According to another embodiment of the present invention, a MAC cyclic superframe may be provided by a higher layer through MAC layer primitives. In this case, the upper layer may determine the service type, the number of active superframes, and the number of inactive superframes.

Referring to FIG. 16, an active superframe includes a synchronization-discovery-control-CL-idle (sync-discovery-control-CL-idle) period and an SI and synchronization-pause-control-CL-idle (sync-idle- control-CL-idle) contains the SI including the section. And, in the inactive superframe, some sections may be used as follows.

-In the case of a search phase, a search slot may be included in an inactive superframe.

-In the case of the peering phase, the control slot may be included in the inactive superframe.

-In the case of P2P data phase, all periods can be idle except for the synchronization period.

As an example of the cyclic structure superframe, the type 4 superframe may include one active superframe and one inactive superframe. At this time, the active superframe is a synchronization-discovery-control-CL-CO (sync-discovery-control-CL-CO) interval and a synchronization-discovery-idle-CL-idle (sync-discovery-idle-CL-idle). ) It may include an SI including a section.

The address of the link resource may refer to two PAC devices located at both ends of the link according to the peer link ID. The peer link ID may consist of a peer device ID (12 bits) and a peer link ID (4 bits). The link section included in the cyclic structure superframe may be identified by a superframe order, an intra-superframe sequence, and an intra-section slot number. In the case of CAP, it can be composed of a superframe sequential ID and a CL period sequential ID, and in the case of a CFP, it is composed of a superframe sequence ID, a CO period sequence ID, and a slot ID. Can be.

According to another embodiment of the present invention, distributed resource reservation may be used.

During peering, distributed resource reservation can be applied as follows.

In the case of service type 3 and type 4, CL intervals may be allocated to cyclic superframes in the order of peering requests.

For service type 4, type 5 and type 6, the source PAC device of the unidirectional link scans the control slot of the neighboring peer before reserving the CFP slot. Then, the source PAC device selects a superframe, a CO section, and a slot based on a value obtained by hashing a peer link ID. Thereafter, a slot reservation is requested from another terminal PAC device by transmitting a peering request.

The destination PAC device of the unidirectional link receives a peering request on a resource allocated for the link. The available slots are checked by scanning the control slots of neighboring PAC devices. In addition, an ACK may be transmitted to the source PAC device through a link or an adjusted slot allocation may be transmitted.

17 is a diagram illustrating interference avoidance between heterogeneous superframes according to an embodiment of the present invention.

Referring to FIG. 17, in order to avoid interference between multiple peer groups, a method for controlling access to multiple peer groups of a participant and an access control method of an initiator may be applied.

When a participant performs access control for multiple peer groups, the participant may perform access control according to the priority of service types between peer groups.

When the initiator performs access control, the initiator selects the start time of the cyclic structure superframe, and performs access control according to the priority of the service type between peer groups. Thereafter, opportunistic transmission is performed based on the planned statistical access.

For example, when a peer group of service type 3 that includes two active superframes and does not include an inactive superframe, and a peer group of service type 4 that includes one active and inactive superframe, coexist, for example, interference Explain how to avoid it. Each peer group is in a P2P data phase. At this time, since the CL intervals may interfere with each other, interference may be avoided by applying a shorter backoff in the peer group of the service type 4.

18 is a flowchart illustrating a peer initialization method according to an embodiment of the present invention.

A peer of a peer service group according to an embodiment of the present invention has device capability information and network service capability information as initial information. In addition, the role of the peer in the peer service group may be determined according to initial information (device capability information and network service capability information) stored in the peer (S1801).

Device capability information includes master clock capable, proxy host capable, peer relay capable, main powered, security capable, and dedicated control channels. (dedicated control channel), always on receiver mode (always on receiver) may be included.

The network service capability information is information on network capability to support application services of a wireless peer service group, and is host capable, real-time capable, reliable connection capable, and It may include group connection capable, burst traffic capable, and the like.

Referring to FIG. 18, first, when the power is turned on, the peer receives a frame from a neighboring network (S1802). When a network clock synchronization frame is received from the received frame, the own clock is synchronized according to the received synchronization frame (S1803).

Thereafter, if the network service capability information is'hostable' (S1804), creation of a peer service group is started (S1805). However, if the network service capability information is not'host available', a next wakeup time is set and the switch is switched to a sleep mode (S1806).

However, if the network clock synchronization frame is not included in the received frame, the device capability information is checked since there is no received synchronization frame (S1807). If the device capability information is'Master clock enabled' and'Central power connection', network service capability information is checked (S1808). If the network service capability information is'hostable', the peer searches for neighboring peers together with network synchronization and starts creating a peer service group (S1809). However, if the network service capability information is not'hostable', the peer periodically transmits only the synchronization frame as the network clock master (S1810).

On the other hand, if the peer's device capability information does not include both'master clock enabled' and'center power connection', the peer adjusts the frame reception interval and attempts clock synchronization again (S1811 and S1812). At this time, if synchronization fails even after the predetermined number of attempts has elapsed, the peer gives up initialization (S1813).

19 is a flowchart illustrating a method of creating a peer service group by a host peer according to an embodiment of the present invention.

First, the host peer analyzes the peer service group service profile to determine configuration information of network service procedures, the type and minimum number of network configuration devices, and link resource allocation scheduling information for each network phase (S1901). Thereafter, the host determines a pre-peer list and a peer network start time from a clock synchronization step or a capability advertisement frame of a peripheral device (S1902).

The creation of the peer service group may vary according to the order of network phases according to the peer service group service. When the service of the peer service group starts from the handshaking phase (S1903), the host peer simultaneously transmits the data frame together with the peer discovery frame (S1904). If there is a peer discovery response or peer data ACK within a predetermined time (S1905), peer group creation is completed (S1906). However, if there is no response or ACK, the host peer retransmits the peer discovery frame and data frame. Even after that, if there is no response or ACK within a predetermined time (S1907), the host peer determines that creation of the peer service group has failed (S1908).

When the service of the peer service group is not started from the handshaking phase (starting from peer discovery), the host peer determines whether peering is necessary or not (S1909).

If peering is not required, the host peer transmits a peer discovery frame (S1914) and waits for a predetermined time until a response is received (S1915). If a response is not received after a predetermined time elapses, the host peer retransmits the peer discovery frame. If a response is not received even when the peer discovery frame is retransmitted, the host peer determines that creation of the peer service group has failed. However, when receiving a response to the peer discovery frame within a predetermined time, the host peer starts a peer communication phase (S1916).

Even when peering is required, the host peer transmits a peer discovery frame (S1910) and waits for a predetermined time until a response is received (S1911). If a response is not received after a predetermined time elapses, the host peer retransmits the peer discovery frame. If a response is not received even when the peer discovery frame is retransmitted, the host peer determines that creation of the peer service group has failed. However, if a response to the peer discovery frame is received within a predetermined time, the host peer transmits a peering response frame to the corresponding peer to complete peering (S1912 and S1913). Thereafter, the host peer begins the peer communication phase.

20 is a diagram illustrating a peer discovery request frame according to an embodiment of the present invention.

Peer discovery may be initiated by receiving an advertisement frame from another PAC device or by transmitting a peer discovery request frame. In this case, the peer discovery request frame may include a peer network service profile and peer network formation information. The peer service group service profile is a peer service group identifier, and may provide a service category. Peer service group formation information is a phase descriptor and a slot allocation descriptor. In addition, the discovery interval corresponds to a synchronization interval of the peer service group and is a wake-up interval of the PAC device.

First, the host peer broadcasts a peer discovery frame every T _d . Peer network service capable PDs (PAC) devices capable of peer service group service respond to the peer discovery frame and synchronize with the host peer. In this case, an address and capability of a PAC device capable of peer service group service may be transmitted as a response. Thereafter, the host peer notifies each PAC device of a network starting time.

The peer discovery request frame may provide a phase duration. In addition, the peer discovery request frame may provide a slot allocation schedule for each phase.

21 is a diagram illustrating a time slot of a PAC device synchronizing to a master clock of a peer service group according to an embodiment of the present invention.

In an embodiment of the present invention, a PAC device included in each peer service group synchronizes its clock with the master clock of the peer service group.

Referring to FIG. 21, PAC device a and PAC device b of peer service group x have synchronized starting positions of base timeslots, but since the lengths of base timeslots are different, they master the length of base timeslots. You need to synchronize with that of Clark. At this time, each PAC device can synchronize the clock by compensating for oscillator drift (clock compensation).

In addition, since the PAC device c of the peer service group y has a starting position of the basic time slot different from that of the master clock, it is necessary to align the position of the basic time slot (timeslot alignment).

22 is a diagram illustrating a synchronization frame transmitted by a peer according to an embodiment of the present invention.

In the present invention, a synchronization frame can be used to synchronize the basic timeslots between each peer service group. The synchronization frame of the peer service group according to an embodiment of the present invention may include a sequence number of a basic time slot and transmission time information (sync clock time) of the synchronization frame. In addition, the synchronization frame may include a peer network information element type and a peer network information element length. In this case, the peer service group information element is for peer service group synchronization, and the transmission time information of the synchronization frame indicates a sequence number of a basic time slot in which the peer service group synchronization frame is transmitted. In addition, the peer network descriptor may provide transmission time information of the synchronization frame.

In an embodiment of the present invention, a PAC device capable of a master clock waits for 2×minSyncAdjustInterval to receive a synchronization frame. If no synchronization frame is received during 2xminSyncAdjustInterval, the master clock-capable PAC device starts transmitting a set of peer service group synchronization frames. The set of peer service group synchronization frames means that the PAC device transmits a peer service group synchronization frame at every sync frame interval. In this case, the synchronization frame interval may be determined as the length of the base timeslot (baseTimeslotLength) × unit time slot (unitTimeslot). In addition, the PAC device may transmit a synchronization frame during a sync frame burst interval.

In an embodiment of the present invention, the synchronization frame may be continuously transmitted for a predetermined period. Thereafter, transmission of the synchronization frame may be stopped, and transmission of the synchronization frame may be resumed after the synchronization correction time elapses. Synchronization according to an embodiment of the present invention may be continued by providing a timestamp even when a peer discovery step is performed.

23 is a diagram illustrating a resource allocation scheduling method of a peer service group according to an embodiment of the present invention.

According to an embodiment of the present invention, different resource allocation may be performed for each phase of a resource to be allocated. At this time, the phase may be a clock synchronization phase, a peer discovery phase, a peer association phase, a peer-to-peer data (P2P) phase, or a peer disassociation phase. In addition, the length of the unit time slot for the peer service group may be determined. The length of the unit timeslot may be determined as a multiple of the base slotted resource. A resource allocation scheduling method is described in the service profile of the peer service group.

24 is a diagram illustrating time slots allocated to a peer discovery phase and a P2P data phase according to an embodiment of the present invention.

The service profile of the peer service group describes the combination of phases or resources allocated to each phase. Referring to FIG. 10, a service for exchanging short messages in real time in a peer service group including a moving PAC device will be described as an example. In order to provide this service, a peer discovery phase and a P2P data phase are combined. In addition, a'host-pause-guest-pause' time slot is allocated to the peer discovery phase. In the P2P data phase, a'host-guest-pause-guest-host-pause' time slot is repeatedly allocated. At this time, the unit time slot is the length of two basic timeslots, the host time slot is the length of three unit timeslots, the idle time slot is the length of two unit timeslots, and the guest time slot is the length of one unit time slot.

Also, the service profile of the peer service group can serve as a profile registry. There may be 1,024 types of peer service groups per class, and the length of a network operation may be determined by the host peer in the peer service group descriptor. The peer service group descriptor includes a phase descriptor and a resource allocation descriptor. The phase descriptor is a peer discovery phase length, a peer association phase length, a P2P data phase length, and a peer disassociation phase length. Includes. The resource allocation descriptor is the pause timeslots length, host timeslots length, guest timeslots length, group timeslots length, and relay timeslots length. timeslots length).

25 is a diagram illustrating a time slot allocated to a peer discovery phase and a P2P data phase according to another embodiment of the present invention.

Referring to FIG. 25, for example, a real-time short message exchange in a peer service group including a moving PAC device will be described. The service phase of the real-time short message exchange service may consist of a'peer discovery phase'-a'P2P data phase'. In addition, the superframe of the peer discovery phase may include slots in the order of'synchronization (SYNC) slot'-'group slot'-'rest slot'-'contention access period (CAP) slot', and , The superframe of the P2P data phase is'SYNC slot'-'group slot'-'contention free access (CFP) slot'-'rest slot'-'CAP slot'-'relay slot'-'rest slot 'Can include slots in order. The details of each MAC slot are as follows. MAC unit slot is 2 unit PHY slot, SYNC slot is 1 unit PHY slot, group slot is 3 unit MAC slot, idle slot is 2 unit MAC slot, CAP slot is 1 unit MAC slot .

26 is a flowchart illustrating an interference mitigation method according to an embodiment of the present invention.

According to an embodiment of the present invention, interference may be avoided by performing access control as a guest peer or performing access control as a host peer in a multi-peer service group (S2601 and S2602).

First, a method of performing access control as a guest peer may be described by dividing into a case where the peer participates in a single peer service group and a case where the peer participates in multiple peer service groups.

When a peer participates in a single peer service group, the peer can use an access scheme according to the slot type of the peer service group, which is referred to as an implicit control method.

When a peer participates in multiple peer service groups, the peer can perform access control by scheduling peer communication between peer service groups, and this is called an explicit control method.

In a method of performing access control as a host peer, the peer may select a start time of a P2P data phase and schedule peer communication between peer service groups.

The interference avoidance method in a single peer service group may be implemented by allocating dedicated timeslots for providing a high-priority service to a peer, and performing backoff according to an access priority.

Next, referring to FIG. 26, when a peer providing a peer service group service is a host peer, the host peer checks whether a slot of another peer group exists in order to minimize interference between peer service groups (S2603), and P2P data A start point of a phase or an allocated slot for a component of a peer service group may be adjusted (S2604). That is, the host peer adjusts the starting point of the P2P data phase or the slot for each phase so that a frame transmitted to itself is not generated in a time synchronization frame delivery slot, a host portion of another peer service group, a relay slot, or the like (S2605).

When a guest peer provides a service to a single peer service group (S2606, S2607), the guest peer determines whether interference has occurred in another peer group (S2607), and the guest peer determines whether interference with the neighboring peer service group is expected. After selecting a CCA starting point in, implicit access control is performed (S2608). Thereafter, if the slot is not occupied (S2609), the slot can be used (S2610).

When a guest peer provides a service to a plurality of peer service groups, it is determined whether interference with other peer groups has occurred (S2611), and the guest peer does not access the link resource (i.e., deletes the request and uses the link access method). Or not) (S2613), it is possible to adjust the data transmission time (ie, delayed transmission) (S2614). For example, based on the phase and slot allocation information of the serving peer service group, the guest peer establishes a link access so that no frame for itself occurs in the time synchronization frame delivery slot, the host part of each peer service group, and the relay slot. It may not be performed or the timing of data delivery may be adjusted.

Alternatively, according to another embodiment of the present invention, a fully distributed mode interference avoidance method may be applied to an interference problem between peer service groups.

First, in a single peer service group, an interference problem can be solved through an access control scheme.

The group cast slot may be used for broadcasting, discovery, peer connection/separation, and transmission of a relay command frame, and a differential backoff may be applied according to the access priority of the PAC device. For example, the priority of the initiator or the relay may be determined based on hashing of the ID of the PAC device.

The CAP slot may be used for transmission of a P2P command frame and a data frame, and CCA may be applied with random backoff.

The CFP slot is a slot previously allocated based on the hashing of the ID of the PAC device, and is allocated through a peer connection, and CCA may be applied with a fixed backoff.

On the other hand, in a multi-peer service group, an interference problem can be solved through an interference avoidance scheme.

The case can be divided into a case where a peer performs access control as a participant and a case where the peer performs access control as an initiator.

When a peer performs access control as a participant, an implicit control technique may be used if the peer participates in a single peer group. The implicit control scheme refers to following the access scheme according to the type of slot.

When a peer performs access control as a participant, an explicit control technique may be used if the peer participates in a multi-peer group. The explicit control scheme refers to a method of scheduling peer communication between peer service groups according to access.

When the peer performs access control as an initiator, the peer selects the start time of the PAC service, re-schedules the PAC service, and performs opportunistic transmission based on the planned statistical access. can do.

27 is a diagram illustrating a peer group created between peer service groups according to an embodiment of the present invention.

In one embodiment of the present invention, a method of configuring a peer group of a peer service group and a method of transmitting data will be described with reference to FIG. 28.

In FIG. 27, PAC device groups included in the peer service group may collaborate with each other by sharing information. For example, the PAC device groups may provide a missing part of service specific information to each other. The PAC device group formed of PAC devices included in each peer service group may be created by invitation between PAC devices included in the peer service group or by grouping PAC devices included in other peer service groups.

Peers included in one peer service group may create a plurality of peer groups or participate in a plurality of peer groups. At this time, the peer address included in the peer service group includes a network ID, a group ID, and a local device ID, and one peer may have a plurality of addresses at the same time. .

In a single peer service group, each peer can unicast by designating a destination peer with "Network ID + Group ID + Local Device ID". In a single peer service group, each peer can broadcast by designating a destination with "network ID + broadcast group ID + broadcast local device ID". In a single peer service group, each peer can groupcast to a designated group with "Network ID + Group ID + Broadcast Local Device ID".

28 is a diagram illustrating broadcasting of a group of PAC devices according to an embodiment of the present invention.

Referring to FIG. 28, each peer may use a broadcast frame instead of a destination address in order to broadcast to all peer service groups included in a space. In this case, the network identifier may indicate the source network of the broadcast frame.

Broadcasting in the peer service group may be performed through a PAC device broadcast address. In this case, the host peer may transmit the broadcast frame in the guest timeslot as in the host timeslot.

Referring back to FIG. 27, the peer group configuration may follow an implicit grouping method and an explicit grouping method. According to the intrinsic grouping method, the PAC device may respond by transmitting a group data response to a group data request. That is, in the intrinsic grouping method, required device capability and service capability are transmitted together with the group ID, and data may be transmitted in a manner in which another peer responds. According to the explicit grouping method, the PAC device may transmit a response to the group request once and transmit the group data frame after receiving the ACK. Even in the explicit grouping method, the required device capability and service capability are transmitted as a group forming request together with a group ID, and a device and a group responding thereto may be configured.

Meanwhile, in an embodiment of the present invention, QoS may mean multiple classes of data primitives. That is, QoS specifies a data rate, implements QoS transmission, and relates to unicast/groupcast/broadcast.

29 is a diagram illustrating a multi-hop relay method according to an embodiment of the present invention.

The multi-hop relay method according to an embodiment of the present invention is to extend coverage of a peer service group. One PAC device may configure a plurality of links through peering with neighboring PAC devices participating in the same service group. When the PAC device receives a frame including relaying information elements from an incoming link in a cyclic superframe, the PAC device receives a relay included in the relaying information element if the final destination of the frame is not itself. An outgoing link to be transmitted is selected according to the redundant information path and a frame is transmitted.

The relaying information may designate a link resource for a frame to be relayed according to a destination peer link ID. At this time, the link resource is a link resource allocated to the relaying PAC device. In this case, the link resource may be designated as a superframe ID, a link period ID, and a slot ID. The PAC device may receive link information for the neighbor of the neighbor device from the linked neighbor PAC device to configure the relay information. Thereafter, the PAC device may determine a relative location map by estimating a relative connection location between PAC devices up to two neighboring hops using link information about the neighbor of the neighboring device. In addition, the relaying information may determine a connection link that can be delivered to a destination according to a relative location map.

After the frame is relayed, the relaying count of the relaying information element in the relayed frame may be increased by one, and at this time, the destination peer link ID of the frame is an outgoing link ID. ) Can be modified.

30 is a diagram illustrating a multi-hop relay method according to another embodiment of the present invention.

A relay capable PAC device (relay peer) according to another embodiment of the present invention may find an isolated PAC device by receiving a device advertisement frame. Thereafter, the relay peer retransmits the clock synchronization frame, and retransmits the outward frame received from the host in the relay timeslot allocated to the relay peer.

Thereafter, the isolated PAC device may perform CCA to transmit a frame in a relay timeslot.

A relay peer receiving an inward frame from an isolated PAC device may retransmit the inward frame in a slot selected based on the frame type.

In this case, the relay peer may change relay layer information in an outbound frame received from a host peer and an inbound frame received from a peer connected to a lower end of the relay peer, and then transmit a frame in which the relay layer information is changed in a relay slot.

When the relay peer receives a relay connection request from the lower peer connected to the lower end, it can relay the frame in the outward portion of the relay slot if it finds a frame transmitted to the lower peer in the host slot, guest slot, or group slot. have.

When the relay peer receives a frame transfer request from the lower peer, the relay peer may relay the frame by selecting one of a host slot, a guest slot, or a group slot according to the frame destination address.

31 is a diagram illustrating selection of a relative position according to an embodiment of the present invention.

Relative positioning according to an embodiment of the present invention may be based on link information between neighboring peers of a neighboring PAC device provided by a neighboring PAC device. The neighbor link information of the neighboring PAC device may be included in the neighbor information element as a link ID of a connected neighbor and a received signal strength indicator (RSSI). The 2-hop neighbor link information collected from neighboring PAC devices may be expressed as a relationship matrix based positioning. In this case, the relationship matrix may represent a connection matrix and an angular distance between PAC devices, and is for searching for connected PAC devices for relaying.

A PAC device map (PD map) may be created through a relationship matrix between neighboring peers separated by two hops. In this case, the relationship matrix between neighboring peers may include a neighbor local device identifier and a received signal strength indicator RSSI. The PAC device map is distributed by the device advertisement frame and may be included in a neighbor relation list field in the device advertisement frame. The PAC device map can be used to conjecture the relative location of neighboring PAC devices.

32 is a diagram illustrating interaction with an upper layer of a peer service group according to an embodiment of the present invention.

The service access point for the next higher layer includes a service access point of a link layer and a PAC device management service access point.

A service access point for an external network is an external PAC device (external PD management) service access point.

Service primitives include a peer service group management primitive, a peer link management primitive, and a PAC device data primitive.

Peer service group management primitives relate to EXTM-PUT-SERVICE, PDM-SET-SERVICE, PDM-GET-SERVICE, and PDM-START-DEVICE.

Peer link management primitives relate to PDL-JOIN-PEER, PDL-LEAVE-PEER and PDL-MANAGE-PEER.

PAC device data primitives relate to PDD-DATA and PDD-DATA-GROUP.

33 is a diagram illustrating a network service method and a link resource allocation method according to an embodiment of the present invention.

The link resource method in a wireless peer service group according to an embodiment of the present invention includes a method of allocating a network life cycle step, and a method of allocating a host, a guest, a group, a relay, and idle time, which are network components for each step. It can be classified as

According to an embodiment of the present invention, the peer service group may configure the peer service group according to service characteristics by combining several types of phases. At this time, the phase includes a peer discovery phase, a handshaking phase in which peer discovery and peer data are simultaneously transmitted, a peer association phase, a P2P data phase, and a peer dissociation phase. .

In a peer service group in which the host peer and the guest peer move, the network service may be provided only in the handshaking phase. When a fixed guest peer and a moving host form a peer service group, the host peer performs a handshaking phase with a peer serving as a proxy host among the fixed guest peers, and the proxy host peer performs a peer connection phase, P2P data phase, and Network services can be provided by performing the peer separation phase.

According to an embodiment of the present invention, each phase may consist of link resources allocated to elements of a peer service group. The link resource may be a base timeslot with the length at which time synchronization frames can be transmitted, and the unit timeslot of the peer service group may be determined as an integer multiple of the base timeslot, and the unit timeslot is the link resource allocation. Can be used as a basic unit.

In an embodiment of the present invention, link resources may be allocated to host peers, guest peers, groups, and relay peers. The rest time can also be displayed as a unit time slot. The duration of each phase and link resource allocation for each phase may be provided through a phase descriptor and a slot allocation descriptor for each phase. At this time, the length of the allocated link resource may be expressed as a time slot × 2 ⁿ , and n is a 4-bit value.

34 to 38 are diagrams illustrating a method of transmitting MAC primitives according to an embodiment of the present invention.

First, the MAC primitive according to an embodiment of the present invention includes the following. Below, the PDME is a PAC device management entity (Peer Device Management Entity).

PDME-START.request/confirm

PDME-DISCOVER.request/indication/response/confirm

PDME-ADVERTISE.request/indication/response/confirm

PDME-PEER.request/indication/response/confirm

PDME-DEPEER.request/indication/response/confirm

PDME-REPEER.request/indication/response/confirm

PD-DATA.request/indication/confirm

PD-DATA-Group.request/indication/response/confirm

In the "PDME-START.request" primitive, a peer service type and a peer group ID may be provided from a higher layer.

The "PDME-START.confirm" primitive may be used to confirm a peer group list.

In the "PDME-DISCOVER.request" primitive, a peer service type or peer ID and peer list may be provided from a higher layer.

In the "PDME-ADVERTISE.request" primitive, a peer service type, peer ID, length of MSDU (msduLength), MSDU and a possible peer service list may be provided.

In the "PDME-PEER.request" primitive, a peer ID and peer link type may be provided.

In the "PDME-DEPEER.request" primitive and the "PDME-REPEER.request" primitive, a peer ID may be specified from a higher layer.

In the "PD-DATA.request" primitive, a peer ID, peer link type, length of MSDU and MSDU may be provided.

34 is a flowchart showing a PDME-START procedure according to an embodiment of the present invention.

Referring to FIG. 34, each PAC device starts a peer group or joins a peer group (S3401).

First, the PAC device can initiate a peer group through the peer service type and peer list. At this time, the peer service type and peer list may be obtained through exchange of the PDME-START.request/confirm primitive.

Thereafter, the PAC device determines a superframe structure (S3402), waits for a frame reception from a neighbor for n superframes (S3403), and reports a peer group list (S3404). Thereafter, if the peer group is found (S3405), the PDME-PEER procedure may be performed (S3406), and if the peer group is not found, the PDME-DISCOVER procedure may be performed (S3407).

35 is a flowchart illustrating a PDME-DISCOVER procedure according to an embodiment of the present invention.

Referring to FIG. 35, the PAC device may initiate a peer discovery procedure through a peer service type and a peer list (S3501). At this time, the peer service type and peer list may be obtained in response to the PDME-DISCOVER.request primitive transmitted and received between the initiator 3510 and the participants 3520 and 3530.

The PAC device determines a superframe structure (S3502) and selects a start time of the peer service group (S3503). Thereafter, the discovery frame is transmitted (S3504), and it is checked whether a response has been received from another PAC device (S3505).

If a response is received from another PAC device, it is determined whether it is necessary to establish a peer link (S3506), and if peer link establishment is required, proceeds with the PDME-PEER procedure (S3507), and if peer link establishment is not required, proceeds with the PD-DATA procedure Can be (S3508). The PDME-PEER procedure and the PD-DATA procedure may be performed as a primitive exchange between a PAC device (ie, an initiator) initiating a peer service group and a discovered PAC device (ie, a participant).

At this time, if peer configuration is required, the initiator transmits the PDME-DISCOVER.request primitive to Participant 1 and receives the PDME-ADVERTISE.request primitive from Participant 1. And if peer configuration is not required, the initiator transmits the PDME-DISCOVER.request primitive to Participant 2, receives the PDME-PEER.request primitive from Participant 2, and then transmits the PDME-PEER.response primitive to Participant 2.

However, if a response is not received from another PAC device, it is determined whether the initial search time has elapsed (S3509). If the initial discovery time has elapsed, it is determined whether the peer has been discovered (S3510). If the peer is not discovered, it is determined that the peer service group creation has failed (S3511). However, if the initial search time has not elapsed, the search frame is transmitted again.

36 is a flowchart illustrating a PDME-ADVERTISE procedure according to an embodiment of the present invention.

Referring to FIG. 36, the PAC device may start a peer advertisement procedure through a peer service type, a list of possible peer services, a peer ID and data (MSDU) (S3601). At this time, a peer service type, a list of possible peer services, a peer ID, and data may be obtained in response to the PDME-ADVERTISE.request primitive transmitted and received between the initiator 3610 and the participants 3620 and 3630.

Thereafter, the PAC device checks whether there is a frame to be received (S3602). Then, an advertisement time is selected (S3603) and an advertisement frame is transmitted (S3604). At this time, the PAC device checks whether the data has been transmitted together (S3605), and if not transmitted together, the PDME-ADVERTISE procedure is completed as it is (S3609). However, if the PAC device transmits the data frame along with the advertisement frame, it may determine the completion/failure of the PDME-ADVERTISE procedure according to whether or not to receive an ACK (S3606). That is, when an ACK is received from another PAC device, the PAC device completes the PDME-ADVERTISE procedure (S3607), and if the ACK is not received, the PAC device determines that the PDME-ADVERTISE procedure has failed (S3608).

At this time, Participant 1 may transmit a PDME-ADVERTISE.request primitive to Initiator and Participant 2. In addition, Participant 1 may transmit data together with the PDME-ADVERTISE.request primitive to Participant 2, and checks whether an ACK transmitted from Participant 2 is received.

37 is a flowchart showing a PDME-PEER procedure according to an embodiment of the present invention.

Referring to FIG. 37, the PAC device may initiate a PDME-PEER procedure through a peer ID and a peer link type (S3701). The PDME-PEER procedure is a procedure for creating a peer link with QoS parameters. In this case, the peer ID and the peer link type may be obtained through transmission of the PDME-PEER.request primitive transmitted and received between the initiator 3710 and the participants 3720 and 3730.

Thereafter, the PAC device transmits a peering request frame (S3702), and checks whether a response is received (S3703). If the response is received, the peering procedure is completed (S3704), and if the response is not received, the PAC device determines that the peering procedure has failed (S3704).

38 is a flowchart illustrating a PD-DATA procedure according to an embodiment of the present invention.

Referring to FIG. 38, the PAC device may initiate a PD-DATA procedure through a peer ID, a peer link type, and an MSDU (S3801). In the PD-DATA procedure, the peer ID, the peer link type, and the MSDU may be obtained by the PD-DATA.request primitive transmitted and received between the initiator 3810 and the participants 3820 and 3830.

Thereafter, the PAC device may select a slot to be used for data frame transmission (S3802), and transmit different primitives and data according to the type of the slot (S3803).

When the slot is a groupcast slot, the PAC device transmits an advertisement request command along with data (S3804). When the slot is a contention access period (CAP) slot or a contention free period (CFP) slot, the PAC device transmits a data request command along with data (S3805 and S3806).

The MAC command frame used in the embodiment of the present invention includes a discovery request command, an advertisement request command, an advertisement response command, a peering request command, and peering. Peering response command, De-peering request command, De-peering response command, Re-peering request command, Re-peering response command (Re -peering response command), data request command, and data response command.

As described above, according to an embodiment of the present invention, in a single peer group, a multiple peer group, or a temporary peer group, the peer device efficiently provides link resources according to the type of service and required quality without resource scheduling and access control of the master coordinator. Access, reserve resources, and avoid interference.

Although the embodiments of the present invention have been described in detail above, the scope of the present invention is not limited thereto, and various modifications and improvements by those skilled in the art using the basic concept of the present invention defined in the following claims are also provided. It belongs to the scope of rights.

Claims (20)

A method in which a peer device of a peer aware communication network transmits signals within a plurality of peer groups,
Determining a structure of a cyclic-superframe carrying signals according to the service type of the peer group including the peer device, and
Transmitting the signal through the cyclic superframe
Including,
Here, the cyclic structure superframe includes at least one superframe, and the at least one superframe includes a synchronization period, a discovery period, a control period, and a contention access period. period), and a contention free period,
The step of determining a structure of a cyclic-superframe carrying a signal according to a service type of a peer group including the peer device,
Replacing the remaining sections other than the synchronization section among the sections included in the at least one superframe with an idle section according to the service type
Including a signal transmission method. In claim 1,
Transmitting the signal through the cyclic structure superframe,
If the peer device is the initiator of the peer group, after selecting a start time of the cyclic structure superframe, the resource is selected according to the priority of the service type of the service operated in the plurality of peer groups. The steps to approach, and
Transmitting the signal through the cyclic structure superframe using the resource
Including a signal transmission method. In paragraph 2,
Step of performing opportunistic transmission based on planned statistical access
Signal transmission method further comprising a. In claim 1,
Transmitting the signal through the cyclic structure superframe,
If the peer device is a participant of the peer group, accessing a resource according to the priority of the service type of the service operated in the plurality of peer groups, and
Transmitting the signal through the cyclic structure superframe using the resource
Including a signal transmission method. In claim 1,
Analyzing the service profile of the peer group, and
Determining scheduling information for accessing the resource of the peer group based on the analysis result of the service profile
Signal transmission method further comprising a. In claim 1,
Determining the number of superframes included in the cyclic structure superframe according to the service type of the peer group
Signal transmission method further comprising a. delete delete delete delete delete delete delete delete delete delete delete delete delete delete

Images