CN101867974A - Data acquisition method in hybrid strip sensor network - Google Patents
Data acquisition method in hybrid strip sensor network Download PDFInfo
- Publication number
- CN101867974A CN101867974A CN 201010141200 CN201010141200A CN101867974A CN 101867974 A CN101867974 A CN 101867974A CN 201010141200 CN201010141200 CN 201010141200 CN 201010141200 A CN201010141200 A CN 201010141200A CN 101867974 A CN101867974 A CN 101867974A
- Authority
- CN
- China
- Prior art keywords
- node
- sink node
- sink
- sensor
- mobile
- 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
Images
Abstract
A data acquisition method in a hybrid strip sensor network belongs to the technical field of data acquisition in wireless sensor networks. The method is characterized in that a sensor node selects a destination Sink node according to the selecting the near principle by comparing the distance from the nearest fixed Sink node and the distance from the nearest movable Sink node at the present moment when selecting the destination Sink node, simultaneously, in the process of transferring a data packet, each intermediate node judges whether the movable Sink node exists in own one-hop range at the present moment, if so, the data packet is directly transferred up to the movable Sink node, if not, the data packet is transferred to the next-hop node and data transferring is continued. Aiming at the characteristics of the strip sensor network, the method combines the movable Sink and the fixed Sink and reduces data transmission delay while ensuring energy consumption equilibrium of the strip sensor network nodes and prolonging the life of the network.
Description
Technical field
The invention belongs to wireless sensor network data acquisition technique field.Be specifically related to a kind of in banded wireless sensor network by mobile Sink(gateway node) and the fixing mode that combines of the Sink method of carrying out data acquisition.
Background technology
Wireless sensor network be by microsensor with calculating, perception and wireless communication ability by the network that the self-organizing mode forms, need not the static infrastructure support, have characteristics such as quick deployment, survivability be strong, be widely used in every field.Deployment wherein sealed in frontier defense, that enclose field wireless sensor network nodes such as the anti-invasion in boundary, river monitoring, intelligent transportation, bridge monitoring, railway monitoring is rendered as banded structure usually, thereby banded wireless sensor network has broad application prospects and higher researching value.
At present, usually only comprise fixedly Sink node in the existing strip sensor network, sensor node is when carrying out data upload, basically be uploaded to from own nearest fixedly Sink node according to fixed route, thereby cause the sensor node energy consumption around the fixing Sink node too fast, make whole banded sensor network energy consume unbalanced; Simultaneously because the constraint in geographical position, causing fixedly, the deployment of Sink node is not random, thereby make some sensor node and recently fixedly the distance between the Sink node is still very long, and then cause transmission delay bigger, and improved the unsteadiness of transmitting; Simultaneously, when because some node energy exhausts when causing network not to be communicated with, make sensing data can't in time be uploaded to remote control terminal.
Summary of the invention
The present invention seeks to solve the drawback that exists in the existing strip sensor network, solve energy consumption and efficiency of transmission problem, prolong the strip sensor network life, reduce data transfer delay etc.
Hybrid strip sensor network among the present invention is made up of sensor node, stationary nodes, mobile Sink node three category nodes, sensor node is responsible for the collection and the transmission of data, fixedly Sink node and mobile Sink node are used for data and compile and be uploaded to remote control terminal (as by modes such as Internet, mobile radio communication), and other sensor nodes in the network are managed.No matter report for data, be by fixing Sink node, still passes to remote control terminal by mobile Sink node, and effect is the same.
Fixedly the quantity of Sink node and mobile Sink node can be 1, also can be a plurality of.Fixedly the deployment of Sink node can be at random, also can be to be deployed in the strip sensor network according to certain optimal way.
Basic skills flow process of the present invention is:
At first, mobile Sink node periodically sends the Hello bag in the process that at the uniform velocity moves.ID number and rate travel value comprising current mobile Sink node in each Hello bag.Receive the sensor node of Hello bag, upgrade the routing table information of self earlier, the routing table of each sensor node has four list items, wherein two are used to write down about own nearest fixedly Sink nodal information, two are used to write down from own nearest move left and right Sink nodal information in addition, the Hello bag of the mobile Sink node that the sensor node utilization newly receives, and, replace route table items corresponding in the routing table with the data in the Hello bag according to its moving direction.Mobile Sink node in (or right) side from the nearest left side of certain sensor node oneself, can regard as this sensor node last see left and the Sink node that moves right.
Secondly, sensor node has on the data and gives the correct time, and calculates the distance of all types of Sink nodes earlier according to routing table, gets its minimum value, as purpose Sink node, carries out data and reports.Carry positional information (to fixing sink) or the estimated position information (to mobile sink) of purpose sink in the packet.
At last, in the process of data forwarding, receive that the intermediate node (intermediatenodes) of packet can be earlier reappraises the distance of grouping purpose Sink node (if mobile sink) according to self routing table, if it is inconsistent with the estimated position of carrying in the grouping, then with new estimated position, and continue to transmit grouping to this target sink, continue said process, receive this grouping up to purpose sink.
By using fixedly Sink node and mobile Sink node simultaneously, help the sensor node energy consumption in the equalizing network, near the sensor node that suppresses the fixing Sink node is too fast because of packet forwarding consumed energy, thereby prolongs whole banded sensor network life; Simultaneously, sensor node can reduce the transmission delay of packet by selecting nearly selection Sink node.And fixedly the existence of Sink node can be guaranteed, when mobile Sink node left strip sensor network design when zone or provisional wireless transmission and interrupts, the sensor node in the network still can carry out real time data and report.
Description of drawings
Fig. 1 hybrid strip sensor network design structural representation.
Fig. 2 destination node is that mobile Sink node data is transmitted schematic diagram.
Fig. 3 destination node is that fixedly the Sink node data is transmitted schematic diagram.
Fig. 4 hybrid strip sensor network data acquisition flow chart.
Embodiment
According to Fig. 1, this patent method contains sensor node, mobile Sink node and fixing Sink node, and wherein each node is set at:
(1) mobile sink moves (allowing to turn back) along strip sensor network design zone;
(2) sensor node is disposed along straight line, or the section between at least two adjacent fixed sink is a straight line.Because belt-like zone is very narrow, we ignore ordinate, only come the representation node position of (comprising sink and sensor node) with abscissa.
(3) each sensor node record is from own nearest two fixing distances of sink; If certain of sensor node is fixing sink not on one side, then only need fixedly sink of record nearest.
(4) each sensor node is preserved adjacent node information, comprises node ID, node location information.
As the flow process of Fig. 4, concrete steps are:
Step 1, the mobile Sink node speed of calculating
Method 1: mobile Sink node is equipped with the GPS positioner, and in this case, mobile Sink node can obtain self rate travel and positional information in real time.
Method 2: mobile Sink node does not have the GPS positioner, in this case, need change the variation of estimating mobile Sink node location information by the positional information of its adjacent sensors node of the difference moment, and pass through the temporal information of passage, estimate the Mean Speed of mobile Sink.If the geographical position of sensor node i is that Xi(is an abscissa in the hybrid strip sensor network, owing to ignore banded network-wide, thereby ordinate can be ignored), sensor node is periodically broadcasted Hello bag (as per three seconds once).If sensor network adopts the sub-clustering topological structure, can only require leader cluster node broadcasting Hello bag, and common bunch of member node do not need broadcasting, can save node energy like this.Contained self ID number and geographical location information in the Hello bag that sensor node sends, in order to reduce error, improved estimation for accuracy, this patent adopts following steps that the speed of mobile Sink node is estimated:
1) mobile sink is with first Hello message of first sensor node of hearing, as the starting point of calculating.We remember that the geographical position of this sensor node is S
1, and the note current time is T
1
2) with distance
L(L〉〉 2R, R represents the transmission radius of node) estimate at interval for speed and (that is: whenever move about distance
LSpeed from new estimation mobile sink), along the moving direction of mobile Sink node, be L+S near the geographical position when hearing
1First Hello bag of sensor node (being not have other sensor node between this sensor node and this geographical position) broadcasting the time, the geographical position that obtains this sensor node from the Hello bag is designated as S
2, and the record current time is T
2Be S then with the geographical position
2Sensor node be starting point, be L+S near the geographical position when hearing
2First Hello bag of sensor node broadcasts the time, the geographical position that obtains this sensor node from the Hello bag is designated as S
3, and the record current time is T
3And the like, mobile Sink node is in the process that moves, and about every interval L just writes down the geographical position of a sensor node, and hears the moment of first Hello bag of this sensor node, and note is made (S
i, T
i).
When the approximately whenever mobile L distance of mobile Sink node j, all can estimate the translational speed of oneself again, mobile Sink node from the off, moved first about L apart from the time, its average rate travel
vComputing formula is:
v=|S
2－S
1|／（T
2－T
1）
And note
1=T
2-T
1
After this, mobile Sink node whenever moves the distance that is approximately L, its rate travel
vComputing formula is as follows:
v=|S
i
－S
i-1
|／[（1－α）×
+α×（T
i
－T
i-1
）]
I＞2, αBe constant
,0
＜α＜1
Wherein,
i=(1
-α) *
I-1 + α* (
T i -T I-1 ).
Comprehensively above-mentioned, the average rate travel of mobile Sink node
vComputing formula is as follows.
The establishment of step 2, sensor node routing table and renewal
Among the present invention, the routing table of each sensor node is made up of four list items, and route table items divides two parts, and every part accounts for two, and a part is used for fixing the Sink node, and a class is used for mobile Sink node, and concrete format content and computational methods are as follows:
L is Sink node route information table fixedly:
| The Sink node ID | Next-hop node ID | And distance between this sensor node | The direction type (about) |
The routing table information of the fixedly Sink node in the sensor node is preserved the fixedly Sink nodal information from own nearest the right and left, wherein arrives the next-hop node of left and right sides Sink node; The direction type; And information such as the distance between this sensor node just are fixed up when sensor node deployment usually, generally can dynamically not change.Wherein, sensor node i and the fixing distance of Sink node j, computing formula is as follows:
d
ij=|X
i－X
j|
X
iAnd X
jRepresent the sensor node and the fixing geographical position of Sink node respectively.
Mobile Sink node route information table:
| The Sink node ID | A left side (right side) neighbor node ID | Average rate travel | Receive for the first time the time of Hello bag | Moving direction (about) |
Two route table items that are used for mobile Sink node have been preserved respectively from the nearest mobile Sink nodal information of sensor node left and right directions, the route table items of mobile Sink node is along with constantly receiving the Hello bag that new mobile Sink node sends, and dynamically updates according to the moving direction of mobile Sink node.In addition, next-hop node ID also becomes with the Routing Protocol that is adopted.
Step 3, selection purpose Sink node
When sensor node has data upload, at first to select current nearest Sink node from oneself, step is as follows:
1) calculates recently the fixedly distance of Sink node
Sensor node is according to routing table information, can directly obtain itself arrive about the fixing distance of Sink node recently.
2) calculate the distance of nearest mobile Sink node
If the expression sensor node is to the distance of mobile Sink node;
v j The rate travel of representing mobile Sink node; The expression current time, t
hMobile Sink node is received in expression for the first time
jMoment of Hello bag,
RThe transmission radius of expression node, the cycle of sensor node broadcasts Hello is t
p
If
v j * (t
c-t
h)＜2R-
v j * t
p, sensor node
iAt mobile Sink node
jThe defeated scope of a jump set in, but then sensor node i and Sinkj direct communication, promptly next-hop node is exactly that this moves the Sink node.Otherwise sensor node
iAt mobile Sink node
jComputing formula as follows:
d
ij=
v j ×（t
c－t
h）－R
3) choose from sensor node apart from the Sink node of minimum as purpose Sink node, carry out data and report.
4) routing table refreshes
If sensor node moves the Sink nodal distance greater than the distance that itself arrives from own nearest fixedly Sink node to certain, then delete this.
Step 4, data forwarding (shown in Figure of description 2,3)
The data forwarding step is as follows:
1) sensor node is at first selected the own nearest purpose Sink node of current time distance from the routing table of oneself, if this Sink node is mobile Sink node, and in the defeated scope of a jump set, then data directly are transferred to this and move the Sink node, carry out data forwarding otherwise sensor node obtains next-hop node according to the purpose Sink node of selecting from routing table; If this purpose Sink node is mobile Sink node, then need in packet, need to comprise the Mean Speed that purpose moves the Sink node, moving direction, this sensor node i to purpose move Sink node j apart from d
Ij, and the positional information X of sensor node i
i
2) intermediate node is at first judged purpose Sink node types when receiving new packet, is mobile Sink or fixing Sink, and treatment step is as follows respectively:
Situation one: the purpose Sink node of packet is fixing Sink node.Whether intermediate node calculates current time earlier has mobile Sink node in the defeated scope of oneself jump set, have, and can directly be transferred to mobile Sink node to data; Otherwise intermediate node obtains next-hop node according to purpose Sink node ID number and continues to transmit packet from routing table.
Situation two: the purpose Sink node of packet is mobile Sink node.Intermediate node judges at first whether current time has mobile Sink node in the defeated scope of the jump set of oneself, have, and can directly be transferred to mobile Sink node to data.Otherwise intermediate node moves the Sink node ID according to the purpose in the packet and check whether exist this to move Sink node route list item in the routing table of oneself:
If exist, then intermediate node moves the Sink node ID according to the purpose in the packet and find next-hop node continuation forwarding data in the routing table of oneself.
Purpose moves Sink node list item in the packet if do not exist in the intermediate node routing table, then intermediate node is according to the routing direction of packet, the next-hop node that obtains equidirectional from routing table continues to transmit data, and it is constant that the purpose in the packet moves Sink.
Claims (5)
1. data acquisition method in hybrid strip sensor network, it is characterized in that: network is disposed along belt-like zone, and the length of band is much larger than the width of band; Network comprises three category nodes: sensor node, fixedly Sink node, mobile Sink node; Sensor node is in reported data, from select the purpose Sink node that nearly selection oneself will be uploaded from own nearest fixedly Sink node and mobile Sink node; Simultaneously, packet is in the process of transmitting, each via node need recomputate current from own nearest Sink node, if inconsistent with the purpose Sink node in the packet, the purpose Sink node that then changes in the packet is current from the nearest Sink node of this via node.
2. data acquisition method in hybrid strip sensor network according to claim 1 is characterized in that:
Sensing data reports step as follows:
1) sensor node is at first selected the own nearest purpose Sink node of current time distance from the routing table of oneself, if this Sink node is mobile Sink node, and in the defeated scope of a jump set, then data directly are transferred to this and move the Sink node, carry out data forwarding otherwise sensor node obtains next-hop node according to the purpose Sink node of selecting from routing table; If this purpose Sink node is mobile Sink node, then need in packet, to comprise the Mean Speed that purpose moves the Sink node, moving direction, this sensor node i to purpose move Sink node j apart from d
Ij, and the positional information X of sensor node i
i
2) intermediate node is at first judged the purpose Sink node type of this packet when receiving packet, is mobile Sink or fixing Sink, handles as follows respectively:
Situation one: the purpose Sink node of packet is fixing Sink node; Whether intermediate node calculates current time earlier has mobile Sink node in the defeated scope of oneself jump set, have, and can directly be transferred to mobile Sink node to data; Otherwise intermediate node obtains next-hop node according to purpose Sink node ID number and continues to transmit packet from routing table;
Situation two: the purpose Sink node of packet is mobile Sink node; Intermediate node judges at first whether current time has mobile Sink node in the defeated scope of the jump set of oneself, have, and can directly be transferred to mobile Sink node to data;
Otherwise intermediate node moves the Sink node ID according to the purpose in the packet and check whether exist this to move Sink node route list item in the routing table of oneself:
If exist, then intermediate node moves the Sink node ID according to the purpose in the packet and find next-hop node continuation forwarding data in the routing table of oneself;
Purpose moves Sink node list item in the packet if do not exist in the intermediate node routing table, then intermediate node is according to the routing direction of packet, the next-hop node that obtains equidirectional from routing table continues to transmit data, and it is constant that the purpose in the packet moves Sink.
3. data acquisition method in hybrid strip sensor network according to claim 1 is characterized in that: mobile Sink node rate prediction method is:
Mobile Sink node is along banded network uniform motion, rate travel is calculated by two kinds of methods, a kind of is by being equipped with the GPS device, a kind of is broadcasting geographical location information bag separately by the sensor node cycle, mobile Sink node is estimated the variation of mobile Sink node location information by the different positional informations of adjacent sensors node constantly that receive, and the temporal information by passage, estimate the Mean Speed of mobile Sink; Calculate the average rate travel of mobile Sink node
vComputing formula be:
。
4. according to right 1 described data acquisition method in hybrid strip sensor network, it is characterized in that: the routing table maintenance method is: mobile Sink node is in the process that moves, periodic broadcasting Hello bag, inform the rate travel of sensor node oneself, ID number, sensor node wraps the routing table information of upgrading oneself with Hello simultaneously; Routing table in each sensor node is made up of four list items, is divided into two classes, respectively accounts for two, and a class is used for fixing the Sink node, preserves from the fixedly Sink of the nearest the right and left of sensor node node routing iinformation; One class is used for mobile Sink node, preserves the mobile Sink node routing iinformation on the nearest left and right sides both direction of sensor node.
5. according to arbitrary described collecting method of claim 1 ~ 3, it is characterized in that: purpose sink node selecting method during data upload:
When sensor node has data upload, select the step of current nearest Sink node from oneself as follows:
1) calculates recently the fixedly distance of Sink node;
Sensor node is according to routing table information, can directly obtain itself arrive about the fixing distance of Sink node recently.
2) calculate the distance of nearest mobile Sink node;
If expression sensor node
To mobile Sink node
Distance;
v j The rate travel of representing mobile Sink node; t
cThe expression current time, mobile Sink node is received in expression for the first time
jMoment of Hello bag,
RThe transmission radius of expression node, the cycle of sensor node broadcasts Hello is t
p
If
v j * (t
c-t
h)＜2R-
v j * t
p, sensor node
iAt mobile Sink node
jThe defeated scope of a jump set in, but then sensor node i and Sinkj direct communication, promptly next-hop node is exactly that this moves the Sink node; Otherwise sensor node
iAt mobile Sink node
jComputing formula be: d
Ij=
v j * (t
c-t
h)-R;
3) choose from sensor node apart from the Sink node of minimum as purpose Sink node, carry out data and report;
4) routing table refreshes;
If sensor node moves the Sink nodal distance greater than the distance that itself arrives from own nearest fixedly Sink node to certain, then delete this.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010141200 CN101867974B (en) | 2010-04-08 | 2010-04-08 | Data acquisition method in hybrid strip sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010141200 CN101867974B (en) | 2010-04-08 | 2010-04-08 | Data acquisition method in hybrid strip sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101867974A true CN101867974A (en) | 2010-10-20 |
| CN101867974B CN101867974B (en) | 2013-03-20 |
Family
ID=42959480
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010141200 Expired - Fee Related CN101867974B (en) | 2010-04-08 | 2010-04-08 | Data acquisition method in hybrid strip sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101867974B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102123472A (en) * | 2011-03-09 | 2011-07-13 | 无锡泛联物联网科技股份有限公司 | Clustering-based data acquisition method of strip wireless sensor network |
| CN102695180A (en) * | 2011-03-23 | 2012-09-26 | 中兴通讯股份有限公司 | Mixed sink node WSN and data collection method thereof |
| CN102984040A (en) * | 2012-11-13 | 2013-03-20 | 上海交通大学 | Sensor network based on wire/wireless mixed framework |
| CN103444210A (en) * | 2011-03-11 | 2013-12-11 | 英派尔科技开发有限公司 | Monitoring wireless nodes using portable device |
| CN103596222A (en) * | 2013-11-29 | 2014-02-19 | 河海大学常州校区 | Wireless sensor network data acquisition method based on predictable mobile Sink position |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101247285A (en) * | 2008-03-20 | 2008-08-20 | 中科院嘉兴中心微系统所分中心 | Band wireless sensor network diagnosis method |
| CN101247302A (en) * | 2008-03-20 | 2008-08-20 | 中科院嘉兴中心微系统所分中心 | Linear regular banding wireless sensor network disposition method based on connectivity |
| CN101247303A (en) * | 2008-03-20 | 2008-08-20 | 中科院嘉兴中心微系统所分中心 | Arc type regular banding wireless sensor network laying method conforming to given connectivity |
-
2010
- 2010-04-08 CN CN 201010141200 patent/CN101867974B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101247285A (en) * | 2008-03-20 | 2008-08-20 | 中科院嘉兴中心微系统所分中心 | Band wireless sensor network diagnosis method |
| CN101247302A (en) * | 2008-03-20 | 2008-08-20 | 中科院嘉兴中心微系统所分中心 | Linear regular banding wireless sensor network disposition method based on connectivity |
| CN101247303A (en) * | 2008-03-20 | 2008-08-20 | 中科院嘉兴中心微系统所分中心 | Arc type regular banding wireless sensor network laying method conforming to given connectivity |
Non-Patent Citations (2)
| Title |
|---|
| 《计算机科学》 20100228 程真，et al 基于带状区域路由的无线传感器网络QoS协议 全文 1-5 第37卷, 第2期 * |
| 《软件学报》 20100131 郜帅，et al Sink轨迹固定传感器网络的高效数据采集机制 全文 1-5 第21卷, 第1期 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102123472A (en) * | 2011-03-09 | 2011-07-13 | 无锡泛联物联网科技股份有限公司 | Clustering-based data acquisition method of strip wireless sensor network |
| CN103444210A (en) * | 2011-03-11 | 2013-12-11 | 英派尔科技开发有限公司 | Monitoring wireless nodes using portable device |
| CN102695180A (en) * | 2011-03-23 | 2012-09-26 | 中兴通讯股份有限公司 | Mixed sink node WSN and data collection method thereof |
| CN102695180B (en) * | 2011-03-23 | 2017-06-09 | 中兴通讯股份有限公司 | Mixing sink node WSNs and its method of data capture |
| CN102984040A (en) * | 2012-11-13 | 2013-03-20 | 上海交通大学 | Sensor network based on wire/wireless mixed framework |
| CN103596222A (en) * | 2013-11-29 | 2014-02-19 | 河海大学常州校区 | Wireless sensor network data acquisition method based on predictable mobile Sink position |
| CN103596222B (en) * | 2013-11-29 | 2016-08-24 | 河海大学常州校区 | Based on the predictable collection method for wireless sensor network data in mobile Sink position |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101867974B (en) | 2013-03-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Villas et al. | A spatial correlation aware algorithm to perform efficient data collection in wireless sensor networks | |
| CN101808384B (en) | Wireless sensor network, routing method and node equipment | |
| Maraiya et al. | Efficient cluster head selection scheme for data aggregation in wireless sensor network | |
| CN101409940B (en) | Route selection method for wireless sensor network facing to target tracking application | |
| CN101547491B (en) | Routing method for mobile ad hoc network system | |
| CN101867974B (en) | Data acquisition method in hybrid strip sensor network | |
| US20060176863A1 (en) | Hierarchical routing in ad-hoc networks | |
| Mishra et al. | Study of cluster based routing protocols in wireless sensor networks | |
| CN104202772A (en) | Mobile Sink data collection method applied to wireless sensor network and used for node internal-memory resource sharing | |
| CN104469879A (en) | Dynamic k value clustering routing method | |
| Zhu et al. | A high-available and location predictive data gathering scheme with mobile sinks for wireless sensor networks | |
| Jin et al. | Q-learning-Based Opportunistic Routing with an on-site architecture in UASNs | |
| CN101873663A (en) | Multi-path routing algorithm based on energy sensing reliability | |
| CN104202724A (en) | AANET combined routing algorithm based on geographical location information | |
| CN102123472A (en) | Clustering-based data acquisition method of strip wireless sensor network | |
| Ratnaraj et al. | OEDSR: Optimized energy-delay sub-network routing in wireless sensor network | |
| CN103260206A (en) | Mixing dynamic wireless router effective search convergence method based on influence degree factors | |
| WO2014198120A1 (en) | Wireless mobile network data transmission method based on coverage maintenance and minimum spanning tree | |
| CN101471864A (en) | Data forwarding method based on receiver route in wireless self-organizing network | |
| Wang et al. | An improved VANET intelligent forward decision-making routing algorithm | |
| Benmahdi et al. | Greedy forwarding routing schemes using an improved K-means approach for wireless sensor networks | |
| CN104394554B (en) | A kind of prediction type low delay Geographic routing method | |
| CN104320811A (en) | Routing method for traffic distribution by using node information transmission capacity | |
| Shen et al. | An ant colony system based energy prediction routing algorithms for wireless sensor networks | |
| Cevik et al. | Localized energy efficient routing for wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C56 | Change in the name or address of the patentee |
Owner name: JIANGSU UBISENSING INTERNET OF THINGS TECHNOLOGY C Free format text: FORMER NAME: WUXI UBISENSING INTERNET OF THINGS TECHNOLOGY CO., LTD. |
|
| CP03 | Change of name, title or address |
Address after: Jiangsu province Wuxi City Linghu District Road No. 228 Tian wisdom city A1 building 7 floor Patentee after: Jiangsu Zhongke Fanlian Internet of Things Technology Co., Ltd. Address before: Jinxi road Binhu District 214125 Jiangsu city of Wuxi province No. 100 Taihu city science and Technology Industrial Park Patentee before: Wuxi Ubisensing Internet of Things Technology Co., Ltd. |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Data acquisition method in hybrid strip sensor network Effective date of registration: 20131209 Granted publication date: 20130320 Pledgee: Agricultural Bank of China Limited by Share Ltd Wuxi science and Technology Branch Pledgor: Jiangsu Zhongke Fanlian Internet of Things Technology Co., Ltd. Registration number: 2013990000945 |
|
| PLDC | Enforcement, change and cancellation of contracts on pledge of patent right or utility model | ||
| PP01 | Preservation of patent right |
Effective date of registration: 20150122 Granted publication date: 20130320 |
|
| RINS | Preservation of patent right or utility model and its discharge | ||
| PD01 | Discharge of preservation of patent |
Date of cancellation: 20160122 Granted publication date: 20130320 |
|
| RINS | Preservation of patent right or utility model and its discharge | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20130320 Termination date: 20150408 |
|
| EXPY | Termination of patent right or utility model |