CN107172678A - Wireless sensor network geography information opportunistic routing protocol - Google Patents
Wireless sensor network geography information opportunistic routing protocol Download PDFInfo
- Publication number
- CN107172678A CN107172678A CN201710389669.8A CN201710389669A CN107172678A CN 107172678 A CN107172678 A CN 107172678A CN 201710389669 A CN201710389669 A CN 201710389669A CN 107172678 A CN107172678 A CN 107172678A
- Authority
- CN
- China
- Prior art keywords
- node
- source node
- energy consumption
- network
- data
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0209—Power saving arrangements in terminal devices
- H04W52/0212—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave
- H04W52/0216—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave using a pre-established activity schedule, e.g. traffic indication frame
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor 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
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of wireless sensor network geography information opportunistic routing protocol, the strategy divides network area, using the geography information of each node and sink nodes, determine that path instructs point and selects via node the most suitable to reach the purposes such as path is shorter, forward hop count less or propagation delay time is smaller；Meanwhile, to reduce network energy consumption, sleep awakening mechanism is combined with geography information chance routing policy, arranges idle node to be slept, it is to avoid node consumes network caused by death excessively and isolated, extends the Web vector graphic life-span.
Description
Technical field
The present invention relates to wireless sensor network technology field, specifically a kind of wireless sensor network geography information
Opportunistic routing protocol.
Background technology
Wireless sensor network (WSN, wireless sensor networks) is by be deployed in monitored area can not
The wireless multi-hop network that the sensor node of recharging is formed.In wireless sensor network, node carries out information gathering
And data are formed, transmitted by multi-hop transmission mechanism to destination node.In data transmission procedure, node is using pre-establishing
Routing policy is transmitted, therefore the formulation of routing policy is most important for the various aspects of performance of whole network.And wirelessly pass
Sensor network in the course of the work, usually causes network topology structure constantly to change, traditional route because of emergency situations
Strategy can not well adapt to this mode of operation, therefore the proposition of chance route carries for wireless sensor network routing policy
Good solution route is supplied.
Chance route is to improve network performance by the diversity of the utilization space in dense wireless sensor network,
More effective data transfer approach can be provided relative to traditional Routing Protocol.Geometry machine can be route, and be one of chance route
Branch, each of which node utilizes geography information, sends data to destination node., will in the mode of operation that chance is route
There is one group of candidate's forward node to be selected, it is the most suitable to be gone out in this group of candidate's forward node according to corresponding metric sebection
Via node carry out data relay forwarding, geometry machine can be route exactly selects via node according to geography information.
In recent years, many Routing Protocols based on geography information are proposed for wireless sensor network.Herein, we
These agreements are simply described.
Greedy circumference stateless Routing Protocol GPSR is the classical Routing Protocol based on geographical location information.It uses greedy
Greedy algorithm sets up route, when source node needs to forward data to destination node, it by calculate the Euclidean of neighbor node away from
From selecting the neighbor node near destination node as via node and carry out data forwarding.Cause number when there is hole region
During according to that can not transmit, with regard to solving the problem using right-hand rule.Greedy circumference stateless Routing Protocol is avoided to be built in node
Vertical, maintenance and storage routing table, but network energy is difficult balance in transmitting procedure, easily causes part of nodes dead too early
Die, ultimately form network and isolate.
It is right to be passed through based on geographical position without beacon routing algorithm Position-Based Beaconless Routing
The scope of WSN deployment nodes carries out subregion, and Relay Region, the angle of neighbor node to destination node of source node are determined respectively,
Then responded by priority and complete to send to the data of destination node.In this process, node is limited by region division
Unnecessary data transfer forwarding.But when carrying out data transmission in the range of the same area, be likely to result in a certain
Node because frequently carry out forwarding task consuming excess energy and caused by node it is dead, all nodes in network are either in addition
It is no to have forwarding task, working condition is all in all the time, also increases network energy consumption.
Energy balance routing agreement Energy balanced position-based routing based on geographical position,
The sweep forward region of source node is determined first, then calculates the corresponding measurement of all both candidate nodes in sweep forward region
It is worth and prioritization.The both candidate nodes of highest priority just as via node carry out next-hop data forwarding, so until
Data are sent to destination node.In this process, agreement has used sleep awakening mechanism to be used to save, and situation is being intercepted in reduction
Under energy expenditure and be limited in data transfer phase active state time.
Geographical forwarding strategy Contention-Based Geographic Forwarding based on competition
Strategies analyzes Geographic routing strategy by assessing forwarding selection algorithm, competition mechanism and geographical forwarding mechanism, first really
Fixed geography forwarding decision region, then carries out trunk node selection, and solving channel competition problem in this region.It is determined that
During geographical forwarding decision region, two kinds of different methods are proposed in article：Staircase bidding region and convex lens decision region.Pass through
It is known that when iterative scheme have impact on the re-computation of collision rift, convex lens decision region is just more advantageous after analysis.Based on competing
The geographical forwarding strategy the striven analytical framework new by setting up improves single-hop forward travel distance, improves network performance.
The chance route QoS Aware Geographic Opportunistic that wireless sensor network geography is perceived
Routing is first described QoS demand in detail by the performance indications of measurement, sets up constraints.On this basis, propose
Using single-hop forward travel distance and data packet reception rate as standard, choosing is further reduced by this standard in effective neighbor node
Range of nodes is selected, so as to reduce the energy consumption of node.Agreement combines sleep mechanism on the scheduling of node, reduces node
Energy consumption, but it needs progress second selecting in trunk node selection, and this may can increase certain energy consumption and time delay.
ExOR agreements are a kind of Routing Protocols for wireless multi-hop network, make full use of the broadcast characteristic of wireless environment to enter
Row data transfer, in order to reduce interactive information, source node sends a batch every time（Some numbers are contained in one batch
According to bag, batch use is that, in order to reduce interactive information, each packet includes candidate node list）, route transmission when
Wait, packet is transmitted between a group node, node every time collaboration is interacted by batchmap, so as to according to ETX
The node of value selection highest priority carries out forwarding packet, so repeats until destination node.But ExOR agreements are not filled
The node divided in the energy consumption for considering network node, network is all in running order all the time, so that Network morals are not
It is preferable.
The content of the invention
It is an object of the invention to provide a kind of new geography information opportunistic routing protocol (Geographic Information
Opportunity Routing), GIoR agreements are true during data are transmitted by network partition and node geo information
The path for determining data forwarding is instructed a little, and instructs point further to select via node progress data forwarding according to path；Simultaneously
Using sleep awakening mechanism, reasonable arrangement network node at one's leisure slept by section, saves network energy.
In order to solve the above technical problems, the technical solution adopted by the present invention is：
A kind of wireless sensor network geography information opportunistic routing protocol, the realization of the agreement comprises the following steps：
Step one：N node of random placement in two dimensional surface, the neighbor node that each node has abundance is communicated；Section
The communication radius of point is r, and knows self geographical position information and destination node geographical location information；In order in suitable area
Select node to carry out relay forwarding in domain, first divided network area；Network area area is set to S, X and Y difference
It is long and wide, R is the length of side of a zoning, and meets mod (X, R)=mod (Y, R)=0；Node in each zoning
The positional information on four summits in zoning where both knowing about；When node needs to carry out data forwarding, forwarded setting up
Region carries out data forwarding；
Step 2：Itself is connected by source node with place zoning summit first when sending data, logical with source node
Letter circle forms four sector regions；Then judge the line Line of source node and destination node splits which sector, this part fan
Shape is known as original Relay Region；After original Relay Region is determined, convex lens circle is done from destination node to source node, it is determined that forwarding
Region；If source node is L to the distance of destination node, the communication radius of node is r, then n=mod (L, r)；The center of circle of convex lens circle
On Line this straight line, and to the distance of source nodeL 1Meet, determine the coordinate of the round heart of convex lens
Position；The center of circle that we split fan-shaped SAB convex lens circle is called that point G is instructed in path, wherein the first paths instruct point to be labeled as
G1, other are labeled as G successively2、G3、G4……；Wake-up node in Relay Region is referred to as candidate relay node；
Step 3：Source node send first one broadcast beacon, notify Relay Region in be in wake-up states node prepare into
Row relaying competition；Both candidate nodes reply ACK to source node immediately after the broadcast beacon of source node is received；When not occurring
When collision, just there was only oneself both candidate nodes in explanation Relay Region, you can carry out relay forwarding as via node；
If being collided, illustrate there are other both candidate nodes to carry out relaying competition, this moment all both candidate nodes calculate itself to road
Instruct the distance of point in footpath, then calculate,M i Be worth minimum node into
Relay forwarding is carried out for via node；If the node in Relay Region is all in sleep state, there is no node reverts back source node
ACK, then source node next time slot send again broadcast beacon notified.
Sleep awakening mechanism is introduced in the agreement, the sleep awakening mechanism of each node is separate, and one is slept
Dormancy wake-up period is divided into awakening phase and sleep stage, and wakeup time isT wake , the length of one's sleep isT sleep , during the wake-up of source node
Between beT wake =T b +T w +T data ,T b It is the time that source node is broadcasted,T w When being that source node waits both candidate nodes reply ACK
Between,T data It is the time that source node sends data.
In data transmission procedure, broadcast energy consumption, which is equal to, to be intercepted energy consumption and isE m , the transmission energy consumption of data isE s , data connect
Receiving energy consumption isE r , reply ACK energy consumptions and ignore, source node wait ACK reply and sleep time not consumed energy, do not consider
Competition collision energy consumption, then source node transmissionkThe total energy consumption of the packet of bit isE stotal =E m +E s ×k, node receptionkBit
The total energy consumption of packet isE rtotal =E r ×k, when the node current remaining in network is insufficient to complete a data receiver
During with sending, i.e.,E residue ﹤E rtotal +E stotal , this node is thus referred to as death nodes.
Beneficial effects of the present invention：
The wireless sensor network geography information opportunistic routing protocol that the present invention is provided, the strategy divides network area, using every
The geography information of individual node and sink node, determine path instruct point and select via node the most suitable with reach path compared with
Short, the forwarding purpose such as hop count is less or propagation delay time is smaller.Meanwhile, to reduce network energy consumption, by sleep awakening mechanism and ground
Reason pager meeting routing policy is combined, and arranges idle node to be slept, it is to avoid node consumes net caused by death excessively
Network is isolated, and extends the Web vector graphic life-span；Using single-hop forward travel distance as main module, network area is divided, and carries
Outbound path instructs point to ensure the uniformity of data transfer direction.Simultaneously to save network energy, by sleep awakening mechanism and ground
Reason pager, which can be route, to be combined, and arranging network node, section is slept to save network overhead at one's leisure.
Brief description of the drawings
Fig. 1 inventive networks divide schematic diagram；
The foundation figure of the original Relay Region of Fig. 2 present invention；
Fig. 3 is as n ≠ 0, the foundation figure of Relay Region；
Fig. 4 is as n=0, the foundation figure of Relay Region；
The time scheduling arrangement figure of Fig. 5 nodes；
Fig. 6 network areas are constant, data transfer energy consumption figure during number of nodes increase；
Fig. 7 network areas are constant, transmission energy consumption figure of the different communication distance when number of nodes changes；
Fig. 8 number of nodes is constant, expands transmission energy consumption figure during network area；
Fig. 9 network areas are constant, transmission energy consumption figure during communication distance increase；
Figure 10 network areas are constant, propagation delay time figure during number of nodes increase；
During Figure 11 network area changes, the propagation delay time figure of different communication distance；
Figure 12 GIoR agreements, GCF agreements, the energy consumption comparison figure of ExOR agreements.
Embodiment
With reference to embodiment, the present invention is further elaborated.
Network settings are with dividing
N node of random placement in two dimensional surface, the neighbor node that each node has abundance is communicated.The communication of node
Radius is r, and knows self geographical position information and destination node geographical location information.In order to be selected in suitable region
Node carries out relay forwarding, and we are first divided network area.It is long respectively that network area area is set into S, X and Y
And width.R is the length of side of a zoning, and meets mod (X, R)=mod (Y, R)=0, such as Fig. 1.Section in each zoning
The positional information on four summits in zoning where point is both known about.When node needs to carry out data forwarding, turn setting up
Send out region and carry out data forwarding.
Relay Region is determined
Itself is connected by source node with place zoning summit first when sending data, and the communication with source node is circular
Into four sector regions.Then judge which sector the line Line of source node and destination node splits, this partial sector just claims
For original Relay Region, sector SAB in such as Fig. 2.
After original Relay Region is determined, convex lens circle is done from destination node to source node, Relay Region is determined.If source node
Distance to destination node is L, and the communication radius of node is r, then n=mod (L, r).The center of circle of convex lens circle is in this straight line of Line
On, and arrive the distance of source nodeL 1Meet, determine the coordinate position of the round heart of convex lens.We claim segmentation
Point G is instructed in the center of circle of fan-shaped SAB convex lens circle for path, wherein the first jump path instructs point to be labeled as G1, other are marked successively
For G2、G3、G4…….Dash area in n ≠ 0 and n=0 two kind situation, figure is respectively described in Fig. 3 and Fig. 4 --- convex lens justify and
The lap of original Relay Region, i.e., real Relay Region.Wake-up node in Relay Region is referred to as candidate relay section
Point.
Trunk node selection
Source node sends a broadcast beacon first, notifies the node for being in wake-up states in Relay Region is ready for relaying competing
Strive.Both candidate nodes reply ACK to source node immediately after the broadcast beacon of source node is received.When not colliding
Wait, just there was only oneself both candidate nodes in explanation Relay Region, you can carry out relay forwarding as via node；If there occurs
Collision, then illustrate have other both candidate nodes to carry out relaying competition, this moment all both candidate nodes calculate itself and instructed a little to path
Distance, then calculate,M i The minimum node of value turns into via node
Carry out relay forwarding.If node in Relay Region is all in sleep state, without node reverts back source node ACK, then source node
Broadcast beacon is sent again in next time slot to be notified.
Sleep awakening mechanism and energy consumption model
Sleep awakening mechanism is introduced in order to save in network energy expense, geography information opportunistic routing protocol.If each node
Sleep awakening mechanism be separate, according to the description before article, a sleep awakening cycle is divided into awakening phase
And sleep stage, wakeup time isT wake , the length of one's sleep isT sleep , the wakeup time of source node isT wake =T b +T w +T data ,T b It is
The time that source node is broadcasted,T w It is the time that source node waits both candidate nodes reply ACK,T data It is that source node sends data
Time.Both candidate nodes can carry out broadcast in awakening phase and intercept, and time of intercept isT m , after broadcast beacon is listened to, just enter
The competition of row relaying simultaneously replys ACK to source node,T back For the collision back-off time,T r To reply the ACK times.In both candidate nodes competition
After node success, it is ready for receiving data, the time isT data .Here, we set the broadcast time of source nodeT b Detectd with both candidate nodes
Listen to the radio programme time of beaconT m Equal, source node waits both candidate nodes reply ACK timeT w ACK is replied slightly larger than both candidate nodes
TimeT r .Fig. 5 is the time scheduling arrangement of node.
Network energy consumption is assessed in order to simple, used here as a simple energy model.If the node in network
Primary power is identical, and sink node energies are unlimited.In data transmission procedure, broadcast energy consumption, which is equal to, to be intercepted energy consumption and isE m , data
Transmission energy consumption beE s , the reception energy consumption of data isE r .Reply ACK energy consumptions to ignore, source node waits ACK to reply and sleep
Time not consumed energy, do not consider competition collision energy consumption.So, source node is sentkThe total energy consumption of the packet of bit isE stotal =E m +E s ×k, node receptionkThe total energy consumption of the packet of bit isE rtotal =E r ×k, when the node in network is currently remained
When complementary energy is insufficient to complete a data receiver and send, i.e.,E residue ﹤E rtotal +E stotal , this node is thus referred to as death
Node.
Analog simulation
In this trifle simulation analysis will be carried out to the performance of geographical opportunistic routing protocol.Geographical opportunistic routing protocol be
Carried out on MATLAB emulation platforms, choose MICAz hardware parameters, related experiment parameter such as table 1.
The simulation parameter of table 1 is set
Network range is set to (100 m, 100m) by we, and the coordinate of sink nodes is set to (100,100), different
Transmission energy consumption such as Fig. 6 under communication range and different number of nodes.It can be seen that network area it is constant, communication
In the case of constant, during from source node to one packet of sink node-node transmissions, transmission energy consumption is not with nodes
The increase of amount and significantly reduce because it is to select via node by distance that geometry machine, which can be route,.When from same section
When point is to sink node-node transmission packets, transmission range does not change, and transmission energy consumption is also just without significant change.And with
Network node quantity is continuously increased, in selecting when node, the both candidate nodes increasing number that can select, transmits energy
Consumption is slightly reduced.
It is (200 m, 200m) that network range is shown in Fig. 7, and the coordinate of sink nodes is (200,200), communication
Transmission energy consumption in the case of distance respectively 30,40 and 50m, different number of nodes.It can be seen that with communication distance
Increase, transmission energy consumption reduce.Because in the case where transmission range is constant, the increase of communication distance reduces transmission and jumped
Number, transmission energy consumption is also just reduced therewith.
Fig. 8 is shown in the case where network node quantity is constant, the Energy Expenditure Levels that network area changes.By net
Communication node in network is set to 350, and the communication distance of node is respectively set to 30m, 40m and 50m, and network area is carried out
Expand.It may be seen that with the expansion of network area, transmission energy consumption increases therewith from figure.Because the expansion of area
Source node is also increased to the transmission range of sink nodes, so as to exacerbate network energy consumption.Node is also show in other figure to lead to
The increase of communication distance, reduces network energy consumption.Because when communication distance is 50m, identified Relay Region each time
More than the Relay Region that communication distance is 30m, this makes it possible to select apart from sink nodes closer to via node enter line number
According to forwarding.
Fig. 9 is shown in the case where network area is constant, and packet is sent to sink nodes from source node, and node leads to
The energy expenditure that communication distance changes.Network area is set to (300m, 300m), the coordinate of sink nodes is (300,300).From
It can see in figure, with the increase of communication distance, network energy consumption is decreased.The increase of communication distance can reduce forwarding and jump
Number, so as to reduce network energy consumption.The energy consumption under different number of nodes is also show in Fig. 8., will when number of nodes increases
More effective via node can be selected, so as to also reduce network energy consumption.
Figure 10 is shown in the case where network area is (200 m, 200m), the propagation delay time that number of nodes changes.
It can be seen that with the increase of number of nodes, the propagation delay time of network is consequently increased.Because in selecting after
When node, the node in wake-up states increases, therefore adds selection time.
This paper presents a kind of new geography information opportunistic routing protocol Geographic Information
Opportunity Routing, the agreement is divided by network and the geography information of nodes determines data transfer
Path is instructed a little, and is selected most suitable via node by distance and the remaining energy consumption of node and carried out data forwarding, reaches biography
The purpose such as defeated path is shorter, forwarding hop count is less or propagation delay time is smaller.Sleep awakening mechanism arrangement network section is utilized simultaneously
Point at one's leisure slept by section, reduces network energy consumption.The simulation experiment result shows that geography information opportunistic routing protocol GIoR exists
In data transmission procedure, transmission path is shorter, and hop count is less, and energy expenditure is smaller.
Claims (3)
1. a kind of wireless sensor network geography information opportunistic routing protocol, it is characterised in that：The realization of the agreement, including it is following
Step：
Step one：N node of random placement in two dimensional surface, the neighbor node that each node has abundance is communicated；Section
The communication radius of point is r, and knows self geographical position information and destination node geographical location information；In order in suitable area
Select node to carry out relay forwarding in domain, first divided network area；Network area area is set to S, X and Y difference
It is long and wide, R is the length of side of a zoning, and meets mod (X, R)=mod (Y, R)=0；Node in each zoning
The positional information on four summits in zoning where both knowing about；When node needs to carry out data forwarding, forwarded setting up
Region carries out data forwarding；
Step 2：Itself is connected by source node with place zoning summit first when sending data, logical with source node
Letter circle forms four sector regions；Then judge the line Line of source node and destination node splits which sector, this part fan
Shape is known as original Relay Region；After original Relay Region is determined, convex lens circle is done from destination node to source node, it is determined that forwarding
Region；If source node is L to the distance of destination node, the communication radius of node is r, then n=mod (L, r)；The center of circle of convex lens circle
On Line this straight line, and to the distance of source nodeL 1Meet, determine the coordinate of the round heart of convex lens
Position；The center of circle that we split fan-shaped SAB convex lens circle is called that point G is instructed in path, wherein the first paths instruct point to be labeled as
G1, other are labeled as G successively2、G3、G4……；Wake-up node in Relay Region is referred to as candidate relay node；
Step 3：Source node send first one broadcast beacon, notify Relay Region in be in wake-up states node prepare into
Row relaying competition；Both candidate nodes reply ACK to source node immediately after the broadcast beacon of source node is received；When not occurring
When collision, just there was only oneself both candidate nodes in explanation Relay Region, you can carry out relay forwarding as via node；
If being collided, illustrate there are other both candidate nodes to carry out relaying competition, this moment all both candidate nodes calculate itself to road
Instruct the distance of point in footpath, then calculate,M i Be worth minimum node into
Relay forwarding is carried out for via node；If the node in Relay Region is all in sleep state, there is no node reverts back source node
ACK, then source node next time slot send again broadcast beacon notified.
2. wireless sensor network geography information opportunistic routing protocol as claimed in claim 1, it is characterised in that：In the agreement
Sleep awakening mechanism is introduced, the sleep awakening mechanism of each node is separate, and a sleep awakening cycle is divided into and called out
Wake up stage and sleep stage, wakeup time isT wake , the length of one's sleep isT sleep , the wakeup time of source node isT wake =T b +T w + T data ,T b It is the time that source node is broadcasted,T w It is the time that source node waits both candidate nodes reply ACK,T data It is source node
Send the time of data.
3. wireless sensor network geography information opportunistic routing protocol as claimed in claim 1, it is characterised in that：Passed in data
During defeated, broadcast energy consumption, which is equal to, to be intercepted energy consumption and isE m , the transmission energy consumption of data isE s , the reception energy consumption of data isE r , reply
ACK energy consumptions are ignored, source node wait ACK reply and sleep time not consumed energy, do not consider competition collision energy consumption, then
Source node is sentkThe total energy consumption of the packet of bit isE stotal =E m +E s ×k, node receptionkThe total energy consumption of the packet of bit
ForE rtotal =E r ×k, when the node current remaining in network is insufficient to complete a data receiver and send, i.e.,E residue ﹤E rtotal +E stotal , this node is thus referred to as death nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710389669.8A CN107172678B (en) | 2017-05-27 | 2017-05-27 | Opportunistic routing method for geographic information of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710389669.8A CN107172678B (en) | 2017-05-27 | 2017-05-27 | Opportunistic routing method for geographic information of wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107172678A true CN107172678A (en) | 2017-09-15 |
| CN107172678B CN107172678B (en) | 2020-07-14 |
Family
ID=59821919
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710389669.8A Active CN107172678B (en) | 2017-05-27 | 2017-05-27 | Opportunistic routing method for geographic information of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107172678B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110493846A (en) * | 2018-05-14 | 2019-11-22 | 贵州师范学院 | Coal mine work area based on Internet of Things integrates MAC and routing Data Transport Protocol |
| CN112087768A (en) * | 2020-09-17 | 2020-12-15 | 东北石油大学 | Low-energy-consumption routing method for oil and gas pipeline Internet of things |
| CN113783588A (en) * | 2021-11-12 | 2021-12-10 | 国网江苏省电力有限公司营销服务中心 | Opportunistic relay dynamic routing method and device for high-frequency acquisition of transformer area data |
| CN113965957A (en) * | 2021-09-27 | 2022-01-21 | 江苏大学 | Self-adaptive transmission rate adjusting method based on multi-hop in wireless body area network |
| CN115314433A (en) * | 2022-08-08 | 2022-11-08 | 电子科技大学 | Relay forwarding strategy of opportunistic routing combined with MAC layer |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120099587A1 (en) * | 2010-10-22 | 2012-04-26 | Kabushiki Kaisha Toshiba | Forwarding and routing in sensor networks |
| CN102740392A (en) * | 2012-06-01 | 2012-10-17 | 华中科技大学 | Routing method based on layering geotagging in opportunistic network |
| CN104038965A (en) * | 2014-06-10 | 2014-09-10 | 南京邮电大学 | Opportunistic routing method capable of efficiently utilizing energy, for mobile wireless sensor network |
| CN105657777A (en) * | 2016-03-14 | 2016-06-08 | 西安电子科技大学 | Routing protocol design method based on link quality and node forwarding capacity |
| CN106604346A (en) * | 2016-11-29 | 2017-04-26 | 河南科技大学 | Wireless sensor network energy effective opportunistic routing protocol implementation method |
-
2017
- 2017-05-27 CN CN201710389669.8A patent/CN107172678B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120099587A1 (en) * | 2010-10-22 | 2012-04-26 | Kabushiki Kaisha Toshiba | Forwarding and routing in sensor networks |
| CN102740392A (en) * | 2012-06-01 | 2012-10-17 | 华中科技大学 | Routing method based on layering geotagging in opportunistic network |
| CN104038965A (en) * | 2014-06-10 | 2014-09-10 | 南京邮电大学 | Opportunistic routing method capable of efficiently utilizing energy, for mobile wireless sensor network |
| CN105657777A (en) * | 2016-03-14 | 2016-06-08 | 西安电子科技大学 | Routing protocol design method based on link quality and node forwarding capacity |
| CN106604346A (en) * | 2016-11-29 | 2017-04-26 | 河南科技大学 | Wireless sensor network energy effective opportunistic routing protocol implementation method |
Non-Patent Citations (1)
| Title |
|---|
| RODOLFO W. L. COUTINHO, AZZEDINE BOUKERCHE, LUIZ F. M. VIEIRA: ""GEDAR: Geographic and Opportunistic Routing"", 《IEEE ICC 2014 - AD-HOC AND SENSOR NETWORKING SYMPOSIUM》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110493846A (en) * | 2018-05-14 | 2019-11-22 | 贵州师范学院 | Coal mine work area based on Internet of Things integrates MAC and routing Data Transport Protocol |
| CN112087768A (en) * | 2020-09-17 | 2020-12-15 | 东北石油大学 | Low-energy-consumption routing method for oil and gas pipeline Internet of things |
| CN112087768B (en) * | 2020-09-17 | 2022-04-29 | 东北石油大学 | Low-energy-consumption routing method for oil and gas pipeline Internet of things |
| CN113965957A (en) * | 2021-09-27 | 2022-01-21 | 江苏大学 | Self-adaptive transmission rate adjusting method based on multi-hop in wireless body area network |
| CN113965957B (en) * | 2021-09-27 | 2024-04-09 | 江苏大学 | Multi-hop-based adaptive transmission rate adjusting method in wireless body area network |
| CN113783588A (en) * | 2021-11-12 | 2021-12-10 | 国网江苏省电力有限公司营销服务中心 | Opportunistic relay dynamic routing method and device for high-frequency acquisition of transformer area data |
| CN113783588B (en) * | 2021-11-12 | 2022-02-08 | 国网江苏省电力有限公司营销服务中心 | Opportunistic relay dynamic routing method and device for high-frequency acquisition of transformer area data |
| CN115314433A (en) * | 2022-08-08 | 2022-11-08 | 电子科技大学 | Relay forwarding strategy of opportunistic routing combined with MAC layer |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107172678B (en) | 2020-07-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zafar et al. | A reliable, delay bounded and less complex communication protocol for multicluster FANETs | |
| Hu et al. | On mitigating the broadcast storm problem with directional antennas | |
| CN107172678A (en) | Wireless sensor network geography information opportunistic routing protocol | |
| Tripathi et al. | Comparison of reactive and proactive routing protocols for different mobility conditions in WSN | |
| JP2007074561A (en) | Routing method of wireless network and wireless communication system | |
| Wu et al. | Geographic load balancing routing in hybrid vehicular ad hoc networks | |
| DU et al. | LB-AGR: level-based adaptive geo-routing for underwater sensor network | |
| Tian et al. | A VANETs routing algorithm based on Euclidean distance clustering | |
| CN110324877A (en) | Relaying robot method for routing based on servo backbone network Yu Vikor multi-standard decision | |
| Satyajeet et al. | Heterogeneous approaches for cluster based routing protocol in vehicular ad hoc network (vanet) | |
| Setiawan et al. | An optimum multiple metrics gateway selection mechanism in MANET and infrastructured networks integration | |
| Abuashour et al. | A cluster-based life-time routing protocol in VANET | |
| CN108650137A (en) | Wireless sensor network node is made decisions on one's own formula Routing Protocol | |
| CN103701705A (en) | Mobile sink data acquisition method based on binary tree inquiry in wireless sensor network | |
| Garrosi et al. | Geo-routing in urban Vehicular Ad-hoc Networks: A literature review | |
| Abuashour | An efficient Clustered IoT (CIoT) routing protocol and control overhead minimization in IoT network | |
| Nie et al. | Energy efficient AODV routing in CDMA ad hoc networks using beamforming | |
| Ramachandran et al. | An intersection based traffic aware routing with low overhead in vanet | |
| CN111556548B (en) | Multi-path routing protocol based on non-uniform clustering in WBAN | |
| Zhang et al. | An energy-aware routing for cognitive radio ad hoc networks | |
| Hajela et al. | LCSD: Leveling clustering and sectoring with dissemination nodes to perform energy efficient routing in mobile cognitive wireless sensor networks | |
| Shi et al. | Power-efficient location-based cooperative routing in wireless networks | |
| Sheikh | A self-organizing location and mobility-aware route optimization protocol for bluetooth wireless | |
| Durai et al. | Energy efficient random cast DSR protocol with mediation device in MANET | |
| Devi et al. | Routing with AODV protocol for Mobile AdHoc network |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20211109 Address after: 511400 Nansha street public collective house, Room 501, no.15-2, Yinchuan street, Nansha District, Guangzhou City, Guangdong Province Patentee after: Liu Guoying Address before: 471000 No. 48, Xiyuan Road, Jianxi District, Henan, Luoyang Patentee before: HENAN University OF SCIENCE AND TECHNOLOGY |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20211231 Address after: 253000 Jinghua Avenue, songguantun sub district office, Dezhou Economic and Technological Development Zone, Shandong Province Patentee after: Dezhou Luotai Trading Co.,Ltd. Address before: 511400 Nansha street public collective house, Room 501, no.15-2, Yinchuan street, Nansha District, Guangzhou City, Guangdong Province Patentee before: Liu Guoying |