JP2003333079A - Method of performing multihop peer-to-peer communication in wireless network, and distribution service - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a method of issuing coupons or points in a method of performing multi-hop peer-to-peer communication, in a wireless network which includes a plurality of wireless terminals with a intermittently changing topology. <P>SOLUTION: Each wireless terminal mutually exchanges link condition with a wireless terminal enabling direct communication, and a routine table is configured in advance. When a wireless terminal obtains a content and desires to introduce it to someone else, the wireless terminal refers to the routine table and transfers the content to other wireless terminal. Then, the wireless terminal calculates coupons or points for getting discount when purchasing the content and stores the same. <P>COPYRIGHT: (C)2004,JPO

Description

Detailed Description of the Invention

[0001]

FIELD OF THE INVENTION The present invention relates to a method for multi-hop peer-to-peer communication in a wireless network.

[0002]

2. Description of the Related Art Internet Protocol (IP) is known as a protocol for data communication using a network.
This protocol is widely used on the Internet. Recently, wireless networks such as IEEE802.11x and Bluetooth are becoming widespread, and data communication using the wireless networks is also being provided. The system for this has a central server and a central point.
It is not for eer-to-Peer communication.

[0003]

[Problems to be Solved by the Invention] In order to perform multi-hop Peer-to-Peer communication on a wireless network,
Each terminal on the way route must correctly control the packet. However, it is highly likely that the conventional route control technology on the Internet will not be able to keep up with the update of route information in a network whose topology changes drastically. In wireless networks, nodes = devices move extensively, so that the points of connection to the network change frequently. In addition, the terminal itself may appear to have disappeared due to shutting down or going out of radio range.

It is an object of the present invention to provide a protocol and a communication method of a wireless terminal device, which are capable of correctly controlling a route even in such a network whose topology changes drastically.
In particular, a viral (viral:
It is an object to provide a word-of-mouth system / method and a push (delivery) server system / method.

[0005]

SUMMARY OF THE INVENTION The present invention is a method for performing multi-hop peer-to-peer communication in a wireless network that includes a plurality of wireless terminals, the topology of which varies from time to time. Includes a step of exchanging a link state with a wireless terminal capable of direct communication to build a routing table, a step of a first wireless terminal included in the wireless terminal obtaining contents, and a step of the first wireless terminal Transferring the content to another wireless terminal by referring to the routing table; calculating coupons or points for the first wireless terminal to receive a discount when purchasing the content, and storing the coupon or points; And a step of performing.

[0006] Preferably, the coupon or points are calculated based on the number of transfer destinations of the content.

Preferably, the content is accompanied by attribute information including transfer path information, and the transfer path information is updated when the content is transferred.

[0008] Preferably, the attribute information further includes a comment of a relay person, and the comment is added at the relay terminal when the content is transferred.

[0009] Preferably, the attribute information is transmitted to the content provider.

[0010] Preferably, further, a step of preparing a packet including a route stack for storing intermediate route information each time the packet passes through the terminal, and a step of broadcasting the packet by designating a destination terminal as a source terminal And, while the wireless terminal on the way of receiving the packet writes the intermediate route information to the route stack,
Transferring the packet to all the wireless terminals based on the routing table, and the destination terminal receiving the packet reverses the route that the packet has followed based on the information of the route stack to the source terminal. Sending back a packet, the source terminal receiving the packet unicasting a message to the target terminal via a wireless terminal in the path based on information of the path stack included in the packet, Equipped with.

The present invention is a method for performing multi-hop peer-to-peer communication in a wireless network including a plurality of wireless terminals and a content distribution server, wherein the topology between the plurality of wireless terminals changes from moment to moment. Then, each wireless terminal exchanges a link state with a wireless terminal that can directly communicate with each other to construct a routing table, and a packet including a route stack that stores intermediate route information each time the packet passes through the terminal. And a step in which the source terminal designates the distribution server as a destination to broadcast the packet, and a wireless terminal on the way of receiving the packet writes intermediate path information to the path stack,
Transferring the packet to all the wireless terminals based on the routing table, and the delivery server receiving the packet reverses the route that the packet has followed based on the information of the route stack to the source terminal. Transmitting the packet or content,
The distribution server includes a step of calculating a coupon or points, and a step of the distribution server transmitting the coupons or points to a wireless terminal that has performed a relay process with reference to the route stack. is there.

Preferably, the method further comprises the step of storing the coupon or points in the distribution server together with or instead of the step of transmitting the coupon or points.

[0013] Preferably, the coupon or points are calculated according to the number of times of relay of the wireless terminal which has performed the relay process.

Preferably, the coupon or points are calculated according to the time that the wireless terminal that has performed the relay process stays within the coverage area of the distribution server.

The present invention includes a plurality of wireless terminals and a content distribution server, wherein the topology between the plurality of wireless terminals is a distribution server connected to a wireless network that changes from time to time, and the distribution server is connected to each of the terminals every time it passes the terminal. Receive a packet containing a route stack that stores route information on the way,
Based on the information of the route stack, the packet is traversed and the content is delivered to the source terminal,
The coupon or points are calculated, and the coupon or points are transmitted to the wireless terminal that has performed the relay process by referring to the path stack.

[0016]

BEST MODE FOR CARRYING OUT THE INVENTION Embodiment 1 of the Invention An explanatory diagram of a system / method according to a first embodiment of the invention is shown in FIG.
In FIG. 1, 1-S, 1a, 1b, 1c and 1d are wireless terminals. Each terminal has substantially the same function and can communicate with other wireless terminals existing within a predetermined range. The details of the protocol will be described later. The wireless terminal 1-S can communicate with the other wireless terminals 1a, 1b, 1c existing within the range surrounded by the circle R, and can deliver contents to them. The wireless terminal 1-S cannot communicate with the wireless terminal 1d, but can indirectly deliver the content via the wireless terminal 1a.

Each wireless terminal includes a memory 1-1 for storing content and a memory 1-2 for storing points as a reward for content distribution.

The wireless terminal 1 in FIG. 1 realizes P2P communication. The wireless terminal 1 does not require complicated address setting or connection procedure, and operates immediately when the terminal is powered on. The wireless terminal 1 connects the communication in a relay manner. The protocol is characterized by dynamically discovering communication routes (details will be described later). This protocol is for mobile phones, PDAs, P
Enables multi-hop communication between all terminals regardless of type such as C or dedicated wireless terminal. Therefore, the wireless terminal may be a mobile phone, a PDA, or a PC. This protocol is an ad hoc network that does not require preconfiguration such as addresses. This protocol is based on IEEE
It is a wireless communication protocol that is used by incorporating it in a PC or mobile terminal device such as 802.11x or Bluetooth (trademark).

When the wireless terminal 1 is constructed as a dedicated terminal, the wireless gadget can be made as small and convenient as it is lowered to a key holder. This dedicated terminal can perform relay refusal and reception settings, and can perform wireless communication with other terminals within a range of 10 m / 100 m with one button operation. This dedicated terminal has a small LCD for checking items and a simple character input mechanism. By plugging this dedicated terminal into a mobile phone, you can operate it using the numeric keypad of the mobile phone, use the same color liquid crystal display, play the saved music and video files on the mobile phone, and display detailed information on the mobile phone. It can be displayed in a browser.

The system shown in FIG. 1 can do the following.

(1) Viral system using music files Viral (virus) is word-of-mouth on the network. Today, with so much information, mere advertising is no longer effective. In order to get the user's attention, it is necessary to get into the circle of communication between users. The system of FIG. 1 is optimal for this purpose.

For example, it is assumed that the user who owns the wireless terminal 1-S downloads to the mobile phone an MP3 file capable of playing only the new song chorus. This is a very nice thing, and there are times when I want to let people know the new song I got. This is possible in the system of FIG. 1, and it is possible to transfer the content to other wireless terminals 1a, 1b, 1c and tell them that they should listen. Since the system of FIG. 1 does not use a public line, there is no cost for communication. Although the content cannot be directly transmitted to the wireless terminal 1d, when the user of the wireless terminal 1a considers the content to be good, the content can be transferred to the wireless terminal 1d by transferring the content. In this way, if the content is nice, the relay of the promotional song occurs, that is, the content spreads by word of mouth.

Moreover, since the users of the wireless terminal 1-S have recommended new songs to three people, they can receive a discount when buying a CD, and from this point, it is possible to promote the spread by word of mouth. The content that has been transferred over and over is excellent, so the more you relay it to your friends, the more valuable your "music file" becomes.

According to the system of FIG. 1, contents (for example, music files) are relayed one after another, and the contents can be appealed to people who have not downloaded them directly. This is achieved by the “easy” multi-hop network that was first realized by the system of FIG.

The above processing will be described with reference to the flowchart of FIG.

S1: Content (eg music file)
Is downloaded to the wireless terminal 1-S. It is received from a server (not shown) or another wireless terminal, or downloaded directly from a store device.

S2: When the user evaluates the content and wants to introduce it to others, the user operates the wireless terminal 1-S to start the distribution process.

S3: The wireless terminal 1-S searches the link table described later to grasp the wireless terminals in the vicinity that can communicate. It should be noted that each wireless terminal can refuse any communication with other terminals, refuse processing of relaying between terminals, and refuse content transfer. When rejecting any communication, the ID of the terminal is not recorded in the link table. When the relay is rejected or the content transfer is rejected, the link table is flagged to that effect. When the flag is set, the wireless terminal 1-S does not transfer the content to the terminal. The notification of relay refusal / content transfer refusal is sent from the terminal in advance as indicated by the dotted line in FIG.

S4: The content is transferred to the wireless terminal which has not refused the transfer of the content.

S5: Calculate points for content transfer. When the content is paid and is for commercial purposes, it is advisable to pay some kind of reward or reward to the person who spread the content through so-called word-of-mouth. This point is for this purpose. Points include, for example, content discount points and redemption points for other products.

S6: The calculated points are stored in the memory 1-2.
Will be added to.

S7: Redeem points as required. The point is a paperless coupon, you can purchase goods at the paperless coupon participating store,
At the time of payment, the discount coupon can be wirelessly transferred to the POS.

An example of the structure of the transferred content is shown in FIG.
Shown in. The attribute 1-1b may be included together with the content data 1-1a. For example, a content download source (for example, URL) is included so that the content can be directly downloaded or inquired. Alternatively, information about the transfer route including the stack and the number of people is included so that the route that the content has followed can be understood. Content that has gone through the hands of many people can be said to be excellent. By seeing this, it can be used as a reference for deciding whether to view (listen to) the content. Further, the comment of the relay person may be included. The comment serves as a reference for evaluating the content. The attribute information is also useful for content providers. This system enables a kind of market research. Moreover, the cost for that can be kept extremely low.

Embodiment 2 of the Invention First Embodiment of the Invention
In the above, the content is distributed to the wireless terminals that can communicate, but the content may be guided in advance and the content may be transferred to the desired person.

FIG. 4 shows a flowchart of the second embodiment of the present invention. In this figure, a content guide is transmitted to each wireless terminal (S8), and a content transfer request (S9-
1, S9-2), the contents are transferred (S10-1, S10-2). Whether or not there is a content transfer request is recorded in the attribute 1-1b in FIG.
The content provider can know the degree of popularity of the content by receiving the attribute data from each wireless terminal and checking the attribute 1-1b.

The second embodiment of the present invention has the following features. (1) Since the content guide is sent before the content distribution, the content can be distributed only to those who need it. (2) Attribute information can be updated when delivering contents.
The attribute information is useful information for market research. (3) When calculating points, the distribution status (number of distribution destinations, etc.) can be taken into consideration, so that a reward can be paid according to the achievement.

Third Embodiment of the Invention Embodiment 3 of the invention
FIG. 6 is an explanatory diagram of the system / method according to the present invention. In FIG. 6, 2 includes a predetermined content and has a predetermined range (see FIG.
Is a distribution server that communicates with the wireless terminal 1e within the circle R). For example, the distribution server 2 is a PUSH server for PUSH-distributing information to peripheral devices centering on an access point. The wireless terminals 1e and 1f are the same as the wireless terminal 1 described above. The wireless terminal 1f is outside the coverage area of the antenna of the server 2 and cannot directly communicate, but can communicate by relaying the wireless terminal 1e according to a protocol described later.

The system of FIG. 6 is used, for example, as follows. The user of the wireless terminal 1f knows that the distribution server 2 is nearby, and wants to obtain that information. However, it cannot directly communicate with the distribution server 2. Therefore, the wireless terminal 1f broadcasts the packet with the distribution server 2 as the destination. The packet is the wireless terminal 1
It is transferred by e and reaches the distribution server 2. Distribution server 2
Returns the packet to the wireless terminal 1f. The wireless terminal 1f receives the packet from the distribution server 2 and requests the distribution server 2 to transmit the content based on the route stack included in the packet. In this way, even if the wireless terminal 1f cannot directly communicate with the distribution server 2, the wireless terminal 1f can receive the content from the distribution server 2. The wireless terminal 1f may first broadcast a content transmission request, and the distribution server 2 may directly transmit the content without returning a packet.

The system shown in FIG. 6 can do the following. (2) Information distribution from hotspots ・ PUSH pinpoint information from a distribution server installed at a specific place ・ Distribute recommended information in front of the station for each station ・ Notify train congestion from one station in front ・ Notification of bulletin board Receive details at the touch of a button ・ Distribute traffic information in the surrounding area in a timely manner by using car signal waiting

(3) Street corner game-Preparing different game maps for each real city-Preparing items that can only be obtained by going to the spot and clearing-Clearing in cooperation with the person present

The above processing will be described with reference to the flowchart of FIG.

S20: The content requesting terminal 1f
The packet is broadcast to know the route for accessing the server 2. If the route to the server 2 is already known, the broadcast may be omitted and the content request may be sent directly to the server 2.

S21: A content request is transmitted to the server 2. The content request is made on the way to another terminal 1e.
Is received (S22).

S23: The server 2 receives the content request, analyzes the request, and prepares the requested content.

S24: The route stack included in the content request (packet) received from the terminal 1f is analyzed. Along with the route from the route stack to the requesting terminal,
It is possible to know the terminal 1e that relayed.

S25: The contents are distributed to the requesting wireless terminal 1f based on the path stack. The relay (S26) of another terminal 1e is received on the way.

S27: Calculate a coupon (reward) for the relayed wireless terminal. Thanks to the wireless terminal that relayed, the wireless terminal outside the coverage area of the distribution server 2 was also able to obtain the content, so we should thank the wireless terminal for the relay work. The wireless terminal 1f should pay a reward to the wireless terminal 1e if it is a beneficiary's burden, but in reality, it is desirable that the server 2 distributes the coupon.

The coupon is calculated according to the contribution of the relayed terminal. For example, it is calculated according to the number of times of relaying or the time in the coverage area of the distribution server 2. This is because the wireless terminal always moves.

Although the number of relay terminals is one in FIG. 7, the number is not limited to this, and a plurality of relay terminals may be used. In the case of multiple terminals, a coupon is issued for each terminal.

S28: The coupon is distributed.

S29: Store the received coupon in the memory. The stored coupons are later used for discounts when purchasing goods and services. For example, it is used when downloading paid content from the distribution server 2.

S30: With the issuance of the coupon / instead of the issuance of the coupon, points that can be used in exchange for goods / services may be calculated. Points are calculated in the same way as coupons.

S31: The points are stored in the distribution server 2. The above-mentioned coupons and points are a kind of reward for the owner of the terminal that has fulfilled the relay function. By these, the wireless terminal owner is prompted to participate in the P2P communication described below, and the P2P communication can be realized.

<Explanation of Protocol> The routing protocol according to the present invention (hereinafter referred to as the Jnutella routing protocol) will be described in detail below by taking the network topology of FIG. 8 as an example. In the figure, circles 1 including alphabets represent respective terminals, and solid lines between the plurality of terminals 1 represent sessions between the terminals 1. The terminal 1 is a mobile terminal and includes, for example, a mobile phone, a personal digital assistant, and a laptop computer. Terminal 1 is another terminal 1 within a specified coverage area
Can communicate with. It is possible to communicate with the terminal 1 outside the coverage area through a network. For example, in FIG.
In the above, even when the terminal 1F is outside the coverage area of the terminal 1A and cannot directly communicate, the terminal 1A can communicate with the terminal 1F by way of the terminals 1B, 1D, and 1E.
Each terminal 1 has the routing table of FIG.

In the Jnutella routing protocol, the link state having the structure of FIG. 9 is mutually exchanged between adjacent terminals 1 at regular intervals, and a routing table is constructed in advance regardless of the timing of data transmission.
It uses the ctive type. FIG. 10 shows a flowchart of this process in the terminal 1.

S1 of FIG. 10: A process of exchanging link information between adjacent terminals every predetermined time will be described. This process consists of steps S2 to S5 in FIG. Specific processing will be described below with reference to FIGS. 11 and 12.

In FIG. 11, the terminal 1B has the adjacent terminals 1A, 1C,
It shows how to obtain the link status from 1D. here,
Terminals 1A, 1C and 1D are all within the coverage area of terminal 1B,
The terminal 1B can directly communicate with each of the terminals 1A, 1C and 1D. The terminal 1B receives the link status of the terminal 1A itself from the terminal 1A, the link status of the terminal 1C itself from the terminal 1C, and the information of the terminal 1D itself and the terminals 1E and 1F from the terminal 1D. Therefore, the terminal 1B can know the existence of the terminals 1E and 1F (the terminal 1B cannot directly communicate with these terminals) ahead of the terminal 1D.

S2 of FIG. 10: A process for extracting information of terminals within a predetermined hop area from the own routing table will be described.

In this protocol, each terminal 1 does not exchange all the link information that it knows at once, but changes the refresh rate according to the scope of the terminal (the number of hops to the partner). This is because the route changes drastically in the mobile environment, and thus it is highly likely that the link information of a terminal in a scope farther than necessary will be invalid by the time it is relayed to the other party according to the procedure of FIG. .

In this protocol, the refresh rate is changed, for example, in 3 hops. An example of this case is shown in FIG. In FIG. 11, the terminal 1B is the terminals 1A, 1
It has a link status of C, 1D to 1F. In FIG. 12, when the terminal 1A obtains the link state from the terminal 1B, the terminal having a hop count of more than 3 as viewed from the receiving terminal 1A from the link information transferred by the terminal 1B, that is, the terminal 1F (from the terminal 1A to the terminal 1F). The number of hops to is 4)
Is deleted. The terminal 1F is not registered in the routing table within the 3-hop area viewed from the terminal 1A. That is, the terminal 1A cannot see the terminal 1F. With this device, it is possible to keep the communication bandwidth that is regularly consumed for exchanging link information low, and at the same time, stably acquire the route information within a few hops that is important to me.

Next, Peer-to-according to the embodiment of the present invention
13 to 18 for the procedure for performing Peer communication
Will be described with reference to.

As described above, each terminal 1 has only the link status of a predetermined number (= 3) of terminals within the hop area, and does not have the link information about the terminals outside the hop area. Then, the terminals 1A and 1F in FIG. 8 can use only broadcast for exchanging packets, which is inefficient compared to the short hop count. This problem can be solved by increasing the number of hops (the number of hops is 4 in FIG. 8), but if the scope of the link state exchange is expanded, it is necessary to increase the refresh rate in order to fill the time difference in the number of hops required for transmission. The communication band is consumed more. Therefore, in the embodiment of the present invention, the scope of link state exchange is kept narrow, but instead, on-demand type source routing using a packet structure is also used. An example of the route stack table for realizing this routing is shown in FIG. 14, and flowcharts of the processing of each terminal are shown in FIGS.

[0063] In the following description, "broadcast" is to transfer a received message to all connecting nodes in a multi-hop manner. Unicast is a multi-hop transfer of a received message to a specific connecting node. The sendback unicast is to reverse the route that the received message has followed and send it back to the sender.

If the scope of the link state exchange is S and the depth of the path stack is D, then S + D is the theoretical unicast communication radius in the embodiment of the invention (for example, S =
3 or 5, D = 7).

In the protocol according to the embodiment of the invention,
Each time the packet passes through the terminal, the intermediate route information is stored inside the packet (see S35 to S38 in FIG. 17). This is called a path stack. The packet also has a stack pointer that points to the location of the next value to retrieve from this route stack. When the data transmission source terminal broadcasts the packet (see S10 and S11 in FIG. 15), the route stack of the packet is packed with the return route to the transmission source when it reaches the target terminal. become.

If it is known in advance that the target terminal exists in the route table (YES in S10a of FIG. 15),
Instead of the broadcast in S11, the packet is unicast to the target terminal based on the routing table (S10).
b).

Specifically, when broadcasting is performed from the terminal 1A in FIG. 13, when the packet reaches the terminal 1F, the inside of the route stack is as shown in FIG. The value stacked on the stack is the terminal-local link ID or Identity, and the link ID or Identity need only be unique between adjacent terminals, and need not be globally unique. The number 0 is reserved as a link ID or Identity indicating that the stack is empty.

In the embodiment of the present invention, an address system such as IP is not adopted. Instead, there is the concept of "Identity" (link ID). Identit
An important function of y is "node identity abstraction".
In the protocol of the embodiment of the present invention, Identity.e
If the quals () method (terminal identification method) returns false, the node is determined to be another person. All message transmissions and receptions in the embodiment of the present invention are transmitted to this Identity.

When terminal 1F sends back a packet (sendbac
k unicast), a terminal on the way (for example, terminal 1E) moves the stack pointer and at the same time sends the link ID or
The Identity is taken out and the packet is transferred to the adjacent terminal corresponding to that value (see S39, S40, S42 in FIG. 17). By performing this processing by each terminal 1 on the way, data can be sent back to the transmission source. This process has a high transfer rate because it is not necessary to draw the route table.

The terminal 1A can send the packet to the target terminal based on the route stack of the returned packet (S12, S13 in FIG. 15).

Now, consider a case where the link between the terminals 1D and 1E is broken and a new link is newly created between the terminals 1C and 1E instead. When the packet is sent back from the terminal 1F to the terminal 1E, the transfer destination corresponding to the next link ID or Identity to be popped is lost, so the stack needs to be reconstructed (YES in S42 of FIG. 17). .

FIG. 18 shows an example of the stack reconstruction process.
When the value is found to be invalid, empty the stack (S5
0), broadcast again from the terminal 1E to the terminal 1A (S51, S52). Upon receiving this packet, the terminal 1A transmits the packet to the target terminal 1F.

The protocol of the embodiment of the present invention aims at a practical level P2P protocol which operates in a network environment whose topology is likely to change such as a wireless network. It has the following features.

(1) ad-hoc network In a wireless network, nodes = devices move over a wide area, so that the connection point to the network is frequently switched. In addition, the terminal itself may appear to have disappeared due to shutting down or going out of radio range. From this point: ・ There is no static node list that covers the entire network. -It is not possible to infer the network position of the node from the device-specific information such as the device ID.-It means that all routes that were valid up to the previous time may be lost. The protocol of the embodiment of the present invention can be operated without failure under this condition.

(2) fully decentralized A central server and a central point used in other protocols / systems are not placed at the core of the architecture. In wireless networks that do not assume reachability, such as the Internet, it may not be possible to find the central point ("server" in the traditional language) even if it exists. The central point is a peripheral element that is "arbitrarily" introduced by companies, such as guaranteeing the quality of traffic to users.

The present invention is not limited to the above embodiments, and various modifications can be made within the scope of the invention described in the claims, and these are also included in the scope of the present invention. It goes without saying that this is what is done.

Further, in the present specification, the means does not necessarily mean a physical means, but also includes the case where the function of each means is realized by software.
Further, the function of one means may be realized by two or more physical means, or the functions of two or more means may be realized by one physical means.

[Brief description of drawings]

FIG. 1 is an explanatory diagram of a system according to a first embodiment of the invention.

FIG. 2 is a flowchart according to the first embodiment of the invention.

FIG. 3 is an explanatory diagram of a content memory according to the first embodiment of the invention.

FIG. 4 is a flowchart according to a second embodiment of the invention.

FIG. 5 is an explanatory diagram of a content memory according to the second embodiment of the invention.

FIG. 6 is an explanatory diagram of a system according to a third embodiment of the invention.

FIG. 7 is a flowchart according to a third embodiment of the invention.

FIG. 8 shows an example of a network topology for explaining a routing protocol according to the embodiment of the present invention.

FIG. 9 shows an example of a routing table according to the embodiment of the present invention.

FIG. 10 shows a flowchart of a link state acquisition process between adjacent terminals according to the embodiment of the present invention.

FIG. 11 shows a topology viewed from the terminal 1B of FIG.

FIG. 12 shows a topology viewed from the terminal 1A of FIG.

FIG. 13 shows a state of broadcasting from the terminal 1A in FIG.

FIG. 14 shows a state of a path stack in the case of FIG.

FIG. 15 shows a flowchart of processing of the transmission source terminal in the embodiment of the present invention.

FIG. 16 shows a flowchart of processing of a target terminal according to the embodiment of the present invention.

FIG. 17 shows a flowchart of processing of a terminal on the way of a route according to the embodiment of the present invention.

FIG. 18 shows a flowchart of a stack reconfiguration process in the embodiment of the invention.

[Explanation of symbols]

1 wireless terminal 2 distribution servers

   ─────────────────────────────────────────────────── ─── Continued front page    F term (reference) 5K030 GA08 HA08 HC09 JL01 JT09                       KA05 LB05 LD02                 5K033 AA09 CB01 CB06 CC01 DA03                       DA19 DB16

Claims (11)

[Claims] 1. A method for performing multi-hop peer-to-peer communication in a wireless network including a plurality of wireless terminals, the topology of which changes from moment to moment, wherein each wireless terminal is capable of direct communication. With each other, exchanging the link state with each other to construct a routing table, a step of the first wireless terminal included in the wireless terminal obtaining contents, the first wireless terminal referring to the routing table, etc. Wireless network, the step of transferring the content to the wireless terminal, and the step of the first wireless terminal calculating coupons or points for discounting when purchasing the content and storing the coupons or points. For performing multi-hop peer-to-peer communication in. 2. The method for performing multi-hop peer-to-peer communication in a wireless network according to claim 1, wherein the coupon or points are calculated based on the number of transfer destinations of the content. 3. The multi-hop wireless network according to claim 1, wherein the content is accompanied by attribute information including transfer path information, and the transfer path information is updated when the content is transferred. A method for performing peer-to-peer communication. 4. The multi-hop peer in a wireless network according to claim 3, wherein the attribute information further includes a comment of a relay person, and the comment is added at the relay terminal when the content is transferred. -A method for performing two-to-peer communication. 5. The method for performing multi-hop peer-to-peer communication in a wireless network according to claim 3, wherein the attribute information is transmitted to a provider of the content. 6. A step of preparing a packet including a route stack for storing intermediate route information each time the packet passes through the terminal, and a step of broadcasting the packet by designating a destination terminal as a destination terminal A step in which the wireless terminal on the way of receiving the packet writes the intermediate path information to the path stack and transfers the packet to all the wireless terminals based on the routing table; A step of reversing the route followed by the packet based on the information of the route stack and sending the packet back to the source terminal; and the source terminal receiving the packet, in the information of the route stack included in the packet. A message to the target terminal via the wireless terminal in the route based on Method for performing multi-hop peer-to-peer communication in a wireless network according to any one claims 1 to 5, characterized in that it comprises the steps of Nikyasuto, the. 7. A method for performing multi-hop peer-to-peer communication in a wireless network including a plurality of wireless terminals and a content distribution server, wherein the topology between the plurality of wireless terminals changes from time to time. Each wireless terminal exchanges the link state with wireless terminals that can communicate directly with each other, and prepares a routing table and a packet including a route stack that stores intermediate route information each time the packet passes through the terminal. And a step in which the transmission source terminal designates the distribution server as a destination and broadcasts the packet, a wireless terminal in the middle of the route receiving the packet writes intermediate route information to the route stack and performs the routing. Based on the table, a step for forwarding the packet to all wireless terminals And a step in which the distribution server that receives the packet reverses the route that the packet has followed based on the information of the route stack and transmits the packet or the content to the source terminal, the distribution server, A multi-hop peer in a wireless network, comprising: calculating a coupon or points; and the distribution server transmitting the coupon or points to a wireless terminal that has performed relay processing by referring to the route stack. A method for performing two-to-peer communication. 8. The multi-hop wireless network according to claim 7, further comprising: storing the coupon or points in the distribution server together with or instead of transmitting the coupon or points. A method for performing peer-to-peer communication. 9. The multi-hop peer-to-peer communication in the wireless network according to claim 7, wherein the coupon or points are calculated according to the number of times of relaying of the wireless terminal that has performed the relay process. Way for. 10. The multi-hop in a wireless network according to claim 7, wherein the coupon or points are calculated according to the time that the wireless terminal that has performed the relay process stays within the coverage area of the distribution server. A method for performing peer-to-peer communication. 11. A distribution server including a plurality of wireless terminals and a distribution server for contents, wherein the topology between the plurality of wireless terminals is connected to a wireless network that changes from moment to moment, and an intermediate route for each passing through the terminals. Receives a packet including a route stack that stores information, reverses the route that the packet has followed based on the information of the route stack, delivers the content to the source terminal, calculates a coupon or points, and calculates the route stack. A distribution server, which transmits the coupon or points to a wireless terminal that has performed relay processing with reference to the coupon.