CN101867974B - Data acquisition method in hybrid strip sensor network - Google Patents
Data acquisition method in hybrid strip sensor network Download PDFInfo
- Publication number
- CN101867974B CN101867974B CN 201010141200 CN201010141200A CN101867974B CN 101867974 B CN101867974 B CN 101867974B CN 201010141200 CN201010141200 CN 201010141200 CN 201010141200 A CN201010141200 A CN 201010141200A CN 101867974 B CN101867974 B CN 101867974B
- Authority
- CN
- China
- Prior art keywords
- node
- sink node
- sensor
- sink
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 25
- 230000005540 biological transmission Effects 0.000 claims abstract description 18
- 238000004364 calculation method Methods 0.000 claims description 7
- 238000012545 processing Methods 0.000 claims description 2
- 238000012423 maintenance Methods 0.000 claims 1
- 238000005265 energy consumption Methods 0.000 abstract description 5
- 238000010586 diagram Methods 0.000 description 4
- 238000012544 monitoring process Methods 0.000 description 3
- 241000854291 Dianthus carthusianorum Species 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000007123 defense Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000002265 prevention Effects 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000007789 sealing Methods 0.000 description 1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
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 the technical field of wireless sensor network data acquisition. In particular to a method for collecting data in a strip-shaped wireless sensor network by combining a mobile Sink (gateway node) and a fixed Sink.
Background
The wireless sensor network is formed by micro sensors with computing, sensing and wireless communication capabilities in a self-organizing mode, does not need fixed infrastructure support, has the characteristics of rapid deployment, strong survivability and the like, and is widely applied to various fields. The deployment of the wireless sensor network nodes in the fields of frontier defense sealing control, enclosure intrusion prevention, river monitoring, intelligent traffic, bridge monitoring, railway monitoring and the like is generally in a strip-shaped structure, so that the strip-shaped wireless sensor network has wide application prospect and higher research value.
At present, an existing strip-shaped sensor network only comprises fixed Sink nodes, and when data is uploaded by the sensor nodes, the sensor nodes are basically uploaded to the fixed Sink nodes nearest to the sensor nodes according to a fixed path, so that the energy consumption of the sensor nodes around the fixed Sink nodes is too high, and the energy consumption of the whole strip-shaped sensor network is unbalanced; meanwhile, due to the constraint of the geographical position, the fixed Sink nodes are not randomly arranged, so that the distance between some sensor nodes and the nearest fixed Sink node is still long, the transmission delay is larger, and the instability of transmission is improved; meanwhile, when the network is not communicated due to the energy exhaustion of some nodes, the sensing data cannot be uploaded to the remote control end in time.
Disclosure of Invention
The invention aims to solve the defects of the conventional strip sensor network, solve the problems of energy consumption and transmission efficiency, prolong the service life of the strip sensor network, reduce data transmission delay and the like.
The hybrid strip sensor network comprises three types of nodes, namely a sensor node, a fixed node and a mobile Sink node, wherein the sensor node is responsible for collecting and transmitting data, and the fixed Sink node and the mobile Sink node are used for collecting and uploading the data to a remote control end (such as through the Internet, a mobile communication network and the like) and managing other sensor nodes in the network. For data reporting, the effect is the same whether the data is transmitted to a remote control end through a fixed Sink node or a mobile Sink node.
The number of the fixed Sink nodes and the mobile Sink nodes may be 1 or more. The fixed Sink nodes may be deployed randomly or in an optimized manner in the strip sensor network.
The basic method flow of the invention is as follows:
firstly, the mobile Sink node periodically sends Hello packets in the process of uniform movement. Each Hello packet contains the ID number of the current mobile Sink node and the mobility rate value thereof. The sensor nodes receiving the Hello packet update own routing table information firstly, the routing table of each sensor node has four table entries, two of the four table entries are used for recording the nearest left and right fixed Sink node information, the other two table entries are used for recording the nearest left and right Sink node information, and the sensor nodes use the newly received Hello packet of the mobile Sink node and replace the corresponding routing table entries in the routing table with data in the Hello packet according to the moving direction of the Hello packet. The left (or right) mobile Sink node closest to a certain sensor node can be regarded as the Sink node which moves left and right and is seen by the last sensor node.
Secondly, when data report exists in the sensor nodes, the distances from the sensor nodes to various Sink nodes are calculated according to the routing table, the minimum value is taken as a target Sink node, and data report is carried out. The data packet carries the position information (for fixed sink) or the estimated position information (for mobile sink) of the destination sink.
Finally, in the process of data forwarding, the intermediate node (intermediate nodes) receiving the data packet can firstly re-estimate the distance to the destination Sink node (if the destination Sink node is a mobile Sink) of the packet according to the routing table of the intermediate node, if the distance is inconsistent with the estimated position carried in the packet, the intermediate node follows the new estimated position and continues to forward the packet to the destination Sink, and the process is continued until the destination Sink receives the packet.
The fixed Sink node and the mobile Sink node are used simultaneously, so that energy consumption of the sensor nodes in the network is balanced, the sensor nodes near the fixed Sink node are restrained from consuming too fast energy due to data packet forwarding, and the service life of the whole strip-shaped sensor network is prolonged; meanwhile, the sensor node selects the Sink node closely, so that the transmission delay of the data packet can be reduced. And the existence of the fixed Sink node can ensure that the sensor nodes in the network can still report real-time data when the mobile Sink node leaves a ribbon sensor network deployment area or the temporary wireless transmission is interrupted.
Drawings
Fig. 1 is a schematic diagram of a hybrid strip sensor network deployment architecture.
Fig. 2 is a schematic diagram of data forwarding of a mobile Sink node.
Fig. 3 is a schematic diagram of data forwarding of a fixed Sink node.
FIG. 4 is a hybrid strip sensor network data acquisition flow diagram.
Detailed Description
According to fig. 1, the method of the present invention includes a sensor node, a mobile Sink node, and a fixed Sink node, where each node is set as:
(1) the mobile sink moves along the deployment area of the strip-shaped sensor network (turn-back is allowed);
(2) the sensor nodes are arranged along a straight line, or at least the section between two adjacent fixed sinks is a straight line. Since the banded region is narrow, we ignore the ordinate and represent the location of the nodes (including sink and sensor nodes) only in the abscissa.
(3) Each sensor node records the distance between two fixed sinks nearest to the sensor node; if one side of the sensor node has no fixed sink, only the nearest fixed sink needs to be recorded.
(4) Each sensor node stores adjacent node information including node ID and node location information.
As shown in the flow of fig. 4, the specific steps are as follows:
step 1, calculating the rate of the mobile Sink node
The method comprises the following steps: the mobile Sink node is provided with a GPS positioning device, and under the condition, the mobile Sink node can obtain the self moving speed and the position information in real time.
The method 2 comprises the following steps: the mobile Sink node does not have a GPS positioning device, in this case, the change of the mobile Sink node position information needs to be estimated through the position information change of the adjacent sensor nodes at different time, and the average speed of the mobile Sink node needs to be estimated through the elapsed time information. Let Xi be the geographical location of sensor node i in the hybrid strip sensor network (i.e. abscissa, negligible ordinate due to neglecting strip network width), the sensor node broadcasts Hello packets periodically (e.g. once every three seconds). If the sensor network adopts a clustering topological structure, only cluster head nodes can be required to broadcast the Hello packets, and common cluster member nodes do not need to broadcast, so that the node energy can be saved. The Hello packet sent by the sensor node contains the ID number and the geographical position information of the sensor node, and in order to reduce errors and improve estimation accuracy, the method adopts the following steps to estimate the speed of the mobile Sink node:
1) the mobile sink takes the first Hello message heard from the first sensor node as the starting point for the computation. Let us remember that the geographical position of the sensor node is S1And recording the current time as T1；
2) By distanceL（L>>2R, R denotes the transmission radius of the node) is the rate estimation interval (i.e.: each travel by about a distanceLFrom the new estimate of the velocity of the mobile Sink), along the moving direction of the mobile Sink node, L + S when the closest geographical position is heard1When the first Hello packet is broadcast by the sensor node (i.e. there is no other sensor node between the sensor node and the geographical location), the geographical location of the sensor node is obtained from the Hello packet and is marked as S2And recording the current time as T2(ii) a Then taking the geographic position as S2The sensor node of (1) is taken as a starting point, and L + S is taken as the closest geographical position when hearing2When the first Hello packet is broadcasted by the sensor node, the geographical position of the sensor node is obtained from the Hello packet and is marked as S3And recording the current time as T3(ii) a By analogy, the mobile Sink node records the geographical position of a sensor node and the time when the mobile Sink node hears the first Hello packet of the sensor node every L or so during the moving process, and records the time (S)i,Ti）。
When the mobile Sink node j moves about every L distances, the self moving speed is estimated again, and the average moving speed of the mobile Sink node starts from the starting point and moves over the first about L distancesvThe calculation formula is as follows:
v=|S2－S1|／（T2－T1）
memo
1=T2－T1。
Thereafter, the mobile Sink node moves at a rate of about L for every distance that the node movesvThe calculation formula is as follows:
v=|S i －S i-1 |／[（1－α）× 
+α×（T i －T i-1 ）]
i＞2，αis a constant quantity，0＜α＜1
Wherein,
i=（1－α）×
i-1 +α×（T i －T i-1 ）。
combining the above, the average moving rate of the mobile Sink nodevThe calculation formula is as follows.
Step 2, creating and updating sensor node routing table
In the invention, the routing table of each sensor node consists of four table entries, the routing table entries are divided into two parts, each part respectively occupies two entries, one part is used for fixing the Sink node, the other part is used for moving the Sink node, and the specific format content and the calculation method are as follows:
l, fixing a Sink node routing information table:
| sink node ID | Next hop node ID | Distance between the sensor and the node | Type of direction (left and right) |
The routing table information of the fixed Sink nodes in the sensor nodes stores the fixed Sink node information of the left side and the right side closest to the sensor nodes, wherein the fixed Sink node information is the next hop node of the left Sink node and the right Sink node; a direction type; information such as the distance between the sensor node and the sensor node is usually fixed when the sensor node is deployed, and generally does not change dynamically. The distance between the sensor node i and the fixed Sink node j is calculated according to the following formula:
dij=|Xi－Xj|
Xi and XjRespectively representing the geographical positions of the sensor node and the fixed Sink node.
And (3) a mobile Sink node routing information table:
| sink node ID | Left (right) neighbor node ID | Average moving rate | Time of first receipt of Hello packet | Moving direction (left and right) |
The two routing table entries for the mobile Sink node respectively store the mobile Sink node information closest to the sensor node in the left-right direction, and the routing table entries of the mobile Sink node are dynamically updated according to the moving direction of the mobile Sink node along with the continuous receiving of new Hello packets sent by the mobile Sink node. In addition, the next hop node ID is also a function of the routing protocol employed.
Step 3, selecting a destination Sink node
When the sensor node has data to upload, firstly, the nearest Sink node from the sensor node is selected, and the steps are as follows:
1) calculating the distance to the nearest fixed Sink node
The sensor node can directly acquire the distance from the sensor node to the left and right nearest fixed Sink nodes according to the routing table information.
2) Calculating the distance to the nearest mobile Sink node
Setting the distance from the sensor node to the mobile Sink node;v j representing the moving rate of the mobile Sink node; indicates the current time, thIndicates the first timeReceive mobile Sink nodejThe time of the Hello packet of (c),Rrepresenting the transmission radius of the node, and the period of the sensor node broadcasting Hello is tp。
If it is notv j ×（tc－th）＜2R－v j ×tpNode of sensoriIn a mobile Sink nodejWithin the transmission range of one hop, the sensor node i and the Sink j can directly communicate, that is, the next hop node is the mobile Sink node. Else the sensor nodeiIn a mobile Sink nodejThe calculation formula of (a) is as follows:
dij=v j ×（tc－th）－R
3) and selecting the Sink node with the minimum distance from the sensor node as a target Sink node, and reporting data.
4) Routing table refresh
And if the distance from the sensor node to a certain mobile Sink node is greater than the distance from the sensor node to a fixed Sink node closest to the sensor node, deleting the item.
Step 4, data forwarding (as shown in the attached figures 2 and 3 of the specification)
The data forwarding steps are as follows:
1) the sensor node selects a destination Sink node closest to the sensor node at the current moment from a routing table of the sensor node, if the Sink node is a mobile Sink node and is within a hop transmission range, data is directly transmitted to the mobile Sink node, otherwise the sensor node acquires a next hop node from the routing table according to the selected destination Sink node for data forwarding; if the destination Sink node is a mobile Sink node, the data packet needs to contain the average speed and the moving direction of the destination mobile Sink node, and the distance d from the sensor node i to the destination mobile Sink node jijAnd position information X of sensor node ii。
2) When receiving a new data packet, the intermediate node firstly judges the type of a destination Sink node, namely a mobile Sink node or a fixed Sink node, and the processing steps are respectively as follows:
the first condition is as follows: the destination Sink node of the data packet is a fixed Sink node. The intermediate node firstly calculates whether a mobile Sink node exists in the transmission range of one hop at the current moment, and if so, the intermediate node can directly transmit data to the mobile Sink node; otherwise, the intermediate node acquires the next hop node from the routing table according to the ID number of the destination Sink node and continuously forwards the data packet.
Case two: the destination Sink node of the data packet is a mobile Sink node. The intermediate node firstly judges whether a mobile Sink node exists in the one-hop transmission range of the intermediate node at the current moment, and if so, the intermediate node can directly transmit data to the mobile Sink node. Otherwise, the intermediate node checks whether the mobile Sink node routing table entry exists in the routing table of the intermediate node according to the destination mobile Sink node ID in the data packet:
if the destination mobile Sink node ID exists, the intermediate node finds the next hop node in the routing table of the intermediate node according to the destination mobile Sink node ID in the data packet and continues to forward the data.
And if the intermediate node routing table does not have the target mobile Sink node list item in the data packet, the intermediate node acquires the next hop node in the same direction from the routing table according to the forwarding direction of the data packet to continue forwarding the data, and the target mobile Sink in the data packet is unchanged.
Claims (4)
1. The data acquisition method of the hybrid strip sensor network is characterized by comprising the following steps: the network is deployed along a banded region, the length of the band being much greater than the width of the band; the network includes three types of nodes: the system comprises a sensor node, a fixed Sink node and a mobile Sink node; firstly, calculating the distance to the nearest fixed Sink node: the sensor node can directly obtain the distance from the sensor node to the nearest fixed Sink node on the left and right according to the routing table information; and then calculating the distance from the sensor node to the nearest mobile Sink node: to be provided withWhich represents the nodes of the sensor or the sensors,
represents the moving Sink node and the moving Sink node, v j representing the moving rate of the mobile Sink node; t is tcIndicates the current time, thIndicating that the mobile Sink node is received for the first timejThe time of the Hello packet of (c),Rrepresenting the transmission radius of the node, and the period of the sensor node broadcasting Hello is tp(ii) a If it is notv j ×（tc－th）＜2R－v j ×tpNode of sensoriIn a mobile Sink nodejIn the transmission range of one hop, the sensor node i and the Sink j can directly communicate, namely the next hop node is the mobile Sink node; else the sensor nodeiIn a mobile Sink nodejThe calculation formula of (a) is as follows: dij=v j ×（tc－th) -R; selecting a Sink node with the minimum distance from the sensor node as a target Sink node, and reporting data; and finally, refreshing a routing table: if the distance from the sensor node to a certain mobile Sink node is greater than the distance from the sensor node to a fixed Sink node closest to the sensor node, deleting the item;
meanwhile, in the process of forwarding the data packet, each relay node needs to recalculate the Sink node which is currently closest to the relay node, and if the destination Sink node in the data packet is inconsistent with the destination Sink node in the data packet, the destination Sink node in the data packet is changed into the Sink node which is currently closest to the relay node.
2. The hybrid tape sensor network data acquisition method of claim 1, wherein:
the sensing data reporting step is as follows:
1) the sensor node firstly selects a destination Sink node which is closest to the sensor node at the current time from a routing table of the sensor node, and if the Sink node is mobileThe Sink node directly transmits data to the mobile Sink node within a one-hop transmission range, otherwise, the sensor node acquires a next-hop node from the routing table according to the selected destination Sink node to forward the data; if the destination Sink node is a mobile Sink node, the data packet needs to include the average rate and the moving direction of the destination mobile Sink node, and the distance d from the sensor node i to the destination mobile Sink node jijAnd position information X of sensor node ii；
2) When receiving a data packet, an intermediate node firstly judges the destination Sink node type of the data packet, whether the destination Sink node type is a mobile Sink or a fixed Sink, and the processing is as follows:
the first condition is as follows: the destination Sink node of the data packet is a fixed Sink node; the intermediate node firstly calculates whether a mobile Sink node exists in the transmission range of one hop at the current moment, and if so, the intermediate node can directly transmit data to the mobile Sink node; otherwise, the intermediate node acquires the next hop node from the routing table according to the ID number of the destination Sink node and continuously forwards the data packet;
case two: the destination Sink node of the data packet is a mobile Sink node; the intermediate node firstly judges whether a mobile Sink node exists in a one-hop transmission range of the intermediate node at the current moment, and if so, the intermediate node can directly transmit data to the mobile Sink node;
otherwise, the intermediate node checks whether the mobile Sink node routing table entry exists in the routing table of the intermediate node according to the destination mobile Sink node ID in the data packet:
if the destination mobile Sink node ID exists, the intermediate node finds the next hop node in the routing table of the intermediate node according to the destination mobile Sink node ID in the data packet to continuously forward the data;
and if the intermediate node routing table does not have the target mobile Sink node list item in the data packet, the intermediate node acquires the next hop node in the same direction from the routing table according to the forwarding direction of the data packet to continue forwarding the data, and the target mobile Sink in the data packet is unchanged.
3. The hybrid tape sensor network data acquisition method of claim 1, wherein: the method for predicting the rate of the mobile Sink node comprises the following steps:
the mobile Sink node moves at a constant speed along the strip network, the moving speed is calculated by two methods, one is through equipping a GPS device, the other is through periodically broadcasting respective geographical position information packets by the sensor node, the mobile Sink node estimates the change of the position information of the mobile Sink node through the received position information of the adjacent sensor node at different moments, and estimates the average speed of the mobile Sink node through the elapsed time information; calculating the average moving speed of the moving Sink nodevThe calculation formula of (2) is:
Siindicating the geographical position, T, of the sensor nodei Time of indicating a Hello packet, Ti-1、Si-1When i =2 and i > 2 are set, respectively, the geographical position of the corresponding sensor node and the time of the Hello packet,
the average is shown.
4. The hybrid tape sensor network data acquisition method of claim 1, wherein: the maintenance method of the routing table comprises the following steps: in the moving process of the mobile Sink node, periodically broadcasting a Hello packet to inform the sensor node of the own moving speed and ID number, and simultaneously updating the own routing table information by the sensor node by the Hello packet; the routing table in each sensor node consists of four table entries, the four table entries are divided into two types, each type occupies two entries, one type is used for fixing Sink nodes, and the routing information of the fixed Sink nodes on the left side and the right side closest to the sensor node is stored; one type is used for moving Sink nodes, and mobile Sink node routing information in the left direction and the right direction closest to the sensor nodes is stored.
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 CN101867974A (en) | 2010-10-20 |
| CN101867974B true 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) |
Families Citing this family (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 |
| JP5663105B2 (en) * | 2011-03-11 | 2015-02-04 | エンパイア テクノロジー ディベロップメント エルエルシー | Wireless node monitoring using portable devices |
| 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 |
| CN103596222B (en) * | 2013-11-29 | 2016-08-24 | 河海大学常州校区 | Based on the predictable collection method for wireless sensor network data in 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 |
| CN101247303A (en) * | 2008-03-20 | 2008-08-20 | 中科院嘉兴中心微系统所分中心 | Arc type regular banding wireless sensor network laying method conforming to given connectivity |
| CN101247302A (en) * | 2008-03-20 | 2008-08-20 | 中科院嘉兴中心微系统所分中心 | Linear regular banding wireless sensor network disposition method based on 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 |
| CN101247303A (en) * | 2008-03-20 | 2008-08-20 | 中科院嘉兴中心微系统所分中心 | Arc type regular banding wireless sensor network laying method conforming to given connectivity |
| CN101247302A (en) * | 2008-03-20 | 2008-08-20 | 中科院嘉兴中心微系统所分中心 | Linear regular banding wireless sensor network disposition method based on connectivity |
Non-Patent Citations (2)
| Title |
|---|
| 程真，et al.基于带状区域路由的无线传感器网络QoS协议.《计算机科学》.2010,第37卷(第2期),全文. * |
| 郜帅,et al.Sink轨迹固定传感器网络的高效数据采集机制.《软件学报》.2010,第21卷(第1期),全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101867974A (en) | 2010-10-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108600942B (en) | Routing method of unmanned aerial vehicle ad hoc network | |
| Oubbati et al. | ECaD: Energy‐efficient routing in flying ad hoc networks | |
| US7352750B2 (en) | Mobile terminal, control device and mobile communication method | |
| CN102255973B (en) | Routing method in vehicle wireless communication network and vehicle wireless communication network | |
| CN101867974B (en) | Data acquisition method in hybrid strip sensor network | |
| CN105376152B (en) | A kind of more candidate compound relay data transmission methods in In-vehicle networking | |
| CN103281742B (en) | Road information vehicular ad hoc network method for routing is obtained based on autonomous | |
| CN108040353A (en) | A kind of unmanned plane swarm intelligence Geographic routing method of Q study | |
| CN110312209B (en) | Positioning information assisted mobile ad hoc network routing method | |
| CN106792977A (en) | Double cluster head method for routing based on traffic density in vehicular ad hoc network | |
| CN104202724B (en) | A kind of AANET joint route algorithms based on geographical location information | |
| CN112929940A (en) | Unmanned aerial vehicle ad hoc network multicast routing protocol based on link survival time prediction | |
| CN103619046B (en) | The In-vehicle networking unicast routing method of adaptive vehicle density | |
| CN108271139A (en) | A kind of method for routing based on software definition car networking | |
| CN105554838B (en) | Multichannel multi-hop vehicular ad hoc network frequency coordination distribution method | |
| CN108024228B (en) | Vehicle-mounted network GPSR protocol improvement method based on road network and QOS model | |
| CN110493749B (en) | Greedy routing method for Internet of vehicles based on path exploration | |
| CN109561392B (en) | Self-adaptive dynamic sensing route for driving environment of Internet of vehicles | |
| CN104835316A (en) | Traffic flow density-based solution to problem of VANET sparse connectivity | |
| CN101471864B (en) | Data forwarding method based on receiver route in wireless self-organizing network | |
| WO2014198120A1 (en) | Wireless mobile network data transmission method based on coverage maintenance and minimum spanning tree | |
| CN109600712B (en) | Self-adaptive routing method based on software defined internet of vehicles | |
| Al-Mayouf et al. | Efficient routing algorithm for VANETs based on distance factor | |
| Li et al. | Efficient mobile networking for tactical radios | |
| KR20120069439A (en) | Method and mobile node for routing in mobile wireless network system |
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 |