CN103327563A - Multi-path unicast method based on position information in wireless self-organization and sensor network - Google Patents
Multi-path unicast method based on position information in wireless self-organization and sensor network Download PDFInfo
- Publication number
- CN103327563A CN103327563A CN201310149061XA CN201310149061A CN103327563A CN 103327563 A CN103327563 A CN 103327563A CN 201310149061X A CN201310149061X A CN 201310149061XA CN 201310149061 A CN201310149061 A CN 201310149061A CN 103327563 A CN103327563 A CN 103327563A
- Authority
- CN
- China
- Prior art keywords
- grid
- node
- path
- grouping
- cost
- 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.)
- Pending
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention belongs to the technical field of wireless self-organization and sensor network protocols, and particularly relates to a multi-path unicast method based on the position in a wireless self-organization and sensor network. The multi-path unicast method based on the position in the wireless self-organization and sensor network comprises the steps that (1) a grid network structure is divided based on position information of nodes, (2) grid costs are set according to attributes and residual energy of the nodes in grids, and (3) high-energy-efficiency multiple paths used for connecting an information source and an information sink are searched based on a grid structure network. Therefore, unicast performance is optimized, and the service life of the network is prolonged.
Description
Technical field
The invention belongs to wireless Ad Hoc and sensor network protocol technical field, be specifically related to the multipath method in a kind of wireless Ad Hoc and the sensor network.In by chargeable node and the wireless Ad Hoc and sensor network that can not charge node form, but the method utilizes node location information to generate the grid network structure of support node dynamic dormancy, and according to each grid working node attribute and dump energy thereof the grid cost is set, on this basis, seek many high energy efficiency paths, footpath, realize the multipath unicast communication, to equalizing network node energy consumption, prolongation network lifetime.
Background technology
In the last few years, wireless multi-hop network (wireless sensor network, mobile Ad hoc network, the wireless mesh network etc.) correlation technique in field had obtained the extensive concern of academia and industrial quarters, and had obtained swift and violent development.
In many research directions in this field, the working life of prolonging wireless sensor network becomes one of key issue in the Design of Wireless Sensor Network as much as possible.Owing to being subject to the restriction of the factors such as cost and volume, the battery capacity of most of common wireless sensor network nodes is all very limited and can't be replenished.For improving the life-span of wireless sensor network, by in network, laying a part of chargeable node network node of solar cell (as possess), and design energy heavy duty detergent procotol is to utilize these nodes to share more communication task, in many applied environments, received good effect, become a kind of by the generally accepted raising network life of people solution.
Energy-conservation unicast communication is a kind of important method that realizes efficient wireless Ad Hoc and Sensor Network networking, prolong network lifetime.The present invention is in conjunction with the chargeable node that exists in node location information, the network, and the dynamic adjustments node dormancy arranges the grid cost according to nodal community and cost, and the multipath that selectivity is optimized is to reaching the purpose of optimizing clean culture performance and prolong network lifetime.
Summary of the invention
The present invention relates to the multipath unicast method of a kind of location-based wireless Ad Hoc and Sensor Network.The method is mainly used in the wireless Ad Hoc and Sensor Network that are comprised of chargeable and not chargeable two category nodes, at first based on node location information structure grid network structure, and according to the nodal community in each grid and dump energy the grid cost value is set, then seek the high energy efficiency multipath that connects information source s and stay of two nights t based on grid network, with the multi-path transmission of supported data, the business load in the equalizing network and energy consumption.
Make G that (V, E) represents network diagram, wherein the set of V (G) representation node, E (G) represent the set on limit in the network; Two node x ∈ V (G) and y ∈ V (G) among the figure-{ the distance note between the x} is d
XyIf satisfy d
Xy≤ R then claims limit (x, y) ∈ E (G), and the subtraction of "-" representative set, each node are equipped with a cover omnidirectional antenna, the maximum transmitted radius of R representation node; To a node x, the hop neighbor node set of N (x) representation node x, wherein x ∈ V (G) for y ∈ N (x), has (x, y) ∈ E (G); Network is in the two dimensional surface deploy, but the node in the network comprises recharging node and can not the recharging node, but the recharging node can obtain energy and be converted into electric weight from nature by means such as solar energy, mechanical systems, but recharging node set note is A, can not the recharging node battery-powered, this node set note is B, A+B=V (G)
Wherein "+" represents the add operation of set or claims union operation; For a node u ∈ B, E
uRepresent its dump energy.
This method implementation requires each node to possess oneself positional information and energy remaining information, the positional information of each neighbor node, current remaining information.
Grid network structure generation method based on node location in the described method is specific as follows:
1) selects arbitrarily or specifies the origin of coordinates O of grid network structure;
2) based on origin of coordinates O position, dividing two dimensional surface by the length of side one by one is the grating texture that the little square of r forms, and each little square is called a grid; In the partition process r must satisfy≤
With this understanding, the node of optional position can direct communication in two adjacent grids; Wherein: if
Only have then that to have two grids of common edge be adjacent cells, if
The grid that then has public vertex or common edge all is adjacent cells, and wherein R is the maximum transmitted radius of node;
3) if having chargeable node in a grid, then only need chargeable node in running order, other node sleep, and do not need by turns; Otherwise, only need the highest node of dump energy to keep operating state, other node sleep; Sleeping nodes regularly wake up communicate by letter to receive with working node in this grid/send out data; For the grid that does not have chargeable node, its working node was rotated once every the T time, and is by turns each, always selects the highest node of current remaining to serve as working node; Each working node is rotated, and then the work at present node will be transferred all state informations to next working node; Working node in each grid can according to the position coordinates of oneself, calculate the grid at own place and the grid at each neighbor node place, so each node be known all nodes that belong to same grid together;
4) each grid is set the grid cost in conjunction with this grid internal node attribute and dump energy thereof.
Grid cost method to set up is in the described method: if having at least one chargeable node in a grid, then this grid cost is 0; Otherwise the cost of a grid is the inverse of work at present residue energy of node in this grid.
High energy efficiency multipath path-finding method based on the grid network structure in the described method is:
1) information source s at first seeks the footpath grouping to one of network inundation, and its path of having passed by is up to now carried in this grouping, and initial value is s; The cost in its path of having passed by is up to now carried in this grouping, and initial value is 0;
2) working node of a grid, if the stay of two nights does not belong to this grid, then carry out following operation:
If after receiving article one and seek footpath grouping from neighbours' grid, at first own ID is appended to this and seek on " path of having passed by up to now " of carrying in dividing into groups in the footpath, and upgrade passed by the up to now cost in path of this grouping; Working node is set up the list item relevant with this session in this locality; If the work at present node is chargeable node, then immediately this to be sought the footpath forwarding of packets to the neighbours' grid of oneself, otherwise will start a repeating timer, timing length is T2 * this grid cost;
If a. before the timer expiry, receive the directly grouping of seeking of repetition from other neighbours' grids, if and seeking of newly the receiving path cost that footpath grouping passes by is less than the path cost that the footpath grouping is passed by of seeking of receiving before, then carry out following steps: the ID of oneself is attached to new seeking on " path of having passed by up to now " of carrying in the grouping of footpath, and upgrade passed by the up to now cost in path of this grouping, upgrade the local list item relevant with this session;
If timer expiry is b. then sought this footpath forwarding of packets to neighbours' grid, this section is named a person for a particular job and is no longer processed repeat relevant with this session and seek directly and dividing into groups afterwards;
3) if stay of two nights t belongs to current grid, the working node of this grid waits for a period of time and more seeks the footpath grouping to receiving; Then, one or more routing information of finding is encapsulated in the route replies grouping, then in the path of finding, along the shortest inverse path the routing information of finding is sent to information source s; Do not receive the node of route replies grouping, after a period of time, automatically delete the route table items relevant with this session;
4) after information source s received route replies grouping, information source just can be along the descending transmission packet in the path of finding.
The path cost update method is specially in the described method: the working node of a grid receive one seek footpath grouping after, then the cost of this grid is added to the footpath of seeking of receiving and divides into groups on entrained " cost in the path of having passed by up to now ".
The multi-path data transmission method is specific as follows in the described method: if only found a paths, then all data of this session all send along this path, otherwise send a grouping at every turn, from the multipath of finding, select at random one to carry out the data transmission or adopt endless form to send data to the path of every discovery successively; Data send and adopt the source routing pattern, carry the whole piece routing information in each packet.
Description of drawings
Fig. 1 is grid network structure division method schematic diagram.
Embodiment
Grid network structure generation method based on node location:
1) origin of coordinates of grid network structure can be selected arbitrarily, also can be appointment, and note is O;
2) based on origin of coordinates O position, dividing two dimensional surface by the length of side one by one is the grating texture that the little square of r forms, and each little square is called a grid; In the partition process r must satisfy≤
With this understanding, the node of optional position can direct communication in two adjacent grids; If
Only have then that to have two grids of common edge be adjacent cells, if
The grid that then has public vertex or common edge all is adjacent cells, specifically referring to accompanying drawing 1;
3) if having chargeable node in a grid, then only need chargeable node in running order, other node sleep, and do not need by turns; Otherwise, only need the highest node of dump energy to keep operating state, other node sleep; Sleeping nodes regularly wake up communicate by letter to receive with working node in this grid/send out data; For the grid that does not have chargeable node, its working node was rotated once every the T time, and is by turns each, always selects the highest node of current remaining to serve as working node, such as T=10 minute, 30 minutes or 1 day; Each working node by turns, then the work at present node will be transferred all state informations to next working node, such as connection status etc.; Working node in each grid can according to the position coordinates of oneself, calculate own place grid and each neighbor node place grid, so each node be known all nodes that belong to same grid together.
Grid cost method to set up
If there is at least one chargeable node in the grid, then this grid cost is 0; Otherwise the cost of a grid is the inverse of work at present residue energy of node in this grid.
High energy efficiency multipath path-finding method based on the grid network structure
1) information source s at first seeks the footpath grouping to one of network inundation, and its path of having passed by is up to now carried in this grouping, and initial value is s; The cost in its path of having passed by is up to now carried in this grouping, and initial value is 0;
2) working node of a grid, if the stay of two nights does not belong to this grid, then carry out following operation:
If after receiving article one and seek footpath grouping from neighbours' grid, at first own ID is appended to this and seek on " path of having passed by up to now " of carrying in dividing into groups in the footpath, and upgrade this grouping " cost in the path of having passed by up to now "; Working node is set up the list item relevant with this session in this locality; If the work at present node is chargeable node, then immediately this to be sought the footpath forwarding of packets to the neighbours' grid of oneself, otherwise will start a repeating timer, timing length is T2 * this grid cost, such as the T2=100 millisecond;
If a. before the timer expiry, receive the directly grouping of seeking of repetition from other neighbours' grids, if and seeking of newly the receiving path cost that footpath grouping passes by is less than the path cost that the footpath grouping is passed by of seeking of receiving before, then carry out following steps: the ID of oneself is appended to new seeking on " path of having passed by up to now " of carrying in the grouping of footpath, and upgrade this grouping " cost in the path of having passed by up to now ", upgrade the local list item relevant with this session;
If timer expiry is b. then sought this footpath forwarding of packets to neighbours' grid, this section is named a person for a particular job and is no longer processed repeat relevant with this session and seek directly and dividing into groups afterwards;
3) if the stay of two nights belongs to current grid, the working node of this grid waits for a period of time and more seeks footpath grouping to receiving, that is: multipath, as waited for for 1.5 seconds.Then, one or more routing information of finding is encapsulated in the route replies grouping, then in the path of finding, along the shortest inverse path the routing information of finding is sent to information source; Do not receive the node of route replies grouping, after a period of time (such as 1500 milliseconds), automatically delete the route table items relevant with this session;
4) after information source s received route replies grouping, information source just can be along the descending transmission packet in the path of finding.
The path cost update method:
The working node of a grid receive one seek footpath grouping after, then the cost of this grid is added to the footpath of seeking of receiving and divides into groups on entrained " cost in the path of having passed by up to now ".
The multi-path data sending method:
If only found a paths, then all data of this session all send along this path, otherwise send a grouping at every turn, from the multipath of finding, select at random one to carry out the data transmission or adopt endless form (round robin) to send data in the path to every discovery successively; Carry the whole piece routing information in each packet, that is: data send the source routing pattern that adopts.
Claims (6)
1. a location-based wireless Ad Hoc and Sensor Network multipath unicast method, it is characterized in that: in the wireless Ad Hoc and Sensor Network that are formed by chargeable and not chargeable two category nodes, at first based on node location information structure grid network structure, and according to the nodal community in each grid and dump energy the grid cost value is set, then seek the high energy efficiency multipath that connects information source s and stay of two nights t based on grid network, with the multi-path transmission of supported data, the business load in the equalizing network and energy consumption.
2. method according to claim 1 is characterized in that, wherein the grid network structure generation method based on node location is:
1) selects arbitrarily or specifies the origin of coordinates O of grid network structure;
2) based on origin of coordinates O position, dividing two dimensional surface by the length of side one by one is the grating texture that the little square of r forms, and each little square is called a grid; In the partition process r must satisfy≤
With this understanding, the node of optional position can direct communication in two adjacent grids; Wherein: if
Only have then that to have two grids of common edge be adjacent cells, if
The grid that then has public vertex or common edge all is adjacent cells, and wherein R is the maximum transmitted radius of node;
3) if having chargeable node in a grid, then only need chargeable node in running order, other node sleep, and do not need by turns; Otherwise, only need the highest node of dump energy to keep operating state, other node sleep; Sleeping nodes regularly wake up communicate by letter to receive with working node in this grid/send out data; For the grid that does not have chargeable node, its working node was rotated once every the T time, and is by turns each, always selects the highest node of current remaining to serve as working node; Each working node is rotated, and then the work at present node will be transferred all state informations to next working node; Working node in each grid can according to the position coordinates of oneself, calculate the grid at own place and the grid at each neighbor node place, so each node be known all nodes that belong to same grid together;
4) each grid is set the grid cost in conjunction with this grid internal node attribute and dump energy thereof.
3. method according to claim 2 is characterized in that, wherein grid cost method to set up is:
If there is at least one chargeable node in the grid, then this grid cost is 0; Otherwise the cost of a grid is the inverse of work at present residue energy of node in this grid.
4. one of according to claim 1-3 described method is characterized in that, wherein the high energy efficiency multipath path-finding method based on the grid network structure is:
1) information source s at first seeks the footpath grouping to one of network inundation, and its path of having passed by is up to now carried in this grouping; The cost in its path of having passed by is up to now carried in this grouping, and initial value is 0;
2) for the stay of two nights working node in same grid not, then carry out following operation:
If after receiving article one and seek footpath grouping from neighbours' grid, at first own ID is appended to this and seek on " path of having passed by up to now " of carrying in dividing into groups in the footpath, and upgrade this grouping " cost in the path of having passed by up to now "; Working node is set up the list item relevant with this session in this locality; If the work at present node is chargeable node, then immediately this to be sought the footpath forwarding of packets to the neighbours' grid of oneself, otherwise will start a repeating timer, timing length is T2 * this grid cost;
If a. before the timer expiry, receive the directly grouping of seeking of repetition from other neighbours' grids, if and seeking of newly the receiving path cost that footpath grouping passes by is less than the path cost that the footpath grouping is passed by of seeking of receiving before, then carry out following steps: the ID of oneself is appended to new seeking on " path of having passed by up to now " of carrying in the grouping of footpath, and upgrade this grouping " cost in the path of having passed by up to now ", upgrade the local list item relevant with this session;
If timer expiry is b. then sought this footpath forwarding of packets to neighbours' grid, this section is named a person for a particular job and is no longer processed repeat relevant with this session and seek directly and dividing into groups afterwards;
3) if stay of two nights t belongs to current grid, the working node of this grid waits for a period of time and more seeks the footpath grouping to receiving; Then, one or more routing information of finding is encapsulated in the route replies grouping, then in the path of finding, along the shortest inverse path the routing information of finding is sent to information source s; Do not receive the node of route replies grouping, after a period of time, automatically delete the route table items relevant with this session;
4) after information source s received route replies grouping, information source just can be along the descending transmission packet in the path of finding.
5. method according to claim 4, it is characterized in that, wherein the path cost update method is specially: the working node of a grid receive one seek footpath grouping after, then the cost of this grid is added to the footpath of seeking of receiving and divides into groups on entrained " cost in the path of having passed by up to now ".
6. method according to claim 1, it is characterized in that, wherein the multi-path data transmission method is specific as follows: if only found a paths, then all data of this session all send along this path, otherwise send a grouping at every turn, from the multipath of finding, select at random one to carry out the data transmission or adopt endless form to send data to the path of every discovery successively; Data send and adopt the source routing pattern, carry the whole piece routing information in each packet.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310149061XA CN103327563A (en) | 2013-04-25 | 2013-04-25 | Multi-path unicast method based on position information in wireless self-organization and sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310149061XA CN103327563A (en) | 2013-04-25 | 2013-04-25 | Multi-path unicast method based on position information in wireless self-organization and sensor network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103327563A true CN103327563A (en) | 2013-09-25 |
Family
ID=49196029
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310149061XA Pending CN103327563A (en) | 2013-04-25 | 2013-04-25 | Multi-path unicast method based on position information in wireless self-organization and sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103327563A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109195192A (en) * | 2018-08-16 | 2019-01-11 | 全球能源互联网研究院有限公司 | Balancing energy dispatching method, device, system and the storage medium of wireless sense network |
| CN110708241A (en) * | 2014-02-13 | 2020-01-17 | 洛克波特网络股份有限公司 | Method for routing packets in a distributed direct interconnection network |
-
2013
- 2013-04-25 CN CN201310149061XA patent/CN103327563A/en active Pending
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110708241A (en) * | 2014-02-13 | 2020-01-17 | 洛克波特网络股份有限公司 | Method for routing packets in a distributed direct interconnection network |
| CN109195192A (en) * | 2018-08-16 | 2019-01-11 | 全球能源互联网研究院有限公司 | Balancing energy dispatching method, device, system and the storage medium of wireless sense network |
| CN109195192B (en) * | 2018-08-16 | 2022-04-01 | 全球能源互联网研究院有限公司 | Energy balance scheduling method, device and system for wireless sensor network and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wei et al. | Cluster-based routing protocols in wireless sensor networks: a survey | |
| Xie et al. | Cluster-based routing for the mobile sink in wireless sensor networks with obstacles | |
| Bhushan et al. | A comprehensive survey of secure and energy efficient routing protocols and data collection approaches in wireless sensor networks | |
| Cirstea | Energy efficient routing protocols for Wireless Sensor Networks: A survey | |
| Zhu et al. | Energy-efficient tree-based message ferrying routing schemes for wireless sensor networks | |
| CN108541039B (en) | Low-power-consumption wireless sensor network static node routing method | |
| Leu et al. | Adaptive power-aware clustering and multicasting protocol for mobile ad hoc networks | |
| CN103327563A (en) | Multi-path unicast method based on position information in wireless self-organization and sensor network | |
| Meenakshi et al. | Energy efficient hierarchical clustering routing protocol for wireless sensor networks | |
| Zhou et al. | Adaptive working schedule for duty-cycle opportunistic mobile networks | |
| Agrawal et al. | Layered clustering routing protocol with overlapping cluster heads in WSN | |
| Sivaraj et al. | Energy-efficient and load distributed clustering algorithm for dense wireless sensor networks | |
| Al et al. | Energy-efficient communication protocol for wireless sensor networks | |
| CN103067870A (en) | Wireless sensor network high-efficiency broadcasting method based on distances | |
| Boulhares et al. | Hybridizing PEGASIS with LEACH-1R protocols in wireless sensor networks | |
| Jing et al. | A cluster-based multipath delivery scheme for wireless sensor networks | |
| Gotefode et al. | Energy efficiency in wireless sensor network using fuzzy rule and tree based routing protocol | |
| CN103067860A (en) | Wireless self-organization and sensor network multicast method based on location information | |
| Islam et al. | Recent trends in energy-efficient clustering in WSNs | |
| Garg et al. | A Review Of Efficient Clustering Algorithms Used in MANET | |
| CN103037317A (en) | Energy-conservation multicasting method based on relay group in wireless self-organized and sensor network | |
| Amit et al. | AOMDV with multi-tier multi-hop clustering in wireless sensor networks | |
| Sharma et al. | Heterogeneous multi-hop LEACH routing protocol | |
| Baranidharan et al. | An Energy Efficient Clustering Protocol Using Minimum Spanning Tree for Wireless Sensor Networks | |
| Thomas et al. | Energy efficient dynamic multi-level hierarchical clustering technique for network discovery in wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130925 |