CN1694429A - Method for implementing support to paralel transmission of compression packet in IPv6 sensor network - Google Patents
Method for implementing support to paralel transmission of compression packet in IPv6 sensor network Download PDFInfo
- Publication number
- CN1694429A CN1694429A CNA2005100117478A CN200510011747A CN1694429A CN 1694429 A CN1694429 A CN 1694429A CN A2005100117478 A CNA2005100117478 A CN A2005100117478A CN 200510011747 A CN200510011747 A CN 200510011747A CN 1694429 A CN1694429 A CN 1694429A
- Authority
- CN
- China
- Prior art keywords
- territory
- address
- route
- route distinguisher
- node
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
This invention relates to a method for realizing the support of compression packets parallel transmission on IPV 6 sensor network, which solves the problem of prallel transmission of multiple data streams between any two sensor network nodes under the mode of transmitting IPV 6 data packet compressed by the packet head via net-link routes using wireless sensor network. This invention introduces a route ID symbol domain to the frame form of an applied layer, an eight bit sequence number, one is suitable for multi-hop compression transmission route algorithm based on the network topology.
Description
Affiliated technical field
The present invention relates to support in a kind of IPv6 sensor network the implementation method of compressed package parallel transmission, belong to technical field of the computer network.
Background technology
Wireless sensor network is made up of a large amount of low-power consumption, low rate, low cost, highdensity miniature node, and node is formed network by the mode of self, oneself's healing.Utilize wireless sensor network can realize that the collection of data quantizes, handles and merge and the transmission application, wireless sensor network can be deployed in family, hospital, military affairs, environmental monitoring and industrial control field, utilize various transducer to remove to measure signals such as temperature, humidity, noise, pressure, thereby improve existing quality of life of people and production efficiency.
In November, 2004, IETF formally set up 6LOWPAN working group, set about formulating wireless sensor network standards based on IPv6, the work of this working group mainly around how IPv6 and IEEE 802.15.4 being launched, is studied the key issue based on the Wireless Personal Network of IPv6.Because the largest frames of the physical layer of IEEE 802.15.4 standard criterion is 127 bytes, and IPv6 standard packet header is 40 bytes,, should compress its packet header for transmission IPv6 packet on IEEE 802.15.4.Simultaneously, in order to guarantee that the routing algorithm of compressed package is particularly important through the packet arrival destination node as usual after the compression of packet header, it is the important support to the packet header compression algorithm.
The 6LOWPAN working group of IETF has issued draft-montenegro-lowpan-ipv6-over-802.15.4-02 in February, 2005, a kind of packet header compression scheme has been proposed, tentatively provide simultaneously the routing algorithm of supporting this compressed header packet, this algorithm uses netted route, is applicable to multi-hop compression transmission.But the parallel transmission of multiple data stream can only transmit a data flow between two nodes simultaneously between can not support node.This has brought considerable restraint for the extensive use of wireless sensor network undoubtedly.
The MTU of IPv6 datagram is 1280 bytes, but the largest frames of the physical layer of IEEE 802.15.4 standard criterion is 127 bytes, adds the load of frame and the expense of link layer encryption algorithm, only stays 81 bytes under the maximum cost situation and gives upper layer application.In order to transmit the IPv6 packet on IEEE 802.15.4 standard criterion, this draft is set up an adaptation layer between link layer and network layer.On this adaptation layer, encapsulate burst, refitting and realization route or the like.The MTU of this adaptation layer is greater than the minimum transmission units of IPv6, simultaneously with to leave the grouping size of upper layer application for compatible under the 802.15.4 standard criterion.
In order to set up this adaptation layer, need before each IP datagram, add an encapsulation packet header.If entire I P datagram can be an adaptation layer grouping the inside transmission, the frame format of this adaptation layer is referring to table 1.
| LF(2) | Data type (5) | ?M(1) | IPv6 packet (or packet header, final purpose address) |
Table 1 is the adaptation layer encapsulation package head format of burst not
The territory is defined as follows:
The LF:2 bit, this value of two is 0, expression does not have burst.
Data type: 5 bits, these 5 types that are used for representing back to back data.For example, hexadecimal 1 expression IPv6 bag, hexadecimal 2 expression compressed packages or the like.
The M:1 bit is used for representing whether there is territory, final purpose address, if put 1, territory, final purpose address will appear at before the IPv6 bag.
If data are greater than a frame, then adaptation layer carries out burst transmission, the frame format such as the table 2 of first burst.
| LF(2) | Keep (3) | Data type (7) | M(1) | Datagram label (8) | Datagram size (11) |
The encapsulation format of first burst of table 2
Second until the frame format such as the table 3 of last burst.
| LF(2) | Datagram skew (11) | Datagram label (8) | Datagram size (11) |
Table 3 second is until the encapsulation format of last burst
The definition in LF territory is with reference to table 4.
| ????00 | Burst not |
| ????01 | First burst |
| ????10 | Last burst |
| ????11 | Middle burst |
The definition in table 4 LF territory
The datagram size: 11 bits are used for the size of entire I P datagram is encoded.
Data type: 7 bits, only in first burst, occur, be used for INNA, detailed directions is undetermined.
Datagram skew: 11 bits, this territory only can occur in second and afterwards burst, are used for demarcating side-play amount.
The datagram label: 8 bits, in all bursts of same IP datagram, this value is constant.Transmit leg increases and increases along with the number that sends datagram, and returns 1 after being increased to 255.0 value is not used.
Stateless address disposes automatically: in order better to realize compression, used a kind of IPv6 link local address, generated a link local address according to 64 IEEE addresses, as table 5, and used same prefix FE80 ∷/64 in local network.
10 54 64
| 1111111010 | ?0000000000 | Interface identifier |
Table 5 link local address generation method
Simultaneously, the process that provides according to [I-D.ietf-ipv6-2461bis] realizes the mapping of an IEEE address, single-point transfer address to 64.
Packet header compression algorithm design: this algorithm principle is as follows, and the realization of compression comes from the transmission that reduces some constant amount.To those field informations that in packet header, remains unchanged always, only when beginning, send once, so just can greatly reduce the size in packet header.Rely on a group coding to identify the method that obtains these compressed informations, will not have information compressed to leave in the datagram again, just formed compressed package according to the agreement form.In the inside of not compressing, territory, 8 distance section restriction territory must be in each compressed package the inside transmission.
By one group 8 HC1 coding, which kind of method receiving node can be known by is obtained compressed information, and after having transmitted a complete IPv6 packet header, each packet header may be compressed to 2 bytes.If through certain manual setting, even may begin just directly to send compressed header packet from first packet header.
The HC1 coding is as follows:
PI: embed prefix
PC: condensed prefix (supposing common local prefix)
II: embed interface IP address
IC: omit interface IP address (obtain interface IP address from the corresponding link layer address, in netted route, can obtain this value) in the inside, territory, final purpose address
The HC1 coding is as follows: (from 0 to 7)
IPv6 source address (position 0 and 1):
00：PI，II
01：PI，IC
10：PC，II
11：PC，IC
IPv6 destination address (position 2 and 3):
00：PI，II
01：PI，IC
10：PC，II
11：PC，IC
Priority and stream label (position 4):
0: do not compress, transmit complete 8 priority and 20 s' stream label
1: priority and stream label all are 0
Next packet header (position 5 and 6):
00: do not compress, transmit complete 8
01：UDP
10：ICMP
11：TCP
HC2 coding (position 7):
0: the compressed encoding position, packet header that does not have other
1:HC1 coding back also has the HC2 coding to wait the compression form, and the HC2 coding is used for packet header such as compression-tcp, UDP, may realize further compressing in the future.
IPv6 compressed header packet frame format is as shown in table 6.
| HC1 encode (8) | Followed by the thresholding of not compressing |
The frame format of table 6 IPv6 compressed header packet
Routing Design: packet header compression can be saved transmission quantity really, but the packet header after the compression does not have source address, and how information such as destination address realize route, allows the packet behind the compressed header packet as usually be sent to destination node, is the key issue in the practical application.Draft proposes to use packet header, a kind of final purpose address to realize the method for netted route.
The frame format in packet header, final purpose address is referring to table 7.
| S(1) | Residue jumping figure (7) | Final purpose address (64) |
Packet header, table 7 final purpose address
Thresholding is defined as follows:
S:1 bit, this position are that 0 expression destination address uses the IEEE extended address.This position is that 1 expression destination address uses the short address, but does not support the short address at present.
The residue jumping figure: 7 bits, the every jumping through one subtracts 1, if this territory thresholding is 0, node abandons this bag.
Final purpose address: 64 bits, the link layer address of destination node.Version uses the IEEE extended address at present, may support 16 short addresses from now on.
It is the principle that generates with MAC Address that this method is utilized the local IPv6 of link address, when knowing destination node IPv6 address, also knows the MAC Address of this destination node.In routing table, seek the route of next jumping by the MAC Address of destination node, can save the memory space of routing table, also can omit the decompression of intermediate node compressed header packet.But draft does not illustrate the specific implementation details, and only the method for routing of netted topology is taked in explanation, and can only transmit a data flow simultaneously between two nodes.
The shortcoming of prior art scheme:
This draft has carried out research targetedly to use IPv6 on IEEE 802.15.4 standard criterion, realizes route by adding adaptation layer, can transmit the packet behind the compressed header packet smoothly.But it has the deficiency of a key, and two equipment is merely able to transmit a data flow in section at the same time, and being equivalent to can only serially-transmitted data stream.Because adopt packet header, final purpose address, draft has been realized route on adaptation layer, still, only rely on the MAC Address of destination node and, be not enough to distinguish a plurality of data flow from last one MAC Address of jumping that link layer obtains.As shown in Figure 1, device A will send one piece of data to equipment D by the C relaying, equipment B will be given D by C relaying one piece of data simultaneously, then equipment D can't distinguish this two data flow, because two segment datas of sending from C relaying stream all has only the packet header after the compression, the inside does not have source address, destination address and has only one group of HC1 coding and distance section restriction territory, and two segment datas stream all sends from the C node, and the transmit leg MAC Address in the link layer is identical.Because conventional Routing Protocol is serially-transmitted data stream between support node seldom, this brings very big problem can for the design of Routing Protocol.The serial transmission meeting reduces the efficient of whole wireless sensor network operation greatly, thereby has limited the extensive use of wireless sensor network.
Summary of the invention
In order to overcome the deficiency of existing technology, the invention provides the implementation method of supporting the compressed package parallel transmission in a kind of IPv6 sensor network, solved and used wireless sensor network to transmit under the pattern of the IPv6 packet that compresses through packet header the problem of parallel transmission multiple data stream between any two sensor network nodes by netted route.
The technical solution adopted for the present invention to solve the technical problems is:
The present invention's frame format to adaptation layer on ietf draft " in the transmission of carrying out the IPv6 packet on the IEEE 802.15.4 network " basis (draft-montenegro-lowpan-ipv6-over-802.15.4-02) is introduced Route Distinguisher (RID) territory, one 8 sequence number, have one to be applicable to the routing algorithm of multi-hop compression transmission based on mesh topology, its routing algorithm has the following steps;
Step 1, when certain node need send information to a given address, it at first obtains the route of leading to this address according to the Routing Protocol of this network;
Step 2 produces a Route Distinguisher (RID) in the corresponding list item of this route, this initial Route Distinguisher (RID) is exactly low eight of this node extended address (MAC Address);
Step 3 is carried out the judgement and the detection of Route Distinguisher (RID) conflict, with Route Distinguisher (RID) information of not conflicting after revising along with packets of information sends.
Step 4 after node is received packet, detects the value of ' M ' position in the adaptation layer;
Step 5, if the value of ' M ' position is 0, the destination address that this packet is described is a present node, node receives and handles this data.
Step 6 if the value of ' M ' position is 1, detects the thresholding of " residue jumping figure " in the packet header, final purpose address.
Step 7 if " residue jumping figure " is 0, abandons this packet.
Step 8 if " residue jumping figure " is not 0, obtains the route of leading to this address according to the Routing Protocol of this network;
Step 9 carry out step 3, and circulation is gone down.
Step 5 and step 7 are outlets of this algorithm.
The effect of invention: the present invention is based on IEEE 802.15.4 standard criterion, be applicable to the Wireless Personal Network of low rate, low-power consumption, at netted route (mesh routing), be applicable to multihop network, but do not have specifically to limit the kind of Routing Protocol, these designs have all spread out road for being applied to practice.Owing to do not determine Routing Protocol, need the prerequisite of this routing algorithm of statement: can not have two or more routes simultaneously between any two nodes.Because the finite energy of wireless sensor network node, memory capacity is limited, and this prerequisite is very reasonable in actual applications.The present invention adopts the IPv6 packet header compression algorithm that proposes among the draft draft-montenegro-lowpan-ipv6-over-802.15.4-02, by the transformation to the frame format of adaptation layer, creatively introduces the RID thresholding, proposes a kind of better routing algorithm.By the introducing of RID, in conjunction with routing algorithm of the present invention, can a plurality of data flow of parallel transmission between any two nodes, this is that the routing algorithm institute that proposes of former draft is irrealizable.
In cable network, use source address, destination address, source port, destination interface can distinguish each data flow well, but in the wireless sensor network of energy constraint, it is too big to do obvious expense like this.The purpose of introducing RID is to allow destination node distinguish to have the different data flow of compressed header packet, and node could be finished decompress(ion) smoothly according to the compressed information of HC1 coding acquisition different data streams like this.Increase the RID territory and only take a byte, can realize that but node asks the parallel transmission of multiple data stream, improved the efficient of wireless sensor network greatly, realize the data flow of a plurality of IPv6 of the having compressed header packets of parallel transmission between any two nodes.
The present invention has done on the generation method of RID preferably and to have selected, and under the known condition of the MAC of a node, low eight probability identical with it of the MAC of another node have only 1/256, and less than 0.4%, therefore, the expense of RID conflict processing is very little.
Description of drawings
The present invention is further described below in conjunction with drawings and Examples.
Fig. 1 example of the present invention
Fig. 2 node sends data flowchart
Fig. 3 node receives flow chart of data processing figure
The routing table process chart of Fig. 4 source node
The routing table process chart of Fig. 5 intermediate node
Embodiment
Embodiment:
The design of adaptation layer and realization
After the modification, the adaptation layer of burst encapsulation package head format is not as shown in table 8:
| LF(2) | Data type (5) | M(1) | RID(8) | IPv6 packet (or packet header, final purpose address) |
The adaptation layer of burst encapsulation package head format not after table 8 is revised
The territory is defined as follows:
RID:router identifier, Route Distinguisher.This is that the present invention independently creates.One 8 sequence number is used for distinguishing a plurality of data flow from same intermediate node.Each RID correspondence a routing iinformation.The different list item of destination address can have identical RID in the routing table.
After the modification, the encapsulation format table 9 of first burst.
| LF(2) | Keep (3) | Data type (7) | M(1) | RID(8) | Datagram label (8) | Datagram size (11) |
Table 9 is revised the encapsulation format of first burst of back
Second until the form of last burst is constant, referring to table 3.
The design of routing algorithm and realization
There is not source address in the compressed package, destination address, for compressed package is sent to destination node as usually, the present invention utilizes RID information, by adding territory, final purpose address (seeing Table 7), realizes route at adaptation layer.One of such benefit need not be carried out decompress(ion) to each compressed package exactly and be carried out Route Selection to extract its IPv6 destination address.Because the destination address in this territory is the MAC Address of destination node, therefore can node of unique identification.This programme is supported netted route, and concrete Routing Protocol can be decided according to user's request.
The routing algorithm general introduction
As shown in Figure 2, node need send data, at first obtains to lead to the route of destination address according to the Routing Protocol of this network using, and when can't find route, cancellation sends.
After finding the route that arrives destination node, check the whether neighbours of present node of destination node.If the words of neighbor node are then omitted packet header, final purpose address in packet, send data to neighbor node; Otherwise add packet header, final purpose address, data are sent to the next hop address of route.Detailed process is pressed the described flow processing of Fig. 2.
As shown in Figure 3, after node is received packet, at first inspection ' M ', if ' M ' position is 0, illustrates that then present node is the destination node of packet, receive and deal with data.If ' M ' position is 1, detect whether the residue jumping figure is 0.If the residue jumping figure is 0, abandon this packet; If non-0, node extracts destination address by detecting packet header, final purpose address, and seeks the node of next jumping in routing table according to destination address; The thresholding of jumping figure restriction is subtracted 1.If destination node is the neighbours of present node, then modification ' M ' position is 0, the packet header, final purpose address in the deleted data bag, and the thresholding that jumping figure is limited subtracts 1, and this packet is forwarded to next jumping; Otherwise the thresholding of jumping figure restriction subtracts 1, straight this packet is switched through be dealt into next jumping.Detailed process is pressed the described flow processing of Fig. 3.
The generation of RID and the processing that conflicts
With reference to the structure of routing table, each route correspondence " last one jumps a address " chained list, and a jumping address correspondence a RID chained list on each.
Certain node need send information to a given address, after finding this route of leading to assigned address, if it is 0 list item that there be not " last one jump address " in this route, (a last jumping address is that 0 explanation present node is the source node of data), then newly-built one of route " last jumps the address " is 0 chained list list item for this reason, simultaneously for should " last a jumping address " newly-built RID chained list.The initial inlet RID of this RID chained list is exactly low eight of this node M AC address.Carry out the RID collision detection then, the RID information of do not conflict after will revising (revising if desired) is recorded as outlet RID, and along with packets of information sends.
For routes different in the routing table, node does not detect the conflict of their outlet RID.That is to say that different routes can be used identical outlet RID fully.
Jump address link list for last one of same route in the routing table, node is responsible for detecting the conflict of outlet RID information between these different last jumping addresses.If the RID that the back produces appears among the outlet RID of this route " last one jumps the address ", then the RID of the route of back generation adds 1, till not producing conflict.The amended RID of node both had been stored in accordingly among the outlet RID of " last jumps the address ", also is stored in the RID territory of original packets of information, (former RID information is deleted), and along with packets of information sends, thereby make the node of next jumping not produce conflict.
Jump the same RID chained list of address link list list item correspondence for same last one of same route in the routing table, node does not detect the conflict of outlet RID because this moment the different different data flow of outlet RID sign.
The structure of routing table, maintenance
In the 802.15.4 wireless sensor network, each FFD equipment all has routing function, can be other equipment relay transmission data.For realizing this function, each equipment is all stored a routing table, form such as table 10.
Table 10 route tableau format
Article one, route has the chained list of " last jumps the address ", and can there be a plurality of list items the inside as required, and one jumps the chained list that the address all has " RID " on each, and also can there be a plurality of list items the inside as required.But a route is distributed 256 outlet RID values at most, for " RID " chained list use of all " last jumps the address ".Each list item has certain life span, so that discharge corresponding resource.
Destination address in this routing table, a last jumping address, next hop address all are to use 64 extended address (MAC Address) of IEEE.According to the address configuration scheme that draft uses, each MAC Address can both be mapped to a legal single-point transfer address.
Route as the source node generation:
As shown in Figure 4, source node need send packet, obtains the route of destination address according to Routing Protocol; If can't find route, the transmission of cancellation data.
After finding the route that arrives destination node, check that whether this route has one last one address of jumping is 0 list item, (last a jumping address be 0 illustrate that present node is the source node of data).If have, illustrate that certain RID is using, continue to use this value, change the RID of packets of information into the outlet RID value of present use, the words of Xiu Gaiing if desired.
Otherwise, newly-built one last one address of jumping be 0 list item with and corresponding RID list item, write down current RID (least-significant byte of node extended address) for inlet RID, carry out the RID collision detection.Check whether initial RID appears among the outlet RID of RID chained list of all " last one jumping address " list item correspondences of this route.If conflict, then RID adds 1, till not producing conflict, as RID when no conflict occurred, write down the current RID of conflict that do not produce for exporting RID.Specifically flow process is handled as described in Figure 4.
Route as the intermediate node generation:
As shown in Figure 5, intermediate node is received the non-packet of destination address own, obtains last one of this packet from the MAC layer and jumps the address, obtains the route that arrives destination address according to Routing Protocol.
Check at first whether route exists the chained list list item of this " last jumps the address ".
If exist should " last one jumps the address " the chained list list item, reexamine the RID value that whether exists among the inlet RID of the RID chained list that current route should " a last jumping address " list item in the packet.If exist, illustrate that current RID uses, need not detect, with the outlet RID value that the RID of packet is revised as its RID chained list, transmit packet; If there is no, set up a RID chained list list item, current RID is recorded as inlet RID, carry out the RID collision detection for this " last one jumps the address ".
Otherwise, newly-built should " last one jump address " the chained list list item with and corresponding RID chained list list item, current RID is recorded as the RID that enters the mouth, carry out the RID collision detection.
Collision detection: check whether current RID appears among the outlet RID of RID chained list of all " last one jumping address " list item correspondences of this route.If conflict, then RID adds 1, till not producing conflict.No conflict occurred as RID, writes down the current RID that does not produce conflict and be outlet RID.
Annotate: the outlet RID between the RID chained list list item of same " last one jumps the address " chained list list item correspondence need not carry out collision detection, because this moment, different outlet RID represented different data flow.
802.15.4 standard criterion is the Wireless Personal Network at low-power consumption, low rate, the probability that certain node occurs and be 256 data flow of same destination node relay transmission is very low.Moreover design can define the upper bound of a memory space Routing Protocol time, limits total memory space of the RID list item of same route, can not take place to guarantee this situation.
Each route table items all has certain life span, and life span arrives, and routing table is automatically with its deletion, thus the chance of minimizing conflict.
Intermediate node is distinguished the method for a plurality of data flow
1. destination address is different, no matter goes up one and whether equally to jump address, inlet RID, and node can be distinguished a plurality of data flow.
2. destination address is the same, and a last jumping address is different.If this moment, inlet RID had nothing in common with each other, then can directly send to next and jump, in the node of next jumping, destination address can appear, and last one jumps the address all equally, but enters the mouth the different situation of RID; If producing with the outlet RID of current route, inlet RID conflicts, then the RID of the list item of back generation is added 1, up to do not exist identical till, this amended RID is kept at the outlet RID the inside of this route correspondence, and the RID territory of revising packets of information, writes amended RID value, be forwarded to next jumping, thereby make next-hop node receive destination address, last one jumps the address all equally, but enters the mouth the different packets of information of RID.
3. destination address, last is jumped under all the same situation in address, and an inlet RID correspondence a data flow.
The method of destination node identification multiple data stream
Destination node receives a plurality of data flow, by table 11 is listed data stream is classified.Event data stream just can be distinguished data flow from different neighbours by the MAC Address of neighbor node; If from same neighbours, the corresponding data flow of inlet RID.
| The neighbours address | The RID that receives | Packet header behind the decompress(ion) | Data |
Table 11 destination node storage organization
The corresponding different RID of node utilizes the HC1 coding decompress(ion) packet header in its packet respectively, obtains complete header packet information, receives data smoothly.
Claims (4)
1. support the implementation method of compressed package parallel transmission in the IPv6 sensor network, it is characterized in that: the frame format to adaptation layer is introduced the Route Distinguisher territory, one 8 sequence number has one to be applicable to the routing algorithm of multi-hop compression transmission based on mesh topology, and its routing algorithm has the following steps;
Step 1, when certain node need send information to a given address, it at first obtains the route of leading to this address according to the Routing Protocol of this network;
Step 2 produces a Route Distinguisher in the corresponding list item of this route, this initial Route Distinguisher is exactly low eight of this node extended address;
Step 3 is carried out the judgement and the detection of Route Distinguisher conflict, with the Route Distinguisher information of not conflicting after revising along with packets of information sends;
Step 4 after node is received packet, detects the value of ' M ' position in the adaptation layer;
Step 5, if the value of ' M ' position is 0, the destination address that this packet is described is a present node, node receives and handles this data;
Step 6 if the value of ' M ' position is 1, detects the thresholding of " residue jumping figure " in the packet header, final purpose address;
Step 7 if " residue jumping figure " is 0, abandons this packet;
Step 8 if " residue jumping figure " is not 0, obtains the route of leading to this address according to the Routing Protocol of this network;
Step 9 carry out step 3, and circulation is gone down.
2. support the implementation method of compressed package parallel transmission in a kind of IPv6 sensor network according to claim 1, it is characterized in that: the Route Distinguisher territory, be used for distinguishing a plurality of data flow from same intermediate node, each Route Distinguisher territory correspondence a routing iinformation, and different routes can have identical Route Distinguisher territory in the routing table.
3. support the implementation method of compressed package parallel transmission in a kind of IPv6 sensor network according to claim 1, it is characterized in that: jump address link list for last one of same route in the routing table, node is responsible for detecting the conflict of outlet Route Distinguisher domain information between these different last jumping addresses, if the Route Distinguisher territory that the back produces appears among the outlet RID of this route " last one jumps the address ", then the Route Distinguisher territory of the route of back generation adds 1, till not producing conflict, the amended Route Distinguisher of node territory both had been stored in accordingly in the outlet Route Distinguisher territory of " last jumps the address ", also be stored in the Route Distinguisher territory of original packets of information, and along with packets of information sends.
4. support the implementation method of compressed package parallel transmission in a kind of IPv6 sensor network according to claim 1, it is characterized in that: intermediate node is received the non-packet of destination address own, obtain last one of this packet from the MAC layer and jump the address, obtain the route of arrival destination address according to Routing Protocol after, check at first whether route exists the chained list list item of this " last jumps the address ", if there is the chained list list item that is somebody's turn to do " last jumps the address ", reexamine the Route Distinguisher thresholding that whether exists in the inlet Route Distinguisher territory of the Route Distinguisher territory chained list that current route should " last one jumping address " list item in the packet, if exist, need not detect, the outlet Route Distinguisher thresholding of its Route Distinguisher territory chained list is revised as in the Route Distinguisher territory of packet, transmits packet; If there is no, set up a Route Distinguisher territory chained list list item, current Route Distinguisher territory is recorded as inlet Route Distinguisher territory, carry out the collision detection of Route Distinguisher territory for this " last one jumps the address "; Otherwise, newly-built should " last one jump address " the chained list list item with and corresponding Route Distinguisher territory chained list list item, current Route Distinguisher territory is recorded as the Route Distinguisher territory that enters the mouth, carry out the collision detection of Route Distinguisher territory.Collision detection process: check whether current Route Distinguisher territory appears in the outlet Route Distinguisher territory of Route Distinguisher territory chained list of all " last one jumping address " list item correspondences of this route, if conflict, then the Route Distinguisher territory adds 1, till not producing conflict, no conflict occurred when the Route Distinguisher territory, writes down the current Route Distinguisher territory that does not produce conflict and be outlet Route Distinguisher territory.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100117478A CN100366031C (en) | 2005-05-20 | 2005-05-20 | Method for implementing support to paralel transmission of compression packet in IPv6 sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100117478A CN100366031C (en) | 2005-05-20 | 2005-05-20 | Method for implementing support to paralel transmission of compression packet in IPv6 sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1694429A true CN1694429A (en) | 2005-11-09 |
| CN100366031C CN100366031C (en) | 2008-01-30 |
Family
ID=35353237
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100117478A Expired - Fee Related CN100366031C (en) | 2005-05-20 | 2005-05-20 | Method for implementing support to paralel transmission of compression packet in IPv6 sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100366031C (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009006831A1 (en) * | 2007-07-05 | 2009-01-15 | Huawei Technologies Co., Ltd. | Method and equipment for restricting the transition of a data packet |
| CN100553377C (en) * | 2008-12-05 | 2009-10-21 | 清华大学 | A kind of compression determination method that is used for lowering power consumption of wireless sensor network |
| CN1794732B (en) * | 2005-12-26 | 2010-08-11 | 北京交通大学 | Implementing method of IPv6 micro sensing routing appliance protocol stack system structure |
| CN101515840B (en) * | 2009-03-09 | 2011-08-03 | 北京交通大学 | Route selecting method of multipath parallel transmission and delivery |
| WO2011150776A1 (en) * | 2010-09-15 | 2011-12-08 | 华为技术有限公司 | Packet processing method, device and system |
| CN101540728B (en) * | 2008-03-20 | 2012-03-14 | 阿尔卡特朗讯 | A method for transferring data from a sensor over a computer network, and a corresponding device thereof |
| CN102695256A (en) * | 2012-05-29 | 2012-09-26 | 无锡赛睿科技有限公司 | Parallel transmission method and system thereof for wireless sensor network |
| CN102711211A (en) * | 2012-05-30 | 2012-10-03 | 浙江工业大学 | 6LoWPAN-based energy-saving data transmitting method for wireless sensor network |
| CN103152770A (en) * | 2011-12-07 | 2013-06-12 | 中国移动通信集团广东有限公司 | Method and device of compression of internet protocol (IP) masthead |
| CN110719577A (en) * | 2019-10-08 | 2020-01-21 | 浙江大学 | Wireless data acquisition system based on data frame format optimization and data compression |
| CN111147373A (en) * | 2018-11-02 | 2020-05-12 | 瞻博网络公司 | Method for realizing participation of non-flexible algorithm router in flexible algorithm routing protocol |
| CN111147483A (en) * | 2019-12-25 | 2020-05-12 | 武汉绿色网络信息服务有限责任公司 | Lossy compression storage method and device for original network data packet |
| CN114039861A (en) * | 2021-12-20 | 2022-02-11 | 浪潮思科网络科技有限公司 | Chained topology sensing method, device and medium based on TIPC protocol transformation |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| SE0003440D0 (en) * | 2000-09-26 | 2000-09-26 | Landala Naet Ab | Communication system |
| CN1125545C (en) * | 2001-12-31 | 2003-10-22 | 刘军民 | Data forwarding method for implementing virtual channel transmission in LAN |
| BR0215842A (en) * | 2002-08-16 | 2005-06-21 | Siemens Ag | Process for identifying a communication terminal |
| JP2005094530A (en) * | 2003-09-19 | 2005-04-07 | Nec Corp | Data transfer path construction method, wireless communication network system and sensor network system |
| JP2007512724A (en) * | 2003-10-15 | 2007-05-17 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | Communication system and collision prevention method |
-
2005
- 2005-05-20 CN CNB2005100117478A patent/CN100366031C/en not_active Expired - Fee Related
Cited By (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1794732B (en) * | 2005-12-26 | 2010-08-11 | 北京交通大学 | Implementing method of IPv6 micro sensing routing appliance protocol stack system structure |
| WO2009006831A1 (en) * | 2007-07-05 | 2009-01-15 | Huawei Technologies Co., Ltd. | Method and equipment for restricting the transition of a data packet |
| CN101340361B (en) * | 2007-07-05 | 2012-04-25 | 华为技术有限公司 | Method and apparatus for data package transfer limitation |
| CN101540728B (en) * | 2008-03-20 | 2012-03-14 | 阿尔卡特朗讯 | A method for transferring data from a sensor over a computer network, and a corresponding device thereof |
| CN100553377C (en) * | 2008-12-05 | 2009-10-21 | 清华大学 | A kind of compression determination method that is used for lowering power consumption of wireless sensor network |
| CN101515840B (en) * | 2009-03-09 | 2011-08-03 | 北京交通大学 | Route selecting method of multipath parallel transmission and delivery |
| WO2011150776A1 (en) * | 2010-09-15 | 2011-12-08 | 华为技术有限公司 | Packet processing method, device and system |
| CN102404789A (en) * | 2010-09-15 | 2012-04-04 | 华为技术有限公司 | Data packet processing method and system and equipment |
| CN102404789B (en) * | 2010-09-15 | 2014-07-09 | 华为技术有限公司 | Data packet processing method and system and equipment |
| CN103152770A (en) * | 2011-12-07 | 2013-06-12 | 中国移动通信集团广东有限公司 | Method and device of compression of internet protocol (IP) masthead |
| CN103152770B (en) * | 2011-12-07 | 2015-11-04 | 中国移动通信集团广东有限公司 | The method of IP header-compressed and device |
| CN102695256A (en) * | 2012-05-29 | 2012-09-26 | 无锡赛睿科技有限公司 | Parallel transmission method and system thereof for wireless sensor network |
| CN102695256B (en) * | 2012-05-29 | 2016-04-06 | 无锡赛睿科技有限公司 | A kind of parallel transmission method for wireless sensor network and system thereof |
| CN102711211A (en) * | 2012-05-30 | 2012-10-03 | 浙江工业大学 | 6LoWPAN-based energy-saving data transmitting method for wireless sensor network |
| CN102711211B (en) * | 2012-05-30 | 2014-12-03 | 浙江工业大学 | 6LoWPAN-based energy-saving data transmitting method for wireless sensor network |
| CN111147373A (en) * | 2018-11-02 | 2020-05-12 | 瞻博网络公司 | Method for realizing participation of non-flexible algorithm router in flexible algorithm routing protocol |
| CN111147373B (en) * | 2018-11-02 | 2021-04-13 | 瞻博网络公司 | Method for realizing participation of non-flexible algorithm router in flexible algorithm routing protocol |
| CN110719577A (en) * | 2019-10-08 | 2020-01-21 | 浙江大学 | Wireless data acquisition system based on data frame format optimization and data compression |
| CN110719577B (en) * | 2019-10-08 | 2020-10-02 | 浙江大学 | Wireless data acquisition system based on data frame format optimization and data compression |
| CN111147483A (en) * | 2019-12-25 | 2020-05-12 | 武汉绿色网络信息服务有限责任公司 | Lossy compression storage method and device for original network data packet |
| CN111147483B (en) * | 2019-12-25 | 2021-11-12 | 武汉绿色网络信息服务有限责任公司 | Lossy compression storage method and device for original network data packet |
| CN114039861A (en) * | 2021-12-20 | 2022-02-11 | 浪潮思科网络科技有限公司 | Chained topology sensing method, device and medium based on TIPC protocol transformation |
| CN114039861B (en) * | 2021-12-20 | 2024-02-06 | 浪潮思科网络科技有限公司 | Chain topology sensing method, device and medium based on TIPC protocol transformation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100366031C (en) | 2008-01-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1694429A (en) | Method for implementing support to paralel transmission of compression packet in IPv6 sensor network | |
| CN1279731C (en) | Communication stream mould grouping filter and filtering method | |
| CN1140090C (en) | Packet network interfacing | |
| CN1801764A (en) | Internet access method based on identity and location separation | |
| CN1411239A (en) | Kanuchi Koichi (JP)" | |
| CN106797406B (en) | IPv4 communication using 6LoWPAN header compression mechanism | |
| CN1507231A (en) | Message packet transmitter capable of holding mobile terminal | |
| CN1968184A (en) | Link layer communication method in LAN and network device thereof | |
| CN1791054A (en) | Virtual special network multicast method by virtual router mode | |
| CN101075937A (en) | Method, system and apparatus for converting message in three-layer virtual special network | |
| CN101047714A (en) | Apparatus and method for processing network data | |
| CN1558623A (en) | Method and system for immediately processing real time media stream data packets | |
| CN101057461A (en) | Apparatus and method for compressing of herder in a broad band wireless communication system | |
| CN1700668A (en) | Process for generating and updating a hierarchical tree in a manet multicast routing protocol ad hoc network | |
| CN1905523A (en) | Method for implementing multi-area stream classifying | |
| CN1798104A (en) | Wireless communication system for multicast communications | |
| CN1744534A (en) | Message mirroring method and network equipment with message mirroring function | |
| KR101563001B1 (en) | Method for compressing the header of an ip packet and a node in a network based on multiple addresses therefor | |
| CN1870583A (en) | Method for implementing communication of mobile IPv6 node and IPv4 communication buddy | |
| KR20140034951A (en) | Method for managing context table for compress the ipv6 header based on context in wireless mesh networks | |
| CN1716943A (en) | Method and system for obtaining path maximum transmission length in channel gateway environment | |
| CN1503474A (en) | Wireless insertion network system, method, and control equipment | |
| CN101064637A (en) | Method for guaranteeing quality of service of operation maintenance data stream | |
| CN1181655C (en) | Data packet transmission method in mobile IP | |
| CN1866969A (en) | Iub interface data transmission method in broadband CDMA 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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080130 Termination date: 20110520 |