CN109890059B - Internet of things multi-hop transmission method based on star map - Google Patents
Internet of things multi-hop transmission method based on star map Download PDFInfo
- Publication number
- CN109890059B CN109890059B CN201910152303.8A CN201910152303A CN109890059B CN 109890059 B CN109890059 B CN 109890059B CN 201910152303 A CN201910152303 A CN 201910152303A CN 109890059 B CN109890059 B CN 109890059B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- ssn
- internet
- things
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses an internet of things multi-hop transmission method based on a star map, which comprises the following steps: deploying SN nodes in a defined communication area based on a star map; based on the nearest neighbor routing scheme, the SRN node transmits the data packet to the SSN node through the RN node; based on the shortest routing scheme of the star map, the SSN node transmits the data packet to the DSN node through the SN node; based on the nearest neighbor routing scheme, the DSN node transmits the data packet to the DRN node via the RN node. According to the invention, a shortest routing scheme based on a star map is introduced into the Internet of things, and a small amount of SNs is selected based on the star map with the load balancing shortest routing characteristic so as to establish communication shortcuts among RNs, so that the average path length among the RNs is minimized, the transmission delay of a multi-hop transmission network of the Internet of things can be reduced, the Internet of things has a smaller average path length and a higher average aggregation coefficient, and the load balancing among SNs and the higher average aggregation coefficient of the Internet of things can improve the transmission reliability of the Internet of things.
Description
Technical Field
The invention belongs to the technical field of wireless communication, and particularly relates to an internet of things multi-hop transmission method based on a star map.
Background
With the advent of IoT (internet of things), a large number of low-power devices with short-range communication capability will be connected into a network in a future 5G system, and multi-hop transmission is the main transmission mode of the IoT communication system. In a wireless multihop network, long hop routes are suitable for delay sensitive applications and short hop routes are suitable for applications with less transmit power consumption. Most of the IoT networks are low-power devices, and it is critical to consume less power under the same QoS, but for low-latency communication scenarios in the IoT networks, it is also very important to ensure lower end-to-end latency. Therefore, a single long-hop route and a single short-hop route cannot meet the scenario that low-power-consumption devices in the IoT network have high requirements on delay.
Furthermore, although some routing schemes can improve latency or reliability of information transmission in IoT, no current scheme considers latency and reliability issues.
Therefore, in an IoT network, the prior art cannot simultaneously satisfy the technical problems of reducing transmission delay and improving network reliability.
Disclosure of Invention
Aiming at the defects of the prior art, the invention aims to solve the technical problems of high multi-hop transmission delay and low transmission reliability in the Internet of things in the prior art.
In order to achieve the above object, in a first aspect, an embodiment of the present invention provides a star map-based internet of things multi-hop transmission method, including the following steps:
s1, deploying SN nodes in a defined communication area based on a star map;
s2, based on the nearest neighbor routing scheme, the SRN node transmits the data packet to the SSN node through the RN node;
s3, based on the shortest routing scheme of the star map, the SSN node transmits the data packet to the DSN node through the SN node;
s4, based on the nearest neighbor routing scheme, the DSN transmits the data packet to the DRN through the RN node;
the Internet of things comprises SN nodes, RN nodes, SRN nodes and DRN nodes, wherein the SN nodes are nodes with long-distance communication capacity, the RN nodes are nodes only with short-distance communication capacity, the SRN nodes are source nodes, the DRN nodes are destination nodes, the SSN nodes are SN nodes nearest to the source nodes, and the DSN nodes are SN nodes nearest to the destination nodes.
In particular, the RN node obedience parameter is λRNWithout identity differences.
In particular, based on star map Sn,kDeploying SN nodes in a defined communication area, comprising the steps of:
s101, taking an inscribed circle of a communication area as a circular area;
s102, uniformly dividing the circular area into n fan-shaped areas;
s103, reducing the radius of the inscribed circle of each sector area, wherein the coordinate of the circle center after reduction is consistent with the circle center of the inscribed circle of the sector area;
s104. uniformly deploying (n-1) on each reduced circle! L (n-k)! A SN node, wherein n and k are decision star maps Sn,kAnd k is more than or equal to 1 and less than or equal to n as the parameter of the number of the middle SN nodes.
Specifically, the reduction ratio in step S103 is (0.5, 1).
Specifically, step S2 specifically includes:
s201, for each hop of transmitting node, taking a connecting line between the SRN and the SSN or a parallel line of the connecting line as an initial edge, taking the transmitting node as a center, rotating the transmitting node by a phi/2 in a counterclockwise direction, and then rotating the transmitting node by the phi/2 in the clockwise direction to form a sector area with the angle phi;
s202. each RN node will select the nearest RN node in the sector of angle Φ as its next hop, along the direction of the destination.
Specifically, based on the shortest routing scheme of the star map, the SSN node transmits the data packet to the DSN node via the SN node, which specifically includes the following steps:
s300, randomly distributing an identity identifier to each SN according to the rule that the last digit of the identity identifier of the SN in each sub-area is the same, wherein the identity identifier of the SSN node is ISSN＝u1…us…ukThe identity identifier of the DSN node is IDSN＝v1…vs…vk；
S301. computing sets V, U and Z based on the identity identifiers of the SSN node and the DSN node, wherein V represents ISSNIs absent and IDSNSet of the numbers in (1), U representing ISSNIs of and IDSNSet of numbers not present, Z denotes ISSNIs of and IDSNA set of digits in;
s302, judging a first number u of the SSN node identity identifier1Whether it is equal to the first digit v of the DSN node identity identifier1If yes, go to step S303, otherwise, go to step S304;
s303, judging whether the set U is not an empty set, if so, selecting a maximum number and U from the set U1Performing position exchange, and entering step S305, otherwise, entering step S306;
s304, judging u1∈ Z, if yes, finding v1…vs…vkNeutral u1If the equal number is in s bit, u will be1And usPerforming position exchange, otherwise, entering step S305;
s305. judging u1∈ U, if U1∈ U holds true, finds the smallest number V in the set VtT is vtIf t is 1, judging whether other numbers exist in the set V, if so, finding the next small number V in the set Vt', will vt' alternative u1…us…ukThe first digit in (A) gives vt′…us…ukOtherwise, v is settSubstitution u1…us…ukThe first digit in (A) gives vt…us…ukIf t ≠ 1, then v is directly assignedtSubstitution u1…us…ukThe first digit in (A) gives vt…us…ukDeleting the replacing number from the set V after completing the replacement, judging whether the V is an empty set, if so, finishing u1Replacing elements in the set V, and entering step S306, otherwise, entering step S304; if u1∈ U is not established, the flow proceeds to step S306;
s306, judging u1…us…ukAnd v1…vs…vkIf the sorting is consistent, ending the shortest route based on the star map if the sorting is consistent, otherwise, finding out v1…vs…vkNeutral u1Equal numbers are in s bits, and u is1And usPerforming a position swap to obtain us…u1…ukAnd ending the shortest route based on the star map.
Specifically, the calculation formula of the average path length W in the whole transmission process is as follows:
W＝W1+D+W2
＝L1/E(X)+D+L2/E(X)
wherein, W1Is the number of transmission hops between SRN and SSN, D is the number of transmission hops between SSN and DSN, W2For the number of transmission hops from DSN to DRN, L1Is the linear distance between SRN and SSN, L2E (X) is the straight-line distance between DSN and DRN, and e (X) is the average of the length X that maps the actual transmission distance per hop onto the SRN and SSN connections.
Specifically, the calculation formula of the average aggregation coefficient C of the internet of things is as follows:
wherein, CRNAverage aggregation coefficient of RN, CSNThe average aggregation coefficient of the SNs is shown, M is the number of RN nodes in the Internet of things, and N is the number of SN nodes in the Internet of things.
Specifically, the number N of SN nodes in the internet of things is N! L (n-k)! .
In a second aspect, an embodiment of the present invention provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when executed by a processor, the computer program implements the internet of things multi-hop transmission method according to the first aspect.
Generally, compared with the prior art, the above technical solution conceived by the present invention has the following beneficial effects:
according to the invention, a shortest routing scheme based on a star map is introduced into the Internet of things, and a small amount of SNs is selected based on the star map with the load balancing shortest routing characteristic so as to establish communication shortcuts among RNs, so that the average path length among the RNs is minimized, the transmission delay of a multi-hop transmission network of the Internet of things can be reduced, the Internet of things has a smaller average path length and a higher average aggregation coefficient, and the load balancing among SNs and the higher average aggregation coefficient of the Internet of things can improve the transmission reliability of the Internet of things.
Drawings
Fig. 1 is a flowchart of a multi-hop transmission method of the internet of things based on a star atlas according to an embodiment of the present invention;
FIG. 2 is a star map-based S provided by an embodiment of the present invention4,2A process schematic diagram of deploying SN nodes;
fig. 3 is a schematic diagram of a multi-hop transmission scheme between an SRN and an SSN according to an embodiment of the present invention;
fig. 4 is a schematic diagram of an entire transmission process of a data packet according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
SRN, Source Regular Node, Source RN Node;
DRN, Destination Regular Node, Destination RN Node;
SSN, Source Super Node, Source SN Node;
DSN, Destination Super Node, Destination SN Node;
NNR, neighbor Routing, Nearest neighbor Routing scheme.
As shown in fig. 1, the invention discloses an internet of things multi-hop transmission method based on a star map, which comprises the following steps:
s1, deploying SN nodes in a defined communication area based on a star map;
s2, based on the nearest neighbor routing scheme, the SRN node transmits the data packet to the SSN node through the RN node;
s3, based on the shortest routing scheme of the star map, the SSN node transmits the data packet to the DSN node through the SN node;
s4, based on the nearest neighbor routing scheme, the DSN transmits the data packet to the DRN through the RN node;
the Internet of things comprises SN nodes, RN nodes, SRN nodes and DRN nodes, wherein the SN nodes are nodes with long-distance communication capacity, the RN nodes are nodes only with short-distance communication capacity, the SRN nodes are source nodes, the DRN nodes are destination nodes, the SSN nodes are SN nodes nearest to the source nodes, and the DSN nodes are SN nodes nearest to the destination nodes.
S1, deploying SN nodes in a designated communication area based on a star map.
Star map Sn,kIs a type of Cayley chart, n and k are decision star charts Sn,kAnd k is more than or equal to 1 and less than or equal to n as the parameter of the number of the middle SN nodes. Topological relation among SN nodes conforms to star map Sn,kFormation rule of (1), star map Sn,kThe vertices of (1) represent SNs and the edges connected between the vertices represent communication relationships between the SNs. The Cayley graph allows the shortest route with uniform load on the nodes, the shortest route between any two SNs where load balancing can be achieved.
A communication area defined in the Internet of things is assumed to be a square with the side length of 2R and the origin of a Cartesian coordinate system as a center. In the communication area, based on star map Sn,kDeploying the SN node, comprising the steps of:
s101, taking an inscribed circle of the communication area as a circular area.
A circular area is defined by taking the origin as the center and R as the radius to deploy SN.
S102, uniformly dividing the circular area into n fan-shaped areas.
Based on star map Sn,kCan be divided into n star maps Sn-1,k-1The property of (2) is to divide the circular area into n parts, each part being a sector area with radian Ω -2 π/n. Specifically, the first sub-region is a fan which takes the x-axis as a starting axis and rotates counterclockwise around the origin by an angle of omegaA shape area, the radius of an inscribed circle of the sector area is r, and the coordinate of the center of the inscribed circle is O1(r/tan (pi/n), r), the center O of the inscribed circle of the other sub-regionm(1 < m.ltoreq.n) by passing O1Is obtained by rotating counterclockwise by an angle of Ω × (m-1).
S103, the radius of the inscribed circle of each sector area is reduced, and the coordinate of the circle center after reduction is consistent with the circle center of the inscribed circle of the sector area.
In order to prevent SN nodes of different deployed sub-areas from overlapping, the radius of an inscribed circle of each sector area is reduced according to a certain proportion, the radius of the reduced circle is r' ═ Δ r, wherein Δ is more than 0.5 and less than 1, and the center coordinates of the reduced circle are consistent with the center coordinates of the inscribed circle of the sector area.
S104. uniformly deploying (n-1) on each reduced circle! L (n-k)! And (5) the SN nodes.
The number of the SN nodes deployed in each subregion is N' ═ N-1! L (n-k)! The N' nodes are uniformly distributed with OmAs the center of circle, r' is the circle of radius.
The quantity of RNs in the Internet of things is M, and the quantity of SN nodes is N ═ N! L (n-k)! . The present invention deploys a small number of SNs in a communication area with a large number of RNs, thus satisfying N < M.
As shown in fig. 2, based on star map S4,2The circular area is divided into 4 sections, each of which is a sector area with a radian Ω ═ pi/2. The first sub-area is a sector area which takes an x axis as an initial axis and rotates anticlockwise for an angle of omega pi/2 around an origin, the radius of an inscribed circle is r, and the center O of the inscribed circle1Has the coordinates of (r/tan (pi/4), r) and the center O of the inscribed circle of the other sub-aream(1 < m.ltoreq.4) by passing O1Is obtained by rotating the coordinates of (a) counterclockwise by an angle of (q) × (m-1), where n is 4, k is 2, the number of SNs per sub-region is 3, and the SN is evenly distributed at OmAs the center of circle, r' is the circle of radius.
And S2, based on the nearest neighbor routing scheme, the SRN node transmits the data packet to the SSN node through the RN node.
In order to transmit a data packet to the destination node DRN, the source node SRN first transmits the data packet to the SN closest to itself, i.e. the SSN. And the transmission between the SRN and the SSN adopts an NNR multi-hop transmission scheme.
As shown in fig. 3, for each hop of transmitting node, a connecting line between the SRN and the SSN or a parallel line of the connecting line is taken as a starting edge, the transmitting node is taken as a center, the transmitting node is rotated by a counterclockwise angle of Φ/2, and then the transmitting node is rotated by the clockwise angle of Φ/2, so as to form a sector area with the angle of Φ. Each RN node selects the nearest node in a sector with an angle phi as the next hop along the direction of the destination, and the distance transmitted by each hop is rRN. The link quality of each single hop link is guaranteed by taking advantage of all available relays in the sector and minimizing the hop distance.
The RN node obeys a parameter of lambdaRNAnd there is no identity difference between RNs. Transmission distance r per hopRNHas an average value of
Actual transmission distance r per hopRNLength X mapped to SRN and SSN connection line and actual transmission distance rRNThe ratio of (A) is calculated as follows:
where Φ is an angle of a sector region centered on the transmission node, and Φ is an emission angle with respect to a straight line connecting the SRN and the SSN.
Actual transmission distance r per hopRNThe average of the lengths X mapped onto the SRN to SSN connection is calculated as follows:
number of transmission hops W between SRN and SSN1The calculation formula of (a) is as follows:
wherein, L1Is the linear distance between the SRN and the SSN.
And S3, based on the shortest routing scheme of the star map, the SSN node transmits the data packet to the DSN node through the SN node.
The routing problem between the SSN and the DSN is converted into a star map Sn,kRouting problems between two nodes. Star map Sn,kEach node of (a) is represented by a sequence number, i.e. each node has an identity identifier. Star map Sn,kNode set of { p }1…ps…pk|ps∈{1,2,...,n},ps≠ptfors≠t}。
Randomly distributing an identity identifier to each SN according to the rule that the last digit of the identity identifier of the SN in each subarea is the same, and then distributing the identity identifier to each SN according to the star map Sn,kThe formation rules of the neighboring nodes establish communication links.
The SSN node has an identity identifier of ISSN＝u1…us…ukThe identity identifier of the DSN node is IDSN＝v1…vs…vkAnd obtaining the shortest route between the SSN node and the DSN node through the replacement between the SSN node and the DSN node identity identifiers.
S301. computing sets V, U and Z based on the identity identifiers of the SSN node and the DSN node, wherein V represents ISSNIs absent and IDSNSet of the numbers in (1), U representing ISSNIs of and IDSNSet of numbers not present, Z denotes ISSNIs of and IDSNThe existing number sets.
S302, judging a first number u of the SSN node identity identifier1Whether it is equal to the first digit v of the DSN node identity identifier1If yes, the process proceeds to step S303, otherwise, the process proceeds to step S304.
S303, judging whether the set U is not an empty set, if so, selecting a maximum number and U from the set U1The location exchange is performed, and the process proceeds to step S305, otherwise, the process proceeds to step S306.
S304, judging u1∈ Z, if yes, finding v1…vs…vkNeutral u1If the equal number is in s bit, u will be1And usThe position exchange is performed, otherwise, the process proceeds to step S305.
S305. judging u1∈ U, if U1∈ U holds true, finds the smallest number V in the set VtT is vtIf t is 1, judging whether other numbers exist in the set V, if so, finding out the next small number Vt', will vt' alternative u1…us…ukThe first digit in (A) gives vt′…us…ukOtherwise, v is settSubstitution u1…us…ukThe first digit in (A) gives vt…us…ukIf t ≠ 1, then v is directly assignedtSubstitution u1…us…ukThe first digit in (A) gives vt…us…ukDeleting the replacing number from the set V after completing the replacement, judging whether the V is an empty set, if so, finishing u1Replacing elements in the set V, and entering step S306, otherwise, entering step S304; if u1∈ U is not established, the flow proceeds to step S306;
s306, judging u1…us…ukAnd v1…vs…vkIf the sorting is consistent, ending the shortest route based on the star map if the sorting is consistent, otherwise, finding out v1…vs…vkNeutral u1Equal numbers are in s bits, and u is1And usPerforming a position swap to obtain us…u1…ukAnd ending the shortest route based on the star map.
When entering step S306, u1…us…ukAnd v1…vs…vkThe same numbers are used.
For example, ISSN＝3241，IDSNAt 1234, u1u2u3u43241 and v1v2v3v4The numbers 1234 are all the same, but the ordering of the numbers is different, at u1u2u3u4The number 3 in the first position in 3241 is located at v1v2v3v4Third bit in 1234, then u will be1u2u3u4The 3 at the first position in 3241 is exchanged with the number at the third position to obtain u1u2u3u4＝3241→[u1u2u3u4]14231. In [ u ]1u2u3u4]14231 the number 4 in the first position is located at v1v2v3v4To the fourth bit of 1234, [ u ] will1u2u3u4]14231, 4 at the first position is exchanged with 1 at the fourth position to obtain [ u [1u2u3u4]1＝4231→[u1u2u3u4]2Finally, 1234, [ u ] is obtained1u2u3u4]2＝v1v2v3v4And ending the route.
The total number of times of position exchange and digit replacement in the above steps is the number of transmission hops D between the SSN and the DSN.
According to star map Sn,kThe maximum value of the number of transmission hops D between the SSD and the DSN is calculated by the following formula:
based on star map Sn,kThe SN has the characteristic of the shortest route of load balancing, and the load among the SNs is balanced while the SNs realize the shortest route, so that the reliability of data packet transmission among the SNs is improved.
As shown in fig. 4, based on star map S4,2Deploying SN, Star map S4,2Node set of { p }1p2|pi∈ {1,2,3,4}, i ∈ {1,2} }, and p1≠p2. Last number p of the identity identifier of the SN of each sub-area2Are all the same. For example, the nodes 42, 12, 32 belong to the same sub-area. Each SN has an identity identifier p1p2For example, the SSN has an id of 24, and the DSN has an id of 13. When I isSSN＝24，IDSNWhen 13, is equivalent to u1u2＝24，v1v213. The routing scheme for SSNs and DSNs is as follows: i isSSNNone and IDSNThe collection of the numbers in the Chinese character is V ═ {1,3}, ISSNIs of middle origin and IDSNThe set of numbers not included in the list is U ═ 2,4, ISSNAnd IDSNThe set of numbers in all of them is Z ═ Θ. First u1≠v1And u is1∈ {2,4}, then the smallest of the sets {1,3} and not located at IDSNDigit 3 of the first digit replacing u1To yield 34, i.e. u1u2＝24→[u1u2]1After this step is completed, V ═ 1}, U ═ 4}, and Z ═ 3 }. 3 is located at IDSNSecond bit of 13, so will [ u [ ]1u2]1Position exchange between 3 and 4 in 34 gives 43, i.e. [ u ]1u2]1＝34→[u1u2]2After completing this operation, V ═ 1}, U ═ 4}, and Z ═ 3 }. Continue to replace 4 in 43 with 1 in {1} set V, resulting in 13, i.e., [ u ]1u2]2＝43→[u1u2]3After this step is completed, V ═ Θ, U ═ Θ, and Z ═ 1,3}, at this time [ U ═ c1u2]3＝v1v2And ending the routing process. The routing process from SSN to DSN can be represented as 24 → 34 → 43 → 13 with a total number of hops for transmission of 3. After the SRN at (-R, -R) transmits the packet to the SSN, the SSN transmits the packet to the DSN over a 3-hop long distance, and then the DSN transmits the packet to the DRN at (R, R).
And S4, based on the nearest neighbor routing scheme, the DSN transmits the data packet to the DRN node through the RN node.
The data packet transmission between the DSN and the DRN adopts an NNR multi-hop transmission scheme. Number of transmission hops W between DSN and DRN2The calculation formula of (2) is as follows:
W2＝L2/E(X)
wherein, L2Is the straight-line distance between the DSN and DRN.
And selecting the average path length and the average aggregation coefficient, and comparing the advantages and disadvantages of the multi-hop transmission method provided by the invention and the transmission method only adopting the NNR scheme. The average path length represents the average hop number of the data packet transmitted from the source node to the destination node, and the average aggregation coefficient represents the aggregation degree of the nodes.
The number of transmission hops W from SRN to SSN obtained in step S21The number of transmission hops from SSN to DSN obtained in step S3 is D, and the number of transmission hops from DSN to DRN obtained in step S4 is W2Thus, the average path length W in the whole transmission process of the present invention can be obtained, and the calculation formula is:
W＝W1+D+W2
＝L1/E(X)+D+L2/E(X)
if only NNR scheme is used for transmission between SRN and DRN, the average path length is calculated as:
W′＝L/E(X)
wherein L is the straight-line distance between SRN and DRN.
Since N < M, the number of RN nodes is large, so the distance transmitted by each hop of RN node is a small value compared with the actual transmission distance between SRN and DRN, when the straight-line distance L between SRN and DRN satisfies L > L1,L＞＞L2When it is used, it is (L-L)1-L2) and/E (X) > max (D), so W < W' exists, namely, compared with an NNR scheme, the multi-hop transmission method provided by the invention can effectively reduce the average path length of data packet transmission in the Internet of things.
The calculation formula of the average aggregation coefficient C of the Internet of things is as follows:
wherein, CRNAverage aggregation coefficient of RN, CSNIs the average aggregation coefficient of SN.
Because the quantity M of RNs and the quantity N of SNs in the communication area of the Internet of things satisfy the relation M > N, C is approximately equal to CRNThe result shows that the average aggregation coefficient of the network is not influenced by a small amount of SNs deployed in the Internet of things. The multi-hop transmission method provided by the invention can enable the average aggregation coefficient of the Internet of things to be still kept at a higher level.
Compared with an NNR scheme, the multi-hop transmission scheme based on the star map provided by the invention can reduce the average path length of data packet transmission in the Internet of things, and the average aggregation coefficient is still kept at a higher level, so that the Internet of things has good small-world characteristics. The smaller average path length reduces the data transmission delay, and the higher average aggregation coefficient increases the reliability of data transmission.
The above description is only for the preferred embodiment of the present application, but the scope of the present application is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present application should be covered within the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (8)
1. A star map-based Internet of things multi-hop transmission method is characterized by comprising the following steps:
s1, deploying SN nodes in a defined communication area based on a star map;
s2, based on the nearest neighbor routing scheme, the SRN node transmits the data packet to the SSN node through the RN node;
s3, based on the shortest routing scheme of the star map, the SSN node transmits the data packet to the DSN node through the SN node;
s4, based on the nearest neighbor routing scheme, the DSN transmits the data packet to the DRN through the RN node;
the Internet of things comprises SN nodes, RN nodes, SRN nodes and DRN nodes, wherein the SN nodes are nodes with long-distance communication capacity, the RN nodes are nodes only with short-distance communication capacity, the SRN nodes are source nodes, the DRN nodes are destination nodes, the SSN nodes are SN nodes nearest to the source nodes, and the DSN nodes are SN nodes nearest to the destination nodes;
step S2 specifically includes:
s201, for each hop of transmitting node, taking a connecting line between the SRN and the SSN or a parallel line of the connecting line as an initial edge, taking the transmitting node as a center, rotating the transmitting node by a phi/2 in a counterclockwise direction, and then rotating the transmitting node by the phi/2 in the clockwise direction to form a sector area with the angle phi;
s202, each RN node selects the nearest RN node in a sector area with an angle phi as the next hop along the direction of a destination;
based on the shortest routing scheme of the star map, the SSN node transmits the data packet to the DSN node through the SN node, and the method specifically comprises the following steps:
s300, randomly distributing an identity identifier to each SN according to the rule that the last digit of the identity identifier of the SN in each sub-area is the same, wherein the identity identifier of the SSN node is ISSN＝u1…us…ukThe identity identifier of the DSN node is IDSN＝v1…vs…vk；
S301. computing sets V, U and Z based on the identity identifiers of the SSN node and the DSN node, wherein V represents ISSNIs absent and IDSNSet of the numbers in (1), U representing ISSNIs of and IDSNSet of numbers not present, Z denotes ISSNIs of and IDSNA set of digits in;
s302, judging a first number u of the SSN node identity identifier1Whether it is equal to the first digit v of the DSN node identity identifier1If yes, go to step S303, otherwise, go to step S304;
s303, judging whether the set U is not an empty set, if so, selecting a maximum number and U from the set U1Perform position exchange, andstep S305 is entered, otherwise, step S306 is entered;
s304, judging u1∈ Z, if yes, finding v1…vs…vkNeutral u1If the equal number is in s bit, u will be1And usPerforming position exchange, otherwise, entering step S305;
s305. judging u1∈ U, if U1∈ U holds true, finds the smallest number V in the set VtT is vtIf t is 1, judging whether other numbers exist in the set V, if so, finding the next small number V in the set Vt', will vt' alternative u1…us…ukThe first digit in (A) gives vt′…us…ukOtherwise, v is settSubstitution u1…us…ukThe first digit in (A) gives vt…us…ukIf t ≠ 1, then v is directly assignedtSubstitution u1…us…ukThe first digit in (A) gives vt…us…ukDeleting the replacing number from the set V after completing the replacement, judging whether the V is an empty set, if so, finishing u1Replacing elements in the set V, and entering step S306, otherwise, entering step S304; if u1∈ U is not established, the flow proceeds to step S306;
s306, judging u1…us…ukAnd v1…vs…vkIf the sorting is consistent, ending the shortest route based on the star map if the sorting is consistent, otherwise, finding out v1…vs…vkNeutral u1Equal numbers are in s bits, and u is1And usPerforming a position swap to obtain us…u1…ukAnd ending the shortest route based on the star map.
2. The internet of things multihop transmission method of claim 1, wherein a RN node compliance parameter is λRNWithout identity differences.
3. The internet of things multihop transmission method of claim 1, based on a star map Sn，kDeploying SN nodes in a defined communication area, comprising the steps of:
s101, taking an inscribed circle of a communication area as a circular area;
s102, uniformly dividing the circular area into n fan-shaped areas;
s103, reducing the radius of the inscribed circle of each sector area, wherein the coordinate of the circle center after reduction is consistent with the circle center of the inscribed circle of the sector area;
s104. uniformly deploying (n-1) on each reduced circle! L (n-k)! A SN node, wherein n and k are decision star maps Sn，kAnd k is more than or equal to 1 and less than or equal to n as the parameter of the number of the middle SN nodes.
4. The internet-of-things multihop transmission method of claim 3, wherein the reduction ratio in step S103 is (0.5, 1).
5. The internet of things multihop transmission method of claim 1, wherein an average path length W in the whole transmission process is calculated as follows:
W＝W1+D+W2
＝L1/E(X)+D+L2/E(X)
wherein, W1Is the number of transmission hops between SRN and SSN, D is the number of transmission hops between SSN and DSN, W2For the number of transmission hops from DSN to DRN, L1Is the linear distance between SRN and SSN, L2E (X) is the straight-line distance between DSN and DRN, and e (X) is the average of the length X that maps the actual transmission distance per hop onto the SRN and SSN connections.
6. The internet of things multihop transmission method of claim 1, wherein an average aggregation coefficient C of the internet of things is calculated by the following formula:
wherein, CRNAverage aggregation coefficient of RN, CSNThe average aggregation coefficient of the SNs is shown, M is the number of RN nodes in the Internet of things, and N is the number of SN nodes in the Internet of things.
7. The internet of things multihop transmission method of claim 3, wherein the number of SN nodes in the internet of things is N ═ N! L (n-k)! .
8. A computer-readable storage medium, having stored thereon a computer program which, when executed by a processor, implements the internet of things multi-hop transmission method as claimed in any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910152303.8A CN109890059B (en) | 2019-02-28 | 2019-02-28 | Internet of things multi-hop transmission method based on star map |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910152303.8A CN109890059B (en) | 2019-02-28 | 2019-02-28 | Internet of things multi-hop transmission method based on star map |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109890059A CN109890059A (en) | 2019-06-14 |
| CN109890059B true CN109890059B (en) | 2020-07-10 |
Family
ID=66930064
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910152303.8A Active CN109890059B (en) | 2019-02-28 | 2019-02-28 | Internet of things multi-hop transmission method based on star map |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109890059B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103079249A (en) * | 2012-12-16 | 2013-05-01 | 北京泛联至诚科技有限公司 | Internet of Things multicast data transmission method based on traffic density |
| CN106102048A (en) * | 2016-06-03 | 2016-11-09 | 上海理工大学 | The security data packet that in a kind of Internet of Things, sensor sends is transferred to the transmission method of base station |
| CN106657207A (en) * | 2015-12-29 | 2017-05-10 | 苏州踪视通信息技术有限公司 | Method and system for user and device management of an IOT network |
| WO2018056387A1 (en) * | 2016-09-23 | 2018-03-29 | 日本電気株式会社 | INFORMATION PROCESSING DEVICE, COMMUNICATION METHOD, COMMUNICATION PROGRAM, COMMUNICATION SYSTEM, IoT DEVICE, AND BASE STATION |
-
2019
- 2019-02-28 CN CN201910152303.8A patent/CN109890059B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103079249A (en) * | 2012-12-16 | 2013-05-01 | 北京泛联至诚科技有限公司 | Internet of Things multicast data transmission method based on traffic density |
| CN106657207A (en) * | 2015-12-29 | 2017-05-10 | 苏州踪视通信息技术有限公司 | Method and system for user and device management of an IOT network |
| CN106102048A (en) * | 2016-06-03 | 2016-11-09 | 上海理工大学 | The security data packet that in a kind of Internet of Things, sensor sends is transferred to the transmission method of base station |
| WO2018056387A1 (en) * | 2016-09-23 | 2018-03-29 | 日本電気株式会社 | INFORMATION PROCESSING DEVICE, COMMUNICATION METHOD, COMMUNICATION PROGRAM, COMMUNICATION SYSTEM, IoT DEVICE, AND BASE STATION |
Non-Patent Citations (1)
| Title |
|---|
| 星图上基于循环置换的任意两点之间的最短路径算法;王静，郭大昌;《广东工业大学学报》;20100930;正文1-3章 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109890059A (en) | 2019-06-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7782882B2 (en) | Method and apparatus for distributing dynamic auto-summarization of internet protocol reachable addresses | |
| Jimenez et al. | On the controller placement for designing a distributed SDN control layer | |
| CN112104558B (en) | Method, system, terminal and medium for implementing block chain distribution network | |
| US10574567B2 (en) | Modeling a border gateway protocol network | |
| US7334047B1 (en) | Method and system for selective link state advertisement blocking over a data network area | |
| US7760745B2 (en) | Method and apparatus for network routing between a tactical network and a satellite network | |
| US20090086663A1 (en) | Selecting Aggregation Nodes in a Network | |
| JPH07177143A (en) | Link metric assignment method | |
| US11558280B2 (en) | System and method of processing in-place adjacency updates | |
| CN107864092B (en) | Cloud content distribution method and device based on multicast technology | |
| Adhinugraha et al. | Measuring fault tolerance in IoT mesh networks using Voronoi diagram | |
| CN109890059B (en) | Internet of things multi-hop transmission method based on star map | |
| Zhu et al. | Efficient hybrid multicast approach in wireless data center network | |
| Sudarsan et al. | A survey on various improvements of hybrid zone routing protocol in MANET | |
| CN106992930B (en) | A kind of opportunistic network routing method based on approach frequency | |
| US20220239595A1 (en) | Increasing multi-path size using hierarchical forwarding equivalent classes | |
| Kim et al. | Interface Assignment‐Based AODV Routing Protocol to Improve Reliability in Multi‐Interface Multichannel Wireless Mesh Networks | |
| Mohammadi et al. | A new algorithm inspired by Impala Mexican Wave with variable stride for relay node placement as a nested reverse p-median problem in disjoint wireless sensor networks | |
| Anbu Ananth et al. | Efficient load balancing techniques for wireless mesh networks based on multi-path optimized link state routing protocol | |
| Di et al. | Connected dominating set based hybrid routing algorithm in ad hoc networks with obstacles | |
| Tao et al. | Greedy face routing with face identification support in wireless networks | |
| Winter et al. | Topology-aware overlay construction in dynamic networks | |
| CN115499271B (en) | Hybrid network topology structure and routing method thereof | |
| WO2021020525A1 (en) | Route control device, route control method, and program | |
| Fujita | Three-Tier Delaunay Network as a Topology for Peer-to-Peer Overlay |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |