CN103024858B - For the low-power consumption directional broadcasting method of wireless sensor network - Google Patents
For the low-power consumption directional broadcasting method of wireless sensor network Download PDFInfo
- Publication number
- CN103024858B CN103024858B CN201310010943.8A CN201310010943A CN103024858B CN 103024858 B CN103024858 B CN 103024858B CN 201310010943 A CN201310010943 A CN 201310010943A CN 103024858 B CN103024858 B CN 103024858B
- Authority
- CN
- China
- Prior art keywords
- node
- fan
- shaped
- route
- broadcast
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
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
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention is to provide a kind of low-power consumption directional broadcasting method for wireless sensor network.Comprise the steps: the first step: initialization network topology; Second step: divide sector region; 3rd step: determine sensing radius; 4th step: directional broadcasting; 5th step: route discovery.The mode that AODV in original Routing Protocol is searched route by the present invention adds the thought of directional broadcasting, only for the broadcast of part at the node of defined sector region, to not carrying out packet loss process at the node that directional broadcasting is fan-shaped, therefore the energy of the sensor node of packet loss process just can store, to treat application next time, a lot of network performances of wireless sensor network can be improved by analysis of simulation experiment DB_AODV agreement.
Description
Technical field
What the present invention relates to is a kind of directional broadcasting strategy of wireless sensor network.
Background technology
Energy of wireless sensor network is limited is the of paramount importance factor restricting radio sensing network, just node failure is meaned once depleted of energy, the loss of data may be caused or cannot transmit, because wireless sensor network is often operated in bad environments or more dangerous search coverage, so it is very difficult to change battery.
The progress of cell hardware is slower in recent years, researcher is converted to the research to network routing protocol direction gradually, when traditional AODV protocol needs to set up route in AODV agreement, first source node broadcasts a route requests (Route Request, RREQ) grouping.When intermediate node receives RREQ, first the information provided according to this RREQ is established to the reverse route of upper hop, then the routing table of oneself is searched, if find that there is the effective routing of destination node, so transmit route replies (Route Replay, RREP) grouping by reverse route.If be not found to the effective routing of destination node, so just the RREQ received is broadcast to neighbor node, until this RREQ arrives destination node, generates RREP by destination node, and pass to source node along the reverse route set up.As shown in Figure 8, No. 0 node is source node, and No. 11 nodes are destination nodes.No. 0 node sends request message RREP to set up its route to No. 11 nodes, and just initiate to reply message RREQ to No. 0 source node until No. 11 destination nodes receive request message, the final path set up is { 0,7,10,11}.When same route requests message RREQ has some different reply message RREP, source node is by according to the destination node sequence number marked in all reply message RREP, choosing the destination node sequence number marked in RREP is that message is replied in maximum conduct, or mark in RREP destination node sequence number identical time, choose the minimum conduct of jumping figure in RREP and reply message, thus set up route according to reply message.
Energy of wireless sensor network problem has become study hotspot now and difficult point, what traditional wireless sensor network route discovery strategy adopted is AODV agreement, AODV agreement is by setting up route to the whole network broadcast route request message, but on the basis in the direction of known destination node, some unnecessary broadcast can be formed.
Summary of the invention
The object of the present invention is to provide a kind of low-power consumption directional broadcasting method for wireless sensor network that can improve a lot of network performances of wireless sensor network.
The object of the present invention is achieved like this:
The first step: initialization network topology
Wireless sensor node is after deployment, according to from the known coordinate information of sink node, carry out Coordinate Conversion, determine the position of destination node in the coordinate system being the origin of coordinates with work at present node, with the positive direction that this direction is x-axis, determine the coordinate system of working node;
Second step: divide sector region
According to the x-axis direction determined with x-axis be angular bisector with 2/3 π for of drift angle determination sensing scope is fan-shaped, divide equally another two fan-shaped;
3rd step: determine sensing radius
Fan-shaped according to what obtain, each fan-shaped in namely to increase through-put power by increasing sensing radius method search neighbor node, make each fan-shaped at least existence neighbor node, neighbor node is numbered according to place is fan-shaped, number information is inserted in the middle of packet;
4th step: directional broadcasting
Using directed broadcast in route finding process, the node having marked the fan-shaped numbering of orientation is received to the RREQ message of source node broadcast, the node IP address that message comprises, energy information, fan-shaped numbering, broadcast type relevant information, carry out the process of write nodal information, receive source node broadcast packet but not belong to directed fan-shaped node the broadcast packet received is carried out packet loss process, determination methods is according to forward node criterion;
5th step: route discovery
The node receiving RREQ message judges node for the purpose of oneself whether, if not destination node, then carry out the first step to the iteration process of the 4th step thus build route, if destination node then route construction success, the opposite direction along constructed route carries out transmission data manipulation.
The present invention is the technical research that the agreement being AODV based on Wireless Sensor Network Routing Protocol is improved, and devise a kind of route discovery algorithm (DB_AODV) of directional broadcasting, the method has the following advantages:
(1) DB_AODV agreement is compared traditional AODV agreement and is improved a lot at Packet delivery fractions, group delivery ratio is an index describing network quality, for representing that the packet sent out from source node within a certain period of time can be successfully transmitted to the ratio of destination node.Scale in an experiment by changing topological structure is tested and is added the AODV agreement of directional broadcasting algorithm and the performance (see figure 5) of puppy parc.
(2) degree of communication: network just can be made not to be communicated with if sensor network at least will remove k sensor node, this just claims network k to be communicated with, or the degree of communication claiming network is k.Topology controls generally to ensure that network is communicated with (1 is communicated with).No matter be radio frequency network, ADHOC network, or wireless sensor network are all utilize the multi-hop transmission between two nodes to connect, so the degree of communication of topology is most important.So Topology Control Algorithm must ensure the connectedness of network, this is also the most basic demand that topology controls.In the whole process of algorithm, along with dissipation of energy, node can exit network because exhausting energy gradually, this will certainly cause the direct impact on degree of communication, herein after regular hour experiment, by weighing the degree of communication of topology to the ratio of working node in total node be communicated with, as shown in the figure, the a very long time advantage of degree of communication in algorithmic procedure is unconspicuous, but after algorithm carries out a period of time, due to the increase of each broadcast node dissipation energy of AODV, algorithm still can ensure certain degree of communication.(see figure 6).
(3) network energy loss: the load of network topology balancing energy is the comprehensive important indicator considering network performance, energy consumption level have recorded the energy total value consumed at all nodes of a certain operation time, DB_AODV algorithm can make single node broadcasting efficiency in topology improve 67%, and overall energy consumption reduces about 20%(and sees Fig. 7).
Accompanying drawing explanation
Fig. 1 neighbor node sector diagram;
The algorithm examples sketch of Fig. 2 DB_AODV;
Fig. 3 DB_AODV algorithm application instance graph;
Fig. 4 forward node criterion figure;
Fig. 5 Packet delivery fractions simulation result figure;
Fig. 6 degree of communication experiment effect figure
Fig. 7 network energy consumption design sketch
Fig. 8 traditional broadcast figure.
Embodiment
Energy of wireless sensor network problem is the technological difficulties that govern Internet of Things development always, wireless sensor network searches node, what set up route employing is traditional AODV agreement, AODV agreement sets up the form of the whole network broadcast that route adopts, each node broadcasts the RREQ message oneself received, until message arrives destination node, set up route, in this process, a lot of node there is no need to broadcast, the foundation of route has also only used small part node, the present invention have devised a kind of strategy of directional broadcasting accordingly, the mode of AODV in original Routing Protocol being searched route adds the thought of directional broadcasting, only for the broadcast of part at the node of defined sector region, to not carrying out packet loss process at the node that directional broadcasting is fan-shaped, therefore the energy of the sensor node of packet loss process just can store, to treat application next time, a lot of network performances of wireless sensor network can be improved by analysis of simulation experiment DB_AODV agreement.Concrete technical scheme is described below:
Before description DB_AODV method, provide in method the several conditions that can use:
1, power
Node determination distance sensing is enough to make a hop neighbor node around receive and reply data-message.
2, energy consumption
Node energy consumption does not consider the energy ezpenditure that itself calculates, because compared with all energy consumptions of transmission, it is very little for calculating the cost paid.
3, node coordinate
Each node is known itself is the coordinate of the coordinate system of initial point relative to sink gateway node.
4, topological density
Topology density is enough, and the present invention is set to the square area of 300*300m, can ensure that the step of searching neighbor node is carried out smoothly.
DB_AODV method is always divided into five steps:
The first step: initialization network topology
Wireless sensor node is after deployment, according to from the known coordinate information of sink node, carry out Coordinate Conversion, determine the position of destination node in the coordinate system being the origin of coordinates with work at present node, with the positive direction that this direction is x-axis, determine the coordinate system of working node.
Second step: divide sector region
Conveniently transducer is to the identification of node, according to the x-axis direction determined with x-axis be angular bisector with 2/3 π for of drift angle determination sensing scope is fan-shaped, divide equally another two fan-shaped, three regions are made to have effective identification by the amendment to specific fields in transmission packet, mark, the operation after convenient.
3rd step: determine sensing radius
Fan-shaped according to what obtain, each fan-shaped in by increase sensing radius (namely increasing through-put power) method search neighbor node, make each fan-shaped at least existence neighbor node, the sensing radius now determined is three fan-shaped maximums determining sensing radius, this value can make three fan-shaped central each fan-shaped at least existence transducer neighbor node, neighbor node is marked according to fan-shaped numbering used, markup information is inserted in the middle of packet.
4th step: directional broadcasting
The thought of using directed broadcast in route finding process, the node having marked the fan-shaped numbering of orientation is received to the RREQ message of source node broadcast, the node IP address that message comprises, energy information, fan-shaped numbering, broadcast type etc. relevant information carries out the process such as write nodal information, receives source node broadcast packet and does not but belong to the fan-shaped node of numbered orientation and the broadcast packet received is carried out packet loss process, and determination methods is according to forward node criterion.
5th step: route discovery
Node in the middle of each transmitting procedure will carry out aforesaid operations, namely the node receiving RREQ message needs to judge node for the purpose of oneself whether, if not the destination node that will transmit, so to carry out the first step to the iteration process of the 4th step thus build route, if destination node then route construction success, the opposite direction along constructed route carries out transmission data manipulation.
0 is source node, according to the coordinate information determination destination node direction of sink node switching after, trisection is carried out to the sensitive zones of 0, make eachly fan-shapedly there is neighbor node at 0 peripheral region by increasing the mode of through-put power, determine sensing radius, forward node is chosen from orientation is fan-shaped, to determine in the node (see figure 2) figure that lower step forwards that 0 for source node according to the orientation chosen is fan-shaped, neighbor node in orientation is fan-shaped is 5 and 6, only these two nodes are forwarded, other nodes judge whether to forward by forward node criterion after accepting RREQ message, packet loss process is carried out if ineligible, following 5, the forward node of 6 nodes is 7 nodes, determine that 10 nodes are down hop forward node by identical step, confirmable route is { 0 accordingly, 5, 7, 10, 11} and { 0, 6, 7, 10, 11}, relatively just final Route Selection can be determined by certain, each node in directed set of node will perform said process, the object of directional broadcasting just can be realized by above algorithm, general broadcast scope of 2 π radians around node carries out searching next step forward node, and the present invention only fan-shaped for directional broadcasting in node carry out broadcast forwarding, as shown in Figure 3, the node 2 of broadcasting is carried out at generic broadcasted middle needs, 1, 3, 4, 5, 12 just can carry out packet loss process, save the energy of broadcast for work afterwards, eliminate the energy consumption of beyond orientation is fan-shaped (radian is 4 π/3), thus in a repeating process, save the broadcast angle of 67%, thus a large amount of saving is achieved to their energy, n point all adopts this strategy can reach (67%) the saving of angle
n, so the saving of algorithm to energy is significant.
Fig. 1 is the division methods of the sensor sensing area determined according to the positional information of source node destination node, the sensing scope of source node O can regard a circle as, fan-shaped drift angle degree is α, at least a neighbor node is there is in the middle of each sector region, A as shown in Figure 1, B, C, D, E, F node is respectively three fan-shaped central neighbor nodes, and G, H node be not included in neighbor node fan-shaped in the middle of, wherein B, C node is positioned at 2. number fan-shaped, A point is positioned at 3. number fan-shaped, D, E, F is positioned at 1. number fan-shaped, determine that so directed fan-shaped just selection the in direction completes by known.
Fig. 4 is the basis for estimation of forward node, node for the purpose of I point, be the positive direction of x-axis, when node judges to be less than π/3 with the angle of x-axis and working node line, node namely drop on this directed fan-shaped in the middle of, i.e. ∠ KSI< π/3 in figure, illustrate K point be positioned at directed fan-shaped in the middle of, it is a selection of S node or work at present node forward node, and ∠ FSI> π/3 in figure, illustrate that F point is in the middle of orientation is not fan-shaped, after F point receives RREQ message, will packet loss process be carried out.
Fig. 5 is the simulation result of Packet delivery fractions.Use the agreement of directional broadcasting can obtain higher Packet delivery fractions.When the number of nodes in network is little time, the Packet delivery fractions of network is general not high, and the performance difference before and after utilization directional broadcasting strategy is not clearly.Along with the change of topological scale is large, the Packet delivery fractions of network raises gradually.
Fig. 6 is the design sketch of degree of communication emulation experiment.The a very long time advantage of degree of communication in algorithmic procedure is unconspicuous, but after algorithm carries out a period of time, due to the increase of each broadcast node dissipation energy of AODV, algorithm still can ensure certain degree of communication.
Fig. 7 is the experiment simulation schematic diagram of network energy loss.The load of network topology balancing energy is the comprehensive important indicator considering network performance, energy consumption level have recorded the energy total value consumed at all nodes of a certain operation time, the experiment consumption of incipient stage to energy is more or less the same, but As time goes on can find that the saving of DB_AODV algorithm to energy is very significant in repeatedly broadcasting process.
Claims (1)
1., for a low-power consumption directional broadcasting method for wireless sensor network, it is characterized in that comprising the steps:
The first step: initialization network topology
Wireless sensor node is after deployment, according to from the known coordinate information of sink node, carry out Coordinate Conversion, determine the position of destination node in the coordinate system being the origin of coordinates with work at present node, with the positive direction that this direction is x-axis, determine the coordinate system of working node;
Second step: divide sector region
Take x-axis as angular bisector being drift angle determination sensing scope with 2/3 π according to the x-axis direction determined, an orientation is fan-shaped, remainder be divided into two fan-shaped;
3rd step: determine sensing radius
Fan-shaped according to what obtain, each fan-shaped in namely to increase through-put power by increasing sensing radius method search neighbor node, make each fan-shaped at least existence neighbor node, neighbor node is numbered according to place is fan-shaped, number information is inserted in the middle of packet;
4th step: directional broadcasting
Using directed broadcast in route finding process, the node having marked the fan-shaped numbering of orientation is received to the RREQ message of source node broadcast, the node IP address that message comprises, energy information, fan-shaped numbering, broadcast type relevant information, carry out the process of write nodal information, receive source node broadcast packet but not belong to the fan-shaped node of described orientation the broadcast packet received is carried out packet loss process, determination methods is according to forward node criterion;
5th step: route discovery
The node receiving RREQ message judges node for the purpose of oneself whether, if not destination node, then carry out the first step to the iteration process of the 4th step thus build route, if destination node then route construction success, the opposite direction along constructed route carries out transmission data manipulation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310010943.8A CN103024858B (en) | 2013-01-11 | 2013-01-11 | For the low-power consumption directional broadcasting method of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310010943.8A CN103024858B (en) | 2013-01-11 | 2013-01-11 | For the low-power consumption directional broadcasting method of wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103024858A CN103024858A (en) | 2013-04-03 |
| CN103024858B true CN103024858B (en) | 2015-09-30 |
Family
ID=47972867
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310010943.8A Expired - Fee Related CN103024858B (en) | 2013-01-11 | 2013-01-11 | For the low-power consumption directional broadcasting method of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103024858B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103648141A (en) * | 2013-11-30 | 2014-03-19 | 中国电子器材总公司 | Communication method of wireless sensor network and sensor node |
| CN106792975B (en) * | 2016-12-09 | 2020-04-10 | 南京理工大学 | AODV routing protocol optimization method based on distance estimation |
| CN108881285B (en) * | 2018-07-17 | 2021-04-02 | 湖北理工学院 | Big data implementation control system based on internet network security |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012115303A1 (en) * | 2011-02-21 | 2012-08-30 | 동국대학교 산학협력단 | Method for delivering sound tracking movement of object using directional speaker |
-
2013
- 2013-01-11 CN CN201310010943.8A patent/CN103024858B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012115303A1 (en) * | 2011-02-21 | 2012-08-30 | 동국대학교 산학협력단 | Method for delivering sound tracking movement of object using directional speaker |
Non-Patent Citations (1)
| Title |
|---|
| 基于定向广播的AODV控制报文抑制研究;韦智仁等;《计算机应用》;20110331;第598-616页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103024858A (en) | 2013-04-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jain et al. | Geographical routing using partial information for wireless ad hoc networks | |
| CN109547351B (en) | Routing method based on Q learning and trust model in Ad Hoc network | |
| CN101951655B (en) | Reactive routing protocol based on geographic information in wireless sensor network | |
| CN103781144A (en) | Zigbee network tree-shaped routing method for neighbor table mode interaction | |
| Singh et al. | Optimization techniques in wireless sensor networks | |
| CN103024858B (en) | For the low-power consumption directional broadcasting method of wireless sensor network | |
| CN102781060B (en) | A kind of method, forward node and wireless network realizing route in the wireless network | |
| Sathya et al. | Energy efficient clustering in sensor networks using Cluster Manager | |
| CN111212456B (en) | Multi-path routing method for low-power-consumption long-distance Internet of things based on geographic position | |
| CN101409905A (en) | Routing method for mobile multi-hop grouping wireless network based on random broadcast mode | |
| Sundarameena et al. | Acquaint based grid clustering algorithm for underwater wireless sensor network | |
| CN110971524B (en) | Centralized routing method for wireless sensor network | |
| Islam et al. | An efficient routing protocol on a Dynamic Cluster-based Sensor Network | |
| Kumar et al. | Improved data gathering protocol for WSN | |
| Chahidi et al. | Hybrid routing protocol for wireless sensor networks | |
| CN102547902B (en) | Multipath routing method for Ad-Hoc network based on planar region division | |
| Dick et al. | Multiple sink nodes to improve performance in WSN | |
| Cui et al. | An Energy efficient Routing For Vehicular Ad Hoc Networks Using Real-Time Perception Of Node Information | |
| Mehrotra et al. | Performance comparison of different routing protocols for traffic monitoring application | |
| Zhang et al. | Efficient localized topology control algorithm | |
| Junfeng | A Study of Wireless Ad-hoc Network Protocol using Composite Routing Distance Algorithm | |
| Shuai et al. | Research Progress of Wireless Sensor Network Router Protocol | |
| Liu et al. | Design and simulation of a routing protocol of mobile network with double-layer fixed cluster structure | |
| Wagh et al. | Performance Measurement of GSTEB Protocol Using NS-2 | |
| JAYASHREE BHAT | DISCERNING BORDER CASTING LOCATION ORIENTED ZONE ROUTING PROTOCOL FOR MANET |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201207 Address after: Area A129, 4th floor, building 4, Baitai Industrial Park, Yazhou Bay science and Technology City, Yazhou District, Sanya City, Hainan Province, 572024 Patentee after: Nanhai innovation and development base of Sanya Harbin Engineering University Address before: 150001 Heilongjiang, Nangang District, Nantong street,, Harbin Engineering University, Department of Intellectual Property Office Patentee before: HARBIN ENGINEERING University |
|
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150930 Termination date: 20210111 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |