CN106888491B - Wireless sensor network on-demand quick awakening method based on constructive interference - Google Patents

Wireless sensor network on-demand quick awakening method based on constructive interference Download PDF

Info

Publication number
CN106888491B
CN106888491B CN201611201027.2A CN201611201027A CN106888491B CN 106888491 B CN106888491 B CN 106888491B CN 201611201027 A CN201611201027 A CN 201611201027A CN 106888491 B CN106888491 B CN 106888491B
Authority
CN
China
Prior art keywords
wake
node
route
signal
nodes
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
Application number
CN201611201027.2A
Other languages
Chinese (zh)
Other versions
CN106888491A (en
Inventor
郝洁
王然
董第
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing University of Aeronautics and Astronautics
Original Assignee
Nanjing University of Aeronautics and Astronautics
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Nanjing University of Aeronautics and Astronautics filed Critical Nanjing University of Aeronautics and Astronautics
Priority to CN201611201027.2A priority Critical patent/CN106888491B/en
Publication of CN106888491A publication Critical patent/CN106888491A/en
Application granted granted Critical
Publication of CN106888491B publication Critical patent/CN106888491B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22Communication 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
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02Power saving arrangements
    • H04W52/0209Power saving arrangements in terminal devices
    • H04W52/0225Power saving arrangements in terminal devices using monitoring of external events, e.g. the presence of a signal
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing 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 wireless sensor network demand-based quick awakening method based on constructive interference, which is characterized in that in consideration of the limited awakening distance of a low-power consumption awakening antenna, among any adjacent data transmission route nodes, the nodes establish a multi-hop awakening route with the minimum hop count between any required node and a forwarding node thereof according to gradient and designate constructive interference cooperative nodes and awakening signal forwarding delay for the nodes on the awakening route; when a wake-up requirement exists in the data communication process, the wake-up is carried out along the wake-up route, meanwhile, the route node and the cooperative node on the wake-up route simultaneously forward the wake-up signal through the forwarding delay setting of the wake-up signal, and the wake-up range is expanded by utilizing constructive interference until the main antenna of the wake-up target receiving node is reached. The invention can rapidly wake up the sleeping node only when needed, thereby realizing the purpose of improving the real-time property of data transmission on the premise of saving energy as much as possible.

Description

Wireless sensor network on-demand quick awakening method based on constructive interference
Technical Field
The invention belongs to the technical field of wireless sensor networks, and particularly relates to an on-demand quick wake-up protocol based on constructive interference.
Background
In wireless sensor networks, energy has always been a critical issue to consider. There are studies that show that sensor nodes consume a large amount of unnecessary energy when they are listening idle. Sensor nodes therefore typically employ sleep scheduling to conserve energy and can only assume communication tasks in the awake (active) state. Sleep scheduling can significantly reduce energy consumption and improve network lifetime, but it also increases end-to-end data transmission delay, which also presents challenges for some delay-sensitive applications. Such as fire monitoring, illegal intrusion monitoring, air pollution monitoring and the like, the end-to-end transmission delay of data is required to be minimized, and the sensing and reporting of target events can be completed in a short time.
For the purpose of low-energy-consumption fast awakening of the sleep node, an effective method is to provide an additional low-power-consumption awakening antenna WuRx (wakeup receiver) for the sensor node, use the main antenna for data transmission, and use WuRx for awakening. WuRx requires that the received signal power be generally higher than-29.3 dBm, and the wake-up distance is also around 35 m. While the conventional antenna has higher sensitivity and transmission distance, for example, the antenna CC2420 widely used by the sensor has sensitivity as high as-95 dBm, and the transmission distance is also in the order of hundreds of meters. By comparison, it can be seen that the sensitivity and working distance of WuRx are much lower than those of the main antenna. This performance mismatch may cause that the nodes that need to be woken up cannot be woken up in time, that is, the nodes in the single-hop data transmission range need to be woken up through multiple hops. Using fig. 1 for example, if the node S selects the node D as its next hop node based on a certain routing protocol (the routing protocol usually establishes a route according to the transmission characteristics of the main antenna), if the distance between the nodes SD exceeds the wake-up distance, the node S cannot wake up the node D directly, but only wake up a first and wake up D. Aiming at the problem, the invention researches a rapid awakening mechanism based on WuRx, designs a minimum hop count on-demand awakening mechanism, strengthens the awakening signal by constructive interference in the awakening process, expands the transmission distance of the awakening signal, and can awaken the target node at the fastest speed to finally realize the real-time transmission of data.
Disclosure of Invention
The invention provides a wireless sensor network rapid awakening method based on constructive interference according to needs, aiming at the defects of the problems, and the method can rapidly awaken a sleep node only when needed, thereby achieving the purpose of improving the real-time performance of data transmission on the premise of saving energy as much as possible.
The technical scheme provided by the invention for solving the technical problems is as follows:
a wireless sensor network demand-based quick awakening method based on constructive interference is characterized in that the limited awakening distance of a low-power consumption awakening antenna is considered, and in any adjacent data transmission route nodes, the nodes establish a multi-hop awakening route with the minimum hop count between any required node and a forwarding node thereof according to gradient and designate constructive interference cooperative nodes and awakening signal forwarding delay for the nodes on the awakening route; when a wake-up requirement exists in the data communication process, the wake-up is carried out along the wake-up route, meanwhile, the route node and the cooperative node on the wake-up route simultaneously forward the wake-up signal through the forwarding delay setting of the wake-up signal, and the wake-up range is expanded by utilizing constructive interference until the main antenna of the wake-up target receiving node is reached.
Preferably: the method for establishing the multi-hop awakening route with the minimum hop count according to the gradient comprises the following steps:
when any network node S needs to wake up the next hop transmitting node D, the slave node S starts to use a wake-up antenna to transmit a wake-up route establishment request signal WAKEUP _ RREQ; in the forwarding process, each node updates and records the minimum hop count of the distance S as a gradient and forwards WAKEUP _ RREQ; in the forwarding process, each node monitors signals of all neighbor nodes and selects the strongest signal in the same gradient as the own cooperative node; the node D selects a path with the minimum hop count from all the received WAKEUP _ RREQs, and returns a wake-up route establishment response signal WAKEUP _ RREP to the original path; the intermediate node determines that the intermediate node is a node and a cooperative node on the wake-up route after receiving the WAKEUP _ RREP; and the node S receives the WAKEUP _ RREP to indicate that the establishment of the wake-up route and the selection of the cooperative node are finished.
Preferably: when an adjacent node needs to be awakened, namely when data needs to reach a sleeping awakening target receiving node D from a sending node S, the sending node S sends an awakening signal WAKEUP _ REQ along an awakening route; only the nodes on the wake-up route and the cooperative nodes transmit the wake-up signals according to the set transmission delay after receiving the wake-up signals, the wake-up range is expanded by utilizing constructive interference, and other nodes enter the sleep mode; if the nodes on the wake-up route and the cooperative nodes sense the wake-up signals of the nodes with higher gradient before forwarding, the nodes enter sleep inhibition forwarding; after receiving the wake-up signal, the receiving node wakes up the main antenna to return a WAKEUP _ REP signal to the sending node; if the sending node S receives the WAKEUP _ REP signal within a certain time, the data transmission is carried out, otherwise, the wake-up signal is sent again.
Preferably: the wake-up signal WAKEUP _ REQ contains only the gradient of the current node and the target node D.
Preferably: the wake-up signal forwarding delay is set as follows:
T=(G-g)Tmax/G+Tp
wherein T represents the forwarding delay from the moment of receiving the signal, G is the maximum gradient number, G represents the gradient of the current node, Tmax is the maximum delay, Tp represents the time required for processing the signal, etc., and the gradient is the minimum hop number from the S node.
Compared with the prior art, the method has the following beneficial effects:
in the wireless sensor network using the low-power-consumption wake-up antenna, the nodes establish a multi-hop wake-up route with the minimum hop count between any required node and a forwarding node thereof and designate constructive interference cooperative nodes for the nodes on the wake-up route. When a wake-up requirement exists in the data communication process, the wake-up is carried out along the wake-up route, and meanwhile, the nodes determine the forwarding delay of the wake-up signal according to the gradient. Meanwhile, the route node and the cooperative node on the wake-up route transmit the wake-up signal simultaneously through the forwarding delay setting of the wake-up signal, and the wake-up range is expanded by utilizing constructive interference to accelerate the wake-up process. Through the mechanism, the sleeping node can be rapidly awakened only when needed, so that the aim of improving the real-time property of data transmission is fulfilled on the premise of saving energy as much as possible. Therefore, the invention can design an on-demand multi-hop wake-up route to rapidly wake up the sleep sensor node as required aiming at a delay sensitive event monitoring network (such as a wireless sensor network for fire monitoring, illegal intrusion monitoring, air pollution monitoring and the like), and the like, and utilizes constructive interference to accelerate the wake-up process in the wake-up process, thereby finally realizing a good balance relation among energy consumption, network service life and transmission delay.
Drawings
The neighbor nodes of the single-hop data transmission in fig. 1 need to be awakened through multiple hops.
Fig. 2 wake-up procedure.
Detailed Description
The accompanying drawings disclose a schematic structural diagram of a preferred embodiment of the present invention without limitation, and the technical solution of the present invention will be described in detail with reference to the accompanying drawings.
Examples
Assuming that a certain wireless sensor network is randomly or planned to be deployed in an event monitoring area, each sensor node is provided with a main antenna with higher power consumption and a wake-up antenna with low power consumption. When no communication task exists, the main antenna sleeps; when a communication task exists, the sending node sends a wake-up signal, and the low-power-consumption wake-up antenna of the target receiving node receives the wake-up signal and then wakes up the main antenna of the receiving node to perform data transmission. The present invention assumes that there is already some routing protocol present, i.e. each node already knows its next hop forwarding node.
The protocol includes two phases: a setup phase for waking up the route and an on-demand wake-up phase. Specific embodiments of each stage will be described in detail below.
1) Setup phase of wake-up route
This phase is a network initialization phase for establishing wake-up routes and cooperative nodes. The establishment of the wake-up route must depend on the data transmission route, and when some data transmission route is established, the establishment of the wake-up route is started (or can be synchronized with the route establishment process). If the node S selects the node D as the next hop forwarding node of the node S, the S initiates a wake-up route establishment process for reaching the node D. To wake up fastest, the invention extends the wake-up range using constructive interference. The specific process is as follows.
a. Starting to use a wake-up antenna to send a wake-up route request signal WAKEUP _ RREQ including the address of a destination node D from a node S;
b. establishing a wake-up gradient for each received intermediate node, wherein the gradient is the minimum hop count from the S node;
c. after updating the gradient, each node receiving WAKEUP _ RREQ forwards WAKEUP _ RREQ;
d. after receiving WAKEUP _ RREQ transmitted by a plurality of paths, the node D selects the route with the minimum hop count as a wake-up route (if a plurality of routes with the minimum hop count exist, the route which is received earliest is selected as the wake-up route), and returns a WAKEUP _ RREP to the original route;
e. after receiving the WAKEUP _ RREP, the intermediate node determines the intermediate node as a node on the wake-up route, adds cooperative node information in the WAKEUP _ RREP, and determines the intermediate node as a cooperative node after the cooperative node is sensed;
f. and after receiving the WAKEUP _ RREP, the node S wakes up the establishment of the route and finishes the selection of the cooperative node.
2) Data transmission phase
When the node S has data to send to D, it first needs to wake up the node D as needed. The node S transmits a wake up signal wake _ REQ along the wake up route. The wake-up signal wake _ REQ only contains the gradient of the current node and the target node D, so that the wake-up signals forwarded by the nodes with the same gradient will be the same signal, and the wake-up range can be extended by using constructive interference. In the awakening process, only the nodes on the awakening route and the cooperative nodes thereof can forward the awakening signal, and the awakening signal is forwarded according to the forwarding delay T after the awakening signal is received. The forwarding delay T of each node is set according to the gradient of the node, and is specifically set as follows:
T=(G-g)Tmax/G+Tp, (1)
wherein T represents the forwarding delay from the moment of receiving the signal, and g represents the gradient of the current node; tp represents a time required for processing a signal or the like, and is a fixed value; g is a maximum gradient number, is a fixed value, and can be set according to a data transmission distance and an awake distance (for example, G ═ 4); tmax is the maximum delay and is also a fixed value, for example, Tmax is 50 ms.
The forwarding delay setting ensures that the forwarding delay T of the awakening signal forwarded by the nodes with the same gradient is the same, and the nodes with high gradient can be forwarded faster, so that the forwarding delay with the same gradient is the same, and the nodes on the awakening route and the cooperative nodes thereof can be forwarded at the same time. The second purpose is that after receiving WAKEUP _ REQ, each gradient node simultaneously forwards WAKEUP _ REQ after the same time delay, so that constructive interference can be effectively utilized to improve the wake-up distance; when the node with the low gradient hears the node with the high gradient to forward WAKEUP _ REQ, the node with the low gradient inhibits the forwarding of the node to sleep, the forwarding delay of the node with the high gradient is smaller, the forwarding delay of the node with the low gradient is larger, and the energy consumption is reduced to the maximum extent.
When an adjacent node needs to be awakened, namely when data needs to reach a sleeping awakening target receiving node D from a sending node S, the sending node S sends an awakening signal WAKEUP _ REQ along an awakening route; only the nodes on the wake-up route and the cooperative nodes transmit the wake-up signals according to the set transmission delay after receiving the wake-up signals, the wake-up range is expanded by utilizing constructive interference, and other nodes enter the sleep mode; if the nodes on the wake-up route and the cooperative nodes sense the wake-up signals of the nodes with higher gradient before forwarding, the nodes enter sleep inhibition forwarding; after receiving the wake-up signal, the receiving node wakes up the main antenna to return a WAKEUP _ REP signal to the sending node; if the sending node S receives the WAKEUP _ REP signal within a certain time, the data transmission is carried out, otherwise, the wake-up signal is sent again.
The wake-up procedure will be described in detail below.
When each node S has data to send to the sleeping node D, the node S sends a wake-up signal WAKEUP _ REQ, wherein the wake-up signal WAKEUP _ REQ comprises the current gradient 0 and the address of the destination node D.
After receiving the wake-up signal wake _ REQ, each node performs the following operations:
a. recording the receiving time as Tr;
b. if the current node is not the node on the wake-up route reaching D or the cooperative node, packet loss is cleared up Tr and the node enters sleep;
c. if the current node is a wake-up routing node or a cooperative node to reach D, the interception is maintained, and the forwarding time is set to Ttx + T, where T is the forwarding delay set according to equation (1).
d. If the current node monitors WAKEUP _ REQ of the high-gradient node before the wake-up signal is forwarded, the Ttx is cleared of packet loss and the current node goes to sleep;
e. the current node forwards a wake-up signal WAKEUP _ REQUEST at time Ttx, including the gradient of the current node and the address of the destination node D.
This process continues until the D node receives the WAKEUP _ REQ to wake up. After being awakened, the node D sends a WAKEUP _ REP signal containing ID information of the node D and the like by using the main antenna.
f. When the node S senses the WAKEUP _ REP of D, data transmission is performed. If the node S does not hear WAKEUP _ REP of D within a certain time, the wake-up procedure is restarted.
How the wake-up procedure is performed will be exemplified below.
As shown in fig. 2, the next-hop routing node of the node S is the node D, and the node S needs to wake up the node D quickly. The wake-up route between SDs is S-w1-w2-w3-D, node c1c2c3Are respectively w1w2w3The cooperative node of (1). S will first send a wake-up signal WAKEUP _ REQ, node w1And c1And after receiving the wake-up signal, simultaneously forwarding the wake-up signal according to the own forwarding delay. Node w due to constructive interference2w3c2A wake-up signal is received. According to the setting of the forwarding delay, w3The wake-up signal, w, will be forwarded earlier2And c2Monitor w3Will go to sleep after the wake-up signal. Last w3Node D is awakened. So far the wake-up process is finished. The gray nodes in the figure represent nodes that have forwarded WAKEUP _ REQ, and the white nodes represent nodes that have not forwarded.
After being awakened, the node D opens the main antenna and returns a WAKEUP _ REP signal, and the node S can send data after receiving the WAKEUP _ REP signal. Node D will start the wake-up procedure and the data transmission procedure again after receiving the data. This process continues until the data reaches the sink node.
The preferred embodiments of the present invention described above with reference to the accompanying drawings are only for illustrating the embodiments of the present invention and are not to be construed as limiting the aforementioned object of the invention and the contents and scope of the appended claims, and any simple modification, equivalent change and modification of the above embodiments according to the technical essence of the present invention still fall within the technical and claim protection scope of the present invention.

Claims (2)

1. A wireless sensor network on-demand quick awakening method based on constructive interference is characterized in that: considering the limited wake-up distance of the low-power-consumption wake-up antenna, among any adjacent data transmission routing nodes, the nodes establish a multi-hop wake-up route with the minimum hop count between any required node and a forwarding node thereof according to the gradient and assign constructive interference cooperative nodes and wake-up signal forwarding delay to the nodes on the wake-up route; when a wake-up requirement exists in the data communication process, the wake-up is carried out along a wake-up route, meanwhile, a route node and a cooperative node on the wake-up route simultaneously forward the wake-up signal through the forwarding delay setting of the wake-up signal, and the wake-up range is expanded by utilizing constructive interference until a main antenna of a wake-up target receiving node is reached;
the method for establishing the multi-hop awakening route with the minimum hop count according to the gradient comprises the following steps:
when any network node S needs to wake up the next hop transmitting node D, the slave node S starts to use a wake-up antenna to transmit a wake-up route establishment request signal WAKEUP _ RREQ; in the forwarding process, each node updates and records the minimum hop count of the distance S as a gradient and forwards WAKEUP _ RREQ; in the forwarding process, each node monitors signals of all neighbor nodes and selects the strongest signal in the same gradient as the own cooperative node; the node D selects a path with the minimum hop count from all the received WAKEUP _ RREQs, and returns a wake-up route establishment response signal WAKEUP _ RREP to the original path; the intermediate node determines that the intermediate node is a node and a cooperative node on the wake-up route after receiving the WAKEUP _ RREP; the node S receives the WAKEUP _ RREP to indicate that the establishment of the wake-up route and the selection of the cooperative node are finished;
when an adjacent node needs to be awakened, namely when data needs to reach a sleeping awakening target receiving node D from a sending node S, the sending node S sends an awakening signal WAKEUP _ REQ along an awakening route; only the nodes on the wake-up route and the cooperative nodes transmit the wake-up signals according to the set transmission delay after receiving the wake-up signals, the wake-up range is expanded by utilizing constructive interference, and other nodes enter the sleep mode; if the nodes on the wake-up route and the cooperative nodes sense the wake-up signals of the nodes with higher gradient before forwarding, the nodes enter sleep inhibition forwarding; the target receiving node wakes up the main antenna to return a WAKEUP _ REP signal to the sending node after receiving the wake-up signal; if the sending node S receives the WAKEUP _ REP signal within a certain time, the data transmission is carried out, otherwise, the wake-up signal is sent again;
the wake-up signal forwarding delay is set as follows:
T=(G-g)Tmax/G+Tp
wherein, T represents the forwarding delay from the moment of receiving the signal, G is the maximum gradient number, G represents the gradient of the current node, Tmax is the maximum delay, Tp represents the time required for processing the signal, and the gradient is the minimum hop number from the S node.
2. The method for on-demand fast wake-up of a wireless sensor network based on constructive interference according to claim 1, wherein: the wake-up signal wake _ REQ contains only the gradient of the current node and the target receiving node D.
CN201611201027.2A 2016-12-22 2016-12-22 Wireless sensor network on-demand quick awakening method based on constructive interference Active CN106888491B (en)

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 CN106888491A (en) 2017-06-23
CN106888491B true 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 (1)

* Cited by examiner, † Cited by third party
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

Families Citing this family (4)

* Cited by examiner, † Cited by third party
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
CN110784902B (en) * 2019-10-17 2022-07-29 电子科技大学 Energy efficiency cooperation multicast routing method oriented to multi-hop wireless network
JP7207278B2 (en) * 2019-11-22 2023-01-18 株式会社オートネットワーク技術研究所 In-vehicle relay device and relay method
CN114040469B (en) * 2021-11-08 2024-03-19 中南大学 Pre-awakening rapid routing and energy-efficient routing method and system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103402236A (en) * 2013-06-28 2013-11-20 南京邮电大学 Constructive interference based wireless sensor network flooding mechanism
CN106131800A (en) * 2016-06-12 2016-11-16 东南大学 A kind of implementation method towards intensive wireless senser ACT MAC protocol

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10211662B2 (en) * 2014-08-15 2019-02-19 Analog Devices Global Wireless charging platform using environment based beamforming for wireless sensor network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103402236A (en) * 2013-06-28 2013-11-20 南京邮电大学 Constructive interference based wireless sensor network flooding mechanism
CN106131800A (en) * 2016-06-12 2016-11-16 东南大学 A kind of implementation method towards intensive wireless senser ACT MAC protocol

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
《Routing Protocols for Duty Cycled Wireless Sensor Networks: A Survey》;Jie Hao etc.;《IEEE Communications Magazine》;20121224;第50卷(第12期);第116-123页 *
《一种面向随机调度无线传感器网络的路由方法》;张永江,郝洁 等;《中国科学院研究生院学报》;20130331;第30卷(第2期);第251-256页 *
《基于Glossy机制的无线传感器网络OHFS协议设计与实现》;张智为;《CNKI博硕论文数据库》;20160531;全文 *

Cited By (1)

* Cited by examiner, † Cited by third party
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

Also Published As

Publication number Publication date
CN106888491A (en) 2017-06-23

Similar Documents

Publication Publication Date Title
CN106888491B (en) Wireless sensor network on-demand quick awakening method based on constructive interference
EP3024289B1 (en) Communication system, communication apparatus and communication method, and computer program
Yang et al. A wakeup scheme for sensor networks: Achieving balance between energy saving and end-to-end delay
US7729285B2 (en) Energy-efficient network protocol and node device for sensor networks
US7496059B2 (en) Energy-efficient medium access control protocol and system for sensor networks
US8547982B2 (en) Wireless sensor network with energy efficient protocols
US20070242634A1 (en) Method and apparatus for message transmission within a communication system
KR101032724B1 (en) method for wireless multi-hop network
Jun et al. Trading latency for energy in densely deployed wireless ad hoc networks using message ferrying
CN107211368A (en) Network, battery-operated node and the method for managing battery-operated node of node
JP2006005933A (en) Power saving method in distributed wireless network and system having power saving function
CN102843758B (en) Method for data energy conservation transmission between nodes in wireless sensor network
Hwang et al. A novel efficient power‐saving MAC protocol for multi‐hop MANETs
Awerbuch et al. The pulse protocol: Energy efficient infrastructure access
Sadiq et al. An Energy-Efficient Cross-Layer approach for cloud wireless green communications
US8355380B1 (en) Mesh power conservation
Hsieh et al. A hybrid MAC protocol for wireless sensor networks
JP5618243B2 (en) Control device, program executed in the control device, and communication system including the control device
Wang et al. p-manet: Efficient power saving protocol for multi-hop mobile ad hoc networks
JP7321699B2 (en) Wireless sensor network system
Vergados et al. An Energy Efficiency Scheme for Wireless Sensor Networks
Soares et al. A Hybrid Cross-Layer Protocol for Wireless Sensor Networks Based on Backbone
Shinde et al. An energy efficient critical event monitoring routing method for wireless sensor networks
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

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