CN101895954B - Opportunistic network routing method based on incremental transmission of packet index - Google Patents
Opportunistic network routing method based on incremental transmission of packet index Download PDFInfo
- Publication number
- CN101895954B CN101895954B CN2010102606253A CN201010260625A CN101895954B CN 101895954 B CN101895954 B CN 101895954B CN 2010102606253 A CN2010102606253 A CN 2010102606253A CN 201010260625 A CN201010260625 A CN 201010260625A CN 101895954 B CN101895954 B CN 101895954B
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- message
- index information
- sent
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to an opportunistic network routing method based on incremental transmission of a packet index. The method comprises the following seven steps of a node non-meeting stage and a node meeting stage, wherein the node non-meeting stage comprises a step of: periodically broadcasting Hello messages; and the node meeting stage comprises the following six steps of: sensing node meeting; sending data packets of target nodes to opposite nodes; sending SV messages; sending request messages; sending and processing the data packets; and broadcasting the Hello messages as required. Through the method, only increment information of the packet index is sent in the process of sending index information of the data packets during node meeting, so that resource loss is reduced; the method can reduce delay from one end to another end of the data packets, and can reduce loss risk of the packets; the method does not need special control packets to realize distribution of data packet information which reaches the target nodes, and avoids redundant cost of globally broadcasting and periodically sending the control packets; and meanwhile, the method reduces storage cost by deleting the data packets reaching the target nodes.
Description
Technical field
The invention belongs to the field of using the opportunistic network technology, particularly adopted based on infecting (epidemic) machine-processed route technology and being the opportunistic network that each node has distributed independent identification in the network.
Background technology
Opportunistic network be the chance of meeting that a kind ofly do not need there is fullpath between source node and the destination node, utilize node motion to bring realize communication, time delay and the tolerable self-organizing network of fracture; It can be accomplished data and transmit task under the situation that Radio Link breaks off and network divides; It is a kind of concrete network construction form; It also is a kind of network service new technology; Be regarded as the important directions that moves Ad Hoc network development, to the realization of following Ubiquitous Network (Ubiquitous Networks) with develop significant.
Route technology is a challenging important component part in the opportunistic network architectural framework.Up to the present, it is the method for routing of background condition with the opportunistic network that people have proposed multiple, these methods can be divided into based on redundant, mix and based on four types of active movements based on effectiveness, redundant effectiveness.As a sub-category, caused extensive concern in recent years and obtained more and more deep research and application based on the method for routing of infection mechanism based on the method for routing of redundancy.The main thought of infection mechanism is that the chance hop-by-hop ground that utilizes node to meet at the volley transmits packet, and its basic step is following:
(1) when node A and Node B in the network are met (communication range that " meeting " refers to get into each other the other side); A uses SV (Summary Vector) message (" message " refers to control grouping or the packet that the information unit as independent completion transmits in opportunistic network, SV message is used for the index information that loading data divides into groups) to send the index information (" index information of grouping " refer to can a grouping of unique expression significant information) of the packet that oneself has to B;
(2) B receive after the SV message will be wherein the packet index information compare with the index information of own institute deposit data grouping, determine the index information of the packet that oneself does not have as yet;
(3) index information of the packet that will not have as yet of the B Request message of packing into, and this message sent to A, send the packet that oneself does not have to the A request;
(4) after A receives the Request message that B sends, find oneself to have and packet that B does not have, send to B then according to the packet index information in this message.
Use the opportunistic network node of infection mechanism to need to adopt the mode process data packets of " storing-carry-transmit ", when not meeting with other node, can deletes data packet, move together but carrying them.
The basic thought of infection mechanism proposes (participation document: A. Demers, D. Greene, C. Hauser by people such as Demers at first; W. Irish; J. Larson, S. Shenker, H. Sturgis; D. Swinehart; D. Terry. Epidemic Algorithms for Replicated Database Maintenance [C]. Proceedings of the Sixth Symposium on Principles of Distributed Computing 1987:1-12), is used for the administering and maintaining of database information of the different nodes of network.Thereafter; Vahdat and Becker have improved original infection mechanism and have made it to be fit to the opportunistic network topology and be interrupted connection characteristics; Proposed based on this infection route (Epidemic Routing) agreement (referring to document: A. Vahdat, D. Becker. Epidemic Routing for partially connected ad hoc networks [R]. Technical Report CS-200006, Duke University; Durham; 2000), infect Routing Protocol and adopt the mode of " storing-carry-transmit " to handle grouping, with IMEP (Internet MANET Encapsulation Protocol) agreement (referring to document: M. S. Corson; S. Papademetriou; P. Papadopoulos, V. Park, A. Qayyum. An Internet MANET EncapsulationProtocol (IMEP) pecific-
Ation [R]. (draft-ietf-manet-imep-spec-01.txt; 1999) as meeting node perceived mechanism; Transmission through packet index information when node meets and and the forwarding of packet realize the hop-by-hop transmission of data in network; Can not need the help of priori topology information and in opportunistic network, transmit data reliably, and the end-to-end time delay that divides into groups is less.Be the basis to infect Routing Protocol; People such as Ramanathan have proposed infection (Prioritized Epidemic) Routing Protocol of prioritization (referring to document: R. Ramanathan; R. Hansen, P. Basu, R. Rosales-Hain; R. Krishnan. Prioritized Epidemic Routing for Opportunistic Networks [C]. Proceedings of the 1st ACM International MobiSys Workshop on Mobile opportunistic Networking; San Juan, 2007:62-66), the path cost that utilization calculates is to the data-message prioritization of node storage; And data message is taked different deletions and transmit strategy according to priority, reduce offered load through abandoning useless relatively message.Matsuda and Takine have designed (p; Q) infect ((p, q)-Epidemic) Routing Protocol is (referring to document: T. Matsuda, T. Takine. (p; Q)-and Epidemic Routing for Sparsely Populated Mobile Ad Hoc Networks [J]. IEEE Journal on Selected Areas in Communications; Vol. 26, No. 5,2008:783-793); Comprehensively use 2-Hop to transmit and traditional infection routing algorithm according to network state; And adopt by the mechanism of a kind of being called as " VACCINE " (referring to document: Z. Haas, T. Small. A New Networking Model for Biological Applications of Ad Hoc Sensor Networks [J]. IEEE/ACM Trans. Networking, 2006; 14 (1): 27-40) divide into groups to eliminate the grouping that has arrived destination node in the nodal cache, reduce the storage overhead through broadcasting control.People such as Wang Xin have proposed the infection Routing Protocol of ARER (Adaptive Randomized Epidemic Routing)-a kind of self-adapting randomization (referring to document: Wang Xin; Shu Yan-Tai; Jin Zhi-Gang; Pan Qing-Fen; Lee Bu-Sung. Adaptive Randomized Epidemic Routing for Disruption Tolerant Networks [C]. Proceedings of the 5th International Conference on Mobile Ad-hoc and Sensor Networks, 2009:424-429), this agreement is used expression formula
W Ij =
C 1 R i (
T s )+C
2 p Ij + C
3 TTL Ij Calculated data divides into groups
iExperienced
jWeights after jump set is passed
W Ij (wherein,
R i (
T s ) for duplicating density,
p Ij Be the forwarding probability,
TTL Ij Time parameter for survival,
C 1 ,C
2, C
3Be preset constant), and according to weights
W Ij Transmit with delete procedure in to the data packet sequencing improving performance such as time delay, the information of in Hello message, carrying the grouping that the arrives destination node simultaneously node that supplies to meet is cleared up buffer memory, but the periodic Hello message that extends can be brought additional overhead.Li Feng and Wu Jie add traditional infection Routing Protocol (referring to document: Li Feng with corporations structure detecting functions; Wu Jie. LocalCom:A Community-based Epidemic Forwarding Scheme in Disruption-tolerant Networks [C]. Proceedings of the 6th Annual IEEE Communications Society Conference on sensor; Mesh and Ad Hoc Communications and Networks; 2009:1-9); Thereby detect corporations' structure and the raising packet forward efficiency that is used with local information, yet the difference of corporations' structure can impact to routing performance.
From above-mentioned literature content and present Research; After infecting the Routing Protocol proposition; The research that people improve and expand it is being carried out always; The forwarding of packet and management, with other pass-through mode combine and the aspects such as expansion of network application scene have obtained certain progress; But divide into groups to send in the node perceived of meeting, control, still there are redundancy overhead in links such as packet forwarding and nodal cache management, and up to the present this problem effectively do not solved yet, and it has material impact to the performance of the method for routing that adopts infection mechanism; Therefore the improved needs of further research are arranged, and the present invention will propose the solution of a novelty to this problem.
Conclusion is got up, and there is following problem in existing opportunistic network routing method based on infection mechanism:
(1) when two nodes meet, their adopt IMEP agreement to realize meeting the node perceived function, and mechanism such as used control messages such as Hello, Echo and shake hands for twice is brought certain redundancy overhead;
When (2) nodes sent SV message to the node that meets, the index information that nodal cache divides into groups was not packed in the SV message with making any distinction between, wherein possibly comprise the information of having told the other side, and the information that therefore causes repeats transmitting-receiving and can bring redundancy overhead;
When (3) node met, the operating sequence of infection mechanism was the packet of sending SV message-transmission Request message-transmission the other side request, because the transmission of packet is arranged at last link, may bring certain extra time-delay; In addition, the node limited duration that in motion process, meets also can cause the potential risk of lost data packet;
(4) when issue has arrived the information of destination node grouping; What the existing route method adopted is that the special control grouping of broadcasting perhaps uses existing periodicity to control (like Hello message) the incidentally method of information of dividing into groups, and has caused certain control expense redundant.
To above-mentioned 4 problems; Preferentially in the operation after increment, the node that present patent application proposes only to send after node meets packet index information meets send packet, use Request message to carry as required to have arrived information that destination node divides into groups and with the hello message 4 kinds of new mechanisms such as node perceived of meeting; The control expense of minimizing aspect node and radio channel resource; Shorten the end-to-end transfer delay of packet, reduce the storage overhead of node.
Summary of the invention
The objective of the invention is to propose a kind of opportunistic network routing method that transmits based on the packet index increment; In this method for routing, adopt the packet index increment to transmit, packet is preferentially sent, in Request message, carry as required and arrived information that destination node divides into groups and with the hello message 4 kinds of new mechanisms such as node perceived of meeting; Solve the problem that has redundancy overhead in the existing information transfer process of method for routing after meet node perceived and node meet based on infection mechanism; Reduce the grouping end-to-end time delay; And the packet buffer memory of cleaning node, reduce the node storage overhead.
For realizing that the technical scheme that above-mentioned purpose adopts is such; It is a kind of opportunistic network routing method that transmits based on the packet index increment; Comprise that node does not meet and node seven steps in two stages of meeting, wherein: the node stage of not meeting comprises a step: the broadcasting of Hello message cycle property; The node stage of meeting comprises six steps: node meets perception, destination node for the packet of the other side's node is sent, SV message is sent, Request message is sent, packet transmission and processing and Hello message on-demand broadcasting; Seven steps are following:
1), the broadcasting of said Hello message cycle property is specially:
The network layer of a, node produces 1 Hello message, and with the network address of the own network layer Hello message of packing into;
B, according to the broadcast cycle of setting, node repeated broadcast in the scope that 1 jumps is equipped with the Hello message of the network address of own network layer;
2), the perception of meeting of said node comprises one of following situation:
If a, a node are received the Hello message of another node broadcasts, confirm that then it and this node meet;
If b, a node receive that the destination node that another node is sent is the packet of oneself, confirm that then it and this node meet; In this case, the MAC layer of receiving node is striden the shared network layer of giving oneself of layer with the MAC Address of sending node; The network layer of receiving node then searches out the network address and the storage of sending node according to MAC Address-network address corresponding relation;
If c, node are received another node and issue the SV of oneself (Summary Vector) message that then it confirms to meet with this node;
3), said destination node is sent for the packet of the other side's node and is specially:
After a, a node confirmed to run into another node, it searches for destination node immediately in grouping cache be the other side's packet;
B, node finish for the other side's packet one by one sends to the other side the destination node that searches up to transmission, get into next step then; If do not search the packet of destination node, then directly get into next step for the other side;
4), said SV message is sent and is specially:
A, node run into another node and accomplish destination node for behind the other side's the packet forwarding step, and its is according to the tick lables in oneself packet buffer memory, and whether judgement has deposited new packet in after last time and this node meet;
If b has deposited new packet in, node then produces a SV message and with the index information of the said packet that newly deposits in the SV message of packing into, sends to the other side's node in network layer; Simultaneously, note the position of the up-to-date packet that deposits in, as the sign of judging next time; (secondary indication can be come with the index information of this packet in the position of packet, and direct representation is come in the address of the spatial cache that also can take with this grouping.）
If c does not deposit new packet in, then do not send SV message;
5), the concrete steps of said Request transmission are:
After a, a node are received SV message,, search out that the other side's node has and the index information that has arrived the packet of destination node or/and the other side's node has that oneself does not have through the comparison of index information that data are divided into groups;
B, node produce a Request message in network layer, and the index information of the above-mentioned packet that will the search out Request message of packing into, send to the other side's node; If do not search the index information of above-mentioned packet, then do not produce and send Request message;
6), said packet transmission and processing are specially:
After a, a node are received Request message,, the other side is issued in the packet of the other side's request according to packet index information wherein; If the other side's node does not ask to send packet, then do not send any packet;
B, node are according to the index information of the packet that provides in the Request message; The packet that arrives destination node is deleted from grouping cache; But the index information that keeps this packet of being deleted, whether the node that runs into after being used to judge has the packet that has arrived destination node;
7), said Hello message on-demand broadcasting is specially:
A, a node are through step 2) perceive with another node and meet; And carry out above-mentioned steps 3 successively), 4), 5), 6) afterwards, it will be judged: whether sent packet, SV message or the Request message of destination node for the other side;
If the b node is in execution of step 2) to 6) do not send any packet or control messages (comprising SV message and Request message) afterwards to the other side's node; It is Hello message that the own network address is housed of broadcasting in the scope that 1 jumps then, to the appearance of the other side's node report oneself.
The present invention is during node meets in the meet essence of stages operating of node, carries out the transmission of SV message, Request message and packet.In the process of transmitting of SV message and packet, have following 3 characteristics:
(1) SV message is only carried the increment of packet index information, promptly only carries out increment and sends;
(2) destination node at first sends to the other side's node for the packet of the other side's node after node meets;
(3) contain the index information that arrives destination node but still be stored in the packet in the other side's nodal cache district in the Request message that node sends.
The main innovation part of the opportunistic network routing method that transmits based on the packet index increment that the present invention proposes has been to design that the packet index increment transmits, packet is preferentially sent, in Request message, carry as required and arrived information that destination node divides into groups and with the Hello message 4 kinds of new mechanisms such as node perceived of meeting, the principle of these new mechanisms with operate specific as follows:
(1) the packet index increment transmits
Adopt in each SV message that the opportunistic network node of infection mechanism receives, have only and poor from the content of the SV of same node message of receiving last time, promptly the increment of packet index is only Useful Information in fact.Around this principle, in the present invention, a node is noted the position of the packet of current up-to-date storage when another node sends SV message; If run into same node next time, then in new SV message, only load the index information that after sending SV message last time, newly deposits grouping in; Like this; Just can only transmit the increment of packet index; Thereby the length that shortens SV message and quantity (when the packet that newly do not deposit in, just not sending SV message), and reduce the amount of calculation that the other side's node compares computing, the expense of reduction wireless channel and node resource;
(2) packet is preferentially sent
Because the motion of node, the duration that node meets in the opportunistic network is limited, and this has brought potential negative effect for the completion of packet process of transmitting.In order in limited Encounter Time, to transmit packet as much as possible; The mechanism of " packet is preferentially sent " has been proposed here; That is: when a node and other node meet; Can immediately destination node be issued the other side for the packet of the other side's node, just send SV message then, carry out the follow-up transport process.Can utilize limited node Encounter Time Data transmission to divide into groups so as much as possible, can reduce the end-to-end propagation delay time of dividing into groups, help to reduce the risk that packet can't be sent because of the node Encounter Time inadequately again, improve and divide into groups to transmit success rate;
(3) in Request message, carry the index information that has arrived the destination node grouping as required
From the packet buffer memory, deleting the grouping that has arrived destination node is node administration buffer memory and the important channel that reduces the storage overhead, but must confirm earlier when deletes data packet whether it has arrived destination node.Reached the message context that destination node is divided into groups in issue at present, existing broadcasting and Hello message incidentally wait method, but of overall importance and periodicity Hello message of broadcasting can make the control expense increase.
In order to reduce the control expense that issue has arrived destination node packet information generating; In the present invention; Having proposed a kind of Request of use message carries the mechanism that has arrived destination node packet index information as required and issues the packet information that arrives destination node; Thereby do not need special control to divide into groups, avoided overall broadcasting and the problem of periodically sending yet.The concrete implementation of this mechanism is following: node receives that successfully destination node that the node that meets sends is for after the packet of oneself; To in Request message thereafter, the index information of these groupings be issued the other side; The other side receives behind the index information deletion, and these divide into groups, but whether the node that the index information that keeps them runs into after being used to judge has the packet that has arrived destination node; A node is received the SV message that another node sends, and can carry out the packet index information comparison, finds out the packet that arrives destination node; Still have the grouping that has arrived destination node if find the other side's node, it can inform the other side in Request message.Can delete the packet that has arrived destination node like this, save the memory space of node; Can reduce the meaningless transmission of control information again, reduce the control expense;
(4) with the Hello message node perceived of meeting
Existing method for routing based on infection mechanism uses the meet node perceived mechanism of IMEP agreement as acquiescence, and this agreement has been used control messages such as Hello, Echo and operation such as shake hands for twice, has certain redundancy overhead.We are through discovering: in fact, Echo message is not essential in node meets perception, and node is received other grouping that another node sends, and divides into groups like data, can perceive the meet generation of incident of node equally.Based on such principle, we do not re-use the IMEP agreement in the present invention, but only with the periodic hello message node perceived of meeting, concrete perception is following: during the network operation, node is periodically in spot broadcasting Hello message, and the cycle of establishing does
T Hello If a node is received the Hello message of another node broadcasts, run into the other side just it is judged, so log-on data is divided into groups and the process of transmitting of SV message; If node received the destination node that another node is sent and has been own packet or SV message, also can judge and run into the other side, thus the process of transmitting of log-on data grouping and SV message.Do not have packet if node is received Hello message and SV message will be issued the other side's node, then broadcast of the appearance of a Hello message to the other side's node report oneself.
In the concrete process of using of the present invention, can be according to 2 stages mentioned above, 7 determined rules of step and method, the opportunistic network routing method that transmits based on the packet index increment that the software programming through the combined with hardware condition realizes that the present invention proposes.
The present invention has following beneficial effect:
1. in the packet index information process of transmitting during node meets, only send the increment information of packet index, reduced the amount of information of sending, thereby reduced the consumption of wireless signal-path band width and node resource;
2. a node at first sends the packet of destination node for the other side after running into other node, can reduce the end-to-end time delay of packet, can reduce again because the limited risk of packet loss of bringing of Encounter Time helps to improve the transmission success rate;
3. use Request message to carry the index information that arrives the destination node packet as required; Do not need special control grouping just can realize having reached the issue of destination node packet information, avoided overall broadcasting and the redundancy overhead of periodically sending the control grouping yet; Simultaneously,, reduced the quantity of packet in the grouping cache, reduced storage overhead through deleting the packet that has arrived destination node;
4. with the hello message node perceived of meeting, do not re-use Echo message, under the prerequisite of node perceived function and effect is met in guarantee, reduced kind and quantity that control is divided into groups, reduced the control expense.
Description of drawings
Fig. 1 is the infection mechanism sketch map.
After node A and Node B were met, the SV message that it will include the packet index information earlier sent to B; B receives after the SV message index information that needing to obtain the packet that A transmits through comparison calculation: Request=SV
A+ SV
BThen these index informations Request message of packing into is sent to A; A sends to B with the corresponding packet of index information wherein after receiving Request message.
Fig. 2 is the step sketch map based on the opportunistic network routing method of packet index increment transmission.
The opportunistic network routing method that transmits based on the packet index increment is made up of node 7 operating procedures of meeting in two stages that alternately occur with node of not meeting, and these 7 steps are: 1. Hello message cycle property broadcasting; 2. the node perception of meeting; 3. destination node is that the meet packet of node is sent; 4. SV message is sent; 5. Request message is sent and is handled; 6. packet is sent; 7. Hello message on-demand broadcasting.
The meet flow chart of perception of the node that Fig. 3 designs for the present invention.
In the present invention, the Hello message that node can be through receiving broadcasting, receive that destination node is the packet of oneself and receive that the SV message of issuing oneself comes perception and confirm to meet with other node.
Fig. 4 is information processing of packet index delta and transmission flow figure.
Information processing of packet index delta and transmit operation comprise that mainly judgement has or not the steps such as position that newly deposit packet, the new packet index information of transmission in and in the packet buffer memory, note up-to-date grouping.
Fig. 5 is Request message transmission flow figure.
After node is compared packet index information that loads in the SV message and the own packet index information of storing, can obtain to need the other side to send and the index information of the packet of deleting; Then, node is respectively charged into the Request information and sending with these information and gives the other side; If there is not information, then do not send Request message.
Fig. 6 is a Hello message on-demand broadcasting operational flowchart.
The purpose of Hello message on-demand broadcasting is in order in time to inform the appearance of the other side's node oneself.When the Hello message of receiving the other side's node broadcasts; But oneself not having destination node again is that the other side's packet or SV message is will send to the other side the time; Just broadcast a Hello message, let the appearance of the other side's node perceived oneself, for the condition that provides is sent in the packet that the other side's node is follow-up.
Embodiment
The present invention is applicable to the opportunistic network field of employing based on the route technology of infection mechanism.The mode of a practical implementation is: in the node number was not less than 3 the opportunistic network of use based on the route technology of infection mechanism, node was in intermittently or long-term motion state, had data to need to transmit between them.In the process that data transmit; The opportunistic network routing method based on the transmission of packet index increment that can use the present invention to propose; Packet index increment through the present invention design transmits, packet is preferentially sent, carry as required with Request message and reached information that destination node divides into groups and with the Hello message mechanism such as node perceived of meeting, when realizing that success rate of data packet transmission transmits, expense is controlled in minimizing; Reduce the packet end-to-end time delay, reduce the storage overhead of node simultaneously.The broadcast cycle of Hello message in the present invention
T Hello Value can be provided with according to concrete network condition, according to the content of existing international standard manuscript RFC3561 (Ad hoc On-Demand Distance Vector (AODV) Routing),
T Hello Default value can be set to 1 second.
Claims (1)
1. opportunistic network routing method that transmits based on the packet index increment is characterized in that: comprise that node does not meet and node seven steps in two stages of meeting, wherein: the node stage of not meeting comprises a step: the broadcasting of Hello message cycle property; The node stage of meeting comprises six steps: node meets perception, destination node for the packet of the other side's node is sent, SV message is sent, Request message is sent, packet transmission and processing and Hello message on-demand broadcasting; Seven steps are following:
1), the broadcasting of said Hello message cycle property is specially:
The network layer of a, node produces 1 Hello message, and with the network address of the own network layer Hello message of packing into;
B, according to the broadcast cycle of setting, node repeated broadcast in the scope that 1 jumps is equipped with the Hello message of the network address of own network layer;
2), the perception of meeting of said node comprises one of following situation:
If a, a node are received the Hello message of another node broadcasts, confirm that then it and this node meet;
If b, a node receive that the destination node that another node is sent is the packet of oneself, confirm that then it and this node meet; In this case, the MAC layer of receiving node is striden the shared network layer of giving oneself of layer with the MAC Address of sending node; The network layer of receiving node then searches out the network address and the storage of sending node according to MAC Address-network address corresponding relation;
If c, node are received another node and issue the SV of oneself (Summary Vector) message that then it confirms to meet with this node;
3), said destination node is sent for the packet of the other side's node and is specially:
After a, a node confirmed to run into another node, it searches for destination node immediately in grouping cache be the other side's packet;
B, node finish for the other side's packet one by one sends to the other side the destination node that searches up to transmission, get into next step then; If do not search the packet of destination node, then directly get into next step for the other side;
4), said SV message is sent and is specially:
A, node run into another node and accomplish destination node for behind the other side's the packet forwarding step, and its is according to the tick lables in oneself packet buffer memory, and whether judgement has deposited new packet in after last time and this node meet;
If b has deposited new packet in, node then produces a SV message and with the index information of the said packet that newly deposits in the SV message of packing into, sends to the other side's node in network layer; Simultaneously, note the position of the up-to-date packet that deposits in, as the sign of judging next time;
If c does not deposit new packet in, then do not send SV message;
5), the concrete steps of said Request transmission are:
After a, a node are received SV message,, search out that the other side's node has and the index information that has arrived the packet of destination node or/and the other side's node has that oneself does not have through the comparison of index information that data are divided into groups;
B, node produce a Request message in network layer, and the index information of the above-mentioned packet that will the search out Request message of packing into, send to the other side's node; If do not search the index information of above-mentioned packet, then do not produce and send Request message;
6), said packet transmission and processing are specially:
After a, a node are received Request message,, the other side is issued in the packet of the other side's request according to packet index information wherein; If the other side's node does not ask to send packet, then do not send any packet;
B, node are according to the index information of the packet that provides in the Request message; The packet that arrives destination node is deleted from grouping cache; But the index information that keeps this packet of being deleted, whether the node that runs into after being used to judge has the packet that has arrived destination node;
7), said Hello message on-demand broadcasting is specially:
A, a node are through step 2) perceive with another node and meet; And carry out above-mentioned steps 3 successively), 4), 5), 6) afterwards, it will be judged: whether sent packet, SV message or the Request message of destination node for the other side;
If the b node is in execution of step 2) to 6) control messages of not sending any packet afterwards or comprising SV message and Request message is to the other side's node; It is Hello message that the own network address is housed of broadcasting in the scope that 1 jumps then, to the appearance of the other side's node report oneself.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102606253A CN101895954B (en) | 2010-08-24 | 2010-08-24 | Opportunistic network routing method based on incremental transmission of packet index |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102606253A CN101895954B (en) | 2010-08-24 | 2010-08-24 | Opportunistic network routing method based on incremental transmission of packet index |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101895954A CN101895954A (en) | 2010-11-24 |
| CN101895954B true CN101895954B (en) | 2012-04-18 |
Family
ID=43104975
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102606253A Expired - Fee Related CN101895954B (en) | 2010-08-24 | 2010-08-24 | Opportunistic network routing method based on incremental transmission of packet index |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101895954B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102065472B (en) * | 2010-12-09 | 2013-02-06 | 重庆邮电大学 | Cross-layer design-based method for determining wireless network coding participation packet |
| CN102056233B (en) * | 2010-12-28 | 2013-05-08 | 重庆邮电大学 | Queue management scheduling method of opportunity network based on message importance degree |
| CN102438276B (en) * | 2011-12-31 | 2014-04-16 | 重庆邮电大学 | High-performance routing method for opportunistic network based on adaptive summery vector (SV) compression |
| CN102711208B (en) * | 2012-05-31 | 2014-12-03 | 重庆邮电大学 | Method for storing and transmitting opportunistic network low-expense immunologic information based on summary vector |
| CN103560966B (en) * | 2013-11-13 | 2016-08-31 | 重庆邮电大学 | Opportunistic network mixed logic dynamic method based on network code and duplication |
| CN104661275B (en) * | 2014-12-11 | 2018-01-30 | 北京邮电大学 | Data transmission method in a kind of opportunistic network |
| CN107371211B (en) * | 2017-08-07 | 2020-10-02 | 重庆邮电大学 | Opportunistic network routing method with low overhead and high transaction success rate |
| CN111585893A (en) * | 2020-04-30 | 2020-08-25 | 长安大学 | Routing performance analysis method based on opportunity network in Internet of vehicles environment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101695179A (en) * | 2009-10-16 | 2010-04-14 | 天津大学 | Method for forwarding messages on DTN or ICN network in way of self-adoption changeable probability |
| CN101784067A (en) * | 2010-01-14 | 2010-07-21 | 重庆邮电大学 | Method for quickly sensing meeting nodes based on cross-layer triggering in opportunistic network |
-
2010
- 2010-08-24 CN CN2010102606253A patent/CN101895954B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101695179A (en) * | 2009-10-16 | 2010-04-14 | 天津大学 | Method for forwarding messages on DTN or ICN network in way of self-adoption changeable probability |
| CN101784067A (en) * | 2010-01-14 | 2010-07-21 | 重庆邮电大学 | Method for quickly sensing meeting nodes based on cross-layer triggering in opportunistic network |
Non-Patent Citations (1)
| Title |
|---|
| 任智 等.机会网络路由协议.《计算机应用》.2010,第30卷(第3期),723-728. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101895954A (en) | 2010-11-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101895954B (en) | Opportunistic network routing method based on incremental transmission of packet index | |
| Khabbazian et al. | Local broadcast algorithms in wireless ad hoc networks: Reducing the number of transmissions | |
| CN102223683B (en) | Data transmission method, node and system in wireless sensor network | |
| Raffelsberger et al. | A hybrid MANET-DTN routing scheme for emergency response scenarios | |
| Petroccia | A distributed ID assignment and topology discovery protocol for underwater acoustic networks | |
| CN101242431A (en) | Layer-cross mobile Ad Hoc network service discovery method | |
| CN101431810A (en) | Cross-layer cooperated routing method supporting multi-speed transmission in Ad Hoc network | |
| CN105828404A (en) | Clustering routing method based on channel access heterogeneous wireless sensor network | |
| CN103560966A (en) | Opportunistic network route mixing method based on network coding and copying | |
| CN105072586A (en) | Management method for forwarding of broadcast message in embedded wireless ad hoc network | |
| Nowsheen et al. | An adaptive approach to opportunistic data forwarding in underwater acoustic sensor networks | |
| Ma | Coupling degree seeking based routing strategy for delay tolerant networks | |
| Venkatesh et al. | Geographic opportunistic routing protocol based on two-hop information for wireless sensor networks | |
| Chinara et al. | Topology control by transmission range adjustment protocol for clustered mobile ad hoc networks | |
| CN102438276B (en) | High-performance routing method for opportunistic network based on adaptive summery vector (SV) compression | |
| CN103595657B (en) | Layer-stepping network route method based on distributed context aware | |
| Abolhasan et al. | A routing strategy for heterogeneous mobile ad hoc networks | |
| CN102711208B (en) | Method for storing and transmitting opportunistic network low-expense immunologic information based on summary vector | |
| Yasmin et al. | A multi-attribute routing protocol for opportunistic network environments | |
| Yim et al. | Distributed forwarder selection for beaconless real-time routing in wireless sensor networks | |
| Karimzadeh | Efficient routing protocol in delay tolerant networks (DTNs) | |
| CN102573001B (en) | Routing protocol applicable to central type underwater acoustic multi-hop network | |
| Lu et al. | An adaptive and distributed collision-free mac protocol for wireless personal area networks | |
| Yadav et al. | Improved ant colony optimization technique for mobile adhoc networks | |
| Ahmed et al. | Hdar: Highly distributed adaptive service replication for manets |
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 |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120418 Termination date: 20190824 |