CN104936313B - Information exchange in communication network - Google Patents
Information exchange in communication network Download PDFInfo
- Publication number
- CN104936313B CN104936313B CN201510360462.9A CN201510360462A CN104936313B CN 104936313 B CN104936313 B CN 104936313B CN 201510360462 A CN201510360462 A CN 201510360462A CN 104936313 B CN104936313 B CN 104936313B
- Authority
- CN
- China
- Prior art keywords
- node
- information entity
- information
- entity
- composite
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1061—Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
- H04L67/1068—Discovery involving direct consultation or announcement among potential requesting and potential source peers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Present invention is entitled " information exchange in communication network ".Disclosed herein is the methods that can be formed the portable node of self-organizing network with other nodes and at least the first and second information entities (for example, file) are transferred to other nodes in self-organizing network from first node.In first node in some way will at least the first and second information entity combined codings at composite information entity, composite information entity to be decoded by using at least first information entity or the second information entity.Composite information entity is then transmitted.
Description
Technical field
The present invention relates to the fields of ad-hoc communication network, and specifically, are related to information friendship in ad hoc networks
The field changed.
Background technique
Many mobile wireless electronic devices of today can be communicated with the device of surrounding, and thus be served as in self-organizing network
Node.Self-organizing network be electronic device mutually nearby when spontaneous, self-configuring the network that can be formed, no immobilizing foundation sets
It applies.Close to each other or when leaving in different devices, node can be separately added into or exit self-organizing network.Form self-organizing network
Node it is generally mutually equal, therefore, they in network transmission do not have the responsibility different from other nodes.Generally
In the case of, the node in self-organizing network is portable, battery powered device, such as laptop computer, personal digital assistant, MP3
Player or multimedia mobile phone.
It can make a node in self-organizing network and another node switching information in self-organizing network, such as refering to
M. " the Push of Jacobsson et al.!Music: Intelligent Music Sharing on Mobile Devices"
(the 7th general fit calculation international conference, in September, 2005), it is disclosed that a kind of be used for music file from self-organizing network
The first node system that is pushed to another node in self-organizing network.The push of music file can be by the use of first node
Family, or started by the agents document software in first node, the software can compare the listening to pattern of first node with it is other
The listening to pattern of node, to identify similar listening to pattern and the therefore potential receiver of the content of identification first node.
In " the Bubbles:Navigating Multimedia Content in Mobile Ad-hoc of Bach et al.
It is provided in ad hoc networks in Networks " (procceedings of the 5th wireless world meeting, 2004, Surrey, UK)
Another disclosure of information exchange.A kind of system is disclosed, wherein the software application in the first node of self-organizing network
This situation is able to detect that when other devices are in the near nodal.When having detected that another device, answering in first node
With the available music listed files shown in another device.End user, which can thus start, to be communicated through unicast (equity) from this
Another device to first node information downloading.
In ad hoc networks the benefit of the information exchange between node first is that different node is used in self-organizing network
(because node is mutually nearby) is usually mutually known at family, and the content of a node will cause the user interest of other nodes
Chance therefore it is very high.However, the multimedia files such as music or movie file are usually very big.Section in ad hoc networks
This class file therefore time-consuming and/or consumption bandwidth are transmitted between point.Since the transmission of big file among the nodes is generally very long
Time, therefore, the power consumed during file transmission is very big, and when node is generally battery powered, this is especially undesirable.
Thus, it is desirable to have a kind of method can effectively transmit information between nodes in an ad hoc network.
Summary of the invention
A problem of the present invention is how to make the information exchange in self-organizing network more effective.
First information entity at least from first node is transferred to second node and by the second information by a kind of by this problem
Entity is transferred to the method for third node from first node and is addressed, and wherein first node includes that the first and second information are real
Body；Second node includes the second information entity；And third node includes first information entity.Method includes being formed including at least
The self-organizing network of first, second, and third node.Method is characterized in that: in some way will at least in first node
One information entity and the second information entity combined coding are at composite information entity, so as to make in decoding composite information entity
With first information entity or the second information entity；And the composite message including composite information entity is transmitted from first node.
Problem also pass through be arranged on machine element run when execute the method for the present invention computer program code and
The portable node of self-organizing network can be formed with other nodes and be addressed.Portable node includes: memory, setting
The information entity of file at storage such as comprising music or film；Encoder is arranged in some way store memory
At least first information entity and the second information entity combined coding at composite information entity, so as to by using at least first letter
Entity or the second information entity are ceased, composite information entity can be decoded；Output, is coupled to encoder, includes multiple for exporting
Close the composite message of information entity.
Through the invention, the handling capacity being capable of increasing when first node transmits at least two information entities is realized to increase
Benefit, this is because information entity can combined coding it is real at the shorter composite information of the sum of length than at least two information entities
Body.
After the step of forming self-organizing network and the step of transmitting composite message before, first or second information entity is equal
When not being transmitted to second or third node from first node, throughput gain is especially big.
According to one embodiment of present invention, the node in self-organizing network receives identification and in self-organizing network at least two
The identification data of the information entity of a other node associated storages, and want the first and second information of combined coding real in identification
It is used in body and has received identification data.Knowledge in the other node is stored by obtaining which related information entity, it can be with
Certain mode effectively selects to form information entity used in composite information entity, makes it possible to pass through self-organizing network
In at least two nodes the composite information entity of formation is decoded.Identification data can receive in node through user interface,
Or other nodes through the connection such as radio or infrared connection from self-organizing network receive.
In one embodiment of the invention, the benefit measure of composite information entity is calculated, in some way so as to benefit
Measurement reflection by transmission composite information entity rather than the throughput gain realized of the first and second information entities.Benefit amount
Degree can determine formed in composite information entity should use which information entity when use, and can be used in can be formed
Different composite information entity assigns priority, can first transmit in order to provide the composite information entity of high benefit.Self-organizing network
It can stop existing at any time, and usually require to start from that the composite information entity of multi information as far as possible will be conveyed to be transmitted to
Recipient as much as possible.
In the one aspect of this embodiment, also calculating can be by the benefit amount for the composite information entity that other nodes transmit
Degree, and the benefit measure for the composite information entity that can be formed by using first node and can be by sections other in self-organizing network
The benefit measure for the composite information entity that point is formed, determines the scheduling of composite message.In this way, the whole efficiency energy of self-organizing network
Enough reach highest, so as to which the node for forming the composite information entity for generating highest benefit measure can be the section transmitted at first
Point, and the rest may be inferred.In this regard, having the information of the length of the information entity stored in artis that can preferably become can be used for
Other nodes, for example, the identification data of identified information entity, so that benefit measure calculating can be real by the information of combined coding
The comparison length of body is taken into account.
Composite message can advantageously comprise the information entity used in the composite information entity for forming composite message
Identification data.
Portable node according to the present invention advantageously can also have compound including composite information entity for receiving
The input of message and it is arranged to that the decoded decoder of composite information entity will have been received using the information entity stored in memory.
Self-organizing network generally has flat construction (flat structure), wherein all participation nodes can be transmitted and receive letter
Breath, and wherein there is any predefined effect or responsibility without node.Therefore, by include input and decoder, it is portable
Node can receive the information entity for being encoded into composite message from other nodes.
Detailed description of the invention
It for a more complete understanding of the present invention and its advantage, now will be in conjunction with attached drawing, referring to following explanation, in which:
Fig. 1 is the exemplary schematic diagram in the self-organizing network of three different time points.
Fig. 2 shows the examples how content of the different nodes in self-organizing network can be overlapped.
Fig. 3 shows from two different information entities and forms composite information entity.
Fig. 4 shows the example of the composite message including composite information entity.
Fig. 5 is the flow chart for schematically showing one embodiment of the method for the present invention.
Fig. 6 shows the example of node according to the present invention.
Specific embodiment
The schematic diagram of self-organizing network 100 is given in Fig. 1.Self-organizing network 100 is hereinafter referred to as the electronics of node 105
Device mutually finds through signaling and is formed when subsequently forming self-organizing network 100.It may act as the electricity of self-organizing network interior joint 105
Sub-device is usually mobile wireless electronic device, as laptop computer, personal digital assistant, MP3 player and multimedia are moved
Mobile phone.Such portable radio also can with fixation (wirelessly or non-wirelessly) electronic device communications, such as the individual in local area network
Computer and server.Self-organizing network 100 can include the movement for forming node 105 and the mixing of fixed device.
The self-organizing network 100 of Fig. 1 is shown in three different time points: T1、T2And T3.On these time points, self-organizing
Network 100 includes node 105A, 105B and 105C.In time point T3, self-organizing network 100 further includes node 105D.Self-organizing
Network 100 can be completely netted, wherein and the node 105 can hear all other node 105 or partial mesh,
Wherein, the node 105 cannot hear all other node 105 in network 100.In general, any section of self-organizing network 100
Point 105 potentially acts as the conveyer or receiver of information, and under normal circumstances, node 105 does not have in self-organizing network 100
Have than the more central roles of other nodes 105.The node 105 for including in self-organizing network 100 is with formation node 105
Electronic device is close to each other or away and changes over time.Only one node 105 of previous self-organizing network 100 there are still
When, self-organizing network 100 stops existing.
In the self-organizing network 100 of Fig. 1, node 105A is shown as in time T1Transfer information to node 105B.When
Between T2, node 105B is shown as transferring information to node 105A and 105C.In time T3, node 105C is shown as transferring information to
Node 105A and 105D.At other times, other transmission situations can occur, or there may be basic in self-organizing network 100
The time point that do not transmit.It is shown in information transmission information signal 110 as shown in arrow in Fig. 1 of different time transmission.
The purpose for forming self-organizing network 100 is usually to exchange information between node 105.Information can be transmitted with unicast
Form exchanges to another node 105 from a node 105, or exchanges to two from a node 105 in the form of multicast
Or more other nodes 105.According to the present invention, by confirming that some nodes 105 for forming self-organizing network 100 can have altogether
Same one or more information entities, can reduce the data volume transmitted in self-organizing network 100.Hereinafter, it gives
The exchange of information between three nodes is as example.However, it is possible to which it is even more efficient to realize to be related to more nodes
Communication.
Fig. 2 shows content 200A, 200B of three nodes 105A, 105B and 105C of respectively self-organizing network 100 and
200C.The information stored in node 105 can be considered as to be formed by one or more information entities 205.Information entity 205 is for example
It can be music file, text file, movie file or any other data set that can be identified and distinguished between by node 105.Such as
Shown in Fig. 2, before any information exchange in self-organizing network 100 occurs, the content 200 of different nodes 105 may have been weighed
It is folded, that is, the content of two or more nodes 105 may include identical information entity 205.In the example that Fig. 2 is provided, content
200A and 200B includes information entity 205i, and content 200A and 200C include information entity 205ii and 200iii.This
Outside, content 200B and 200C includes content 200vii.
According to the present invention, information entity 205 is typically included in two or more nodes 105 of self-organizing network 100
In content, the fact that be used to reduce the information content to transmit in self-organizing network 100, so as to node 105 and self-organizing
Some or all of other nodes 105 of network 100 share its some or all content 200.It is stored in two different nodes 105
Information entity 205 may never homologous by the two nodes 105 or identical sources receive or one of these nodes 105 can
Information entity 205(can be received for example, in different self-organizing networks is formed from another node 105).As node 105A
Content 200A include information entity 205i and information entity 205ii, the content 200B of interior joint 105B includes information entity
205i, but do not include information entity 205ii, and the content 200C of node 105C includes information entity 205ii, but does not include information
When entity 205i, by forming composite information entity from information entity 205i and 200ii before transmission, can reduce will be from group
The data volume transmitted in knitmesh network 100.Such composite information entity for example can be by holding on information entity 205i and 205ii
Row step-by-step XOR operation and formed.The node 105B of included information entity 205i can receive composite information entity
Afterwards, by executing step-by-step XOR operation in composite information entity and Given information entity 205i, unknown information entity is retrieved
205ii.Similarly, node 200C can be by executing step-by-step exclusive or in composite information entity and Given information entity 205ii
Unknown information entity 205i is retrieved in operation.Therefore, the single transmission of composite information entity can ensure to wrap in self-organizing network
The node 105 of one of 205i containing information entity and 205ii (but do not include another) will receive before be not node 105 content
The information entity 205 of a part, and passed without the first transmission of execution information entity 205i and the second of information entity 205ii
It send.The transmission efficiency of self-organizing network 100 is thus improved, to mean the band of reduced delivery time and/or reduction
The power consumption of width consumption and reduction.The data volume that transmit in self-organizing network 100 to reduce the method for the present invention, should be at least
Know and the ignorant first information entity 205 of third node 105 and third node 105 including at least second node 105B
Know and the first node 105 of ignorant second information entity 205 of second node 205.
In the example provided above with respect to Fig. 2, information entity 205i and 205ii are the content of node 105A respectively
A part of 200 a part and the content 200 of node 105B and 105C.In bigger self-organizing network 100, information entity
205i may include in the content 200 of more than one node 105.Similarly, information entity 205ii can be more than one node
A part of 105 content 200.With information entity 205i but without all sections of information entity 205ii in its content 200
Otherwise point 105 is able to use the composite information entity combined with information entity 205i to retrieve information entity 205ii, and also
So.
As described above, composite information entity can be by using step-by-step exclusive or to transport on two information entities 205i and 205ii
It calculates and is formed.Other operations can be used alternatively in forming composite information entity, such as in other Galois Field (Galois
Field combined coding on).It is compiled for example, modulus summation (modulus sum) can be executed in the section of b bit in some time
Code, that is, use Galois Field 2b.The example that how can form composite information entity 300 is further illustrated in Fig. 3,
It is including wherein referred to as A1-AnN section 305 first information entity 205i on and including referred to as B1-BmM section 305
Modulus summation is executed on two information entity 205ii.As a result composite information entity 300 includes that n composite log 310(assumes n >=m),
Wherein, k-th of composite information section 310 includes information Ak Bk, symbolIndicate the summation in any field.If m < n is wrapped
The the second information entity 205ii for including m section 305 can be advantageously (n-m) a section of zero word of filling of tail portion.305/310 energy of section
It is enough to be made of one or more bits, and information entity 205 can include any amount of section 305.It is compound being used to form
When one of information entity 205 of information entity 300 includes sections 305 more more than another entity, zero padding can be applied, therefore,
The last composite log 310 of composite information entity 300 will simply correspond to the most back segment 310(of longer information entity 205 referring to figure
3) alternative approach, such as repeated encoding are able to use, or.
Due to Ak Ak Bk=Bk, therefore, receiving the composite information entity 300 of Fig. 3 and having information entity 205i is it
The node 105 of a part of content 200 thus can be by executing modulus in composite information entity 300 and information entity 205i
Summation operation retrieves information entity 205ii in n sections of composite information entity 300.
If at least two nodes 105 have more than one common information entity 205, composite information entity 300 can
From the formation of more than two information entity 205.If so, shared information entity 205 can for example link, and combined coding will
It executes on the concatenated information entity.In the example in figure 2, information entity 205ii and 205iii can link, and link
Information entity can be with information entity 205i combined coding.If information entity 205ii and 205iii are both less than information
Entity 205i, this will be particularly advantageous.
Moreover, it is assumed that adequately information resides in receiving node 105, multiple information entities 205 can be encoded effectively
At identical composite information entity 300:Ak Bk Ck ..., wherein AkIt is the section of first information entity 205i, BkIt is second
The section of information entity 205ii, CkIt is (wherein, 205 companies of may or may not be of information entity such as the section of third information entity 205iii
Information entity is tied, refering to the preceding paragraph).This allows to transmit more than two information entity 205 in same composite message 400.For example,
If first node 105A have information entity 205i, 205ii and 205iii, second node 105B have information entity 205i and
205ii, third node 105C have information entity 205i and 205iii, fourth node 105D have information entity 205ii and
205iii, then first node 105A can be transmitted advantageously including composite log Ak Bk CkComposite information entity 300.Each connect
The information entity 205 lacked can be decoded from prior information and composite information entity 300 by receiving node 105B, 105C and 105D.Therefore,
It, can will be compound by using in all information entities formed outside one of information entity 205 used in composite information entity
Information entity 300 decodes.
Fig. 4 instantiates the composite message 400 with composite information entity 300 for its payload.The composite message of Fig. 4
400 further include header 405, which includes in relation to having been used for being formed composite information entity 300 information entity 205(two or
More) mark information.It also can include example in the header by the identifier that the composite message is identified as composite message
Such as, as composite message flag.In addition, cyclic redundancy check (CRC) code 410 can be included in composite message 400 as tail portion
In.The composite message 400 of Fig. 4 is only given as an example, and other formats of composite message 400 may be utilized.
In the self-organizing network 100 for allowing information entity 205 to link, header 405 is preferably able to include related connected
The information entity 205 of knot, different information entities 205 how to encode together and different information entities 205 connection letter
Cease the information of the appearance sequence in entity.
Composite message 400 including composite information entity 300 may include address field, which includes first node 105
With the address of second node 105, by these addresses, composite information entity 300 can be used in retrieving other information；Or disappear
Breath 400 can be sent to all nodes of self-organizing network 100 as multicast message, because without address field.Have
Information entity 205i and 200ii information entity 205i does not have as the node 105 and both not having of its content a part yet
The node 105 of 200ii can ignore that composite message 400, or storage composite message 400 for future use-at that time at it
Both do not have information entity 205i in content 200, also the node 105 without 200ii may receive letter at time point afterwards
Cease one of entity 205i and 200ii, and if be then able to retrieve another information entity 205(composite message 400 stored).
By sending the composite message 400 including composite information entity 300, greatly reducing transmission node 105 will be transmitted
Data volume.Information entity 205i and 200ii individually to send (in same message or in two different messages) without
It is that additional payload amount to be transmitted, which will be equal to, is used to form composite information entity 300 when being sent in composite message 400
Two information entities 205 in shorter entity amount of bits.Composite message 400 can use longer information entity 205
First information entity 205 is transported at least one node 105 while payload space, the second information entity 205 is defeated
It is sent at least another node 105, this is because the prior information stored in respective nodes 105 is used to extract corresponding unknown information
Entity 205.In addition, the single information entity 205 of successful reception likelihood ratio transmission of transmission composite information entity 300 is higher.
Information entity 205iv, 205v and 205vi of such as Fig. 2 is only stored in the information entity 205 in a node 105
At least another node 105 can be transmitted in a usual manner in the first step, and be then able to be encoded into composite information reality
Body 300.
Fig. 5 is the flow chart for schematically showing one embodiment of the method for the present invention.In step 500, node
105A detects other nodes 105, and self-organizing network 100 is formed.Detection can be deposited by requesting other nodes 105 to disclose it
Node 105 start, or by notify its exist and then by other nodes 105 reply notice node 105 start.In shape
It can be different at the degree that user in self-organizing network 100 participates in.Preferably the mark of node 105 is in self-organizing network 100
Formation during be known to other nodes 105.If the mark of node is announced, the information entity of receiving node 105 is arrived
205 transmission can be approved as condition by receiving node 105 with sending node 105.The mark of node 105 for example can be by media
The access control address (MAC) indicates.Alternatively, temporary identifier can be used mutually to distinguish different nodes 105.
In step 505, be stored in which information entity 205 in other nodes 105 in self-organizing network 100 and
It can be used for transmitting related identification data to be received by node 105A.Such identification data for example can be by defeated manually through user interface
The user for entering the node 105A of information receives (for example, exchanging knowledge with other users of self-organizing network 100 by other media
After other data, such as pass through speech or visual manner).Alternatively, the other nodes of one or more of self-organizing network 100 can
Automatically send a notification message, including in relation to which information entity 205 from node 105 can with (refering to the information of step 510),
Alternatively, node 105A can receive which related information entity as the response to the polling message sent before node 105A
205 from the available information of node 105.
In step 510, node 105A notifies node 105A which information entity 205 can be shared with other nodes 105.
This may include all information entities 205 stored on node 105, or the information entity 205 stored on node 105A
Selection.Node 105A can be given notice by notification message, and message is preferably able to be transmitted to self-organization network as broadcast message
All other node 105 in network 100.Notification message preferably includes to be stored in the mark and recognition node 105A of node 105A
Information identification data.The identification data provided in an announcement message for example can be the list with information entity identifier
Form, wherein each information entity identifier identifies the information entity 205 stored on node 105.Alternatively, related
The information which information entity 205 can be used for being transmitted to other nodes is able to respond the polling message received and transmits.Believe herein
Breath is manually entered in the realization of node 105 through user interface, and step 510 can be ignored.
If step 505 is related to the reception of one or more notification messages, the notice executed in step 510 can be
Occur before receiving all or part of notification messages from other nodes 105, that is, occur before or during step 505.
In step 515, received information in step 505 is analyzed, and is identified in node 105A and another node 105
Any information entity 205 stored in the content 200 of the two.The analysis of step 515 includes comparing identification in self-organizing network 100
Other nodes 105 in the information entity identifier of information entity 205 that stores, to identify any shared information entity
205。
In step 520, based on the received letter in relation to available information entity 205 in other nodes 105 in step 505
The information for ceasing and having the information entity 205 stored in artis 105A, determines node 105A should transmit which information entity 205.
In addition, determining whether any composite information entity 300 for forming the information entity 205 that should be transmitted is advantageous.If in node 105A
Content in have a pair of (or group) information entity 205, wherein this is right/group first information entity 205 be stored in including except this is right/
In at least one node 105 of the outer other information entity of one of the information entity 205 of group for a part of its content 200, and
This is right/group another/other information entity 205 be stored in without this is right/group first information entity 205 be its content 200
A part at least one other node 105 in, then can advantageously determine that this is right in step 520/group information entity answer
It is encoded into composite information entity 300.Can not be combined into it is such it is right/group information entity can be passed in regular message in a usual manner
It send.
In addition, forming the analysis of the benefit of specific composite information entity 300 can also execute in step 520, such as logical
It crosses and calculates for transmitting the composite message 400 including composite information entity 300 and transmitting composite information entity 300 in a usual manner
The transmission resource compared of information entity 205 reduce, generate a benefit measure.Such benefit measure can for example depend on will
Can quantity to the decoded node 300 of composite information entity 300 and be used to form composite information entity 300 information it is real
The length ratio (length difference between or) (or difference between the information entity of the connection of where applicable) of body 205.It is then different
The benefit measure of composite message 400, which is able to carry out, to be compared, and the comparative example such as can be used in determining transmission composite message 400
Sequence.
In step 525, compound and/or regular message is formed according to the analysis executed in step 520 and transmission, preferably
It is formed and is transmitted as multicast message.
In step 530, it is decoded to from the received any composite message 400 of other nodes 105.Assuming that answering using Fig. 4
The format for closing message 400 is then analyzed and has received the header 405 of composite message 400 and wrap to identify when being formed in composite message 400
Which information entity 205 has been used when the composite information entity 300 included.If other in addition to one of those information entities 205
Information entity has stored in node 105A, then, can be to composite information entity 300 by using Given information entity 205
Decoding, and the information entity 205 being not yet stored in node 105A can be retrieved.
In step 535, any new information entities 205 for having received/having retrieved are stored into the content 200 of node 105A.
In step 540, which terminates.
When information entity 205 is transmitted to another node 105 by node 105A, the lower level in node 105A can be preferred
Ground transmits a signal to application, the time that instruction transmission is completed.In addition, received confirmation can be by having received composite information message
300 node 105 is sent.Identify that the information entity identifier of information entity that has transmitted between node 105 can be from group
Which which continuously transmitted in knitmesh network 100, to update the node of self-organizing network 100 with regard to information entity known to node 105
105。
Inventive method assumes that the node 105 for forming self-organizing network 100 has the common side of identification information entity 205
Therefore formula is equal to any another node 105 in self-organizing network 100 by the information entity 205 that first node 105 is identified as " X "
It is identified as the information entity 205 of " X ".In one embodiment of the invention, information entity 205 can be with information entity to be used as
The uniqueness of identifier or random alphanumeric name are associated.Information entity 205 and information entity identifier then can
It by integrity protection (in field of encryption has been people for this method advantageous by the hash code of the entire sequence of data
It is known).The use of hash code ensures can be detected any change of information identity identifier.The hash code of information entity 205
It can (notification message disappears to poll as a part of the message for including the identification of information entity 205 stored in node 105
The response of breath) it sends, to ensure the correct identification of information entity 205.Hash code also can include the report in composite message 400
In first 405.
It is alternatively possible to which the common identification for the information entity 205 in different nodes 105 uses other methods.
In one embodiment, to transmit which information entity 205 by node 105A in step 520 is determined to base
The hypothesis with a part of information entity 205 as much as possible as its content 200 is wished in each node 105.Therefore, it saves
Point 105A will assume that any node 105 without particular information entity 205 is wanted to receive the information entity 205.Alternative real
In existing, it is not assumed that all other node 105 should include all available information entities 205 when the exchange of information entity is completed.Section
Point 105 can be in the composite information entity for sending information entity 205(or being formed from information entity) come to waiting before other nodes 105
Request from least one other node 105 to particular information entity 205.Need the node 105 of particular information entity 205 by because
This solicited message entity 205, the information entity is according to received that notification message is stored as the content 200 of another node 105 one
Part.
It does not include a pair of of information reality shared as described above by other node sections if there is at least one node 105
Any information entity 205 of body 205, and need the information entity 205 of this pair, then it is contemplated that in a usual manner by the letter of this pair
Breath entity 205 is sent to all nodes 105, this is because will need routine for the node 105 for not including information entity 205
The transmission of message.It is alternatively possible to the regular message and composite message 400 of one of information entity 205 including this pair are transmitted, because
This, the node 205 for lacking two information entities is able to use the information entity 205 of the message transmitted in a usual manner and disappears to compound
400 decoding of breath.
The process of Fig. 5 is illustrated by the transmission and reception of the node 105A information entity 205 carried out.However, as walked
Shown in rapid 505 and 530, method cannot be executed independently of other nodes in self-organizing network 100.On the contrary, the method for Fig. 5 will
The all or part of nodes (at least three) being related in self-organizing network, and 105 energy of any node in self-organizing network 100
Enough sending nodes 105 for playing the role of composite message 400 frequently.Therefore, the step 525 of composite message is transmitted by node 105
The access right waited when the transmission of other nodes 105 to transmission medium will be commonly included in.
The present invention is able to use any MAC protocol, such as 802.11, ALOHA, CSMA.If for application angle, section
The sequence of 105 transmission of point is coordinated and has been coupled with MAC layer, then performance can be improved further.
More precisely, can determine which node will be in which time point transmission in different ways.For example, can make
With so-called circulation (round robin) scheme, according to the program, the node 105 in self-organizing network 100 is successively once sent
The informational message 400(of one or predetermined quantity is compound or regular message).The sequence that node 105 transmits can for example be based on MAC
Address number.It is alternatively possible to carry out the negotiation in relation to which circular order should be used among the nodes.
In another embodiment, using randomisation process to determine which node 105 will transmit at some time point.?
When transmission node 105 stops sending, other nodes 105 in self-organizing network 100 can generate Counter Value at random, and start
Add drop counts, until reaching scheduled number.The first node 105 for reaching predetermined number will start the transmission of message.If more
A node transmits simultaneously, then this situation can be detected by unfinished confirmation, and Conflicts management strategy can be used.If passed
Send medium to be blocked by another transmission, then the application layer of node 105 can advantageously become the waiting when any transmission carries out, until
Transmission medium is idle, and then which solid polymer composite determination will transmit.
In an alternative embodiment, leading node 105 is selected in step 500 when forming self-organizing network.It is main
The person of leading is then able to determine node 105 by the sequence of transmission.This decision is then communicated to other nodes.
In still another embodiment, it can determine to determine the access right to transmission by decentralized dispatch.Assuming that all
Which information entity 205 on all nodes 105 in self-organizing network 100 that knows for sure of node 205 can be used, then each node
105 can run determine which information entity 205 should transmit at first, second transmission etc. decentralised scheduling algorithm.In other words, scheme
5 step 515 can be that all nodes 105 are run by each node 105.Each node thus will be appreciated by self-organizing network 100
In each node 105 which information entity 205 and composite information entity 300 should be transmitted.Then each letter can be transmitted by determining
The benefit of entity 300/205 is ceased, determination should transmit the sequence of these information entities 300/205.It is every for what is transmitted in network
A message can calculate benefit measure refering to explanation relevant to step 520 above, and be based on this benefit measure, can be true
Surely the sequence of message should be transmitted.If one or more message benefit measure having the same, applies auxiliary regular.
If the corresponding length of the information entity stored in different nodes 105 is known to node 105, centralized dispatching is determined
Can become more effective, so as to make scheduling determine based on benefit measure can illustrate by forming specific composite information entity
300 gains realized.The information of 205 length of entity can for example be included in above-mentioned notification message or right for information about
In the response of polling message.
Node 105 by preferably more any message not yet transmitted information entity and other nodes 105 send
A possibility that information entity in message to avoid sending includes the message of the information entity that has sent of other nodes.
Other steps can be included in it is shown in fig. 5 during.For example, joint can be added with before entering step 540
The inspection whether exchange of the information entity 205 between point 105 is completed.If new node 105 enters self-organizing network 100,
In one embodiment, the process of Fig. 5 can interrupt and start since step 500.In an alternative embodiment, new node
105 are ignored, until the process of Fig. 5 has terminated.Step 500 can then reenter, to include any new node 105.
Embodiment illustrated in fig. 5 be based on 100 interior joint 105 of self-organizing network publication it is related which can be used for other nodes
Information entity 205 notice (refering to step 510 and 505).As described above, in an alternative embodiment, can ignore that logical
Know the step 510 of content 200.On the contrary, node 105A can be 205 poll self-organizing network of one or more particular information entities
Other nodes 105 or information in 100 can be manually entered node 105A through user interface.Poll for example can be user
Node 105 can be programmed for being specific by the user of starting or specific node 105 before the formation of self-organizing network 100
205 poll of information entity.All nodes 105 of the information entity of poll with a part as its content 200 can reply
The information entity 205 of request can be used.This response can be eavesdropped by all or some other nodes 105 in self-organizing network 100
It arrives.It can be used as the response to polling message of unicast or broadcast message transmission by eavesdropping, these other nodes 105 will be had
The information which other node 105 includes the information entity 205 of poll is closed, and thus will be obtained in related other nodes 205
The information for the priori information entities 205 for including.Then, any composite information for having transmitted information entity 205 can correspondingly be carried out
The coding of entity 300.
Fig. 6 schematically shows the embodiment of node 105 according to the present invention.The node 105 of Fig. 6 includes node
The storage unit 600 that 105 content 200 is stored thereon.Content 200 is storable in storage unit 600.Storage unit 600
It further include the identification data for identifying the information entity stored in storage unit 600, such as information entity identifier.Node 105 is also
Including information coder/decoder 605, which includes the processing component and computer program generation for operating needed for executing
Code, so that two (or more the when connection) information entities 205 stored from memory member 600 encode composite information reality
Body 300, and composite information entity 300 is decoded into two (or where applicable more) information entity 205(refering to Fig. 5
Step 525 and 530).Node 105 further includes algorithm process block (handler) 610 and protocol processes block 615 and controller
620.Algorithm process block 610 includes the processing component and computer program code for controlling various processes, and for example can
Including the processing component and computer program code for following operation: notifying available information entity 205 to other nodes 105
(refering to the step 510) of Fig. 5, the benefit measure of possible composite information entity 205 is calculated, which information entity determination should transmit
205 arrive other nodes, and whether the determination information entity 205 to be transmitted should be encoded into composite information entity 300, determine node 205
Whether by any other node 105 of poll/request to understand information (step 515 refering to Fig. 5 and 520), determine where applicable
The benefit measure etc. of composite message 400.Specifically, algorithm process block includes for comparing the letter stored in recognition node 105
It ceases the identification data of entity (205) and identifies the information entity identifier of the information entity (205) stored in other nodes 105
Processing component and computer program code.Protocol processes block include for by the Information encapsulation of any transmission at by self-organizing network
The processing component and computer program code for the protocol format that other nodes 105 use in 100, and including for will be from other
The payload for including in received any message in node 105 decapsulates (referring to the computer program generation of the step 525) of Fig. 5
Code.The integrated operation of 620 control node 105 of controller, and apart from the others include for detecting other nodes 105 and being formed
The processing component and computer program code of self-organizing network 100 are (refering to the step 500) of Fig. 5.The node 105 of Fig. 6 further includes
Input/output end port 625, these ports are for example connectable to radio or infra-red transmitter.
Node 105 discloses the letter for the content 200 for having artis 105 to carry to other nodes 105 of self-organizing network 100
Breath.The content 200 of exchange interested includes the information entity 205 for belonging to file exchange application under normal circumstances.Therefore, from agreement
For layer angle, the present invention is especially suitable for the exchanges of the information entity 205 in application layer.The sequence of transmission is grouped in application layer
It can be advantageously coupled to MAC layer.
Which it is stored in the node 105 of self-organizing network 100 based on 205 priori of information entity, by two (or more
It is a) information entity 205 be encoded into composite information entity 300 the present invention can be handed in multiple information in self-organizing network 100
It changes in situation and applies, in the situation disclosed in the publication of above-mentioned M. Jacobsson et al. and Bach et al..
As apparent from the above, the present invention helps have first information entity in first and third node 105
205 priori knowledge, and the first and second nodes 105 have the second information entity 205B priori knowledge when, reduce from
First node 105 at least first information entity 205 will be transmitted to (or multiple) second node 105 and from first node 105
The amount of bandwidth used when second information entity 205 is transmitted to (or multiple) third node 105.Under normal circumstances, node
Priori knowledge can have been obtained before the formation of self-organizing network 100, but be never from group after self-organizing network is formed
When the source of a part of knitmesh network 100 obtains priori knowledge, throughput gain will be realized.In transmission node 105A from self-organization network
Another node 105 in network is obtained does not include in the composite message 300 in the transmission coverage area of all other node 105
Information entity 205 knowledge when, will also realize throughput gain.The present invention is suitable for the transmitting link road between node 105
Stablize and do not need the self-organizing network 100 of message to retransfer, and is also suitable in more unstable transmission environment.
It will be apparent to one skilled in the art that implementing disclosed in detailed description the present invention is not limited to attached drawing and above
Example, these embodiments simply to illustrate that and state, the present invention can realize in a number of different manners, and it is by appended power
Benefit requires definition.
Claims (16)
1. a kind of be at least transferred to second node (105) from first node (105) for first information entity (205) and believe second
Breath entity (205) method for being transferred to third node (105) from the first node, wherein the first node includes described the
One and second information entity；The second node includes second information entity；And the third node includes described
One information entity, the information entity are the files in application layer, which comprises
Form the self-organizing network (100) including at least described first, second, and third node；
(505) identification and the information entity (205) of the second node (105) associated storage are received in the first node
Second identification data of the first identification data and identification and the information entity (205) of third node (105) associated storage；
It is identified in the first node in first and second information entity using the first and second identification data；
The first node wait until receive from the second node to the request of the first information entity and come
From the request to second information entity of the third node；
It in some way will at least described first information entity and second information entity joint volume in the first node
Code (525) is at composite information entity (300), so as to real by using at least described first information entity or second information
Body can decode the composite information entity；And
It include the composite message (400) of the composite information entity from first node transmission (525).
2. the method as described in claim 1, wherein
After the self-organizing network is formed and the step of transmitting the composite message before, the described first or described second information
Entity is not transmitted to described second or third node from the first node.
3. it is method according to claim 1 or 2, wherein
The step of reception includes that the described first and/or second identification data are received through user interface.
4. the method according to claim 1, wherein
The step of reception includes that the connection through node another into the self-organizing network receives described first and/or second
Identify data.
5. method as claimed in claim 4, wherein
It is that the first node sends polling message before the step of reception, for identification and described second and/or third section
The identification data of the information entity of point associated storage are polled.
6. further including such as the described in any item methods of the above claim
Other nodes in the self-organizing network are transmitted notification messages to from the first node, the notification message includes
Identification can be used for the identification data with the information entity of the first node associated storage transmitted.
7. further including such as the described in any item methods of the above claim
The benefit measure of the composite information entity is calculated, in some way so that benefit measure reflection passes through described in transmission
The throughput gain that composite information entity rather than first and second information entity are realized.
8. it is the method for claim 7, wherein
By using can by the composite information entity that the first node is formed benefit measure and can be by the self-organization network
The benefit measure for the composite information entity that other nodes are formed in network, determines the scheduling of the composite message.
9. method according to claim 8, wherein
The identification data of identification information entity include the information of the length in relation to the information entity, and wherein include in calculating
In the benefit measure of the composite information entity of the information entity, the information of the length of entity for information about is used.
10. such as the described in any item methods of the above claim, wherein
The step of combined coding includes joining the first information entity and second information entity on Galois Field
Compile in collaboration with code.
11. such as the described in any item methods of the above claim, wherein
The step of transmission includes forming the composite message in some way, so that the composite message includes containing described the
One and second information entity identification first part and second part containing the composite information entity.
12. such as the described in any item methods of the above claim, the method also includes
Receiving in the first node from another node in the self-organizing network includes that the compound of composite information entity disappears
It ceases (400)；And
By using at least one information entity with the first node associated storage, by the received composite information entity solution of institute
Code.
13. such as the described in any item methods of the above claim, wherein
First, second, and third node is mutually equivalent, so that each of described first, second, and third node is for institute
The transmission stated in network does not have the responsibility different from other nodes in first, second, and third node.
14. method as claimed in claim 13, wherein
Form at least two nodes the depositing in the self-organizing network at least three node of the self-organizing network
In the step of period executing the combined coding and transmission.
15. such as the described in any item methods of the above claim, wherein
The step of combined coding includes in some way by least three information entity combined codings into composite information entity,
It, can be by the composite information so as to by using all less than at least three information entity used in the coding
Entity decoding.
16. one kind is for the article from first node (105) transmission information, wherein the first node includes the first and second letters
It ceases entity (205), the information entity is the file in application layer, and the article includes:
It sends and receives and includes at least described first node, the second node (105) including second information entity and wrap
Include the component of the related signaling message of formation of the self-organizing network (100) of the third node (105) of the first information entity；
Receive (505) identification and the first identification data of the information entity (205) of the second node (105) associated storage and knowledge
The component of data is not identified with the second of the information entity (205) of third node (105) associated storage；
The component of the first and second identification data is used in identification (515) first and second information entity；
Receive from the second node to the request of the first information entity and from the third node to described
The component of the request of second information entity；
In some way will at least described first information entity and the second information entity combined coding (525) at composite information
Entity (300), so as to can be by the compound letter by using at least described first information entity or second information entity
Cease the decoded component of entity；And
It include the component of the composite message (400) of the composite information entity from first node transmission (525).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510360462.9A CN104936313B (en) | 2006-12-04 | 2006-12-04 | Information exchange in communication network |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510360462.9A CN104936313B (en) | 2006-12-04 | 2006-12-04 | Information exchange in communication network |
| CN200680056507A CN101548521A (en) | 2006-12-04 | 2006-12-04 | Exchange of information in a communication network |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200680056507A Division CN101548521A (en) | 2006-12-04 | 2006-12-04 | Exchange of information in a communication network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104936313A CN104936313A (en) | 2015-09-23 |
| CN104936313B true CN104936313B (en) | 2019-05-31 |
Family
ID=54123307
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510360462.9A Active CN104936313B (en) | 2006-12-04 | 2006-12-04 | Information exchange in communication network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104936313B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1612982A2 (en) * | 2004-07-02 | 2006-01-04 | Microsoft Corporation | Content distribution using network coding |
| CN1759584A (en) * | 2003-03-20 | 2006-04-12 | 艾利森电话股份有限公司 | Data unit transmission method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050193106A1 (en) * | 2004-03-01 | 2005-09-01 | University Of Florida | Service discovery and delivery for ad-hoc networks |
-
2006
- 2006-12-04 CN CN201510360462.9A patent/CN104936313B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1759584A (en) * | 2003-03-20 | 2006-04-12 | 艾利森电话股份有限公司 | Data unit transmission method and device |
| EP1612982A2 (en) * | 2004-07-02 | 2006-01-04 | Microsoft Corporation | Content distribution using network coding |
Non-Patent Citations (1)
| Title |
|---|
| The Importance of Being opportunistic: Practical Network Coding for Wireless Environment;Sachi Katti等;《Computer Laboratory,University of Cambridge》;20050930;1-10 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104936313A (en) | 2015-09-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Dong et al. | Minimum energy reliable paths using unreliable wireless links | |
| Kyasanur et al. | Smart gossip: An adaptive gossip-based broadcasting service for sensor networks | |
| CA2467387C (en) | Ad-hoc network and method of routing communications in a communication network | |
| AU2007342283B2 (en) | Expandable text messaging service protocol for use with a two-way radio transceiver | |
| TW200401553A (en) | System for facilitating personal communications with multiple wireless transmit/receive units | |
| WO2008039477A1 (en) | Methods and apparatus for network coding | |
| AU2009292966A1 (en) | System and method for dynamic automatic communication path selection, distributed device synchronization and task delegation | |
| CN100440820C (en) | Method for connecting an IEEE 1394 remote device to a cluster of IEEE 1394 devices through a wireless link | |
| CN102017729A (en) | Methods and apparatus for scanning for mesh nodes | |
| US20130203413A1 (en) | Method and apparatus for discovering wireless devices | |
| Moll et al. | A brief introduction to state vector sync | |
| KR20010072215A (en) | Wireless protocol method and apparatus supporting transaction requests with variable length responses | |
| TW200814666A (en) | ZigBee network module system | |
| CN104936313B (en) | Information exchange in communication network | |
| EP2090067B1 (en) | Exchange of information in a communication network | |
| JP2010068191A (en) | Dtn data transfer method using network coding, fixed station performing the method, and system including fixed station and mobile terminal | |
| Taj et al. | The impact of MAC protocols in energy consumption of transferring multimedia contents using Castalia simulator | |
| Raja et al. | Performance evaluation on internet of things protocols to identify a suitable one for millions of tiny internet nodes | |
| Salhi et al. | Network coding for event-centric wireless sensor networks | |
| Volovikov et al. | Mobile encounter networks and their applications | |
| Zhou et al. | CIVIC: An power-and context-aware routing protocol for wireless sensor networks | |
| WO2017170010A1 (en) | Information sharing method | |
| Li et al. | Delay analysis in practical wireless network coding | |
| Willke et al. | Coordinated interaction using reliable broadcast in mobile wireless networks | |
| Bosse | BeeTS: Smart Distributed Sensor Tuple Spaces combined with Agents using Bluetooth and IP Broadcasting |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |