CN102438276A - High-performance routing method for opportunistic network based on adaptive summery vector (SV) compression - Google Patents
High-performance routing method for opportunistic network based on adaptive summery vector (SV) compression Download PDFInfo
- Publication number
- CN102438276A CN102438276A CN2011104598167A CN201110459816A CN102438276A CN 102438276 A CN102438276 A CN 102438276A CN 2011104598167 A CN2011104598167 A CN 2011104598167A CN 201110459816 A CN201110459816 A CN 201110459816A CN 102438276 A CN102438276 A CN 102438276A
- Authority
- CN
- China
- Prior art keywords
- message
- index vector
- node
- vector
- request
- 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.)
- Granted
Links
- 239000013598 vector Substances 0.000 title claims abstract description 291
- 238000000034 method Methods 0.000 title claims abstract description 83
- 238000007906 compression Methods 0.000 title claims abstract description 65
- 230000006835 compression Effects 0.000 title claims abstract description 64
- 230000003044 adaptive effect Effects 0.000 title claims abstract description 28
- 230000009467 reduction Effects 0.000 claims abstract description 14
- 230000005540 biological transmission Effects 0.000 claims abstract description 13
- 238000012545 processing Methods 0.000 claims description 18
- 230000008569 process Effects 0.000 claims description 12
- 238000004891 communication Methods 0.000 abstract description 12
- 238000004904 shortening Methods 0.000 abstract description 4
- 238000005265 energy consumption Methods 0.000 abstract 1
- 208000015181 infectious disease Diseases 0.000 description 15
- 230000007246 mechanism Effects 0.000 description 15
- 238000010586 diagram Methods 0.000 description 7
- 238000005516 engineering process Methods 0.000 description 5
- 230000033001 locomotion Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000005538 encapsulation Methods 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- UREBDLICKHMUKA-CXSFZGCWSA-N dexamethasone Chemical compound C1CC2=CC(=O)C=C[C@]2(C)[C@]2(F)[C@@H]1[C@@H]1C[C@@H](C)[C@@](C(=O)CO)(O)[C@@]1(C)C[C@@H]2O UREBDLICKHMUKA-CXSFZGCWSA-N 0.000 description 1
- 238000009792 diffusion process Methods 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 239000003999 initiator Substances 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 229960005486 vaccine Drugs 0.000 description 1
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a high-performance routing method for an opportunistic network based on adaptive summery vector (SV) compression. The method consists of 13 operating steps in four stages, namely a node encounter sensing stage, a stage for exchanging messages of which the destinations are encountered nodes, an adaptive SV transmitting stage and a message exchanging stage. The communication expense of nodes of the opportunistic network is reduced, and the storage for the nodes, the energy consumption and the network bandwidth consumption are also reduced through 3 novel systems for reducing the number of SV messages and Request messages, adaptively compressing the length of the SV messages and shortening the lengths of the SV messages and the Request messages on the premise of not influencing the message transmission function of the opportunistic network; and due to the reduction of expenses on such aspects as node communication, storage, energy and the like, and the saving of network wireless bandwidth resources as well as the efficiency and expandibility of the routing method for the opportunistic network are improved.
Description
Technical Field
The present invention relates to the field of opportunistic network technologies, and in particular, to an opportunistic network that employs a routing technology based on an infection (epidemic) mechanism and assigns an independent identity to each node in the network.
Background
The opportunistic network is a wireless ad hoc network which does not need to have a complete path between a source node and a destination node, realizes communication by using meeting opportunities brought by node movement and has tolerable time delay and breakage; in some wireless network application fields, a fully-connected network topology cannot be established, so that a traditional multi-hop self-organizing network communication protocol cannot normally operate, and an opportunistic network can complete a data transmission task under the conditions of wireless link disconnection and network split; the method is a specific networking form and a new network communication technology, is regarded as an important direction for the development of the mobile Ad Hoc network, and has a great influence on future pervasive computing.
An important component of the opportunistic network architecture is routing technology. Up to now, routing methods based on opportunistic networks mainly include four categories of redundancy-based routing, utility-based routing, redundant utility hybrid routing, and proactive movement-based routing. Routing methods based on the mechanism of infection, as a subclass of redundancy-based routing methods, have attracted considerable attention in recent years and have been studied and applied more and more intensively. The main idea of the infection mechanism is to transmit messages hop by hop with the chance that nodes meet in motion, the basic steps of which are as follows:
(1) when a node a in the network detects that it encounters a node B by using a certain node encounter (encounter refers to mutual entering into a communication range of the other party), a loads an index Vector (binary Vector) of a message (message, which refers to an independent and complete information unit for transmitting service data) stored by itself into an SV message (SV message, which refers to a control information unit for loading the index Vector) and sends the SV message to B, wherein the position of each bit in the Vector is associated with the source node and sequence number of the message by hash mapping, and the value represents whether the message is stored in the current node.
(2) B uses index vector in SV message after receiving SV message from A
Index vector with self-stored message
Performing operation to determine the vector-request vector corresponding to the message not stored in the device, and recording the vector-request vector as the request vector
Namely: <math>
<mrow>
<mover>
<msub>
<mi>REQ</mi>
<mi>B</mi>
</msub>
<mo>→</mo>
</mover>
<mo>=</mo>
<mover>
<msub>
<mi>SV</mi>
<mi>A</mi>
</msub>
<mo>→</mo>
</mover>
<mo>+</mo>
<mover>
<mover>
<msub>
<mi>SV</mi>
<mi>B</mi>
</msub>
<mo>→</mo>
</mover>
<mo>‾</mo>
</mover>
<mo>.</mo>
</mrow>
</math>
(3) b will
Load 1 Request message (the control information unit of the loading Request vector), and send it to A, Request A sends the message that itself does not have.
(4) After A receives the Request message from B, according to the Request vector
Find the message which is stored by itself but not B, and then send to B.
(5) Similarly, with node B as the initiator of the SV message, B, A repeats the operations of steps (1) - (4).
Opportunistic network nodes using the infection mechanism need to process messages in a "store-carry-forward" manner, and when the messages are not transmitted to the destination node, the messages are not deleted, but are carried along. The basic idea of the mechanism of infection was originally proposed by Demers et al (see literature: A. Demers, D.Greene, C.Hauser, W.Irish, J.Larson, S.Shencer, H.Sturgis, D.Swinehart, D.Terry.epidemic Algorithms for replicable database Maintenance [ C.]Proceedings of the six Symposium on Principles of distributed Computing, 1987: 1-12) for the management and maintenance of database information for different nodes in the network. Thereafter, Vahdat and Becker improve the original infection mechanism to make it suitable for the intermittent connection of the opportunistic network topology, and an infection Routing (Epidemic Routing) protocol (see the documents: A. Vahdat, D. Becker. Epidemic Routing for Partially-Connec) is proposed on the basis of the original infection mechanismted Ad Hoc Networks[R]Technical report cs-200006, Duke University, Durham, 2000), the infection routing protocol processes data in a "store-carry-forward" manner, using imep (internet MANET Encapsulation protocol) protocol (see literature: corson, s papademetriou, p papadopoulos, v park, a. qayum. an internet manet. encapsulation. protocol (IMEP)]Draft-ietf-manet-imep-spec-01.txt, 1999) as an encounter node awareness mechanism, realizes hop-by-hop transfer of data in a network through exchange of index vectors and messages when nodes meet, can reliably transmit data in an opportunistic network without the help of prior topology information, and has small end-to-end delay of messages. Matsuda and Takine devised (p, q) infection ((p, q) -Epidemic) Routing protocols (see T.Matsuda, T.Takine. (p, q) -Epidemic Routing for Sparsely Populated Mobile Ad Hoc Networks [ J.]IEEE Journal on Selected Areas in Communications, Vol.26, No.5, 2008: 783-793), using a combination of 2-Hop forwarding and traditional infected routing algorithms based on network state, and employing a mechanism called "VACCINE" (see literature: haas, T.Small.A New network model for Biological Applications of Ad Hoc Sensor Networks [ J]IEEE/ACM Transactionon Networking, 2006, 14 (1): 27-40) to reduce storage overhead by broadcasting information of messages that have reached the destination to eliminate messages that have reached the destination in the node cache. Wang Xin et al proposed an adaptive Randomized infection Routing protocol (see literature: Wang Xin, Shu Yan-Tai, Jin Zhi-Gang, Pan Qing-Fen, Lee Bu-Sung.Adaptation Randomized infectious Routing for differentiation Tolerant Networks [ C]Proceedings of the 5th International Conference on Mobile Ad-hoc and Sensor networks.2009: 424-ij＝G1Ri(Ts)+C2pij+C3TTLijCalculating the weight W of the message i after being transmitted by j hopsijWherein R isi(Ts) For reproducing density, pijFor forwarding probability, TTLijTo a survival time parameter, C1、C2、C3Is a preset constant; and according to the weight WijIn the process of forwarding and deleting, messages are sequenced to improve the performances of time delay and the like, but how to take the network condition as C1、C2、C3Is an unsolved problem. Hong Bian et al propose a Control method for limiting the number of message copies (see document: Hong Bian, Haizheng Yu. an effective Control method Multi-copy Routing in DTN C]2010 selected International Conference on networks security, Wireless Communications and regulated Computing (NSWCTC), 2010: 153-156), recording the encounter frequency of the nodes storing the same message by using 1 node encounter counter, and deleting the message from the cache when the value of the counter reaches the set threshold; the method is beneficial to reducing the node storage overhead, but the proper selection of the threshold value is not easy to achieve. Ueda et al devised a transmission strategy for Sharing Control Information (see document: H.Ueda, N.Fujita.A. MessageTransmission Control Scheme for Efficient Information Sharing in discarding Tolerannetworks [ C.]20102 nd International Conference on Intelligent Networking and hierarchical Systems (INCOS), 2010: 392-; by comparing SV information of neighbor nodes stored in an SV information log with the SV information of the current node, the current node can judge whether the current node has information which is not available in the neighbor nodes, so as to determine whether the SV information is broadcasted or not; the strategy can reduce the broadcast of redundant SV messages in an infection route, but extra storage cost is brought by building the receiving log of the SV messages, and the receiving log of the SV messages is difficult to update in time, so that the judgment of nodes is biased, and redundant SV messages still exist.
From the content of the above documents and the current state of research, since the infected routing protocol is proposed, research on improvement and expansion of the infected routing protocol is carried out, certain progress has been made in the aspects of message forwarding, node cache management, node encounter sensing, combination with other forwarding modes and the like, but redundant communication and storage overhead still exists in the aspects of SV message and Request message transmission, index vector storage and the like, and the problem is not effectively solved so far, but the problem has important influence on the efficiency, expandability and other performances of a routing method adopting an infection mechanism, so that the invention has a need of further research and solution.
Disclosure of Invention
In view of this, the technical problem to be solved by the present invention is to solve the following problems existing in the existing opportunistic network routing method based on the infection mechanism:
(1) when two nodes meet, the number of SV messages and Request messages needing to be received and transmitted is reduced in the transmission process of the index vector;
(2) reducing the vector length of the index vector stored by the node;
(3) the lengths of the SV message and the Request message are shortened.
The purpose of the invention is realized as follows:
the invention provides an opportunistic network efficient routing method based on adaptive index vector compression, which comprises a node encountering sensing stage with a logical precedence relationship, a message exchange stage with the destination being a encountering node, an adaptive index vector transmission stage and a message exchange stage, and specifically comprises the following steps:
s1: the node meeting sensing stage is used for periodically broadcasting information by nodes, sensing node meeting and recording meeting node information;
s2: the message exchange stage of the meeting node as the destination is used for sending the message of the meeting node as the destination, and the destination node receives and processes the message;
s3: the self-adaptive index vector transmission stage is used for judging and executing whether the compression operation of the index vector in the received message is carried out or not, sending the SV message, processing the received SV message, sending the Request message and processing the received Request message;
s4: the message exchange stage is configured to determine a message to be exchanged according to the message obtained in stage S3, send the message to be exchanged, and update the stored index vector.
Further, the specific operation of sending the message destined to the encountering node in S2 includes the following steps:
s21: if the two nodes respectively determine that the two nodes meet each other, the two nodes respectively and independently search out the message with the destination as the opposite party from the message cache and send the message to the opposite party, and simultaneously record the information of the message with the destination, and the information is recorded in an index vector mode or a message identification set mode;
s22: if there is no message destined to the other party, the operation of the adaptive index vector delivery phase described in S3 is directly performed.
Further, the specific step of determining and executing the compression operation on the index vector in S3 is:
s311: segmenting an original index vector of a message sent by a source node in a network, wherein the bit number of each segment of the index vector corresponds to the storage condition of the message sent by each source node;
s312: judging whether each index vector has the same continuous digital signal, if yes, entering step S314 to compress the index vector into a compressed index vector by a compression method;
s313: if not, the step S316 is entered to store the original index vector;
s314: reserving M-F-L bits in the middle of each section, identifying the sizes of F and L by binary numbers, not listing the front F bits and the rear L bits of each section of index vector, and compressing the index vector to comprise the M-F-L bits in the middle of N sections and two identification fields displaying the omitted bits before and after; wherein, N represents the number of source nodes generating messages in the network, and M represents the number of messages generated and sent by each source node;
s315: comparing whether the length of the original index vector is larger than that of the compressed index vector, if not, storing the compressed index vector
S316: if so, the original index vector is stored.
Further, the specific step of processing the received SV message in S3 is:
s321: if the current node receives the SV message sent by the encountering node, extracting a receiving index vector from the SV message;
s322: judging whether the received index vector is compressed or not, and if the length of the index vector is smaller than NM, indicating that the index vector is compressed, reducing the index vector into an original index vector by using a reduction method;
s323: if not, indicating that the compression is not carried out, and entering the next step;
s324: judging whether the index vector stored by the current node is compressed or not, and if so, reducing the index vector into the original index vector by using a reduction method;
s325: comparing the received index vector with the current index vector, and determining the request vector corresponding to the message which is owned by itself but not owned by the opposite node according to the following formula by bit operation
And request vectors corresponding to messages that the opposite node has but does not have
Wherein, the current node B meets the node A, and the node B receives the SV message sent by the node A and the index vector carried by the SV message
S326: applying compression method to request vector
Compressing to obtain a compression request vector, wherein the compression method comprises the following steps: for the first F bits with the same value of 0 contained in each segment of the request vector, the size of F is marked by binary number; for L bits after each segment contains the same value of 0, the size of L is marked by binary number; reserving M-F-L bits in the middle of each segment, and not listing the front F bits and the rear L bits of each segment, wherein the compression request vector comprises: M-F-L bits in the middle of N sections, and two identification fields for displaying the omitted bits before and after.
Further, the reduction method comprises the following steps: adding '1' in front of each section, wherein the number of '1' is equal to the value of the 1 st identification field; and adding 0 to the back of each segment, wherein the number of 0 is equal to the value of the 2nd identification field.
Further, the specific operation of sending the Request message in S3 is:
s341: when the current node receives the SV message sent by the encountering node, a Request message is generated in a network layer;
s342: comparing the lengths of the original Request vector, the compressed Request vector and the identifier set of the message to be transmitted, selecting the shortest length to load the message to the Request message, and setting a flag bit for indicating the type of the loaded information at the head of the Request message;
s343: and sending the Request message to the encountering node.
Further, the specific step of processing the received Request message in S3 is:
s351: the current node receives a Request message sent by the encountering node and takes out the information loaded by the current node;
s352: judging whether the Request vector is a compression Request vector according to the flag bit of the header of the Request message and the length of the data field, and if so, reducing the compression Request vector into an original index vector by using a reduction method;
s352: if not, the next stage is entered.
Further, the specific operation of determining the message to be exchanged in S4 is:
s411: current node according to request vectorRequest vector
Or obtaining a Request vector of the opposite side by processing the received Request message;
s412: and searching the message which is owned by the user and is not owned by the opposite party according to the corresponding rule of the request vector and the message for sending to the opposite party.
Further, the specific step of updating the stored index vector in S4 is:
s421: the current node receives a message sent by the opposite node, judges whether the index vector stored by the current node is compressed or not, and restores the stored index vector into the original index vector by using a restoration method if the stored index vector is compressed;
s422: updating the index vector according to the corresponding rule of the received message and the index vector;
s423: and compressing the updated index vector by adopting an index vector compression method, and storing the compressed index vector by the current node if the compressed updated index vector is shorter than the index vector before compression.
Further, the node encounter sensing stage specifically includes the following steps:
s11: judging whether the broadcast time of the Hello message is finished, if so, broadcasting the Hello message;
s12: if not, judging whether the Hello message is received, if so, turning to S15;
s13: if not, judging whether the received destination is the message of the user or not; if so, go to S15;
s14: if not, judging whether an SV message sent to the user is received or not; if not, return to S11;
s15: if yes, the node is determined to meet other nodes, meeting node information is recorded, and a node meeting sensing process is achieved.
The invention has the advantages that: the opportunistic network efficient routing method based on the adaptive index vector compression comprises 13 operation steps in 4 stages including a node encounter sensing stage with a logical precedence relationship, a message exchange stage with the destination of an encountered node, an adaptive index vector transmission stage and a message exchange stage, by 3 new mechanisms of reducing the number of SV messages and Request messages, adaptively compressing the length of an index vector and shortening the length of SV messages and Request messages, on the premise of not influencing the message transmission function of the opportunistic network, the SV message receiving node can obtain the request vector corresponding to the message which is owned by the SV message receiving node but not owned by the opposite node through calculation, directly transmitting the message which the opposite node does not have according to the Request vector, thereby reducing 50% of SV messages and 50% of Request messages, and reducing the communication overhead and the network bandwidth consumption of the opportunity network node; the length of the index vector stored by the node is compressed in a self-adaptive manner, so that the storage overhead of the opportunistic network node is reduced; meanwhile, the SV message carries the compressed index vector, the length of the SV message is shortened, and the shortest one is selected from the original Request vector, the compressed Request vector and the identifier set of the message to be transmitted for sending, so that the length of the Request message is adaptively shortened, and the node communication overhead and the network bandwidth consumption are further reduced; the reduction of the expenses in the aspects of node communication, storage, energy and the like and the saving of wireless bandwidth resources of the network enhance the efficiency and the expandability of the routing method of the opportunistic network.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be further described in detail with reference to the accompanying drawings, in which:
FIG. 1 is a block diagram of a routing method according to the present invention;
FIG. 2 is a diagram illustrating a conventional routing method based on an infection mechanism in comparison with the routing method of the present invention;
FIG. 3 is a diagram illustrating an index vector compression scheme according to the present invention;
FIG. 4 is a flowchart illustrating the operation of the adaptive index vector delivery phase (phase 3) of the present invention;
FIG. 5 is a flowchart illustrating the operation of the node encounter sensing stage (stage 1) according to the present invention.
Detailed Description
The preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings; it should be understood that the preferred embodiments are illustrative of the invention only and are not limiting upon the scope of the invention.
The following detailed description refers to the accompanying drawings in which:
fig. 1 is a block diagram of a routing method according to the present invention.
The opportunistic network efficient routing method based on the adaptive index vector compression is composed of 13 operation steps in 4 stages of node encounter sensing, message exchange with the destination being an encounter node, adaptive index vector transmission and message exchange, wherein the 13 operation steps are as follows: (1) periodically broadcasting a Hello message by the node; (2) sensing nodes meet; (3) recording the information of the encountering nodes; (4) sending a message destined for the encountering node; (5) the destination node receives and processes the message; (6) judging and executing compression operation on the index vector; (7) sending SV information; (8) processing the received SV message; (9) sending a Request message; (10) processing the received Request message; (11) determining a message to be exchanged; (12) sending a message to be exchanged; (13) the stored index vector is updated.
Fig. 2 is a schematic diagram illustrating a comparison between a conventional routing method based on an infection mechanism and a routing method according to the present invention.
(a) Is a traditional routing method based on infection mechanism. After receiving the BECON message periodically broadcast by the node A, the node B replies an ECHO message to the node A, and the node A and the node B finish the meeting sensing process. Then A first includes the index vector
The SV message of (1) is sent to B; b uses the index vector in SV message after receiving it
Index vector with self-stored message
Performing operation to determine the vector-request vector corresponding to the message not stored in the device
Namely:
b will
Loading a Request message and sending the Request message to A; after A receives the Request message from B, according to the Request vectorFind the message which is stored by itself but not B, and then send to B. B performs a similar procedure as the originator of the SV message to send a message that a does not have.
(b) Is the routing method of the present invention. After receiving the Hello message periodically broadcast by the B, the A determines to meet the B; then sends the message whose destination is B in the message buffer to node B, and stores the index vector which is compressed by itselfLoading SV information and sending to B; b transmitted by receiving ADetermining to meet with A by using the message or SV message with the destination of the message or SV message, and then sending the message with the destination of A in the cache of the message or SV message to A; b receives SV message of A and index vector carried by SV messageIt uses
Index vector with self-stored message
Performing operation to determine the request vector corresponding to the message which is not stored but stored by A
And request vectors corresponding to messages that exist on their own but not A
Namely: <math>
<mrow>
<mover>
<msub>
<mi>REQ</mi>
<mi>B</mi>
</msub>
<mo>→</mo>
</mover>
<mo>=</mo>
<mover>
<msub>
<mi>SV</mi>
<mi>A</mi>
</msub>
<mo>→</mo>
</mover>
<mo>+</mo>
<mover>
<mover>
<msub>
<mi>SV</mi>
<mi>B</mi>
</msub>
<mo>→</mo>
</mover>
<mo>‾</mo>
</mover>
<mo>.</mo>
</mrow>
</math> <math>
<mrow>
<mover>
<msub>
<mi>REQ</mi>
<mi>A</mi>
</msub>
<mo>→</mo>
</mover>
<mo>=</mo>
<mover>
<msub>
<mi>SV</mi>
<mi>B</mi>
</msub>
<mo>→</mo>
</mover>
<mo>+</mo>
<mover>
<mover>
<msub>
<mi>SV</mi>
<mi>A</mi>
</msub>
<mo>→</mo>
</mover>
<mo>‾</mo>
</mover>
<mo>,</mo>
</mrow>
</math> b will
After compressionAnd the shorter length in the message identification set to be transmitted is loaded into the Request message and sent to A; b is according to
The corresponding message sends the message which is not provided by the A to the A; a according to the Request message
Or the message corresponding to the to-be-transmitted message identification set sends the message which is not provided by the B to the B.
It can be seen from the figure that the routing method proposed by the present invention has reduced number and length of control messages and occupied storage space.
FIG. 3 is a diagram illustrating an index vector compression scheme according to the present invention.
(a) For the original index vector, there are 5 source nodes generating messages in the network, and each source node sends 10 messages in total, that is, each 10 bits is a segment, corresponding to the situation that one source node generates a message.
(b) For the compressed index vector, for the same first F bits contained in each segment, identifying the size of F by binary number, where F is 3; for the same last L bits contained in each segment, identifying the size of L by using a binary number, wherein L is 3; the lengths of the two binary flags are: [ log ]2 M]+1 ═ 4 where M ═ 10. The compressed index vector includes: M-F-L bit in the middle of 5 segments, and two identification fields for displaying the omitted digits before and after.
As can be seen from the figure, the original length of the index vector is 5 × 10 to 50 bits, and the length of the compressed index vector is changed to 8+5 × 5 to 33 bits, which is reduced by 50-33 to 17 bits.
FIG. 4 is a flowchart illustrating the operation of the adaptive index vector delivery phase (phase 3) of the present invention.
The node firstly compresses the index vector of the node, and if the compressed index vector is shorter, the current node stores the compressed index vector and does not store the original index vector any more.
If the current node receives the SV message sent by the encountering node, extracting an index vector from the SV message; then, judging whether the received index vector and the index vector stored by the index vector are compressed or not, and if the index vector is compressed, restoring the index vector; then, determining a request vector corresponding to a message which is not owned by the user and is stored in the node of the opposite side through comparison operation, and compressing the request vector; then, the lengths of the original Request vector, the compressed Request vector and the identifier set of the message to be transmitted are compared, and the shortest length is selected to be loaded into a Request message and sent to the opposite node.
If the current node does not receive the SV message from the encountering node, 1 SV message is generated in the network layer of the current node and is loaded into the index vector stored by the current node, and then the SV message is sent to the encountering node.
If the current node receives the Request message, firstly extracting information loaded by the Request message; and then judging whether the information is a compression request vector, and if so, restoring the compression request vector.
If the current node does not receive the Request message, the current node circularly waits for receiving until the condition { receives the message sent by the opposite side }. U { receives the Hello message broadcasted by the opposite side }. U { is no longer adjacent to the opposite side }. then the next phase is entered.
FIG. 5 is a flowchart illustrating the operation of the node encounter sensing stage (stage 1) according to the present invention.
In the invention, each node periodically broadcasts the Hello message, and one node can sense and determine the meeting with other nodes and record the meeting node information by receiving the broadcast Hello message, receiving the message with the destination of the node and receiving the SV message sent to the node, thereby realizing the node meeting sensing process.
The invention is applicable to the field of opportunistic networks which adopt routing technology based on an infection mechanism. One specific implementation mode is as follows: in the opportunistic network with the number of nodes not less than 3, the nodes are in an intermittent or continuous motion state, and messages need to be transmitted between the nodes, the opportunistic network efficient routing method based on the adaptive index vector compression, which is provided by the invention, can be used for transmitting the messages from the source node to the destination node hop by hop in a step-by-step manner with less overhead by means of the opportunity of node meeting in a storage-carrying-forwarding manner. The invention designs 3 new mechanisms of reducing the number of SV messages and Request messages, compressing the length of index vectors in a self-adaptive manner, and shortening the length of SV messages and Request messages, thereby reducing the number of control messages, shortening the length of the control messages, and compressing the storage space consumed by nodes in a self-adaptive manner while realizing successful transmission of the messages, thereby reducing the communication and storage expenses of opportunistic network nodes, saving the energy of the nodes, saving the network bandwidth resources, and enhancing the efficiency and expandability of the routing method.
Broadcast period T of Hello message in the present inventionHelloThe value of (A) can be set according to the concrete conditions of the opportunistic network, refer to the content of the existing IETF (Internet Engineering Task force) International Standard document RFC3561(Ad-hoc On-demand distance Vector (AODV) Routing), THelloMay be set to 1 second.
Fig. 1 is a block diagram of the routing method proposed by the present invention, as shown in the figure: the invention provides an opportunistic network efficient routing method based on adaptive index vector compression, which comprises a node encountering sensing stage with a logical precedence relationship, a message exchange stage with the destination being a encountering node, an adaptive index vector transmission stage and a message exchange stage, and specifically comprises the following steps:
s1: the node meeting sensing stage is used for periodically broadcasting information by nodes, sensing node meeting and recording meeting node information; each node repeatedly broadcasts a Hello message at a certain period, wherein the Hello message contains the identifier of the node (a symbol set which uniquely represents the node, such as a node address); when two nodes enter the communication range of each other, they respectively and independently sense and judge to meet each other in 3 ways in respective network layers: receiving a Hello message broadcast by a node of an opposite side; receiving message with destination as self from opposite node; and receiving SV message from opposite node. If the current node determines to meet other nodes, the identification of the meeting node is stored in the neighbor table, and then the operation of the next stage is executed.
The method specifically comprises the following steps:
s11: judging whether the broadcast time of the Hello message is finished, if so, broadcasting the Hello message;
s12: if not, judging whether the Hello message is received, if so, turning to S15;
s13: if not, judging whether the received destination is the message of the user or not; if so, go to S15;
s14: if not, judging whether an SV message sent to the user is received or not; if not, return to S11;
s15: if yes, the node is determined to meet other nodes, meeting node information is recorded, and a node meeting sensing process is achieved.
S2: the message exchange stage of the meeting node as the destination is used for sending the message of the meeting node as the destination, and the destination node receives and processes the message;
determining two meeting nodes, respectively and independently searching out messages with the destinations being opposite parties from the message cache and sending the messages to the opposite parties, and simultaneously recording the information of the messages which reach the destinations; if there is no message destined for the other party, the next stage of operation is performed directly.
After receiving messages destined to the node, the node sends the messages to an application layer; then, record their identification (the identification of the message is a symbol set uniquely identifying the message, and usually consists of two parts, i.e. the node identification is 16bits, the message sequence number is 16bits, and the length of 1 message identification is 32bits), and delete them from the message buffer.
The specific operation of sending the message destined to the encountering node in S2 includes the following steps:
s21: if the two nodes respectively determine that the two nodes meet each other, the two nodes respectively and independently search out the message with the destination as the opposite party from the message cache and send the message to the opposite party, and simultaneously record the information of the message with the destination, and the information is recorded in an index vector mode or a message identification set mode;
s22: if there is no message destined to the other party, the operation of the adaptive index vector delivery phase described in S3 is directly performed.
S3: the self-adaptive index vector transmission stage is used for judging and executing compression operation on the index vector, sending SV information, processing the received SV information, sending Request information and processing the received Request information;
in S3, the specific steps of determining and executing the compression operation on the index vector are as follows:
s311: segmenting an original index vector of a message sent by a source node in a network, wherein the bit number of each segment of the index vector corresponds to the storage condition of the message sent by each source node;
s312: judging whether each index vector has the same continuous digital signal, if yes, entering step S314 to compress the index vector into a compressed index vector by a compression method;
s313: if not, the step S316 is entered to store the original index vector;
s314: reserving M-F-L bits in the middle of each section, identifying the sizes of F and L by binary numbers, not listing the front F bits and the rear L bits of each section of index vector, and compressing the index vector to comprise the M-F-L bits in the middle of N sections and two identification fields displaying the omitted bits before and after; wherein, N represents the number of source nodes generating messages in the network, and M represents the number of messages generated and sent by each source node;
s315: comparing whether the length of the original index vector is larger than that of the compressed index vector, if not, storing the compressed index vector
S316: if so, the original index vector is stored.
The determination and execution of the compression operation on the index vector will now be exemplified.
If there are N (N > 0) source nodes generating messages in the network, and each source node generates and transmits M (M > 0) messages in total, the length L of the original index vector is setoComprises the following steps:
Lo＝NM (1)
it can be divided into N segments with M bits, and each 1 segment corresponds to the storage status of the message sent by 1 source node. If the values of the first F (F > 0) bits or the values of the last L (L > 0) bits of the N segments are all "1" or "0", the index vector may be compressed; the compression method comprises the following steps: reserving M-F-L bit in the middle of each segment, and using length as [ log ]2 M]The binary number of +1 identifies the size of F and L, and the first F bits and the last L bits of each segment are not listed. The compressed index vector includes: M-F-L bit in the middle of N sections, two identification fields for displaying the omitted bits before and after; let the length of the compressed index vector be Lc(Lc> 0), then there are:
Lc＝N×(M-F-L)+2([log2 M]+1)＝NM-{N(F+L)-2([log2 M]+1)} (2)
when N (F + L) -2([ log ]2 M]+1) > 0, i.e.
When satisfied, have: l isc＜LoI.e. the compressed index vector is shorter. Take 50 nodes, each sending 50 messages as an example: N-M-50, M-M,
then only F + L is more than 0.24, which is equivalent to F ≧ 1 or L ≧ 1, i.e. as long as 1bit is the same at the beginning or end of each segment in the index vector, the compressed index vector is shorter. In the early and middle periods of network operation, since many messages are not generated yet, a plurality of '0's exist at the rear part of each segment in the index vector; in the middle and later periods of network operation, along with the gradual diffusion of messages, a plurality of '1's appear at the front part of each segment in the index vector; therefore, the condition that the compressed index vector is shorter is easily satisfied.
If the compressed index vector is shorter, the current node stores the compressed index vector and no longer stores the original index vector.
The specific steps of processing the received SV message in S3 are:
s321: if the current node receives the SV message sent by the encountering node, extracting a receiving index vector from the SV message;
s322: judging whether the received index vector is compressed or not, and if the length of the index vector is smaller than NM, indicating that the index vector is compressed, reducing the index vector into an original index vector by using a reduction method;
s323: if not, indicating that the compression is not carried out, and entering the next step;
s324: judging whether the index vector stored by the current node is compressed or not, and if so, reducing the index vector into the original index vector by using a reduction method;
s325: comparing the received index vector with the current index vector, and determining the request vector corresponding to the message which is owned by itself but not owned by the opposite node according to the following formula by bit operation
And request vectors corresponding to messages that the opposite node has but does not have
Wherein, the current node B meets the node A, and the node B receives the SV message sent by the node A and the index vector carried by the SV message
S326: applying compression method to request vectorCompressing to obtain a compression request vector, wherein the compression method comprises the following steps: for the first F bits with the same value of 0 contained in each segment of the request vector, the size of F is marked by binary number; for L bits after each segment contains the same value of 0, the size of L is marked by binary number; reserving M-F-L bits in the middle of each segment, and not listing the front F bits and the rear L bits of each segment, wherein the compression request vector comprises: M-F-L bits in the middle of N sections, and two identification fields for displaying the omitted bits before and after.
The reduction method comprises the following steps: adding '1' in front of each section, wherein the number of '1' is equal to the value of the 1 st identification field; and adding 0 to the back of each segment, wherein the number of 0 is equal to the value of the 2nd identification field.
The specific method for restoring the compressed index vector to the original index vector will now be illustrated as follows:
nodes A, B are set to meet; b receives SV message of A and index vector carried by SV message
It usesIndex vector with self-stored messagePerforming operation to determine the request vector corresponding to the message which is not stored but stored by A
And, the request vector corresponding to the message that exists but does not exist is determined
On the other hand, pair B
And compressing to obtain a compression request vector. Since one node does not request any other node to transmit a message generated by itself, a section corresponding to the node in the request vector is all 0; accordingly, the compression method of the request vector comprises the following steps: for the front F bit and the back L bit of which each segment has the same value of 0, the length is [ log ]2 M]The binary number of +1 identifies the size of F and L, and these bits are not listed; the middle M-F-L bit is reserved. The compression request vector includes: M-F-L bits in the middle of N segments, and two identification fields showing the number of digits omitted before and after, wherein M, F, L respectively represent integers.
The specific operation of sending the Request message in S3 is as follows:
s341: when the current node receives the SV message sent by the encountering node, a Request message is generated in a network layer;
s342: comparing the lengths of the original Request vector, the compressed Request vector and the identifier set of the message to be transmitted, selecting the shortest length to load the message to the Request message, and setting a flag bit for indicating the type of the loaded information at the head of the Request message;
s343: and sending the Request message to the encountering node.
The specific steps of processing the received Request message in S3 are as follows:
s351: the current node receives a Request message sent by the encountering node and takes out the information loaded by the current node;
s352: judging whether the Request vector is a compression Request vector according to the flag bit of the header of the Request message and the length of the data field, and if so, reducing the compression Request vector into an original index vector by using a reduction method;
s352: if not, the next stage is entered.
The specific operation of sending the Request message is now illustrated:
if the current node receives the SV message sent by the encountering node, 1 Request message is generated in a network layer; then, comparing the lengths of the original Request vector, the compressed Request vector and the identifier set of the message to be transmitted, and selecting the shortest length to load the shortest length into the Request message; the message is then sent to the encountering node. The header of the Request message is provided with 1bit of flag bit for indicating the type of the loading information: if it is "0", it indicates a load request vector; if the value is '1', the waiting message identification set is loaded. The lengths of the original request vector and the compressed request vector are calculated by the equations (1) and (2), and the length L of the identification set of the messages to be transmittedcCalculated from the following formula:
Lc＝LiR (6)
wherein L isiThe length of 1 message mark is shown, and R shows the number of the message marks to be transmitted.
The specific process of processing the received Request message will now be illustrated:
if the current node sends SV information, the current node waits to receive the Request information until the condition { receives the information sent by the opposite side }. U { receives the Hello information broadcasted by the opposite side }. U { is no longer adjacent to the opposite side }. is satisfied, and then the operation of the next stage is carried out. If a Request message sent by a meeting node is received, firstly, the information loaded by the meeting node is taken out; then, judging whether the vector is a compression request vector according to the length of the flag bit and the data field, if so, restoring the vector, wherein the restoring method comprises the following steps: adding '0' in front of each section, wherein the number of '0' is equal to the value of the 1 st identification field; and adding 0 to the back of each segment, wherein the number of 0 is equal to the value of the 2nd identification field.
S4: the message exchange stage is configured to determine a message to be exchanged according to the message obtained in stage S3, send the message to be exchanged, and update the stored index vector.
The specific operation of determining the message to be exchanged in S4 is:
s411: current node according to request vector
Request vector
Or obtaining a Request vector of the opposite side by processing the received Request message;
s412: and searching the message which is owned by the user and is not owned by the opposite party according to the corresponding rule of the request vector and the message for sending to the opposite party.
The specific steps of updating the stored index vector in S4 are as follows:
s421: the current node receives a message sent by the opposite node, judges whether the index vector stored by the current node is compressed or not, and restores the stored index vector into the original index vector by using a restoration method if the stored index vector is compressed;
s422: updating the index vector according to the corresponding rule of the received message and the index vector;
s423: and compressing the updated index vector by adopting an index vector compression method, and storing the compressed index vector by the current node if the compressed updated index vector is shorter than the index vector before compression.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and it is apparent that those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (10)
1. The opportunistic network efficient routing method based on the adaptive index vector compression is characterized in that: the method comprises a node encountering sensing stage with a logical precedence relationship, a message exchange stage with a destination being a encountering node, a self-adaptive index vector transmission stage and a message exchange stage, and specifically comprises the following steps:
s1: the node meeting sensing stage is used for periodically broadcasting information by nodes, sensing node meeting and recording meeting node information;
s2: the message exchange stage of the meeting node as the destination is used for sending the message of the meeting node as the destination, and the destination node receives and processes the message;
s3: the self-adaptive index vector transmission stage is used for judging and executing whether to compress the index vector in the received message, sending and processing the SV message, and sending and processing the Request message;
s4: the message exchange stage is configured to determine a message to be exchanged according to the message obtained in stage S3, send the message to be exchanged, and update the stored index vector.
2. The opportunistic network efficient routing method based on adaptive index vector compression as claimed in claim 1, wherein: the specific operation of sending the message destined to the encountering node in S2 includes the following steps:
s21: if the two nodes respectively determine that the two nodes meet each other, the two nodes respectively and independently search out the messages with the destinations as the opposite side from the message cache and send the messages to the opposite side, and simultaneously record the information of the messages reaching the destinations, wherein the information is recorded in an index vector mode or a message identification set mode;
s22: if there is no message destined to the other party, the operation of the adaptive index vector delivery phase described in S3 is directly performed.
3. The opportunistic network efficient routing method based on adaptive index vector compression as claimed in claim 1, wherein: the specific steps of determining and executing the compression operation on the index vector in S3 are as follows:
s311: segmenting an original index vector of a message sent by a source node in a network, wherein the bit number of each segment of the index vector corresponds to the storage condition of the message sent by each source node;
s312: judging whether each index vector has the same continuous digital signal, if yes, entering step S314 to compress the index vector into a compressed index vector by a compression method;
s313: if not, the step S316 is entered to store the original index vector;
s314: reserving M-F-L bits in the middle of each section, identifying the sizes of F and L by binary numbers, not listing the front F bits and the rear L bits of each section of index vector, and compressing the index vector to comprise the M-F-L bits in the middle of N sections and two identification fields displaying the omitted bits before and after; wherein, N represents the number of source nodes generating messages in the network, and M represents the number of messages generated and sent by each source node;
s315: comparing whether the length of the original index vector is larger than that of the compressed index vector, if not, storing the compressed index vector
S316: if so, the original index vector is stored.
4. The opportunistic network efficient routing method based on adaptive index vector compression as claimed in claim 3, wherein: the specific steps of processing the received SV message in S3 are:
s321: if the current node receives the SV message sent by the encountering node, extracting a receiving index vector from the SV message;
s322: judging whether the received index vector is compressed or not, and if the length of the index vector is smaller than NM, indicating that the index vector is compressed, reducing the index vector into an original index vector by using a reduction method;
s323: if not, indicating that the compression is not carried out, and entering the next step;
s324: judging whether the index vector stored by the current node is compressed or not, and if so, reducing the index vector into the original index vector by using a reduction method;
s325: comparing the received index vector with the current index vector, and determining the request vector corresponding to the message which is owned by itself but not owned by the opposite node according to the following formula by bit operation
And request vectors corresponding to messages that the opposite node has but does not have
Wherein,
indicating that the current node B meets the node A, the node B receives the SV message sent by the node A and the index vector carried by the SV message,
an index vector representing the message stored in B;
s326: applying compression method to request vector
Compressing to obtain a compression request vector, wherein the compression method comprises the following steps: for each in the request vectorThe first F bits with the same value of 0 are contained in the segments, and the size of F is marked by binary number; for L bits after each segment contains the same value of 0, the size of L is marked by binary number; reserving M-F-L bits in the middle of each segment, and not listing the front F bits and the rear L bits of each segment, wherein the compression request vector comprises: M-F-L bits in the middle of N sections, and two identification fields for displaying the omitted bits before and after.
5. The opportunistic network efficient routing method based on adaptive index vector compression as claimed in claim 4, wherein: the reduction method comprises the following steps: adding '1' in front of each section, wherein the number of '1' is equal to the value of the 1 st identification field; and adding 0 to the back of each segment, wherein the number of 0 is equal to the value of the 2nd identification field.
6. The opportunistic network efficient routing method based on adaptive index vector compression as claimed in claim 1, wherein: the specific operation of sending the Request message in S3 is as follows:
s341: when the current node receives the SV message sent by the encountering node, a Request message is generated in a network layer;
s342: comparing the lengths of the original Request vector, the compressed Request vector and the identifier set of the message to be transmitted, selecting the shortest length to load the message to the Request message, and setting a flag bit for indicating the type of the loaded information at the head of the Request message;
s343: and sending the Request message to the encountering node.
7. The opportunistic network efficient routing method based on adaptive index vector compression as claimed in claim 1, wherein: the specific steps of processing the received Request message in S3 are as follows:
s351: the current node receives a Request message sent by the encountering node and takes out the information loaded by the current node;
s352: judging whether the Request vector is a compression Request vector according to the flag bit of the header of the Request message and the length of the data field, and if so, reducing the compression Request vector into an original index vector by using a reduction method;
s352: if not, the next stage is entered.
8. The opportunistic network efficient routing method based on adaptive index vector compression as claimed in claim 1, wherein: the specific operation of determining the message to be exchanged in S4 is:
s411: current node according to request vector
Request vectorOr obtaining a Request vector of the opposite side by processing the received Request message;
s412: and searching the message which is owned by the user and is not owned by the opposite party according to the corresponding rule of the request vector and the message for sending to the opposite party.
9. The opportunistic network efficient routing method based on adaptive index vector compression as claimed in claim 1, wherein: the specific steps of updating the stored index vector in S4 are as follows:
s421: the current node receives a message sent by the opposite node, judges whether the index vector stored by the current node is compressed or not, and restores the stored index vector into the original index vector by using a restoration method if the stored index vector is compressed;
s422: updating the index vector according to the corresponding rule of the received message and the index vector;
s423: and compressing the updated index vector by adopting an index vector compression method, and storing the compressed index vector by the current node if the compressed updated index vector is shorter than the index vector before compression.
10. The opportunistic network efficient routing method based on adaptive index vector compression according to claim 1, characterized by: the node encountering sensing stage specifically comprises the following steps:
s11: judging whether the broadcast time of the Hello message is finished, if so, broadcasting the Hello message;
s12: if not, judging whether the Hello message is received, if so, turning to S15;
s13: if not, judging whether the received destination is the message of the user or not; if so, go to S15;
s14: if not, judging whether an SV message sent to the user is received or not; if not, return to S11;
s15: if yes, the node is determined to meet other nodes, meeting node information is recorded, and a node meeting sensing process is achieved.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110459816.7A CN102438276B (en) | 2011-12-31 | 2011-12-31 | High-performance routing method for opportunistic network based on adaptive summery vector (SV) compression |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110459816.7A CN102438276B (en) | 2011-12-31 | 2011-12-31 | High-performance routing method for opportunistic network based on adaptive summery vector (SV) compression |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102438276A true CN102438276A (en) | 2012-05-02 |
| CN102438276B CN102438276B (en) | 2014-04-16 |
Family
ID=45986105
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110459816.7A Active CN102438276B (en) | 2011-12-31 | 2011-12-31 | High-performance routing method for opportunistic network based on adaptive summery vector (SV) compression |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102438276B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102711208A (en) * | 2012-05-31 | 2012-10-03 | 重庆邮电大学 | Method for storing and transmitting opportunistic network low-expense immunologic information based on summary vector |
| CN103560966A (en) * | 2013-11-13 | 2014-02-05 | 重庆邮电大学 | Opportunistic network route mixing method based on network coding and copying |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101784067A (en) * | 2010-01-14 | 2010-07-21 | 重庆邮电大学 | Method for quickly sensing meeting nodes based on cross-layer triggering in opportunistic network |
| CN101895954A (en) * | 2010-08-24 | 2010-11-24 | 重庆邮电大学 | Opportunistic network routing method based on incremental transmission of packet index |
-
2011
- 2011-12-31 CN CN201110459816.7A patent/CN102438276B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101784067A (en) * | 2010-01-14 | 2010-07-21 | 重庆邮电大学 | Method for quickly sensing meeting nodes based on cross-layer triggering in opportunistic network |
| CN101895954A (en) * | 2010-08-24 | 2010-11-24 | 重庆邮电大学 | Opportunistic network routing method based on incremental transmission of packet index |
Non-Patent Citations (3)
| Title |
|---|
| 任智 黄勇 曹建玲 祖力: "基于邻居信息交换的机会网络低时延路由算法", 《华中科技大学学报》, vol. 39, no. 2, 28 February 2011 (2011-02-28), pages 94 - 96 * |
| 任智 黄勇 陈前斌: "基于分组索引增量交换的机会网络高效低时延路由算法", 《计算机学报》, vol. 33, no. 9, 30 September 2010 (2010-09-30), pages 1634 - 1642 * |
| 任智 黄勇 陈前斌: "机会网络路由协议", 《计算机应用》, vol. 30, no. 3, 31 March 2010 (2010-03-31), pages 724 - 728 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102711208A (en) * | 2012-05-31 | 2012-10-03 | 重庆邮电大学 | Method for storing and transmitting opportunistic network low-expense immunologic information based on summary vector |
| CN102711208B (en) * | 2012-05-31 | 2014-12-03 | 重庆邮电大学 | Method for storing and transmitting opportunistic network low-expense immunologic information based on summary vector |
| CN103560966A (en) * | 2013-11-13 | 2014-02-05 | 重庆邮电大学 | Opportunistic network route mixing method based on network coding and copying |
| CN103560966B (en) * | 2013-11-13 | 2016-08-31 | 重庆邮电大学 | Opportunistic network mixed logic dynamic method based on network code and duplication |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102438276B (en) | 2014-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jain et al. | Geographical routing using partial information for wireless ad hoc networks | |
| Biradar et al. | Link stability based multicast routing scheme in MANET | |
| KR101446805B1 (en) | Group communication system and method in a mobile ad-hoc network | |
| JP4805646B2 (en) | Sensor terminal and sensor terminal control method | |
| Poonguzharselvi et al. | Survey on routing algorithms in opportunistic networks | |
| US20120224508A1 (en) | Radio communication device, and ad hoc route information acquiring method | |
| US8213352B2 (en) | Wireless communication system, wireless communication device, wireless communication method, and program | |
| JP2007325261A (en) | Method of establishing route | |
| Wu | An extended dynamic source routing scheme in ad hoc wireless networks | |
| CN101895954B (en) | Opportunistic network routing method based on incremental transmission of packet index | |
| Mu | An improved AODV routing for the zigbee heterogeneous networks in 5G environment | |
| CN101827421A (en) | DSR cooperative routing method based on channel state information and router | |
| JP2010093387A (en) | Wireless communication system, transmission terminal, relay terminal, data transmission method, data reception method, and computer program | |
| CN103560966B (en) | Opportunistic network mixed logic dynamic method based on network code and duplication | |
| CN113055945B (en) | Load balancing method and mobile self-organizing network | |
| CN117835164A (en) | Broadcasting method on wireless channel, electronic device and storage medium | |
| CN102438276A (en) | High-performance routing method for opportunistic network based on adaptive summery vector (SV) compression | |
| CN106992930B (en) | A kind of opportunistic network routing method based on approach frequency | |
| Grilo et al. | Routing metrics for cache-based reliable transport in wireless sensor networks | |
| Gruber et al. | Ad hoc routing for cellular coverage extension | |
| CN102711208B (en) | Method for storing and transmitting opportunistic network low-expense immunologic information based on summary vector | |
| Malarkodi et al. | Performance evaluation of AOMDV-PAMAC protocols for ad hoc networks | |
| Osano et al. | Routing protocol using bloom filters for mobile ad hoc networks | |
| Shekhar et al. | Mobile agents aided multicast routing in mobile ad hoc networks | |
| CN111585898B (en) | Routing information increment transmission method facing wireless self-organizing network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20170401 Address after: 518053 Guangdong city of Shenzhen province Nanshan District overseas Chinese town in Eastern Industrial Zone H3 building 501B Patentee after: SHENZHEN TINNO WIRELESS TECHNOLOGY Co.,Ltd. Address before: 400065 Chongqing Nan'an District huangjuezhen pass Chongwen Road No. 2 Patentee before: Chongqing University of Posts and Telecommunications |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20190716 Address after: 518000 Guangdong city of Shenzhen province Qianhai Shenzhen Hong Kong cooperation zone before Bay Road No. 1 building 201 room A (located in Shenzhen Qianhai business secretary Co. Ltd.) Patentee after: WEISHIBO INFORMATION SERVICE (SHENZHEN) CO.,LTD. Address before: 518053 Guangdong city of Shenzhen province Nanshan District overseas Chinese town in Eastern Industrial Zone H3 building 501B Patentee before: SHENZHEN TINNO WIRELESS TECHNOLOGY Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 518000 Guangdong city of Shenzhen province Qianhai Shenzhen Hong Kong cooperation zone before Bay Road No. 1 building 201 room A (located in Shenzhen Qianhai business secretary Co. Ltd.) Patentee after: Smart information service (Shenzhen) Co.,Ltd. Address before: 518000 Guangdong city of Shenzhen province Qianhai Shenzhen Hong Kong cooperation zone before Bay Road No. 1 building 201 room A (located in Shenzhen Qianhai business secretary Co. Ltd.) Patentee before: Lingzhi (Shenzhen) Information Service Co.,Ltd. Address after: 518000 Guangdong city of Shenzhen province Qianhai Shenzhen Hong Kong cooperation zone before Bay Road No. 1 building 201 room A (located in Shenzhen Qianhai business secretary Co. Ltd.) Patentee after: Lingzhi (Shenzhen) Information Service Co.,Ltd. Address before: 518000 Guangdong city of Shenzhen province Qianhai Shenzhen Hong Kong cooperation zone before Bay Road No. 1 building 201 room A (located in Shenzhen Qianhai business secretary Co. Ltd.) Patentee before: WEISHIBO INFORMATION SERVICE (SHENZHEN) Co.,Ltd. |
|
| CP01 | Change in the name or title of a patent holder | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201225 Address after: Room 206, xifuhe digital intelligent innovation community Exhibition Center building, 49 Wengang South Road, Yannan high tech Zone, Yancheng City, Jiangsu Province Patentee after: Yancheng Yannan high tech Zone xifuhe digital intelligent industry development Co.,Ltd. Address before: 518000 Room 201, building A, No. 1, Qian Wan Road, Qianhai Shenzhen Hong Kong cooperation zone, Shenzhen, Guangdong (Shenzhen Qianhai business secretary Co., Ltd.) Patentee before: Smart information service (Shenzhen) Co.,Ltd. |
|
| TR01 | Transfer of patent right |