KR101679990B1 - Method and System for Implementing Uncoordinated Rate Division Multiple Access for EM-Nanonetwork - Google Patents

Abstract

A method and system for autonomous rate division multiple access for wireless nano networks are presented. The method for implementing autonomous rate division multiple access for wireless nano networks proposed by the present invention includes generating a small field of a applicable prime number from a fixed set of master prime in a prime mode algorithm, generating an index value corresponding to a user prime Applying the generated index value to the prime mode algorithm to obtain a prime number corresponding to the user prime, and calculating a user period by multiplying the obtained prime number with the time base.

Description

TECHNICAL FIELD [0001] The present invention relates to a method and a system for an autonomous rate division multiple access for a wireless nano-

The present invention relates to a method and system for autonomous rate division multiple access for wireless nano networks. And more particularly, to a method and system for generating a unique prime number at each node using a prime mode algorithm in the extraction of pulse rates.

Studies of materials ranging in size from 1 to 100 nanometers (meter) have found new and unique applications that lead to nanotechnology. One area of application of recent nanotechnology concerns the design of nanosensor devices for communication purposes. Typical nanosensor devices have evolved with the development of nano-batteries, nano-memories, nano logic circuits as well as nano-antennas that can send and receive electromagnetics. These small parts have become possible as a result of recent research in the field of carbon electronics. It is expected that a large number of nanosensor devices will be deployed in order to form a nanosecond network and perform proper communication. The tiny form of a traditional antenna involves very high electromagnetic frequency usage. Thanks to this resonance frequency, the available transmission band is in the range of almost 10 THz (0.1-10 THz) at hundreds of GHz.

Nano networks using electromagnetics are expected to be applicable to many applications ranging from smart healthcare monitoring, targeted drug delivery, and military operations such as nuclear and biochemical defense systems. It is also conceivable to apply various applications such as vegetation survey, disease control and industrial sensor interface and super sensitive touch screen. In order to easily access these nano-networks, connection with existing communication systems will be required. These requirements create a new paradigm called the nano-objects Internet.

1 is a diagram illustrating a network architecture for the Internet of nano objects according to an embodiment of the present invention.

1, a network architecture for running a general Internet of Nano-Things (IoNT) to compete for a single channel connection for communicating with a Nano-router 110 is shown in star topology And a plurality of nanosensor devices 120 disposed therein. These nanowire routers will have many computational resources and will integrate information from multiple nanosensor devices. Similarly, the Nano-micro interface 130 will relay information between the nanoscale and the Nano-link 260 via the nanowire. Depending on the application, the basic function of the nano-micro interface includes frequency band conversion between the terahertz range and the other low frequency band frequency bands. The gateway 140 will eventually connect to the Internet. The gateway 140 may be coupled to the nanomicro interface via, for example, a Nano-link 250.

Various technologies exist in the field of microscale communication. However, such conventional techniques are not directly applicable to nanoscale communications (communication between nanosensor devices and nanos routers). In practice, integration between small sensors in such nanorinks will require new, simple, and uncomplicated media access control operations. It should be noted that instead of high power carriers, pulse-based communications are expected to interconnect these nanosensor devices. Typical carrier-based communications require high-power EM signals to be continuously emitted through the medium, leading to a large amount of energy consumption that can not be imagined at all. Thus, a typical medium access control scheme based on the carrier sense multiplex technique can not be applied where there is no carrier to be sensed.

In high-speed communication systems, there are a number of pulse-based media access control schemes, such as an impulse radio based ultra wideband (UWB) system that utilizes different orthogonal time hopping sequences. However, most of these techniques presented in IR-UWB are not adequate to cope with energy limitations, device complexity limitations, and the unique features of THz channels. A common medium access control method that can be used in this environment is ALOHA. The basic operating principle of the ALOHA scheme is that the device transmits pulses carrying data at any time. Since transmission starts at a random point in time, a collision occurs when another node also transmits before the transmission of the preceding node is completed. As a result, as the number of sensors increases, retransmissions are frequently required, resulting in a drastic reduction in throughput.

On the other hand, speed-division multiple access (RDMA) is an alternative multiple-access technique in that each sensor node transmits while maintaining the individual pulse rates while keeping the duty cycle very low. The simplicity of the RDMA scheme makes it a promising candidate for EM nano-networks. Different pulse rates between different sensors in RDMA make the transmitted signal distinguishable at the receiver. The pulse rate is simply the reciprocal of the pulse period. Therefore, each sensor node in RDMA has its own pulse period. Unlike the time hopping pulse position modulation (TH-PPM) signal in which the pulse has a pseudo random number pulse position, the deterministic scheme of RDMA has a periodic signal structure.

It is an object of the present invention to provide a method and apparatus for implementing a totally asynchronous RDMA in which a sensor node can determine its corresponding pulse rate without the aid of a nano router or other node.

In one aspect, an autonomous rate division multiple access scheme for wireless nano networks proposed in the present invention generates a small field of applicable prime numbers from a fixed set of master prime in a prime mode algorithm Generating an index value corresponding to a user prime, applying the generated index value to the prime mode algorithm to obtain a prime number corresponding to a user prime, and comparing the obtained prime number with a time base (time base to calculate a user period.

The prime mode algorithm includes a predetermined number of classes and has a master prime corresponding to each class.

Generating an index value corresponding to the user prime and using the prime mode algorithm to generate candidate prime numbers corresponding to the master prime.

The method for generating the candidate prime numbers uses the following equation,

Here, X represents a candidate prime number, index represents a positive integer, and Y represents a value corresponding to one of the classes of the prime mode algorithm, and represents the small field distribution of candidate prime numbers using the above equation.

At least one prime number exists in the small field distribution of the candidate prime numbers.

Wherein the step of generating an index value corresponding to the user prime uses the following equation,

Here, IDm is an identifier of the user, and seed is an integer value shared by all users.

When the sensors are synchronized, the time stamp value is used as the seed. The time stamp records the current time of the event according to the network in a predetermined time unit, and environmental factors including temperature, heart rate, electrocardiogram pattern, humidity, , And considers the environmental factors as seeds.

According to another aspect of the present invention, there is provided an autonomous rate-division multiple access system for a wireless nano network, comprising: a prime mode algorithm unit for generating a small field of a prime number applicable from a fixed set of master prime in a prime mode algorithm; An index value generator for generating an index value corresponding to a user prime, a prime number acquiring unit for acquiring a prime number corresponding to a user prime by applying the generated index value to the prime mode algorithm, And a time base to calculate a user period.

The prime number obtaining unit generates an index value corresponding to the user prime and then generates candidate prime numbers corresponding to the master prime using the prime mode algorithm.

The prime number obtaining unit may generate the prime number using the following equation,

Here, X represents a candidate prime number, index represents a positive integer, MP represents a master prime number, and Y represents a value corresponding to one of the classes of the prime mode algorithm, and the small field distribution of the candidate prime numbers . At least one prime number exists in the small field distribution of the candidate prime numbers.

The index value generator may generate an index value corresponding to the user prime using the following equation,

Here, IDm is an identifier of the user, and seed is an integer value shared by all users. When the sensors are synchronized, the time stamp value is used as the seed. The time stamp records the current time of the event according to the network in a predetermined time unit, and the environment including the temperature, heart rate, electrocardiogram pattern, humidity, Share the factors, and consider the environmental factors as seeds.

A simple new algorithm in accordance with embodiments of the present invention can generate a prime number that is used to compute a separate pulse rate. These algorithms are proposed considering the computation and energy constraints of small sensor nodes. And, this method of operation is based on a random channel access time, and it is not required to coordinate with each other among the sensor nodes. We also implement a prime mode algorithm to use a pure prime number instead of a small number to design the pulse period.

1 is a diagram illustrating a network architecture for the Internet of nano objects according to an embodiment of the present invention.
FIG. 2 is a diagram illustrating a sequence of a plurality of users and a nano router in an OOK-based RDMA system according to an embodiment of the present invention.
FIG. 3 is a flowchart illustrating an autonomous rate-division multiple access method for a wireless nano-network according to an embodiment of the present invention.
4 is a diagram illustrating a configuration of an autonomous rate-division multiple access implementation system for a wireless nano-network according to an embodiment of the present invention.
5 is a diagram illustrating a statistical histogram of D with ascending master prime numbers according to an embodiment of the present invention.
FIG. 6 is a diagram illustrating a statistical histogram of D with order-scrambled master prime numbers according to an embodiment of the present invention.

Nano networks are considered candidates for implementing the nano-objects Internet. However, typical communication techniques can not be directly applied at the nanoscale level due to severe limitations in terms of energy, memory, computational resources, and hardware designs. A unique feature of pulse communication in nanowire networks enables interesting designs in medium access schemes that cross-arrange pulse streams transmitted between multiple nodes. Speed Division Multiple Access (RDMA) is one technique that enables cross placement by assigning different pulse periods (in other words, time periods between two pulses) to each node. As such, there are pulses transmitted from other nodes between two pulses of a particular node. To minimize the probability of collision, the pulse rate for each node in a typical rate-division multiple access scheme is required to be derived from a prime number or a number that is relatively small. In the present invention, a method of generating a unique prime number in each node by using a prime mode algorithm in extracting the pulse rate is proposed. The proposed method enables the implementation of speed - division multiple access in a completely asynchronous manner. In addition, the statistical results of the calculated prime numbers, the range of pulse cycles that can be used, the complexity and the probability of collision are compared with existing plans to determine the usefulness of this method.

Asynchronous multiple access operation for a pulse-UWB multi-user system based on RDMA according to the prior art requires that the pulse periods of each sensor node be given to each other, the greatest common divisor must be 1, And that the range can be minimized. Accordingly, it was necessary to preserve the list of small numbers (LPF). To determine the pulse period, the node selects a number and determines whether the prime number of the number already exists in the LPF. If a common prime number does not exist in the LPF, the selected number is used to calculate the pulse period, and the LPF is updated by adding the selected number. Otherwise, the selected number is incremented by 1 and the comparison process is repeated until a unique prime number is found. The next sensor node selects a number with a unique and small factor greater than the preselected number. This solution requires each user to access the LPF by creating implementation complexity. In addition, the selected number above must be factorized in each step of comparing the smallest factors that require significant computation.

In a terahertz EM nanowire network using a hand-shake between a sensor and an access point, a similar approach using the conventional RDMA according to the prior art has shown that each device has a speed code of 1000 It has an independent pool (for example, 1009, 1013, 1019 ...).

The sensor device randomly selects from the pool before transmission. This makes it possible for two or more sensors to select the same pulse rate. In this situation, a single collision pulse of pulses will lead to all subsequent pulses colliding resulting in a fatal collision. In this case, only one pulse collision of the pulses will result in a pulse collision that will cause all successive worst pulse collisions.

In the present invention, basically two groups of prior art can be categorized. The first involves dynamically generating small numbers of each other, updating a list containing these numbers, and sharing them among all the nanosensor devices. The second concept is to provide a static small number list to each nanosensor device and randomly select one small number from it.

The present invention proposes a simple and novel algorithm for generating a prime number that is used to compute a separate pulse rate. These algorithms are proposed considering the computation and energy constraints of small sensor nodes. This scheme is based on random channel access time and is not required to coordinate with each other between sensor nodes. By implementing this prime mode algorithm, we use a pure prime number instead of a small number to design the pulse period. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

A system model according to the present invention will be described. First, we assume a Nano Router (NR) and a Nanosensor Node M to transmit very short pulses. The nanosensor nodes represent the user, and the pulse period, which is the user's own period, is replaced by the "user period ". The user

Will be indexed as follows. The usage period of user m is denoted by Tm. Similarly, the duration of the pulse will be denoted by Tp and the condition Tp << Tm will treat all users the same.

FIG. 2 is a diagram illustrating a sequence of a plurality of users and a nano router in an OOK-based RDMA system according to an embodiment of the present invention.

Fig. 2 (a) shows a sequence "110101" transmitted by the user 1, Fig. 2 (b) shows a sequence "10110" (d) is a diagram showing a signal received at a nano router.

Time-spread on-off keying (TS-OOK) based on RDMA is regarded as a channel access mechanism and a modulation mechanism, respectively. Thus, as shown in FIG. 3, the logic bit "1" is transmitted in a short pulse and the logic bit &quot; 0 &quot; is transmitted in a pulse-free manner. If the considered model is based on a random channel access time, the initial usage time of the initial user m is

. The propagation delay was not considered in the analysis to simplify. The collision probability was minimized by setting the pulse width Tp to be much shorter than the user's Tm. However, if a collision occurs, it will not be transmitted due to all collided results. Two logical bits &quot; 0 &quot; do not cause any adverse effects, and logical bit conflicts of &quot; 0 &quot; and &quot; 1 &quot; will only adversely affect users transmitting only &quot; 0 &quot; The TS-OOK signal transmitted by the m-th user can be mathematically modeled as shown in equation (1).

Here, Ns is the number of symbols per packet, Am, k is the amplitude of the kth transmitted symbol by the m user, and P (t) is the Gaussian pulse. If there are M users transmitting signals asynchronously to the nano router, the received signal affected by the M signals in the channel can be modeled as shown in equation (2).

From here

Lt; RTI ID = 0.0 &gt; impulse response &lt; / RTI &gt; between the user m and the receiver,

Is the noise absorption added to the signal.

If two or more users transmit at the same pulse rate, a collision on one pulse will continue to cause collisions on all subsequent pulses until the end of the transmission. To avoid such conflicts, different user cycles must be used for each user. Since users are asynchronous, even if different periods are allocated to each user, the random channel connection time may still have a continuous collision probability. In order to overcome this problem and obtain the collision probability with the minimum limit, we can calculate the user period Tm as shown in equation (3).

Where Pm is an integer that is a positive prime number selected from user m, and Tb is a time base. The time base is assumed to be common to all users, and can be interpreted as a granular unit of the user period Tm. The time base is always kept smaller than the pulse width Tp. Thus, each user is required to generate a unique Pm to compute the user period corresponding to that user.

FIG. 3 is a flowchart illustrating an autonomous rate-division multiple access method for a wireless nano-network according to an embodiment of the present invention.

Methods of generating the prime numbers that exist in the prior art include methods such as sieve of eratosthenes, sieve of sundaram, sieve of Atkin, ). Also, running them in a sensor network requires integration between the appropriate nodes. Therefore, the present invention proposes a simple operation for generating a unique user period based on a light prime mode algorithm. At this time, it is not required to integrate each user to calculate an appropriate user period. First, how the prime mode algorithm is utilized will be explained in the next section on user cycle generation operation.

The proposed autonomous rate division multiple access scheme for a wireless nano network includes generating (310) a small field of applicable prime numbers from a fixed set of master prime in a prime mode algorithm, Generating a corresponding index value (320), applying the generated index value to the prime mode algorithm to obtain a prime number corresponding to the user prime (330), multiplying the obtained prime number by the time base And computing (340) the user period.

At this time, the prime mode algorithm includes a predetermined number of classes and has a master prime corresponding to each class.

And generating an index value corresponding to the user prime and generating candidate prime numbers corresponding to the master prime using the prime mode algorithm.

At step 310, a small field of applicable prime numbers is generated from the fixed set of master prime in the prime mode algorithm.

In fact, prime numbers are considered random. The generic method is generated by performing a hydrophobic test on a large field of numeric candidates. The method of generating a typical prime number involves performing an initial test in a broad field of prime number candidates. This therefore requires a lot of computational resources and tends not to be useful for small devices. The proposed prime mode algorithm generates a small field of applicable prime numbers from a fixed set of master prime (MP). And performs initial tests on these prime number candidates.

At this time, the prime mode algorithm includes a predetermined number of classes and has a master prime corresponding to each class. For example, the prime mode algorithm can be classified into three classes: prime mode 30, prime mode 60, and prime mode 90 algorithm. The master prime for each of these prime modes is provided in Table 1.

 <Table 1>

The user cycle generation step of the proposed method can be layered in three stages. First, in step 320, an index value corresponding to the user prime is generated.

Generating index values corresponding to the user prime and generating candidate prime numbers corresponding to the master prime using the prime mode algorithm. The method of generating the candidate prime numbers uses Equation (4).

Here, X is a candidate prime number, index is a positive integer, and Y values are 30, 60, and 90, respectively, depending on whether the prime mode 30, the prime mode 60, or the prime mode 90 is selected. Since each index has a master prime, there are cases where the candidate prime numbers are the same.

Table 2 shows the small field distribution of the candidate group prime numbers generated using the prime mode 60 algorithm (i. E., Y = 60). The numbers in Table 2 in bold type indicate prime numbers, while the remainder are not prime numbers. As can be seen in Table 2, there is at least one prime number among the limited fields of the 14 candidate prime numbers.

<Table 2>

The step of generating an index value corresponding to the user prime uses Equation (5).

Where IDm is a unique identifier for a user, and seed is a generic integer value shared by all users. Like IDm, each user in every network has a specific identifier that is assumed to be an integer. Also, because it covers a small service area of electromagnetism in a nanowire network, all users are very tightly distributed in terms of distance. Therefore, depending on the application, they can be assumed to share common environmental factors such as human body or physical temperature, heart rate, electrocardiogram pattern, humidity, and pressure. General factors between such users can be considered as seed values. In addition, if the sensors are synchronized, the timestamp value can be used as a seed. The time stamp records the current time of the event in units of seconds, minutes, hours, days, etc. according to the network. To mitigate synchronization constraints, higher values can be used in minutes or hours in the timestamp.

After calculating index m, each user generates a prime number candidate corresponding to MP (master prime) using the prime mode algorithm described above. Fermat's prime number discrimination plays a role in identifying which candidate number is the prime number. The Fermat's prime number discrimination method, also referred to as the Fermat measure, is given by Equation (6) if N is a prime number and 0 <a <N.

Since each user needs only one prime number, once the prime number is obtained, it is not necessary to perform a test on the remaining candidate prime numbers. This process can reduce complexity and delay.

Next, in step 330, the generated index value is applied to the prime mode algorithm to obtain a prime number corresponding to the user prime. Finally, in step 340, the user's period is calculated by multiplying the obtained prime number by the time base. As shown in Equation (3), in the final step, the selected prime number is multiplied by a time base to obtain a user period.

The proposed prime mode algorithm according to the embodiment can be expressed as follows.

4 is a diagram illustrating a configuration of an autonomous rate-division multiple access implementation system for a wireless nano-network according to an embodiment of the present invention.

The autonomous speed division multiple access implementation system 400 according to the present embodiment may include a processor 410, a bus 420, a network interface 430, a memory 440 and a database 450. The memory 440 may include an operating system 441 and an autonomous rate division multiple access implementation routine 442. The processor 410 may include a prime mode algorithm unit 411, an index value generation unit 412, a prime number acquisition unit 413, and a user period calculation unit 414. In other embodiments, the autonomous rate division multiple access implementation system 400 may include more components than the components of FIG. However, there is no need to clearly illustrate most conventional technical components. For example, the autonomous rate division multiple access implementation system 400 may include other components such as a display or a transceiver.

The memory 440 may be a computer-readable recording medium and may include a permanent mass storage device such as a random access memory (RAM), a read only memory (ROM), and a disk drive. The memory 440 may also store program code for the operating system 441 and the autonomous rate division multiple access implementation routine 442. These software components may be loaded from a computer readable recording medium separate from the memory 440 using a drive mechanism (not shown). Such a computer-readable recording medium may include a computer-readable recording medium (not shown) such as a floppy drive, a disk, a tape, a DVD / CD-ROM drive, or a memory card. In other embodiments, the software components may be loaded into the memory 440 via the network interface 430 rather than from a computer readable recording medium.

The bus 420 may enable communication and data transfer between the components of the autonomous rate division multiple access implementation system 400. The bus 420 may be configured using a high-speed serial bus, a parallel bus, a Storage Area Network (SAN), and / or any other suitable communication technology.

Network interface 430 may be a computer hardware component for coupling autonomous rate division multiple access implementation system 400 to a computer network. The network interface 430 may connect the autonomous rate division multiple access implementation system 400 to a computer network via a wireless or wired connection.

The database 450 may be responsible for storing and maintaining all information necessary for autonomous rate division multiple access implementation. In FIG. 4, the database 450 is constructed and included in the autonomous speed-division multiple access implementation system 400, but the present invention is not limited thereto and may be omitted depending on the system implementation method or environment, It is also possible that some databases exist as external databases built on separate, separate systems.

The processor 410 may be configured to process instructions of a computer program by performing basic arithmetic, logic, and input / output operations of an autonomous rate-division multiple access implementation system 400. The instructions may be provided by the memory 440 or network interface 430 and to the processor 410 via the bus 420. The processor 410 may be configured to execute program codes for the prime mode algorithm unit 411, the index value generator 412, the prime number acquisition unit 413, and the user period calculator 414. [ Such program code may be stored in a recording device, such as memory 440. [

The prime mode algorithm unit 411, the index value generation unit 412, the prime number acquisition unit 413 and the user period calculation unit 414 may be configured to perform the steps 310 to 340 of FIG. 3 .

The autonomous rate division multiple access implementation system 400 may include a prime mode algorithm unit 411, an index value generation unit 412, a prime number acquisition unit 413, and a user period calculation unit 414. [

The prime mode algorithm unit 411 generates a small field of the applicable prime number from the fixed set of master prime in the prime mode algorithm. The prime mode algorithm includes a predetermined number of classes and has a master prime corresponding to each class.

In fact, prime numbers are considered random. The generic method is generated by performing a hydrophobic test on a large field of numeric candidates. The method of generating a typical prime number involves performing an initial test in a broad field of prime number candidates. This therefore requires a lot of computational resources and tends not to be useful for small devices. The proposed prime mode algorithm generates a small field of applicable prime numbers from a fixed set of master prime (MP). And performs initial testing in such a prime number candidate group.

At this time, the prime mode algorithm includes a predetermined number of classes and has a master prime corresponding to each class. For example, the prime mode algorithm can be classified into three classes: prime mode 30, prime mode 60, and prime mode 90 algorithm.

The index value generator 412 generates an index value corresponding to the user prime.

Generating index values corresponding to the user prime and generating candidate prime numbers corresponding to the master prime using the prime mode algorithm. The step of generating an index value corresponding to the user prime uses Equation (5).

Like IDm, each tk user in any network has a specific identifier that is assumed to be an integer. In addition, because it covers a small range of electromagnetic radiation in the nano-network, all users are very close in terms of distance. Therefore, depending on the application, they may be assumed to share common environmental factors such as human body or physical temperature, heart rate, electrocardiogram pattern, humidity, and pressure. Common factors between these users can be considered as seed values. In addition, if the sensors are synchronized, the timestamp value can be used as a seed. The time stamp records the current time of the event in units of seconds, minutes, hours, days, etc. according to the network. To mitigate synchronization constraints, higher values can be used in minutes or hours in the timestamp.

After calculating the index m, each user generates a prime number candidate corresponding to the master prime (MP) using the prime mode algorithm described above. Fermat's prime number discrimination plays a role of checking which candidate number is the prime number. The Fermat's prime number discrimination method, also referred to as the Fermat measure, is given by Equation (6) if N is a prime number and 0 <a <N.

Since each user needs only one prime number, once the prime number is obtained, it is not necessary to perform a test on the remaining candidate prime numbers. This process can also reduce complexity and resultant latency.

The prime number obtaining unit 413 applies the generated index value to the prime mode algorithm to obtain a prime number corresponding to the user prime. After generating index values corresponding to the user prime, candidate prime numbers corresponding to the master prime are generated using the prime mode algorithm. The method of generating the candidate prime numbers uses Equation (4).

The user period calculator 414 calculates the user period by multiplying the obtained prime number by the time base. As shown in Equation (3), in the final step, the selected prime number is multiplied by a time base to obtain a user period.

Next, the performance verification results of the proposed method and system for autonomous rate division multiple access for wireless nano networks will be described.

5 is a diagram illustrating a statistical histogram of D with ascending master prime numbers according to an embodiment of the present invention.

Clear time differences between the two user cycles are required to interrupt the collision cluster. Since the time base is the same for all users, this can be accomplished by careful selection of prime numbers that are the smallest difference between consecutively selected prime numbers. The difference between consecutively selected prime numbers is denoted by D (distance) as the distance difference. The minimum distance difference then ensures at least one pulse that does not cause a collision.

Even though clashes between two users can be reduced by assigning a transmission period as a product of a unique prime number, cluster collisions can occur when a large number of users are considered. Some degree of difference between the two user cycles needs to be maintained to distribute these cluster conflicts. To compensate for this, attention should be paid to prime number selection in cases such as when there are very small differences in the prime numbers that are selected consecutively. In the proposed method, the difference between consecutively selected prime numbers is called difference distance and is denoted by 'D'. At this time, the minimum difference distance guarantees a pulse that does not cause at least one collision after each collision. As described in the prior art, this can be obtained by multiplying the time base Tb by the minimum difference distance Dmin. Dmin can be expressed by Equation (7).

Then, Dmin must be larger than the pulse width Tp. In other words, Equation (8) is obtained.

For example, in Table 3, considering the first generated prime number for each user, the set of successive distance differences would be (62, 58, 66, 60, 54, 62, 76, 42, 60, 68) . in this case

Is 42.

<Table 3>

In the analysis of the present invention, consecutive distance differences are considered as performance evaluation parameters. The prime numbers generated by the proposed technique are generated from a limited field, but the distribution of this is random within the field. Therefore, statistical characteristics of the prime numbers calculated in terms of the distance difference D can be investigated. Use MATLAB to look at the mean and standard deviation as well as the minimum distance D. To obtain statistical results, a range of index values from 80 to 1600 is considered.

First, look at the case of master prime numbers arranged in ascending order as shown in Table 3. [ It can be confirmed that the histogram of the distance distribution D has a Gaussian distribution having an average of 60.00103 and a standard deviation of 10.1768 as shown in Fig. However, the minimum distance,

Lt; / RTI &gt;

We compare the complexity of the operation proposed in the present invention based on the prime mode algorithm and the prime number generation operation shown in a typical non-integrated RDMA.

In the proposed operation, generating a candidate prime number requires one sum and one multiplication operation. To determine whether a candidate number is not a prime number, the proposed operation requires one minority discrimination. Since there is a master prime, there are the same number of candidate prime numbers. Therefore, the minimum complexity cost of this approach occurs when the first candidate number is subjected to a test of the decimal number. In this regard, the minimum complexity cost in this manner can be expressed as:

Here, Ca , Cm, and Cp represent the complexity costs of a single sum, multiplication, and fractional discrimination test, respectively. On the other hand, complexity is maximized when the last candidate number that performs a fractional discrimination test is a prime number. The cost of complexity in this proposed maximum operation can be expressed as Equation (10).

Here, Lmp is the number of master prime depending on whether prime mode 30, 60 or 90 is used, that is,

to be. When P is checked by a prime number test as a candidate prime number, a single prime number discrimination includes one modular division and a P-2 multiplication. The multiplicative operation

The process can be reduced by exponentiation or by more general addition-chain exponentiation. On the other hand, the prime number generation operation in the prior art includes one addition and one factorization to obtain and test candidate prime numbers. Therefore, the minimum complexity cost for operation in the prior art is expressed by Equation (11).

Where Cf is the cost for one factorization. If no cows are found, the process is repeated. Therefore, the complexity cost of the maximum value in the prior art can be expressed as Equation (12).

Where Lcp is the number of processes in which the process is repeated to find each other.

The algorithm according to the prior art comprises several complex factorization stages, each of which includes several divisions. This prior art algorithm is much more complex than the proposed method. An analysis of this complexity is summarized in Table 4.

<Table 4>

As shown in equation (3), the user period is generated with the selected prime number and time base. The timebase is usually fixed on all nodes. As a result, only the value of the prime number can be changed to adjust the pulse rate. The minimum pulse rate can be determined by the maximum allowed packet delay while the maximum pulse rate can be obtained when Pm = 1.

The fundamental principle underlying RDMA is to insert different pulses between each user pulse. The setting of Pm = 1 reduces the sharp distance between two pulses as much as possible between symbol speed users. So there will be less room to insert another user's pulse between the two pulses. In other words, by lowering the Pm to reduce the symbol rate, the collision will be greatly increased.

In addition, intersymbol interference generated from channel multipath and high power consumption also degrades system performance. Taking this into consideration,

Is the minimum value allowed for the user period. Therefore, the lowest range of the prime number is expressed as Equation (13).

On the other side, each network has a specific limit of delay in the packet range of hundreds of milliseconds (msec) depending on the application. In this regard, the symbol rate can not be minimized beyond the packet delay range that disables the receiver. Considering this fact

Can be regarded as the maximum packet delay of the user m. Therefore, the maximum limit of the prime number is expressed by Equation (14).

A specific offset value must be added to the index value to obtain the required index value. These are summarized in Table 5.

<Table 5>

FIG. 6 is a diagram illustrating a statistical histogram of D with order-scrambled master prime numbers according to an embodiment of the present invention.

Since the object of the present invention is to satisfy the condition of equation (6) to improve performance,

. In order to solve this problem, instead of using the ascending order of the master prime numbers, a random number such as {29, 31, 23, 37, 19, 17, 13, 11, 41, 43, 53, 47, 59, 61} Mix. By considering this, interesting results can be found. The histogram of D still maintains a Gaussian distribution with an average of 59.9925 as shown in Figure 3, which is almost similar to the previous case, while the standard deviation decreases to 8.8650,

Was increased to 30. In other words, by shuffling master prime numbers

3 times. this is

= 30 is the optimal value for the mode 60 algorithm. To visualize this idea, consider whether the selected prime number for the index value i is located in the first master prime number or the prime number selected for the index value i + 2 is located in the last master prime number, and then the index value i + The optimal position of the selected prime number for 1 should be located in the middle of the master prime number, which is approximately 30.

In order to successfully implement the rate division multiple access scheme, a new scheme for determining a user period for each user is proposed. The proposed scheme includes a step of generating an index value for each user and calculating a corresponding prime number that provides a unique user period in the value. The Prime Mode 60 algorithm, which consists of 14 master prime numbers, is used to generate each prime number. The successive distance differences of the selected prime numbers can be increased by arbitrarily shuffling the order of the master prime numbers instead of ascending order.

The apparatus described above may be implemented as a hardware component, a software component, and / or a combination of hardware components and software components. For example, the apparatus and components described in the embodiments may be implemented within a computer system, such as, for example, a processor, a controller, an arithmetic logic unit (ALU), a digital signal processor, a microcomputer, a field programmable array (FPA) A programmable logic unit (PLU), a microprocessor, or any other device capable of executing and responding to instructions. The processing device may execute an operating system (OS) and one or more software applications running on the operating system. The processing device may also access, store, manipulate, process, and generate data in response to execution of the software. For ease of understanding, the processing apparatus may be described as being used singly, but those skilled in the art will recognize that the processing apparatus may have a plurality of processing elements and / As shown in FIG. For example, the processing unit may comprise a plurality of processors or one processor and one controller. Other processing configurations are also possible, such as a parallel processor.

The software may include a computer program, code, instructions, or a combination of one or more of the foregoing, and may be configured to configure the processing device to operate as desired or to process it collectively or collectively Device can be commanded. The software and / or data may be in the form of any type of machine, component, physical device, virtual equipment, computer storage media, or device , Or may be permanently or temporarily embodied in a transmitted signal wave. The software may be distributed over a networked computer system and stored or executed in a distributed manner. The software and data may be stored on one or more computer readable recording media.

The method according to an embodiment may be implemented in the form of a program command that can be executed through various computer means and recorded in a computer-readable medium. The computer-readable medium may include program instructions, data files, data structures, and the like, alone or in combination. The program instructions to be recorded on the medium may be those specially designed and configured for the embodiments or may be available to those skilled in the art of computer software. Examples of computer-readable media include magnetic media such as hard disks, floppy disks and magnetic tape; optical media such as CD-ROMs and DVDs; magnetic media such as floppy disks; Magneto-optical media, and hardware devices specifically configured to store and execute program instructions such as ROM, RAM, flash memory, and the like. Examples of program instructions include machine language code such as those produced by a compiler, as well as high-level language code that can be executed by a computer using an interpreter or the like. The hardware devices described above may be configured to operate as one or more software modules to perform the operations of the embodiments, and vice versa.

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. For example, it is to be understood that the techniques described may be performed in a different order than the described methods, and / or that components of the described systems, structures, devices, circuits, Lt; / RTI &gt; or equivalents, even if it is replaced or replaced.

Therefore, other implementations, other embodiments, and equivalents to the claims are also within the scope of the following claims.

Claims (12)

In an autonomous rate division multiple access implementation,
Generating a small field of an applicable prime number from a fixed set of master prime in a prime mode algorithm;
Generating an index value corresponding to a user prime;
Applying the generated index value to the prime mode algorithm to obtain a prime number corresponding to a user prime; And
Calculating a user period by multiplying the obtained prime number by a time base
The method comprising the steps of: The method according to claim 1,
Wherein the prime mode algorithm comprises a predetermined number of classes, each prime mode algorithm having a master prime corresponding to each class
Autonomous velocity division multiple access implementation method. The method according to claim 1,
Generating index values corresponding to the user prime and generating candidate prime numbers corresponding to the master prime using the prime mode algorithm;
The method comprising the steps of: The method of claim 3,
The method for generating the candidate prime numbers uses the following equation,

Here, X denotes a candidate prime number, index denotes a positive integer, Y denotes a value corresponding to one of the classes of the prime mode algorithm, MP denotes a master prime, Representing a small field distribution
Autonomous velocity division multiple access implementation method. 5. The method of claim 4,
At least one prime number is present in the small field distribution of the candidate prime numbers
Autonomous velocity division multiple access implementation method. The method according to claim 1,
Wherein the step of generating an index value corresponding to the user prime uses the following equation,

Where IDm is the user's identifier, seed is the integer value shared by all users, and M is the number of users in the network
Autonomous velocity division multiple access implementation method. The method according to claim 6,
The time stamp value is used as a seed when the sensors are synchronized, the time stamp records the current time of the event according to the network in a predetermined time unit,
It shares environmental factors including temperature, heart rate, electrocardiogram pattern, humidity, and air pressure, and considers the environmental factors as seeds.
Autonomous velocity division multiple access implementation method. The method according to claim 1,
The prime mode algorithm is expressed as

Autonomous velocity division multiple access implementation method. In an autonomous rate division multiple access implementation system,
A prime mode algorithm unit for generating a small field of an applicable prime number from a fixed set of master prime in a prime mode algorithm;
An index value generator for generating an index value corresponding to a user prime;
Applying the generated index value to the prime mode algorithm to obtain a prime number corresponding to the user prime; And
A user period calculation unit for calculating a user period by multiplying the obtained prime number by a time base,
Wherein the autonomous rate-division multiple access implementation system comprises: 10. The method of claim 9,
Wherein the prime number obtaining unit comprises:
Generating index values corresponding to the user prime, and generating candidate prime numbers corresponding to the master prime using the prime mode algorithm
Autonomous velocity division multiple access implementation system. 11. The method of claim 10,
Wherein the prime number obtaining unit comprises:
The candidate prime numbers are generated using the following equation,

Here, X denotes a candidate prime number, index denotes a positive integer, Y denotes a value corresponding to one of the classes of the prime mode algorithm, MP denotes a master prime, Small field distribution,
At least one prime number is present in the small field distribution of the candidate prime numbers
Autonomous velocity division multiple access implementation system. 10. The method of claim 9,
Wherein the index value generator comprises:
An index value corresponding to the user prime is generated using the following equation,

Here, IDm is an identifier of the user, seed is an integer value shared by all users, M is the number of users in the network,
The time stamp value is used as a seed when the sensors are synchronized, the time stamp records the current time of the event according to the network in a predetermined time unit,
It shares environmental factors including temperature, heart rate, electrocardiogram pattern, humidity, and air pressure, and considers the environmental factors as seeds.
Autonomous velocity division multiple access implementation system.

Images