CN106888491A - A kind of wireless sensor network based on constructive interference fast wake-up method on demand - Google Patents
A kind of wireless sensor network based on constructive interference fast wake-up method on demand Download PDFInfo
- Publication number
- CN106888491A CN106888491A CN201611201027.2A CN201611201027A CN106888491A CN 106888491 A CN106888491 A CN 106888491A CN 201611201027 A CN201611201027 A CN 201611201027A CN 106888491 A CN106888491 A CN 106888491A
- Authority
- CN
- China
- Prior art keywords
- node
- wake
- signal
- route
- wakeup
- 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
-
- 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/0225—Power saving arrangements in terminal devices using monitoring of external events, e.g. the presence of a signal
-
- 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 invention discloses a kind of wireless sensor network based on constructive interference fast wake-up method on demand, the limited wake-up distance of antenna is waken up in view of low-power consumption, between any adjacent data transfer route node, the multi-hop for setting up minimum hop count according to gradient between any desired node and its forward node is waken up and route and for the node waken up in route specifies constructive interference cooperative node and wake-up signal Forwarding Latency by node；In data communication process when there is wake-up demand, to be waken up along route is waken up, simultaneously, set by the Forwarding Latency of wake-up signal, so that the routing node and cooperative node on waking up forward wake-up signal simultaneously, scope is waken up using constructive interference extension, until to the primary antenna of wake up target receiving node.The present invention only can quickly wake up sleeping nodes when needing, so as to realize improving the purpose of data transfer real-time on the premise of energy-conservation as far as possible.
Description
Technical field
The invention belongs to wireless sensor network technology field, and in particular to a kind of quickly calling out on demand based on constructive interference
Awake agreement.
Background technology
In wireless sensor network, energy is always the key issue for needing to consider.There are some researches show sensor node
Substantial amounts of unnecessary energy is consumed in idle listening.Therefore sensor node generally uses sleep scheduling to save energy,
Only communication task can be just undertaken in clear-headed (work) state.Although sleep scheduling can significantly reduce energy ezpenditure, improve net
The network life-span, but can also increase data transmission delay end to end, and this also brings challenge to the application of some latency sensitives.Such as
The applications such as fire hazard monitoring, illegal invasion monitoring, air pollution monitoring, it is desirable to minimize data transmission delay end to end, can
The perception and report of object event are completed in a short period of time.
For the fast wake-up sleeping nodes of low energy consumption, a kind of effective manner be equipped with to sensor node it is extra
Low-power consumption wakes up antenna WuRx (Wakeup Receiver), is carried out data transmission using primary antenna, is waken up using WuRx.
The signal power that WuRx requirements are received is generally greater than -29.3dBm, wakes up distance also in 35m or so.And traditional antenna has
The widely used antenna CC2420 of sensitivity higher and transmission range, such as sensor has the sensitivity of up to -95dBm,
Its transmission range is also in hundred meter levels.By compare it can be seen that WuRx sensitivity and operating distance all well below primary antenna.
This performance is mismatched can be caused to need the node for waking up to be waken up in time, that is to say, that in single-hop data transmission range
Node needs to be waken up by multi-hop.Using accompanying drawing 1 for example, if node S is based on certain Routing Protocol selection node D
It is the next-hop node (Routing Protocol sets up route generally according to the transmission characteristic of primary antenna) of oneself, if node SD distances are super
Wake-up distance is crossed, then node S cannot directly wake up node D, can only first wake up A and wake up D again.For the problem, this hair
A kind of bright fast wake-up mechanism based on WuRx of research, designs a kind of minimum hop count wake-up mechanism on demand, and in wakeup process
Strengthen the transmission range that wake-up signal extends wake-up signal using constructive interference, wake-up destination node that can be most fast is final real
The real-time transmission of existing data.
The content of the invention
Present invention deficiency regarding to the issue above, proposes that a kind of wireless sensor network based on constructive interference is quick on demand
Awakening method, the present invention only can quickly wake up sleeping nodes when needing, so as on the premise of energy-conservation as far as possible
Realize improving the purpose of data transfer real-time.
The present invention is that the technical scheme for solving above-mentioned technical problem proposition is：
A kind of wireless sensor network based on constructive interference fast wake-up method on demand, it is contemplated that low-power consumption wakes up antenna
Limited wake-up distance, between any adjacent data transfer route node, node will any desired node and its forward
The multi-hop for setting up minimum hop count according to gradient between node wakes up and route and for the node waken up in route specifies constructive interference association
Make node and wake-up signal Forwarding Latency；In data communication process when there is wake-up demand, will be carried out along route is waken up
Wake up, meanwhile, set by the Forwarding Latency of wake-up signal so that routing node and cooperative node in wake-up are forwarded simultaneously calls out
Wake up signal, scope is waken up using constructive interference extension, until to the primary antenna of wake up target receiving node.
Preferably：The method that the multi-hop for setting up minimum hop count according to gradient wakes up route：
When needing to wake up its next-hop forward node D for any one network node S, begin to use from node S and call out
Antenna of waking up sends and wakes up Route establishment request signal WAKEUP_RREQ；Each node updates and recording distance S in repeating process
Minimum hop count be gradient, and forward WAKEUP_RREQ；Each node can intercept all neighbor node letters in repeating process
Number, and select the cooperative node as oneself of peak signal in identical gradient；Node D is in all WAKEUP_RREQ for receiving
The path of middle selection minimum hop count, and backtracking wakes up Route establishment answer signal WAKEUP_RREP；Intermediate node is being received
Determine it oneself is to wake up the node and cooperative node in route after WAKEUP_RREP；Node S receives WAKEUP_RREP and represents and calls out
Awake Route establishment and cooperative node selection are finished.
Preferably：When the need for thering is adjacent node to wake up, that is, there are data to need to reach the wake-up of sleep from sending node S
During intended recipient node D, sending node S will send wake-up signal WAKEUP_REQ along route is waken up；Only wake up in route
Node and cooperative node after wake-up signal is received according to setting Forwarding Latency forward wake-up signal, using constructive interference
Expand and wake up scope, other nodes will be into sleep；If the node and cooperative node that wake up in route are intercepted before forwarding
Wake-up signal to more high gradient node then enters sleep suppression forwarding；Receiving node wakes up main day after wake-up signal is received
Line returns to WAKEUP_REP signals to sending node；Sending node S if WAKEUP_REP signals are received within a certain period of time
Carry out data transmission, otherwise resend wake-up signal.
Preferably：The only gradient containing present node and destination node D in wake-up signal WAKEUP_REQ.
Preferably：Wake-up signal Forwarding Latency is set as follows：
T=(G-g) Tmax/G+Tp
Wherein, since T represent the Forwarding Latency receiving the signal moment, and G is greatest gradient number, and g represents present node
Gradient, Tmax is maximum delay, and Tp represents the required time such as process signal, and gradient is the minimum hop count apart from S nodes.
Compared to existing technology, have the advantages that：
The present invention in the wireless sensor network for waking up antenna using low-power consumption, node will in any desired node and
The multi-hop that minimum hop count is set up between its forward node wakes up the specified constructive interference cooperation of node for routeing and being on wake-up route
Node.In data communication process when there is wake-up demand, will be waken up along route is waken up, while node is true according to gradient
Determine the Forwarding Latency of wake-up signal.Meanwhile, set by the Forwarding Latency of wake-up signal so that routing node and association in wake-up
Make node while forwarding wake-up signal, scope is waken up using constructive interference extension, accelerate wakeup process.By this mechanism, can
Only quickly to wake up sleeping nodes when needing, so as to realize improving data transfer reality on the premise of energy-conservation as far as possible
The purpose of when property.Therefore the present invention can be directed to event-monitoring network (such as fire hazard monitoring, the illegal invasion prison of latency sensitive
The wireless sensor networks such as control, air pollution monitoring) etc., design a kind of multi-hop on demand and wake up the fast wake-up that route can be on demand
Sleep sensor node, and accelerate wakeup process using constructive interference in wakeup process, and finally realize energy consumption, network longevity
Well balanced relation between life, transmission delay.
Brief description of the drawings
The neighbor node of Fig. 1 single-hop data transfers needs to be waken up by multi-hop.
Fig. 2 wakeup process.
Specific embodiment
Accompanying drawing discloses the structural representation of a preferred embodiment of the invention without limitation, detailed below with reference to accompanying drawing
Carefully illustrate technical scheme.
Embodiment
Assuming that certain wireless sensor network is random or has being deployed in event-monitoring region of planning, each sensor node
It is equipped with the primary antenna of higher power dissipation and the wake-up antenna of low-power consumption.When without communication task, primary antenna sleep；Appoint there is communication
During business, sending node can send wake-up signal, and the low-power consumption of purpose receiving node wakes up after antenna receives wake-up signal and can call out
The primary antenna of awake receiving node carries out data transmission.Present invention assumes that there is the presence of certain Routing Protocol, i.e. each node
The next-hop forward node of oneself is known.
This agreement includes two stages：The establishment stage of wake-up route and on demand awakening phase.To chat in detail respectively below
State the specific embodiment in each stage.
1) establishment stage of route is waken up
This stage is the netinit stage, and route and cooperative node are waken up for setting up.The foundation for waking up route is necessary
It is route depending on data transfer, when the route foundation of certain data transfer is finished, then wakes up Route establishment and start (can also and to route
Setting up process is synchronously carried out).If node S have selected next-hop forward node of the node D as oneself, S initiates to reach D's
Wake up route establishment process.Waken up for most fast, the present invention wakes up scope using constructive interference extension.Detailed process is as follows.
A. begin to use wake-up antenna to send from node S and wake up routing request signal WAKEUP_RREQ, comprising destination node
The address of D；
B. the intermediate node that each is received is set up and wakes up gradient, and gradient is the minimum hop count apart from S nodes；
C. after updating gradient, each node for receiving WAKEUP_RREQ will forward WAKEUP_RREQ；
D. node D is received will select the route of minimum hop count as wake-up after the WAKEUP_RREQ that mulitpath is transmitted
Route (if the route of a plurality of minimum hop count, then selects the conduct for receiving earliest to wake up route), and backtracking WAKEUP_
RREP；
E. intermediate node will determine oneself to wake up the node in route after receiving WAKEUP_RREP, and in WAKEUP_
Cooperative node information is added in RREP, cooperative node determines oneself to be cooperative node after listening to；
F. after node S receives WAKEUP_RREP, wake up Route establishment and cooperative node selection is finished.
2) data transfer phase
When node S has data is activation to D, it is necessary first to wake-up node D on demand.Node S sends along route is waken up
Wake-up signal WAKEUP_REQ.The only gradient containing present node and destination node D in wake-up signal WAKEUP_REQ, therefore phase
The wake-up signal forwarded with the node of gradient will be identical signal, it is possible to use constructive interference extension wakes up scope.Woke up
Cheng Zhong, the node and its cooperative node only waken up in route can forward wake-up signal, by root after wake-up signal is received
Wake-up signal is forwarded according to forward delay T.The forward delay T of wherein each node is set according to the gradient of node, is specifically set
Put as follows：
T=(G-g) Tmax/G+Tp, (1)
Since wherein T represent the forward delay receiving the signal moment, and g represents the gradient of present node；At Tp expressions
The required times such as reason signal, it is set to a fixed value；G be greatest gradient number, be fixed value, can according to data transfer away from
From with wake up with a distance from set (such as G=4)；Tmax is maximum delay, is also fixed value, such as Tmax=50ms.
This forward delay sets and causes that identical gradient node forwarding wake-up signal forward delay T is identical, and ladder high
The node of degree can be forwarded faster, the result is that the Forwarding Latency of identical gradient is identical, ensure the node that wakes up in route and
Its cooperative node can be forwarded simultaneously.Its purpose has two, and the node of each gradient will be after WAKEUP_REQ be received identical
Time delay after simultaneously forward WAKEUP_REQ, can effectively using constructive interference improve wake up distance；When the node of low gradient is listened
To suppress the forwarding of oneself after to the node forwarding WAKEUP_REQ of high gradient and enter sleep, the node Forwarding Latency of high gradient is more
The node Forwarding Latency of small and low gradient is bigger, the reduction energy ezpenditure of maximum possible.
When the need for thering is adjacent node to wake up, that is, there are data to need the wake up target for reaching sleep from sending node S to connect
When receiving node D, sending node S will send wake-up signal WAKEUP_REQ along route is waken up；Only wake up the node in route
Wake-up signal is forwarded according to the Forwarding Latency of setting after wake-up signal is received with cooperative node, is expanded using constructive interference and called out
Awake scope, other nodes will be into sleep；If the node and cooperative node in wake-up route listen to higher before forwarding
The wake-up signal of gradient node then enters sleep and suppresses forwarding；Receiving node wakes up primary antenna to hair after wake-up signal is received
Node is sent to return to WAKEUP_REP signals；Sending node S enters line number if WAKEUP_REP signals are received within a certain period of time
According to transmission, wake-up signal is otherwise resend.
To specifically introduce wakeup process below.
When each node S has the data to need to be sent to sleeping nodes D, node S sends wake-up signal WAKEUP_REQ, wherein
Address comprising current gradient 0 and destination node D.
Each node will be proceeded as follows after wake-up signal WAKEUP_REQ is received：
A. the record reception time is Tr；
If b. present node is not the node or cooperative node in the wake-up route for reach D, packet loss empties Tr simultaneously
Into sleep；
If c. present node is the wake-up routing node or cooperative node for reaching D, holding is intercepted, and when setting forwarding
Between be Ttx=Trx+T, wherein T be according to formula (1) set Forwarding Latency.
If d. present node listens to the WAKEUP_REQ of high gradient node before wake-up signal is forwarded, packet loss is emptied
Ttx simultaneously enters sleep；
E. present node forwards wake-up signal WAKEUP_REQUEST at the Ttx moment, includes the gradient and mesh of present node
Node D address.
The process is continued for, and is waken up until D nodes receive WAKEUP_REQ.D nodes will use master after being waken up
Antenna sends WAKEUP_REP signals, the id information comprising oneself etc..
F. when node S listens to the WAKEUP_REP of D, then carry out data transmission.If node S does not have within a certain period of time
The WAKEUP_REP of D is listened to, then restarts wakeup process.
Will be exemplified below what how wakeup process was carried out.
As shown in Figure 2, the next-hop routing node of node S is node D, and node S needs fast wake-up D.Between SD
It is S-w to wake up route1-w2-w3- D, node c1c2c3It is respectively w1w2w3Cooperative node.S will first send wake-up signal
WAKEUP_REQ, node w1And c1After receiving wake-up signal, the Forwarding Latency according to oneself forwards wake-up signal simultaneously.Due to
The effect of constructive interference, node w2w3c2Have received wake-up signal.According to the setting of Forwarding Latency, w3By forwarding earlier
Wake-up signal, w2And c2Listen to w3Wake-up signal after will into sleep.Last w3Node D is waken up.So far wakeup process knot
Beam.Grayed-out nodes represent the node that forwarded WAKEUP_REQ in figure, and white nodes represent the node not forwarded.
Node D can open primary antenna after being waken up, return to WAKEUP_REP signals, and node S is received after WAKEUP_REP i.e.
Transmittable data.Node D will be again started up wakeup process and data transmission procedure after receiving the data.The process is held always
Continue data and reach sink nodes.
Embodiments of the present invention are merely to illustrate above in conjunction with the preferred embodiment of the present invention described by accompanying drawing, and
It is every according to technical spirit of the invention not as the limitation to aforementioned invention purpose and appended claims content and scope
To any simple modification made for any of the above embodiments, equivalent variations and modification, still belong to the technology of the present invention and rights protection category.
Claims (5)
1. a kind of wireless sensor network based on constructive interference fast wake-up method on demand, it is characterised in that：In view of low work(
Consumption wakes up the limited wake-up distance of antenna, and between any adjacent data transfer route node, node will be in any desired section
The multi-hop for setting up minimum hop count according to gradient between point and its forward node wakes up and route and for the node waken up in route is specified
Constructive interference cooperative node and wake-up signal Forwarding Latency；In data communication process when there is wake-up demand, will be along calling out
Awake route is waken up, meanwhile, set by the Forwarding Latency of wake-up signal so that routing node and cooperative node in wake-up
Wake-up signal is forwarded simultaneously, scope is waken up using constructive interference extension, until to the primary antenna of wake up target receiving node.
2. the wireless sensor network based on constructive interference according to claim 1 fast wake-up method, its feature on demand
It is：The method that the multi-hop for setting up minimum hop count according to gradient wakes up route：
When needing to wake up its next-hop forward node D for any one network node S, wake-up day is begun to use from node S
Line sends and wakes up Route establishment request signal WAKEUP_RREQ；Each node updates and recording distance S be most in repeating process
Small hop count is gradient, and forwards WAKEUP_RREQ；Each node can intercept all neighbor node signals in repeating process, and
Select the cooperative node as oneself of peak signal in identical gradient；Node D is selected in all WAKEUP_RREQ for receiving
The path of minimum hop count, and backtracking wakes up Route establishment answer signal WAKEUP_RREP；Intermediate node is being received
Determine it oneself is to wake up the node and cooperative node in route after WAKEUP_RREP；Node S receives WAKEUP_RREP and represents and calls out
Awake Route establishment and cooperative node selection are finished.
3. the wireless sensor network based on constructive interference according to claim 2 fast wake-up method, its feature on demand
It is：When the need for thering is adjacent node to wake up, that is, there are data to need the wake up target for reaching sleep from sending node S to receive section
During point D, sending node S will send wake-up signal WAKEUP_REQ along route is waken up；Only wake up node and the association in route
Make node and forward wake-up signal according to the Forwarding Latency of setting after wake-up signal is received, expanded using constructive interference and wake up model
Enclose, other nodes will be into sleep；If the node and cooperative node that wake up in route listen to more high gradient before forwarding
The wake-up signal of node then enters sleep and suppresses forwarding；Receiving node wakes up primary antenna after wake-up signal is received and is saved to transmission
Point returns to WAKEUP_REP signals；Sending node S carries out data biography if WAKEUP_REP signals are received within a certain period of time
It is defeated, otherwise resend wake-up signal.
4. the wireless sensor network based on constructive interference according to claim 1 fast wake-up method, its feature on demand
It is：The only gradient containing present node and destination node D in wake-up signal WAKEUP_REQ.
5. the wireless sensor network based on constructive interference according to claim 1 fast wake-up method, its feature on demand
It is：Wake-up signal Forwarding Latency is set as follows：
T=(G-g) Tmax/G+Tp
Wherein, since T represent the Forwarding Latency receiving the signal moment, and G is greatest gradient number, and g represents the ladder of present node
Degree, Tmax is maximum delay, and Tp represents the required time such as process signal, and gradient is the minimum hop count apart from S nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611201027.2A CN106888491B (en) | 2016-12-22 | 2016-12-22 | Wireless sensor network on-demand quick awakening method based on constructive interference |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611201027.2A CN106888491B (en) | 2016-12-22 | 2016-12-22 | Wireless sensor network on-demand quick awakening method based on constructive interference |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106888491A true CN106888491A (en) | 2017-06-23 |
| CN106888491B CN106888491B (en) | 2020-04-24 |
Family
ID=59176454
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611201027.2A Active CN106888491B (en) | 2016-12-22 | 2016-12-22 | Wireless sensor network on-demand quick awakening method based on constructive interference |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106888491B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108449734A (en) * | 2018-03-20 | 2018-08-24 | 深圳市创艺工业技术有限公司 | Groups of building energy-consumption monitoring device based on wireless sensor network |
| CN110784902A (en) * | 2019-10-17 | 2020-02-11 | 电子科技大学 | Energy efficiency cooperation multicast routing method oriented to multi-hop wireless network |
| CN114040469A (en) * | 2021-11-08 | 2022-02-11 | 中南大学 | Pre-awakening fast routing and energy-efficient routing method and system |
| CN114731298A (en) * | 2019-11-22 | 2022-07-08 | 株式会社自动网络技术研究所 | Vehicle-mounted relay device and relay method |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP4057698A1 (en) * | 2021-03-08 | 2022-09-14 | Université de Strasbourg | Methods for routing wake-up signals in a network and associated system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103402236A (en) * | 2013-06-28 | 2013-11-20 | 南京邮电大学 | Constructive interference based wireless sensor network flooding mechanism |
| US20160049824A1 (en) * | 2014-08-15 | 2016-02-18 | Analog Devices Technology | Wireless charging platform using environment based beamforming for wireless sensor network |
| CN106131800A (en) * | 2016-06-12 | 2016-11-16 | 东南大学 | A kind of implementation method towards intensive wireless senser ACT MAC protocol |
-
2016
- 2016-12-22 CN CN201611201027.2A patent/CN106888491B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103402236A (en) * | 2013-06-28 | 2013-11-20 | 南京邮电大学 | Constructive interference based wireless sensor network flooding mechanism |
| US20160049824A1 (en) * | 2014-08-15 | 2016-02-18 | Analog Devices Technology | Wireless charging platform using environment based beamforming for wireless sensor network |
| CN106131800A (en) * | 2016-06-12 | 2016-11-16 | 东南大学 | A kind of implementation method towards intensive wireless senser ACT MAC protocol |
Non-Patent Citations (4)
| Title |
|---|
| JIE HAO ETC.: "《IEEE ICC 2012 - Ad-hoc and Sensor Networking Symposium》", 30 June 2012 * |
| JIE HAO ETC.: "《Routing Protocols for Duty Cycled Wireless Sensor Networks: A Survey》", 《IEEE COMMUNICATIONS MAGAZINE》 * |
| 张智为: "《基于Glossy机制的无线传感器网络OHFS协议设计与实现》", 《CNKI博硕论文数据库》 * |
| 张永江,郝洁 等: "《一种面向随机调度无线传感器网络的路由方法》", 《中国科学院研究生院学报》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108449734A (en) * | 2018-03-20 | 2018-08-24 | 深圳市创艺工业技术有限公司 | Groups of building energy-consumption monitoring device based on wireless sensor network |
| CN110784902A (en) * | 2019-10-17 | 2020-02-11 | 电子科技大学 | Energy efficiency cooperation multicast routing method oriented to multi-hop wireless network |
| CN110784902B (en) * | 2019-10-17 | 2022-07-29 | 电子科技大学 | Energy efficiency cooperation multicast routing method oriented to multi-hop wireless network |
| CN114731298A (en) * | 2019-11-22 | 2022-07-08 | 株式会社自动网络技术研究所 | Vehicle-mounted relay device and relay method |
| CN114040469A (en) * | 2021-11-08 | 2022-02-11 | 中南大学 | Pre-awakening fast routing and energy-efficient routing method and system |
| CN114040469B (en) * | 2021-11-08 | 2024-03-19 | 中南大学 | Pre-awakening rapid routing and energy-efficient routing method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106888491B (en) | 2020-04-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106888491A (en) | A kind of wireless sensor network based on constructive interference fast wake-up method on demand | |
| Suh et al. | A traffic aware, energy efficient MAC protocol for wireless sensor networks | |
| KR101293378B1 (en) | Wireless network including post groupcast time | |
| CN108541047A (en) | The indicating means and equipment of downlink service data | |
| CN103906207A (en) | Wireless sensor network data transmission method based on self-adaptation required awakening technology | |
| CN107889199A (en) | A kind of state transition method and device | |
| Hwang et al. | A novel efficient power‐saving MAC protocol for multi‐hop MANETs | |
| Sadiq et al. | An Energy-Efficient Cross-Layer approach for cloud wireless green communications | |
| Alhalafi et al. | gTBS: A green task-based sensing for energy efficient wireless sensor networks | |
| Zhao et al. | A transmission power control MAC protocol for wireless sensor networks | |
| Wang et al. | Opportunistic cooperation in low duty cycle wireless sensor networks | |
| Wang et al. | DPS-MAC: An asynchronous MAC protocol for wireless sensor networks | |
| Park et al. | Power saving algorithms for wireless sensor networks on IEEE 802.15. 4 | |
| Hou et al. | A wireless sensor network clustering algorithm based on energy and distance | |
| Vasanthi et al. | AWS: Asynchronous wakeup schedule to minimize latency in wireless sensor networks | |
| Glaropoulos et al. | Enhanced IEEE 802.11 power saving for multi-hop toy-to-toy communication | |
| Tang et al. | REA-MAC: A low latency routing-enhanced asynchronous duty-cycle MAC protocol for wireless sensor networks | |
| Nguyen et al. | Extensions of the ieee802. 15.4 protocol for ultra-low energy real-time communication | |
| Lim et al. | Rcast: A randomized communication scheme for improving energy efficiency in MANETs | |
| Wang et al. | An energy-saving algorithm of WSN based on gabriel graph | |
| Wang et al. | A power control based handshake-competition MAC protocol for underwater acoustic networks | |
| Durai et al. | Energy efficient random cast DSR protocol with mediation device in MANET | |
| Dong et al. | An Energy Efficient Cross-Layer Clustering Scheme for Wireless Sensor Network | |
| Sumathi et al. | Energy efficient bandwidth constrained QoS enabled multipath routing for MANETs | |
| Sivanesan et al. | An energy efficient overhearing controlled medium access control protocol for multi-hop MANETs |
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 |