CN107172678B - Opportunistic routing method for geographic information of wireless sensor network - Google Patents
Opportunistic routing method for geographic information of wireless sensor network Download PDFInfo
- Publication number
- CN107172678B CN107172678B CN201710389669.8A CN201710389669A CN107172678B CN 107172678 B CN107172678 B CN 107172678B CN 201710389669 A CN201710389669 A CN 201710389669A CN 107172678 B CN107172678 B CN 107172678B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- source node
- network
- forwarding
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
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
Abstract
The invention relates to a wireless sensor network geographic information opportunistic routing protocol, which divides a network region, determines path guide points and selects the most appropriate relay node by utilizing the geographic information of each node and sink nodes so as to achieve the purposes of shorter path, less forwarding hop count or less transmission delay and the like; meanwhile, in order to reduce network energy consumption, a sleep awakening mechanism is combined with a geographical information opportunity routing strategy, idle nodes are arranged to sleep, network splitting caused by excessive consumption and death of the nodes is avoided, and the service life of the network is prolonged.
Description
Technical Field
The invention relates to the technical field of wireless sensor networks, in particular to a geographical information opportunistic routing method of a wireless sensor network.
Background
A Wireless Sensor Network (WSN) is a wireless multi-hop network formed by sensor nodes that are deployed in a monitored area and cannot be recharged. In the wireless sensor network, the nodes collect information and form data, and the data is transmitted to a target node through a multi-hop transmission mechanism. In the data transmission process, the nodes transmit by using a pre-established routing strategy, so the establishment of the routing strategy is crucial to the performance of all aspects of the whole network. In the working process of the wireless sensor network, the network topology structure is often changed continuously due to the emergency, and the traditional routing strategy cannot be well adapted to the working mode, so that the proposed opportunistic routing provides a good solution for the routing strategy of the wireless sensor network.
Opportunistic routing is the improvement of network performance by exploiting the diversity of space in dense wireless sensor networks, providing a more efficient data transfer approach over traditional routing protocols. The geographical opportunistic route is a branch of the opportunistic route, and each node transmits data to a destination node by using geographical information. In the operation mode of the opportunistic routing, a group of candidate forwarding nodes are selected, the most suitable relay node is selected according to corresponding measurement in the group of candidate forwarding nodes for data relay forwarding, and the opportunistic routing selects the relay node according to the geographic information.
In recent years, many routing protocols based on geographical information have been proposed for wireless sensor networks. Here we describe these protocols briefly.
Greedy perimeter stateless routing protocol GPSR is a classical routing protocol based on geographical location information. The method uses a greedy algorithm to establish a route, and selects a neighbor node closest to a destination node as a relay node to forward data by calculating Euclidean distances of the neighbor nodes when a source node needs to forward the data to the destination node. When the data cannot be transmitted due to the occurrence of the hole area, the problem is solved by using a right-hand rule. The greedy perimeter stateless routing protocol avoids the establishment, maintenance and storage of routing tables in nodes, but network energy is not easy to balance in the transmission process, so that part of nodes are easy to die prematurely, and finally network fracture is formed.
The beaconing-Based Beaconless Routing algorithm Based on the geographic Position divides the range of the WSN deployment node, respectively determines the angles from the forwarding area of the source node and the neighbor nodes to the destination node, and then completes data transmission to the destination node through priority response. In this process, the nodes limit unnecessary data transmission forwarding through regional division. However, when data transmission is performed in the same area, a node may die due to excessive energy consumption caused by frequent forwarding tasks, and in addition, all nodes in the network are always in a working state regardless of whether there is a forwarding task, which also increases network energy consumption.
Based on the Energy balanced routing-based routing protocol of the geographic position, firstly, a forward search area of a source node is determined, and then, corresponding metric values of all candidate nodes in the forward search area are calculated and prioritized. And the candidate node with the highest priority is used as the relay node to forward the next hop of data until the data is sent to the destination node. In this process, the protocol uses a sleep-wakeup mechanism for power saving, reducing power consumption in listening situations and limiting the time of active states during data transfer phases.
The competition-Based Geographic forwarding strategy content-Based Geographic forwarding strategies analyze Geographic routing strategies by evaluating a forwarding selection algorithm, a competition mechanism and a Geographic forwarding mechanism, firstly determine a Geographic forwarding decision area, then select a relay node in the area, and solve the problem of channel competition. In determining geographical forwarding decision areas, two different approaches are proposed in the article: a segmented decision region and a convex mirror decision region. Through analysis, it can be known that the convex mirror decision area is more advantageous when the iterative scheme influences the recalculation after collision. The competition-based geographical forwarding strategy improves the single-hop forwarding distance and improves the network performance by establishing a new analysis framework.
The opportunistic routing QoS (quality of service) Aware Geographic routing operation of the wireless sensor network geography perception firstly describes the QoS requirement in detail through a measured performance index, and establishes a constraint condition. On the basis, the range of the selected node is further narrowed in the effective neighbor nodes by taking the forward distance of the single hop and the receiving rate of the data packet as the standard, so that the energy consumption of the node is reduced. The protocol combines a sleep mechanism on the work scheduling of the nodes, so that the energy consumption of the nodes is reduced, but secondary selection is required on the selection of the relay nodes, so that certain energy consumption and time delay can be increased.
The ExOR protocol is a routing protocol for a wireless multi-hop network, data transmission is carried out by fully utilizing the broadcast characteristic of a wireless environment, in order to reduce interactive information, a source node sends a batch (one batch contains a plurality of data packets, the batch is adopted to reduce interactive information, each data packet contains a candidate node list), during routing transmission, the data packets are forwarded to a group of nodes every time, and the nodes are interactively cooperated through a batch map, so that the node with the highest priority can be selected according to an ETX value to forward the data packets, and the steps are repeated until a destination node. However, the ExOR protocol does not fully consider the energy consumption of network nodes, and all nodes in the network are always in working states, so that the life cycle of the network is not ideal.
Disclosure of Invention
The invention aims to provide a new geographic information Opportunity Routing protocol (Geogamicinformation Opportunity Routing), wherein the GIoR protocol determines a path guidance point for data forwarding in the process of transmitting data through network partitions and node geographic information, and further selects a relay node for data forwarding according to the path guidance point; meanwhile, a sleep awakening mechanism is utilized, the network nodes are reasonably arranged to sleep in idle time, and network energy is saved.
In order to solve the technical problems, the technical scheme adopted by the invention is as follows:
a method for opportunistic routing of geographic information of a wireless sensor network is realized and comprises the following steps:
the method comprises the following steps: randomly deploying n nodes in a two-dimensional plane, wherein each node has enough neighbor nodes for communication; the communication radius of each node is r, and the geographical position information of each node and the geographical position information of a target node are known; in order to select nodes in a proper area for relay forwarding, firstly dividing a network area; setting the area of a network region as S, wherein X and Y are respectively length and width, R is the side length of one divided region, and mod (X, R) = mod (Y, R) =0 is satisfied; the nodes in each divided area know the position information of four vertexes in the divided area; when the node needs to forward data, a forwarding area is established for forwarding the data;
secondly, when the source node sends data, the source node is connected with the top point of the divided area, four fan-shaped areas are formed by the source node and the communication circle of the source node, then the fan shape which is divided by a connecting line L ine between the source node and the destination node is judged, the fan-shaped area is called as an original forwarding area, after the original forwarding area is determined, a convex mirror circle is made from the destination node to the source node, the forwarding area is determined, the distance from the source node to the destination node is L, the communication radius of the node is r, n = mod (L, r), the center of the convex mirror circle is on the straight line of L ine, and the distance from the convex mirror circle to the source node is equal to the distance from the sourceL 1Satisfy the requirement of
Determining the coordinate position of the circle center of the convex mirror circle; let us call the center of the convex mirror circle of the segmented sector SAB as the path guide point G, where the first path guide point is marked as G1And others are marked sequentially by G2、G3、G4… …, respectively; the awakening node in the forwarding area is called a candidate relay node;
step three: the source node firstly sends a broadcast beacon to inform the forwarding area of being in an awakening stateThe node(s) prepare for relay contention; after receiving the broadcast beacon of the source node, the candidate node immediately replies an ACK (acknowledgement character) to the source node; when no collision occurs, the situation that only one candidate node is in the forwarding area is shown, and the candidate node can become a relay node to perform relay forwarding; if collision occurs, it indicates that other candidate nodes perform relay competition, and at the moment, all the candidate nodes calculate the distance from the candidate nodes to the path guidance point
Then calculate
，M i The node with the minimum value becomes a relay node to carry out relay forwarding; and if the nodes in the forwarding area are in the sleep state and no node replies the source node ACK, the source node sends the broadcast beacon again for notification in the next time slot.
A sleep wake-up mechanism is introduced into the protocol, the sleep wake-up mechanism of each node is mutually independent, one sleep wake-up cycle is divided into a wake-up stage and a sleep stage, and the wake-up time isT wake The sleep time isT sleep The wake-up time of the source node isT wake =T b +T w +T data ，T b Is the time at which the source node is broadcasting,T w is the time for the source node to wait for the candidate node to reply with an ACK,T data is the time when the source node sends data.
During data transmission, the broadcast energy consumption is equal to the interception energy consumptionE m The transmission energy consumption of the data isE s The receiving energy consumption of the data isE r The energy consumption of ACK reply is ignored, the energy consumption is not consumed when the source node waits for ACK reply and sleeps, and the energy consumption of competitive collision is not considered, then the source node sends the ACK messagekTotal energy consumption of a packet of bits isE stotal =E m +E s ×kReception by a nodekTotal energy consumption of a packet of bits isE rtotal =E r ×kWhen the current remaining energy of the nodes in the network is not enough to complete one data reception and transmission, i.e. when the nodes in the network are not enough to complete one data reception and transmissionE residue ﹤E rtotal +E stotal This node is called a dead node.
The invention has the beneficial effects that:
the invention provides a method for opportunistic routing of geographic information of a wireless sensor network, which divides a network region by a strategy, determines path guide points by utilizing the geographic information of each node and sink nodes, and selects the most appropriate relay node to achieve the purposes of shorter path, less forwarding hop count, smaller transmission delay and the like. Meanwhile, in order to reduce network energy consumption, a sleep awakening mechanism is combined with a geographical information opportunity routing strategy, idle nodes are arranged to sleep, network fracture caused by excessive consumption and death of the nodes is avoided, and the service life of the network is prolonged; the single-hop forward distance is taken as a main measurement standard, the network area is divided, and a path guide point is proposed to ensure the consistency of the data transmission direction. Meanwhile, in order to save network energy, a sleep awakening mechanism is combined with geographical information opportunistic routing, and the network nodes are arranged to sleep in idle time periods so as to save network overhead.
Drawings
FIG. 1 is a schematic diagram of the network partitioning of the present invention;
FIG. 2 is a diagram of the creation of an original forwarding area of the present invention;
FIG. 3 is a diagram of the establishment of a forwarding area when n ≠ 0;
fig. 4 is a graph of the establishment of a forwarding area when n = 0;
FIG. 5 is a timing schedule diagram for the nodes;
FIG. 6 is a graph of energy consumption for data transmission when the network area is unchanged and the number of nodes is increased;
FIG. 7 is a transmission energy consumption diagram of the network with constant area and different communication distances when the number of nodes changes;
FIG. 8 is a transmission energy consumption diagram when the network area is enlarged, with the number of nodes unchanged;
FIG. 9 is a diagram of transmission power consumption with an unchanged network area and an increased communication distance;
FIG. 10 is a transmission delay diagram when the network area is unchanged and the number of nodes is increased;
FIG. 11 is a transmission delay diagram for different communication distances when the network area changes;
FIG. 12 is a graph showing a comparison of energy consumption of the GIoR protocol, the GCF protocol, and the ExOR protocol.
Detailed Description
The invention is further illustrated with reference to specific embodiments below.
Network setup and partitioning
And randomly deploying n nodes in a two-dimensional plane, wherein each node has enough neighbor nodes for communication. The communication radius of each node is r, and the self geographical position information and the destination node geographical position information are known. In order to select a node for relay forwarding in a suitable area, we first divide the network area. Let the network area be S, X and Y be length and width, respectively. R is a side length of one divided region, and mod (X, R) = mod (Y, R) =0 is satisfied, as in fig. 1. The nodes in each divided region know the position information of the four vertices of the divided region. When the node needs to forward data, a forwarding area is established for forwarding the data.
Forwarding area determination
When the source node sends data, it first connects itself with the top of the divided region, and forms four fan-shaped regions with the communication circle of the source node, then judges which fan-shaped region the connection line L ine between the source node and the destination node divides, and this part of fan-shaped region is called as the original forwarding region, as shown in fig. 2 as fan-shaped SAB.
Setting the distance from the source node to the destination node as L, and the communication radius of the nodes as r, then n = mod (L, r). the center of the convex mirror circle is on the L ine line, and the distance to the source nodeL 1Satisfy the requirement of
And determining the coordinate position of the circle center of the convex mirror. Let us call the center of the convex mirror circle of the segmented sector SAB as the path guide point G, where the first hop path guide point is marked as G1And others are marked sequentially by G2、G3、G4… … are provided. Fig. 3 and 4 depict two cases, n ≠ 0 and n =0, respectively, where the hatched portion-the overlapping portion of the convex mirror circle and the original forwarding area, i.e. the real forwarding area. The wake-up node within the forwarding area is referred to as a candidate relay node.
Relay node selection
The source node firstly sends a broadcast beacon to inform nodes in an awakening state in a forwarding area to prepare for relay competition. And the candidate node immediately replies an ACK to the source node after receiving the broadcast beacon of the source node. When no collision occurs, the situation that only one candidate node is in the forwarding area is shown, and the candidate node can become a relay node to perform relay forwarding; if collision occurs, it indicates that other candidate nodes perform relay competition, and at the moment, all the candidate nodes calculate the distance from the candidate nodes to the path guidance point
Then calculate
，M i And the node with the minimum value becomes a relay node to carry out relay forwarding. And if the nodes in the forwarding area are in the sleep state and no node replies the source node ACK, the source node sends the broadcast beacon again for notification in the next time slot.
Sleep wake-up mechanism and energy consumption model
In order to save network energy overhead, a sleep-wakeup mechanism is introduced into the geographical information opportunity routing protocol. The sleep wake-up mechanism of each node is independent, and according to the description in the article, a sleep wake-up cycle is divided into a wake-up stage and a sleep stage, and the wake-up time isT wake The sleep time isT sleep The wake-up time of the source node isT wake =T b +T w + T data ，T b Is the time at which the source node is broadcasting,T w is the time for the source node to wait for the candidate node to reply with an ACK,T data is the time when the source node sends data. The candidate node carries out broadcast interception in the awakening stage, and the interception time isT m When the broadcast beacon is sensed, the relay competition is carried out and an ACK is replied to the source node,T back to be the collision back-off time,T r to reply to the ACK time. If the candidate node successfully competes for the relay node, the data is ready to be received for the time ofT data . Here, we set the broadcast time of the source nodeT b And the time when the candidate node listens for the broadcast beaconT m Equal, the source node waits for the candidate node to reply ACKT w Slightly longer than the time for the candidate node to reply to the ACKT r . Fig. 5 is a time schedule of a node.
In order to be able to evaluate the network energy consumption in a simple manner, a simple energy model is used. The initial energy of the nodes in the network is the same, and the energy of the sink nodes is infinite. During data transmission, the broadcast energy consumption is equal to the interception energy consumptionE m The transmission energy consumption of the data isE s The receiving energy consumption of the data isE r . The energy consumption of ACK reply is ignored, the time of the source node waiting for ACK reply and sleeping does not consume energy, and the energy consumption of competitive collision is not considered. Therefore, the source node transmitskTotal energy consumption of a packet of bits isE stotal =E m +E s ×kReception by a nodekTotal energy consumption of a packet of bits isE rtotal =E r ×kWhen the current remaining energy of the nodes in the network is not enough to complete one data reception and transmission, i.e. when the nodes in the network are not enough to complete one data reception and transmissionE residue ﹤E rtotal +E stotal This node is calledAnd (4) death nodes.
Simulation of
In this section, a simulation analysis of the performance of the geographical opportunity routing protocol was performed on the MAT L AB simulation platform, with MICAz hardware parameters selected, and the relevant experimental parameters as in Table 1.
Table 1 simulation parameter settings
We set the network range to (100 m ), the coordinates of the sink node to (100 ), and the transmission energy consumption under different communication ranges and different node numbers as shown in fig. 6. As can be seen from the figure, when a data packet is transmitted from a source node to a sink node under the conditions of constant network area and constant communication distance, the transmission energy consumption does not decrease significantly as the number of nodes increases, because the geographical opportunity routing selects the relay node through the distance. When the data packet is transmitted from the same node to the sink node, the transmission distance is not changed, and the transmission energy consumption is not obviously changed. With the increasing number of network nodes, the number of candidate nodes which can be selected is increased when the relay node is selected, and the transmission energy consumption is slightly reduced.
In fig. 7, the network range is (200 m ), the coordinates of the sink node are (200 ), the communication distance is 30, 40 and 50m, respectively, and the transmission energy consumption is shown in the case of different numbers of nodes. As can be seen from the figure, as the communication distance increases, the transmission power consumption decreases. This is because, under the condition that the transmission distance is not changed, the increase of the communication distance reduces the number of transmission hops, and the transmission energy consumption is reduced accordingly.
Fig. 8 shows the energy consumption of the network area change with the number of network nodes unchanged. The number of communication nodes in the network is set to 350, the communication distances of the nodes are respectively set to 30m, 40m and 50m, and the area of the network is enlarged. From the figure we can see that as the network area is enlarged, the transmission power consumption increases. This is because the transmission distance from the source node to the sink node is also increased due to the enlarged area, thereby increasing network energy consumption. In addition, the graph also shows that the communication distance of the nodes is increased, and the energy consumption of the network is reduced. This is because, when the communication distance is 50m, each determined forwarding area is larger than the forwarding area with the communication distance of 30m, so that a relay node closer to the sink node can be selected for data forwarding.
Fig. 9 shows energy consumption of a data packet transmitted from a source node to a sink node when a communication distance between the nodes changes, under the condition that a network area is unchanged. The network area is set to (300m ) and the coordinates of the sink node are (300 ). As can be seen from the figure, as the communication distance increases, the network power consumption decreases. The increase in communication distance can reduce the number of forwarding hops, thereby reducing network energy consumption. The energy consumption at different node numbers is also shown in fig. 8. When the number of the nodes is increased, more effective relay nodes can be selected, and therefore network energy consumption is reduced.
Fig. 10 shows the transmission delay when the number of nodes changes in the case where the network area is (200 m ). As can be seen from the figure, as the number of nodes increases, the transmission delay of the network also increases. This is because when a relay node is selected, the number of nodes in the awake state increases, thereby increasing the selection time.
The protocol determines a path guidance point of data transmission through network division and Geographic information of nodes in a network, and selects the most appropriate relay node for data forwarding through distance and node residual energy consumption, so that the purposes of shorter transmission path, less forwarding hop count, smaller transmission delay and the like are achieved. Meanwhile, a sleep awakening mechanism is used for arranging the network nodes to sleep in an idle period, so that the network energy consumption is reduced. Simulation experiment results show that the geographic information opportunistic routing protocol GIoR has a short transmission path, less forwarding times and less energy consumption in the data transmission process.
Claims (3)
1. A method for opportunistic routing of geographic information of a wireless sensor network is characterized by comprising the following steps: the method is realized by the following steps:
the method comprises the following steps: randomly deploying n nodes in a two-dimensional plane, wherein each node has enough neighbor nodes for communication; the communication radius of each node is r, and the geographical position information of each node and the geographical position information of a target node are known; in order to select nodes in a proper area for relay forwarding, firstly dividing a network area; setting the area of a network region as S, wherein X and Y are respectively length and width, R is the side length of one divided region, and mod (X, R) = mod (Y, R) =0 is satisfied; the nodes in each divided area know the position information of four vertexes in the divided area; when the node needs to forward data, a forwarding area is established for forwarding the data;
secondly, when the source node sends data, the source node is connected with the top point of the divided area, four fan-shaped areas are formed by the source node and the communication circle of the source node, then the fan shape which is divided by a connecting line L ine between the source node and the destination node is judged, the fan-shaped area is called as an original forwarding area, after the original forwarding area is determined, a convex mirror circle is made from the destination node to the source node, the forwarding area is determined, the distance from the source node to the destination node is L, the communication radius of the node is r, n = mod (L, r), the center of the convex mirror circle is on the straight line of L ine, and the distance from the convex mirror circle to the source node is equal to the distance from the sourceL 1Satisfy the requirement of
Determining the coordinate position of the circle center of the convex mirror circle; let us call the center of the convex mirror circle of the segmented sector SAB as the path guide point G, where the first path guide point is marked as G1And others are marked sequentially by G2、G3、G4… …, respectively; the awakening node in the forwarding area is called a candidate relay node;
step three: the method comprises the steps that a source node firstly sends a broadcast beacon to inform nodes in an awakening state in a forwarding area to prepare for relay competition; after receiving the broadcast beacon of the source node, the candidate node immediately replies an ACK (acknowledgement character) to the source node; when no collision occurs, it shows that there is only one waiting time in the forwarding areaSelecting nodes to become relay nodes for relay forwarding; if collision occurs, it indicates that other candidate nodes perform relay competition, and at the moment, all the candidate nodes calculate the distance from the candidate nodes to the path guidance point
Then calculate
，M i The node with the minimum value becomes a relay node to carry out relay forwarding; if the nodes in the forwarding area are in a sleep state and no node replies the source node ACK, the source node sends the broadcast beacon again for notification in the next time slot;
wherein (A) and (B)x i .y i ) Representing candidate nodes
Respectively, represent nodes
The abscissa and ordinate of (a); (x g .y g ) Representing nodesiIn-region path guide pointGRespectively, represent nodesGThe abscissa and the ordinate.
2. The wireless sensor network geographical information opportunistic routing method of claim 1, wherein: the method introduces a sleep awakening mechanism, the sleep awakening mechanism of each node is mutually independent, one sleep awakening cycle is divided into an awakening stage and a sleep stage, and the awakening time isT wake The sleep time isT sleep The wake-up time of the source node isT wake =T b +T w + T data ，T b Is the time at which the source node is broadcasting,T w is the time for the source node to wait for the candidate node to reply with an ACK,T data is the time when the source node sends data.
3. The wireless sensor network geographical information opportunistic routing method of claim 1, wherein: during data transmission, the broadcast energy consumption is equal to the interception energy consumptionE m The transmission energy consumption of the data isE s The receiving energy consumption of the data isE r The energy consumption of ACK reply is ignored, the energy consumption is not consumed when the source node waits for ACK reply and sleeps, and the energy consumption of competitive collision is not considered, then the source node sends the ACK messagekTotal energy consumption of a packet of bits isE stotal =E m +E s ×kReception by a nodekTotal energy consumption of a packet of bits isE rtotal =E r ×kWhen the current remaining energy of the nodes in the network is not enough to complete one data reception and transmission, i.e. when the nodes in the network are not enough to complete one data reception and transmissionE residue ﹤E rtotal +E stotal This node is called a dead node.
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 CN107172678A (en) | 2017-09-15 |
| CN107172678B true 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) |
Families Citing this family (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 |
| CN112087768B (en) * | 2020-09-17 | 2022-04-29 | 东北石油大学 | Low-energy-consumption routing method for oil and gas pipeline Internet of things |
| CN113965957B (en) * | 2021-09-27 | 2024-04-09 | 江苏大学 | Multi-hop-based adaptive transmission rate adjusting method in wireless body area network |
| 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 |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2484915B (en) * | 2010-10-22 | 2013-10-23 | Toshiba Res Europ Ltd | Forwarding and routing in sensor networks |
-
2017
- 2017-05-27 CN CN201710389669.8A patent/CN107172678B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
|---|
| "GEDAR: Geographic and Opportunistic Routing";Rodolfo W. L. Coutinho, Azzedine Boukerche, Luiz F. M. Vieira;《IEEE ICC 2014 - Ad-hoc and Sensor Networking Symposium》;20160201;251-256 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107172678A (en) | 2017-09-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107172678B (en) | Opportunistic routing method for geographic information of wireless sensor network | |
| Youssef et al. | A constrained shortest-path energy-aware routing algorithm for wireless sensor networks | |
| Zhu et al. | Hausdorff clustering and minimum energy routing for wireless sensor networks | |
| Wieselthier et al. | Energy-aware wireless networking with directional antennas: The case of session-based broadcasting and multicasting | |
| US9386504B2 (en) | Energy-efficient network protocol and node device for sensor networks | |
| Wieselthier et al. | Energy-limited wireless networking with directional antennas: the case of session-based multicasting | |
| Nazir et al. | Dynamic sleep scheduling for minimizing delay in wireless sensor network | |
| Gherbi et al. | Distributed energy efficient adaptive clustering protocol with data gathering for large scale wireless sensor networks | |
| CN111526558B (en) | Efficient routing method based on non-uniform clustering in WBAN | |
| CN105323818A (en) | Energy-saving clustering routing method based on network regional division and distances | |
| Cirstea | Energy efficient routing protocols for Wireless Sensor Networks: A survey | |
| WO2015083506A1 (en) | Method for transmitting packets in wireless network including node, method for transmitting packets in low power and lossy network, and node for forming wireless network | |
| Shah et al. | Joint optimization of a protocol stack for sensor networks | |
| Niewiadomska-Szynkiewicz et al. | Comparative study of wireless sensor networks energy-efficient topologies and power save protocols | |
| Bhasgi et al. | Energy and target coverage aware technique for mobile sink based wireless sensor networks with duty cycling | |
| Kaur et al. | Comparative analysis of clustering protocols for wireless sensor networks | |
| Chaudhary et al. | Energy efficiency and latency improving protocol for wireless sensor networks | |
| Alnawafa et al. | EDMHT-LEACH: Enhancing the performance of the DMHT-LEACH protocol for wireless sensor networks | |
| CN111556548B (en) | Multi-path routing protocol based on non-uniform clustering in WBAN | |
| Zhang et al. | Performance evaluation of leveled probabilistic broadcasting in MANETs and wireless sensor networks | |
| Chelbi et al. | An Unequal Cluster-based Routing Protocol Based on Data Controlling for Wireless Sensor Network. | |
| Long et al. | Energy-aware routing scheme in industrial wireless sensor networks for Internet of Things systems | |
| Soni et al. | Location-based routing protocols in wireless sensor networks: a survey | |
| CN108055686B (en) | Dynamic subnet dividing and collecting method for mobile sink nodes of agricultural wireless sensor network | |
| Zhao et al. | Dynamic cluster-based routing for wireless sensor networks |
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 |
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 |
|
| TR01 | Transfer of patent right |