CN109688244A - A kind of efficient wireless sense network address configuration implementation method - Google Patents
A kind of efficient wireless sense network address configuration implementation method Download PDFInfo
- Publication number
- CN109688244A CN109688244A CN201910102360.5A CN201910102360A CN109688244A CN 109688244 A CN109688244 A CN 109688244A CN 201910102360 A CN201910102360 A CN 201910102360A CN 109688244 A CN109688244 A CN 109688244A
- Authority
- CN
- China
- Prior art keywords
- message
- address
- node
- repetition
- list item
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/50—Address allocation
- H04L61/5046—Resolving address allocation conflicts; Testing of addresses
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/50—Address allocation
- H04L61/5053—Lease time; Renewal aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/26—Network addressing or numbering for mobility support
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Databases & Information Systems (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides a kind of efficient wireless sense network address configuration implementation method, the wireless sense network includes that sensing node is constituted, and sensing node is referred to as node；Sensing node includes new node and configured node, and new node is the sensing node that address is not configured, and configured node is the sensing node of configuration address；One address includes prefix and suffix；The configuration method can be improved address configuration efficiency, be enhanced network scalability sensing node through the invention with quick obtaining address with uniqueness, to realize correctly communication.Present invention can apply to the numerous areas such as traffic prosecution and agricultural engineerization, are with a wide range of applications.
Description
Technical field
The present invention relates to a kind of implementation method of address configuration more particularly to a kind of efficient wireless sensing net address
Configure implementation method.
Background technique
Forwarding and routing of the communication by intermediate node is realized between node in wireless sense network, therefore, Mei Gejie
Point must be equipped with address with uniqueness to realize communication, therefore, realize wireless sense network need the key technology that solves it
One is exactly Address Autoconfiguration problem.
Current address configuration is divided into two kinds of forms of stateful address configuration and stateless address configuration, and stateful address is matched
Scheme is set using the communication mode distribution address of server/customer end, i.e. node request that address is filed an application to server, so
The distribution of the node in network address is unified for by server afterwards.Since wireless sense network does not have any infrastructure, such as service
Device, therefore, stateful address configuration scheme can not be applied in wireless sense network.In stateless address configuration scheme, each
Assigned address requires to carry out duplicate address detection in the entire network to ensure its uniqueness, results in a large amount of control
Packet expense processed, consumes a large amount of Internet resources, therefore is not also suitable for wireless sense network use.
Therefore need to establish a kind of Address Autoconfiguration scheme of low overhead for wireless sensor network.
Summary of the invention
Goal of the invention: a kind of efficient the technical problem to be solved by the present invention is in view of the deficiencies of the prior art, provide
Wireless sense network address configuration implementation method.
Technical solution: the invention discloses a kind of efficient wireless sense network address configuration implementation method, the wireless biographies
Sense net includes that sensing node is constituted, and sensing node is referred to as node；Sensing node includes new node and configured node, new node
For the sensing node that address is not configured, configured node is the sensing node of configuration address；One address includes prefix and suffix；
A kind of message is as shown in the table by type of message unique definition:
| Value of message types | Message name |
| 1 | Initial message |
| 2 | Prefix message |
| 3 | Neighbours' message |
| 4 | Address message |
| 5 | Repetition message |
One new node saves an initial table, and an initialization list item includes coordinate and life cycle；One initial
Changing message includes type of message and coordinate；After the wireless sense network starting, all nodes are new node, and each node has
Unique coordinate, each new node execute operations described below:
Step 101: starting；
Step 102: new node sends an initial message, and the value of message types of the initial message is 1, and coordinate is to work as
Preceding coordinate；
Step 103: after new node receives initial message, creating an initialization list item, the seat of the initialization list item
Mark is equal to the coordinate of the initial message, and life cycle is set as maximum value, such as 1s；
Step 104: terminating.
New node establishes initial table by the above process, thus select the smallest node of coordinate to generate prefix, in this way,
It may insure that the prefix of all new nodes in the network is all consistent, so as to fast implement all new nodes in the network
The rapid configuration of address.
In the method for the invention, node one prefix binary group<prefix of preservation, address>；One node saves one
A message table, a message list item include message field and life cycle thresholding；
Node coordinate (x1, y1) and node coordinate (x2, y2) judge size according to following processes:
If x1≤x2 and y1 < y2, node coordinate (x1, y1) is less than node coordinate (x2, y2)；
If x1 < x2 and y1≤y2, node coordinate (x1, y1) is less than node coordinate (x2, y2)；
If x2≤x1 and y2 < y1, node coordinate (x1, y1) is greater than node coordinate (x2, y2)；
If x2 < x1 and y2≤y1, node coordinate (x1, y1) is greater than node coordinate (x2, y2)；
One Prefix message includes type of message, address and prefix；After one new node establishes initial table, execute following
Operation:
Step 201: starting；
Step 202: new node starts clock T1, checks initial table；If at least there is an initialization list item, this is first
The coordinate of beginningization list item is less than the coordinate of the new node, thens follow the steps 208, no to then follow the steps 203；
Step 203: the new node generates a random number R 1 and constructs an address A1, and the prefix of address A1 is R1, after
Sew the coordinate for the new node；The new node sends a Prefix message, and the value of message types of the Prefix message is 2, and address is
A1, prefix R1；The new node creates a message list item, and the message thresholding of the message list item is the Prefix message, Life Cycle
Phase is maximum value；
Step 204: new node checks message table after receiving Prefix message, if there is a message list item, the message
The address of the message thresholding of list item is equal to the address of the Prefix message, thens follow the steps 208, no to then follow the steps 205；
Step 205: the new node for receiving the Prefix message creates a message list item, the message thresholding of the message list item
Equal to the Prefix message, life cycle is set as maximum value；If the coordinate of the new node is less than in the address of the Prefix message
Suffix, then follow the steps 208, it is no to then follow the steps 206；
Step 206: the new node for receiving the Prefix message checks message table, if in the Prefix message address thresholding
Suffix is less than or equal to the address suffix of message thresholding in any one message list item, thens follow the steps 207, no to then follow the steps
208；
Step 207: the new node for receiving the Prefix message forwards the Prefix message, executes step 204；
Step 208: after clock T1 expires, new node checks message table, selects a message list item, disappears in the message list item
The suffix for ceasing the address of thresholding is minimum, sets message in the message list item for first element in the prefix binary group of oneself
The prefix of thresholding sets second element in the prefix binary group to the address of message thresholding in the message list item；This is new
Node constructs an address, and the prefix of the address is equal to first element of the prefix binary group, and suffix is equal to the new node
Coordinate sets the address of oneself for the address and is converted to configured node；
Step 209: the new node deletes the initial table of oneself；
Step 210: terminating.
New node selects the smallest new node of coordinate value to generate prefix by the above process, in this way, owning in the network
The prefix of new node is all consistent, and then prefix is combined the address for constituting oneself by new node with the coordinate of oneself, eventually becomes
Configured node, so that address configuration cost and delay be greatly lowered.
In the method for the invention, each configured node saves a neighbor table, and a neighbor entry includes address, sits
Mark and life cycle；One neighbours' message includes type of message, coordinate and address；Configured node CN1 is periodically executed following behaviour
Make:
Step 301: starting；
Step 302: configured node CN1 sends neighbours' message, and the value of message types of neighbours' message is 3, coordinate
Equal to the coordinate of configured node CN1, address is the address of configured node CN1；
Step 303: node checks neighbor table after receiving neighbours' message, if there is a neighbor entry, the neighbours
The address of list item is equal to the address of the neighbor entry, then the coordinate of the neighbor entry is updated to the coordinate of neighbours' message, will
Life cycle is set as maximum value, and otherwise, which creates a neighbor entry, and the address of the neighbor entry is equal to the neighbor table
The address of item, the coordinate of the neighbor entry are the coordinate of neighbours' message, set maximum value for life cycle；
Step 304: terminating.
Configured node establishes neighbor table by the above process to obtain the coordinate of the configured node of neighbours, such basis
The configured node of neighbours according to neighbor table can know new node building address whether in the neighbor table of oneself, thus effectively
Realize that address repeats to detect, it is ensured that the uniqueness of address, in such manner, it is possible to which address configuration delay and cost is effectively reduced.
In the method for the invention, after new node ND1 starting, neighbours' message that the configured node of neighbours is sent is listened to, and
Prefix binary group is set, and first element of the prefix binary group is equal to the prefix of neighbours' message addresses, second element etc.
In the address of neighbours' message；
One address message includes type of message, test address, sequence number and source address；
One repetition message includes type of message, test address, sequence number and destination address；
One node saves a repetition table, and a repetition list item includes test address, sequence number, destination address and life
Period；
New node ND1 executes operations described below and obtains address:
Step 401: starting；
Step 402: new node ND1 starts clock T2, constructs an address A2, and the prefix of address A2 is equal to the prefix of oneself
First element of binary group, suffix are equal to random number R 2, random number R 2 eligible 1；New node ND1 sends an address and disappears
Breath, the value of message types of the address message are 4, and test address and source address are address A2, Serial No. random number R 3；
Condition 1: the suffix for any one neighbours' message addresses thresholding that random number R 2 and new node ND1 is listened to not phases
Together；
Step 403: judgement is that new node or configured node receive the address message, is then executed if it is new node
Step 415, no to then follow the steps 404；
Step 404: configured node receives the address message, if the configured address of node is equal to the address and disappears
Test address in breath, thens follow the steps 407, no to then follow the steps 405；
Step 405: the configured node for receiving address message checks neighbor table, should if there is a neighbor entry
The address of neighbor entry is equal to the test address in the address message, thens follow the steps 407, no to then follow the steps 406；
Step 406: the configured node for receiving address message checks repetition table, should if there is a repetition list item
The test address for repeating list item is equal to the test address in the address message and sequence number is not equal to the sequence in the address message
Number, then follow the steps 408, it is no to then follow the steps 409；
Step 407: the configured node for receiving address message sends a repetition message, the message class of the repetition message
Offset is 5, and test address and sequence number are respectively test address and the sequence number of the address message, and destination address is that the address disappears
The source address of breath executes step 411；
Step 408: the configured node for receiving address message sends a repetition message, the message class of the repetition message
Offset is 5, and test address and sequence number are respectively test address and the sequence number of the address message, and destination address is that the address disappears
The source address of breath；The configured node selects a repetition list item, and the test address of the repetition list item is equal in the address message
Test address and sequence number not equal to the sequence number in the address message, which sends a repetition message, should
The value of message types of repetition message is 5, and test address and sequence number are respectively test address and the sequence number of the repetition list item, mesh
Address be the repetition list item destination address, delete the repetition list item, execute step 411；
Step 409: the configured node for receiving address message checks repetition table, should if there is a repetition list item
The test address for repeating list item is equal to the test address in the address message and sequence number is equal to the sequence number in the address message,
Then follow the steps 415, it is no to then follow the steps 410；
Step 410: the configured node for receiving address message creates repetition list item, the test of the repetition list item
Location is equal to the test address in the address message, and sequence number is equal to the sequence number in the address message, and destination address is equal to the ground
Source address in the message of location, life cycle are equal to maximum value；The source address of the address message is updated to certainly by the configured node
Oneself address forwards the address message, executes step 403；
Step 411: after node receives the repetition message, if the node is new node, thening follow the steps 415, otherwise
Execute step 412；
Step 412: the node for receiving the repetition message judges whether the address of oneself is equal to the purpose of the repetition message
Address thens follow the steps 413 if be equal to, no to then follow the steps 415；
Step 413；The node for receiving the repetition message checks repetition table, if there is a repetition list item, the repetition
The test address of list item and sequence number are respectively equal to test address and the sequence number of the repetition message, then follow the steps 414, otherwise
Execute step 415；
Step 414: receive the repetition message node select a repetition list item, the test address of the repetition list item and
Sequence number is respectively equal to test address and the sequence number of the repetition message, and the destination address of the repetition message is updated to the repetition
The destination address of list item deletes the repetition list item, sends the repetition message, executes step 411；
Step 415: after clock T2 expires, new node ND1 judges oneself whether receive the ground that destination address is equal to oneself
The repetition message of location, if so, 402 are thened follow the steps, it is no to then follow the steps 416；
Step 416: address A2 labeled as the address of oneself and is converted to configured node by new node ND1；
Step 417: terminating.
Configured node obtains the address with network uniqueness by the above process, and the above process is configured according to neighbours
The transmission of repetition message is realized by repeating table to detect address repeatability in address of node, routes without establishing,
Therefore address is effectively realized to repeat to detect, it is ensured that the uniqueness of address, and can be effectively reduced address configuration delay and cost.
The utility model has the advantages that sensing node is logical the present invention provides a kind of efficient wireless sense network address configuration implementation method
Address configuration efficiency can be improved, be enhanced with quick obtaining address with uniqueness by crossing configuration method of the present invention
Network scalability, to realize correctly communication.Present invention can apply to many necks such as traffic prosecution and agricultural engineerization
Domain is with a wide range of applications.
Detailed description of the invention
The present invention is done with reference to the accompanying drawings and detailed description and is further illustrated, of the invention is above-mentioned
And/or otherwise advantage will become apparent.
Fig. 1 is initialization process schematic diagram of the present invention.
Fig. 2 is initial table Establishing process schematic diagram of the present invention.
Fig. 3 is neighbor table Establishing process schematic diagram of the present invention.
Fig. 4 is address configuration flow diagram of the present invention.
Specific embodiment:
The present invention provides a kind of efficient wireless sense network address configuration implementation method, sensing node institute through the invention
The configuration method stated can be improved address configuration efficiency, be enhanced network scalability with quick obtaining address with uniqueness,
To realize correctly communication.Present invention can apply to the numerous areas such as traffic prosecution and agricultural engineerization, have extensive
Application prospect.
Fig. 1 is initialization process schematic diagram of the present invention.The wireless sense network includes that sensing node is constituted, sensing
Node is referred to as node；Sensing node includes new node and configured node, and new node is the sensing node that address is not configured,
Configuration node is the sensing node of configuration address；One address includes prefix and suffix；
A kind of message is as shown in the table by type of message unique definition:
| Value of message types | Message name |
| 1 | Initial message |
| 2 | Prefix message |
| 3 | Neighbours' message |
| 4 | Address message |
| 5 | Repetition message |
One new node saves an initial table, and an initialization list item includes coordinate and life cycle；One initial
Changing message includes type of message and coordinate；After the wireless sense network starting, all nodes are new node, and each node has
Unique coordinate, each new node execute operations described below:
Step 101: starting；
Step 102: new node sends an initial message, and the value of message types of the initial message is 1, and coordinate is to work as
Preceding coordinate；
Step 103: after new node receives initial message, creating an initialization list item, the seat of the initialization list item
Mark is equal to the coordinate of the initial message, and life cycle is set as maximum value, such as 1s；
Step 104: terminating.
New node establishes initial table by the above process, thus select the smallest node of coordinate to generate prefix, in this way,
It may insure that the prefix of all new nodes in the network is all consistent, so as to fast implement all new nodes in the network
The rapid configuration of address.
Fig. 2 is initial table Establishing process schematic diagram of the present invention.One node preservation, one prefix binary group < preceding
Sew, address >；One node saves a message table, and a message list item includes message field and life cycle thresholding；
Node coordinate (x1, y1) and node coordinate (x2, y2) judge size according to following processes:
If x1≤x2 and y1 < y2, node coordinate (x1, y1) is less than node coordinate (x2, y2)；
If x1 < x2 and y1≤y2, node coordinate (x1, y1) is less than node coordinate (x2, y2)；
If x2≤x1 and y2 < y1, node coordinate (x1, y1) is greater than node coordinate (x2, y2)；
If x2 < x1 and y2≤y1, node coordinate (x1, y1) is greater than node coordinate (x2, y2)；
One Prefix message includes type of message, address and prefix；After one new node establishes initial table, execute following
Operation:
Step 201: starting；
Step 202: new node starts clock T1, checks initial table；If at least there is an initialization list item, this is first
The coordinate of beginningization list item is less than the coordinate of the new node, thens follow the steps 208, no to then follow the steps 203；
Step 203: the new node generates a random number R 1 and constructs an address A1, and the prefix of address A1 is R1, after
Sew the coordinate for the new node；The new node sends a Prefix message, and the value of message types of the Prefix message is 2, and address is
A1, prefix R1；The new node creates a message list item, and the message thresholding of the message list item is the Prefix message, Life Cycle
Phase is maximum value；
Step 204: new node checks message table after receiving Prefix message, if there is a message list item, the message
The address of the message thresholding of list item is equal to the address of the Prefix message, thens follow the steps 208, no to then follow the steps 205；
Step 205: the new node for receiving the Prefix message creates a message list item, the message thresholding of the message list item
Equal to the Prefix message, life cycle is set as maximum value；If the coordinate of the new node is less than in the address of the Prefix message
Suffix, then follow the steps 208, it is no to then follow the steps 206；
Step 206: the new node for receiving the Prefix message checks message table, if in the Prefix message address thresholding
Suffix is less than or equal to the address suffix of message thresholding in any one message list item, thens follow the steps 207, no to then follow the steps
208；
Step 207: the new node for receiving the Prefix message forwards the Prefix message, executes step 204；
Step 208: after clock T1 expires, new node checks message table, selects a message list item, disappears in the message list item
The suffix for ceasing the address of thresholding is minimum, sets message in the message list item for first element in the prefix binary group of oneself
The prefix of thresholding sets second element in the prefix binary group to the address of message thresholding in the message list item；This is new
Node constructs an address, and the prefix of the address is equal to first element of the prefix binary group, and suffix is equal to the new node
Coordinate sets the address of oneself for the address and is converted to configured node；
Step 209: the new node deletes the initial table of oneself；
Step 210: terminating.
New node selects the smallest new node of coordinate value to generate prefix by the above process, in this way, owning in the network
The prefix of new node is all consistent, and then prefix is combined the address for constituting oneself by new node with the coordinate of oneself, eventually becomes
Configured node, so that address configuration cost and delay be greatly lowered.
Fig. 3 is neighbor table Establishing process schematic diagram of the present invention.One neighbor table of each configured node preservation, one
A neighbor entry includes address, coordinate and life cycle；One neighbours' message includes type of message, coordinate and address；It is configured
Node CN1 is periodically executed operations described below:
Step 301: starting；
Step 302: configured node CN1 sends neighbours' message, and the value of message types of neighbours' message is 3, coordinate
Equal to the coordinate of configured node CN1, address is the address of configured node CN1；
Step 303: node checks neighbor table after receiving neighbours' message, if there is a neighbor entry, the neighbours
The address of list item is equal to the address of the neighbor entry, then the coordinate of the neighbor entry is updated to the coordinate of neighbours' message, will
Life cycle is set as maximum value, and otherwise, which creates a neighbor entry, and the address of the neighbor entry is equal to the neighbor table
The address of item, the coordinate of the neighbor entry are the coordinate of neighbours' message, set maximum value for life cycle；
Step 304: terminating.
Configured node establishes neighbor table by the above process to obtain the coordinate of the configured node of neighbours, such basis
The configured node of neighbours according to neighbor table can know new node building address whether in the neighbor table of oneself, thus effectively
Realize that address repeats to detect, it is ensured that the uniqueness of address, in such manner, it is possible to which address configuration delay and cost is effectively reduced.
Fig. 4 is address configuration flow diagram of the present invention.After new node ND1 starting, the configured section of neighbours is listened to
Neighbours' message that point is sent, and prefix binary group is set, first element of the prefix binary group is equal to neighbours' message addresses
Prefix, second element be equal to the address of neighbours' message；
One address message includes type of message, test address, sequence number and source address；
One repetition message includes type of message, test address, sequence number and destination address；
One node saves a repetition table, and a repetition list item includes test address, sequence number, destination address and life
Period；
New node ND1 executes operations described below and obtains address:
Step 401: starting；
Step 402: new node ND1 starts clock T2, constructs an address A2, and the prefix of address A2 is equal to the prefix of oneself
First element of binary group, suffix are equal to random number R 2, random number R 2 eligible 1；New node ND1 sends an address and disappears
Breath, the value of message types of the address message are 4, and test address and source address are address A2, Serial No. random number R 3；
Condition 1: the suffix for any one neighbours' message addresses thresholding that random number R 2 and new node ND1 is listened to not phases
Together；
Step 403: judgement is that new node or configured node receive the address message, is then executed if it is new node
Step 415, no to then follow the steps 404；
Step 404: configured node receives the address message, if the configured address of node is equal to the address and disappears
Test address in breath, thens follow the steps 407, no to then follow the steps 405；
Step 405: the configured node for receiving address message checks neighbor table, should if there is a neighbor entry
The address of neighbor entry is equal to the test address in the address message, thens follow the steps 407, no to then follow the steps 406；
Step 406: the configured node for receiving address message checks repetition table, should if there is a repetition list item
The test address for repeating list item is equal to the test address in the address message and sequence number is not equal to the sequence in the address message
Number, then follow the steps 408, it is no to then follow the steps 409；
Step 407: the configured node for receiving address message sends a repetition message, the message class of the repetition message
Offset is 5, and test address and sequence number are respectively test address and the sequence number of the address message, and destination address is that the address disappears
The source address of breath executes step 411；
Step 408: the configured node for receiving address message sends a repetition message, the message class of the repetition message
Offset is 5, and test address and sequence number are respectively test address and the sequence number of the address message, and destination address is that the address disappears
The source address of breath；The configured node selects a repetition list item, and the test address of the repetition list item is equal in the address message
Test address and sequence number not equal to the sequence number in the address message, which sends a repetition message, should
The value of message types of repetition message is 5, and test address and sequence number are respectively test address and the sequence number of the repetition list item, mesh
Address be the repetition list item destination address, delete the repetition list item, execute step 411；
Step 409: the configured node for receiving address message checks repetition table, should if there is a repetition list item
The test address for repeating list item is equal to the test address in the address message and sequence number is equal to the sequence number in the address message,
Then follow the steps 415, it is no to then follow the steps 410；
Step 410: the configured node for receiving address message creates repetition list item, the test of the repetition list item
Location is equal to the test address in the address message, and sequence number is equal to the sequence number in the address message, and destination address is equal to the ground
Source address in the message of location, life cycle are equal to maximum value；The source address of the address message is updated to certainly by the configured node
Oneself address forwards the address message, executes step 403；
Step 411: after node receives the repetition message, if the node is new node, thening follow the steps 415, otherwise
Execute step 412；
Step 412: the node for receiving the repetition message judges whether the address of oneself is equal to the purpose of the repetition message
Address thens follow the steps 413 if be equal to, no to then follow the steps 415；
Step 413；The node for receiving the repetition message checks repetition table, if there is a repetition list item, the repetition
The test address of list item and sequence number are respectively equal to test address and the sequence number of the repetition message, then follow the steps 414, otherwise
Execute step 415；
Step 414: receive the repetition message node select a repetition list item, the test address of the repetition list item and
Sequence number is respectively equal to test address and the sequence number of the repetition message, and the destination address of the repetition message is updated to the repetition
The destination address of list item deletes the repetition list item, sends the repetition message, executes step 411；
Step 415: after clock T2 expires, new node ND1 judges oneself whether receive the ground that destination address is equal to oneself
The repetition message of location, if so, 402 are thened follow the steps, it is no to then follow the steps 416；
Step 416: address A2 labeled as the address of oneself and is converted to configured node by new node ND1；
Step 417: terminating.
Configured node obtains the address with network uniqueness by the above process, and the above process is configured according to neighbours
The transmission of repetition message is realized by repeating table to detect address repeatability in address of node, routes without establishing,
Therefore address is effectively realized to repeat to detect, it is ensured that the uniqueness of address, and can be effectively reduced address configuration delay and cost.
Embodiment 1
Based on the simulation parameter of table 1, the present embodiment simulates a kind of efficient wireless sense network address configuration in the present invention
Implementation method, performance evaluation are as follows: when sensing node quantity increases, network performance is reduced, and packet loss increases, so address is matched
Delay is set to increase, when sensing node quantity is reduced, network performance enhancing, packet loss decline, so address configuration delay reduces,
The average retardation of sensing node configuration address is 43.7ms.
1 simulation parameter of table
The present invention provides a kind of thinkings of efficient wireless sense network address configuration implementation method, implement the technology
There are many method and approach of scheme, the above is only a preferred embodiment of the present invention, it is noted that for the art
Those of ordinary skill for, various improvements and modifications may be made without departing from the principle of the present invention, these change
It also should be regarded as protection scope of the present invention into retouching.The available prior art of each component part being not known in the present embodiment adds
To realize.
Claims (4)
1. a kind of efficient wireless sense network address configuration implementation method, which is characterized in that the wireless sense network includes sensing
Node is constituted, and sensing node is referred to as node；Sensing node includes new node and configured node, and new node is that address is not configured
Sensing node, configured node be configuration address sensing node；One address includes prefix and suffix；
A kind of message is as shown in the table by type of message unique definition:
One new node saves an initial table, and an initialization list item includes coordinate and life cycle；One initialization disappears
Breath includes type of message and coordinate；After the wireless sense network starting, all nodes are new node, and each node has unique
Coordinate, each new node executes operations described below:
Step 101: starting；
Step 102: new node sends an initial message, and the value of message types of the initial message is 1, and coordinate is current sits
Mark；
Step 103: after new node receives initial message, creating an initialization list item, the coordinate etc. of the initialization list item
In the coordinate of the initial message, life cycle is set as maximum value；
Step 104: terminating.
2. a kind of efficient wireless sense network address configuration implementation method according to claim 1, which is characterized in that one
Node one prefix binary group<prefix of preservation, address>；One node saves a message table, and a message list item includes message
Domain and life cycle thresholding；
Node coordinate (x1, y1) and node coordinate (x2, y2) judge size according to following processes:
If x1≤x2 and y1 < y2, node coordinate (x1, y1) is less than node coordinate (x2, y2)；
If x1 < x2 and y1≤y2, node coordinate (x1, y1) is less than node coordinate (x2, y2)；
If x2≤x1 and y2 < y1, node coordinate (x1, y1) is greater than node coordinate (x2, y2)；
If x2 < x1 and y2≤y1, node coordinate (x1, y1) is greater than node coordinate (x2, y2)；
One Prefix message includes type of message, address and prefix；After one new node establishes initial table, following behaviour are executed
Make:
Step 201: starting；
Step 202: new node starts clock T1, checks initial table；If at least there is an initialization list item, the initialization
The coordinate of list item is less than the coordinate of the new node, thens follow the steps 208, no to then follow the steps 203；
Step 203: the new node generates a random number R 1 and constructs an address A1, and the prefix of address A1 is R1, and suffix is
The coordinate of the new node；The new node sends a Prefix message, and the value of message types of the Prefix message is 2, address A1, preceding
Sew for R1；The new node creates a message list item, and the message thresholding of the message list item is the Prefix message, and life cycle is most
Big value；
Step 204: new node checks message table after receiving Prefix message, if there is a message list item, the message list item
The address of message thresholding be equal to the address of the Prefix message, then follow the steps 208, it is no to then follow the steps 205；
Step 205: the new node for receiving the Prefix message creates a message list item, and the message thresholding of the message list item is equal to
The Prefix message, life cycle are set as maximum value；If after the coordinate of the new node is less than in the address of the Prefix message
Sew, thens follow the steps 208, it is no to then follow the steps 206；
Step 206: the new node for receiving the Prefix message checks message table, if the suffix in the Prefix message address thresholding
Less than or equal to the address suffix of message thresholding in any one message list item, 207 are thened follow the steps, it is no to then follow the steps 208；
Step 207: the new node for receiving the Prefix message forwards the Prefix message, executes step 204；
Step 208: after clock T1 expires, new node checks message table, selects a message list item, message field in the message list item
The suffix of the address of value is minimum, sets message thresholding in the message list item for first element in the prefix binary group of oneself
Prefix, set second element in the prefix binary group to the address of message thresholding in the message list item；The new node
An address is constructed, the prefix of the address is equal to first element of the prefix binary group, and suffix is equal to the coordinate of the new node,
The address of oneself is set by the address and is converted to configured node；
Step 209: the new node deletes the initial table of oneself；
Step 210: terminating.
3. a kind of efficient wireless sense network address configuration implementation method according to claim 1, which is characterized in that each
Configured node saves a neighbor table, and a neighbor entry includes address, coordinate and life cycle；One neighbours' message includes
Type of message, coordinate and address；Configured node CN1 is periodically executed operations described below:
Step 301: starting；
Step 302: configured node CN1 sends neighbours' message, and the value of message types of neighbours' message is 3, and coordinate is equal to
The coordinate of configured node CN1, address are the address of configured node CN1；
Step 303: node checks neighbor table after receiving neighbours' message, if there is a neighbor entry, the neighbor entry
Address be equal to the neighbor entry address, then the coordinate of the neighbor entry is updated to the coordinate of neighbours' message, by life
Period is set as maximum value, and otherwise, which creates a neighbor entry, and the address of the neighbor entry is equal to the neighbor entry
Address, the coordinate of the neighbor entry are the coordinate of neighbours' message, set maximum value for life cycle；
Step 304: terminating.
4. a kind of efficient wireless sense network address configuration implementation method according to claim 1, which is characterized in that new section
After point ND1 starting, listen to neighbours' message that the configured node of neighbours is sent, and prefix binary group is set, the prefix binary group
First element is equal to the prefix of neighbours' message addresses, and second element is equal to the address of neighbours' message；
One address message includes type of message, test address, sequence number and source address；
One repetition message includes type of message, test address, sequence number and destination address；
One node saves a repetition table, and a repetition list item includes test address, sequence number, destination address and Life Cycle
Phase；
New node ND1 executes operations described below and obtains address:
Step 401: starting；
Step 402: new node ND1 starts clock T2, constructs an address A2, and the prefix of address A2 is equal to the prefix binary of oneself
First element of group, suffix are equal to random number R 2, random number R 2 eligible 1；New node ND1 sends an address message,
The value of message types of the address message is 4, and test address and source address are address A2, Serial No. random number R 3；
Condition 1: the suffix for any one neighbours' message addresses thresholding that random number R 2 and new node ND1 is listened to is different from；
Step 403: judgement is that new node or configured node receive the address message, is thened follow the steps if it is new node
415, it is no to then follow the steps 404；
Step 404: configured node receives the address message, if the configured address of node is equal in the address message
Test address, then follow the steps 407, it is no to then follow the steps 405；
Step 405: the configured node for receiving address message checks neighbor table, if there is a neighbor entry, the neighbours
The address of list item is equal to the test address in the address message, thens follow the steps 407, no to then follow the steps 406；
Step 406: the configured node for receiving address message checks repetition table, if there is a repetition list item, the repetition
The test address of list item is equal to the test address in the address message and sequence number is not equal to the sequence number in the address message, then
Step 408 is executed, it is no to then follow the steps 409；
Step 407: the configured node for receiving address message sends a repetition message, the value of message types of the repetition message
It is 5, test address and sequence number are respectively test address and the sequence number of the address message, and destination address is the address message
Source address executes step 411；
Step 408: the configured node for receiving address message sends a repetition message, the value of message types of the repetition message
It is 5, test address and sequence number are respectively test address and the sequence number of the address message, and destination address is the address message
Source address；The configured node selects a repetition list item, and the test address of the repetition list item is equal to the survey in the address message
It tries address and sequence number is not equal to the sequence number in the address message, which sends a repetition message, the repetition
The value of message types of message is 5, and test address and sequence number are respectively test address and the sequence number of the repetition list item, destination
Location is the destination address of the repetition list item, deletes the repetition list item, executes step 411；
Step 409: the configured node for receiving address message checks repetition table, if there is a repetition list item, the repetition
The test address of list item is equal to the test address in the address message and sequence number is equal to the sequence number in the address message, then holds
Row step 415, it is no to then follow the steps 410；
Step 410: the configured node for receiving address message creates a repetition list item, the test address etc. of the repetition list item
Test address in the address message, sequence number are equal to the sequence number in the address message, and destination address is equal to the address and disappears
Source address in breath, life cycle are equal to maximum value；The source address of the address message is updated to oneself by the configured node
Address forwards the address message, executes step 403；
Step 411: after node receives the repetition message, if the node is new node, thening follow the steps 415, otherwise execute
Step 412；
Step 412: the node for receiving the repetition message judges whether the address of oneself is equal to the destination address of the repetition message,
If be equal to, 413 are thened follow the steps, it is no to then follow the steps 415；
Step 413；The node for receiving the repetition message checks repetition table, if there is a repetition list item, the repetition list item
Test address and sequence number be respectively equal to test address and the sequence number of the repetition message, then follow the steps 414, otherwise execute
Step 415；
Step 414: the node for receiving the repetition message selects a repetition list item, the test address of the repetition list item and sequence
Number respectively equal to the repetition message test address and sequence number, the destination address of the repetition message is updated to the repetition list item
Destination address, delete the repetition list item, send the repetition message, execute step 411；
Step 415: after clock T2 expires, new node ND1 judges oneself whether to receive address of the destination address equal to oneself
Repetition message, if so, 402 are thened follow the steps, it is no to then follow the steps 416；
Step 416: address A2 labeled as the address of oneself and is converted to configured node by new node ND1；
Step 417: terminating.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910102360.5A CN109688244B (en) | 2019-02-01 | 2019-02-01 | High-efficiency wireless sensor network address configuration implementation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910102360.5A CN109688244B (en) | 2019-02-01 | 2019-02-01 | High-efficiency wireless sensor network address configuration implementation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109688244A true CN109688244A (en) | 2019-04-26 |
| CN109688244B CN109688244B (en) | 2021-08-20 |
Family
ID=66195417
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910102360.5A Active CN109688244B (en) | 2019-02-01 | 2019-02-01 | High-efficiency wireless sensor network address configuration implementation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109688244B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101465951A (en) * | 2007-12-21 | 2009-06-24 | 康佳集团股份有限公司 | Method and device for dynamically configuring IPv6 of IPv6 set-top box |
| CN102917079A (en) * | 2012-07-10 | 2013-02-06 | 中国科学技术大学 | Method for automatically configuring IPv6 (internet protocol version 6) address in wireless sensor network |
| CN103347101A (en) * | 2013-06-25 | 2013-10-09 | 常熟理工学院 | 6LoWPAN wireless sensor network address configuration method based on cluster |
| CN103945415A (en) * | 2014-05-14 | 2014-07-23 | 常熟理工学院 | Communication implementation method for wireless network |
| EP3282675A1 (en) * | 2016-08-11 | 2018-02-14 | Nxp B.V. | Network node and method for identifying a node in transmissions between neighbouring nodes of a network |
-
2019
- 2019-02-01 CN CN201910102360.5A patent/CN109688244B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101465951A (en) * | 2007-12-21 | 2009-06-24 | 康佳集团股份有限公司 | Method and device for dynamically configuring IPv6 of IPv6 set-top box |
| CN102917079A (en) * | 2012-07-10 | 2013-02-06 | 中国科学技术大学 | Method for automatically configuring IPv6 (internet protocol version 6) address in wireless sensor network |
| CN103347101A (en) * | 2013-06-25 | 2013-10-09 | 常熟理工学院 | 6LoWPAN wireless sensor network address configuration method based on cluster |
| CN103945415A (en) * | 2014-05-14 | 2014-07-23 | 常熟理工学院 | Communication implementation method for wireless network |
| EP3282675A1 (en) * | 2016-08-11 | 2018-02-14 | Nxp B.V. | Network node and method for identifying a node in transmissions between neighbouring nodes of a network |
Non-Patent Citations (1)
| Title |
|---|
| 窦正雄等: "Coordinate-based addressing for MANET", 《SPRINGER》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109688244B (en) | 2021-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yi et al. | Evaluation of routing protocol for low power and Lossy Networks: LOADng and RPL | |
| JP4838360B2 (en) | Loop detection in mobile networks | |
| CN110113264B (en) | Method for realizing cache and route of named data network | |
| CN104378290B (en) | A kind of message forwarding method and device | |
| CN109714274B (en) | Method for acquiring corresponding relation and routing equipment | |
| CN109246785A (en) | A kind of implementation method of future mobile network | |
| CN104935514A (en) | Path distribution method and device thereof | |
| Kumar et al. | AODV and OLSR routing protocols for Wireless Ad-hoc and Mesh Networks | |
| CN109150723A (en) | A kind of routing Realization Method of Communication of Internet of Things | |
| CN107979645B (en) | Internet of things implementation method | |
| CN109462549A (en) | A kind of implementation method of new generation of wireless mobile network | |
| Wagh et al. | Elimination of internal attacksfor PUMA in MANET | |
| Sahay et al. | Investigating packet dropping attacks in rpl-dodag in iot | |
| Sasidharan et al. | Improving network lifetime and reliability for machine type communications based on LOADng routing protocol | |
| Parsaei et al. | RPL load balancing in Internet of Things | |
| CN109688244A (en) | A kind of efficient wireless sense network address configuration implementation method | |
| Anitha et al. | EEDBC-M: enhancement of leach-mobile protocol with energy efficient density-based clustering for mobile sensor networks (MSNs) | |
| Saha et al. | Fidelity Index Based on Demand (FBOD) Secure Routing in Mobile Ad Hoc Network | |
| Chen et al. | A RPL based Adaptive and Scalable Data-collection Protocol module for NS-3 simulation platform | |
| Arya et al. | A routing protocol for detecting holes in wireless sensor networks with multiple sinks | |
| Soliyal et al. | Preventing packet dropping attack on AODV based routing in mobile ad-hoc MANET | |
| Farooq et al. | Impact of route length on the performance of routing and flow admission control algorithms in wireless sensor networks | |
| CN108770030B (en) | Data communication method of next generation wireless network | |
| Ramanuj et al. | Enhanced Expanding Ring Search Algorithm for AODV | |
| Mewara et al. | Throughput Performance Comparison of Reactive and Proactive Routing Protocols in Mobile Ad Hoc Networks using OPNET v14. 5 |
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 |