CN110971524A - Centralized routing protocol of wireless sensor network - Google Patents
Centralized routing protocol of wireless sensor network Download PDFInfo
- Publication number
- CN110971524A CN110971524A CN201911343037.3A CN201911343037A CN110971524A CN 110971524 A CN110971524 A CN 110971524A CN 201911343037 A CN201911343037 A CN 201911343037A CN 110971524 A CN110971524 A CN 110971524A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- packet
- sink
- path
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/026—Details of "hello" or keep-alive messages
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/246—Connectivity information discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
A centralized routing protocol of a wireless sensor network comprises sensor nodes and Sink nodes, and comprises the following steps: step A: adding a data structure for the sensor node, and calculating the shortest routing path and maintaining the network topology; and B: a route setting stage, namely establishing a routing path between any two nodes before data transmission; and C: and in the route maintenance stage, the link state of each path in the network is updated. The protocol utilizes the sink nodes with sufficient energy to establish forward and reverse routing paths, calculates the optimal routing path, and maintains the network topology structure, thereby centrally managing and reducing the routing overhead.
Description
Technical Field
The invention relates to the technical field of networks, in particular to a centralized routing protocol of a wireless sensor network.
Background
A Wireless Sensor Network (WSN) is a distributed sensing network whose distal end is a Sensor that can sense and inspect the outside world. The sensors in the WSN communicate in a wireless mode, and the union of the sensor nodes forms any topology, so that the network is flexibly arranged, a multi-hop self-organized network is formed, the position of equipment in the network can be changed at any time, and the network can be connected with the Internet in a wired or wireless mode. With the reduction of the scale and the cost of the nodes in the wireless sensor network system, the deployment of the wireless sensor network in a large range becomes possible, so that a large number of applications of the wireless sensor network are promoted.
There are two types of nodes in the wireless sensor network system: sensor nodes and sink nodes. The sink node is a gateway between the Internet and the WSN system, and the sensor node is a low-power consumption device and is provided with a sensing unit, a processor, a memory, a radio and a power supply. In a wireless sensor network system, sensor nodes cooperate to monitor an area to obtain data about the environment, and at the same time, the sensor nodes forward data packets from other sensor nodes. However, sensor nodes are limited by computing power, memory, power supply, and bandwidth, which causes challenges in the design and implementation of wireless sensor network systems. Therefore, each layer of the network protocol stack needs to be designed and optimized; in terms of network layer, the main objective is to find solutions for routing setup and maintenance, which are routing protocols that can improve data transmission efficiency and reduce network load, which is one of the most important design issues in wireless sensor network systems.
There are many existing routing protocols, but most are distributed routing protocols. In a distributed routing system, a sensor node and a sink node are not different, and the sensor node is also the sink node bearing complex calculation. Protocols that employ distributed modes often result in lower network lifetimes due to the high energy cost of complex processing of sensor nodes. For example, a sensor node in an Optimized Link State Routing (OLSR) not only periodically exchanges information with a neighbor, but also calculates a minimum cost Routing path for maintaining a network topology, and as a protocol with an active mode, each node maintains a large Routing table, thereby greatly improving an energy consumption rate.
Disclosure of Invention
The purpose of the invention is: the protocol utilizes the sink nodes with sufficient energy to establish forward and reverse routing paths, calculates the optimal routing path, and maintains a network topology structure, thereby carrying out centralized management and reducing routing overhead.
The technical scheme of the invention is as follows: a Centralized Routing Protocol (CRP) of a wireless sensor network comprises sensor nodes with simple functions and a Sink node which establishes and maintains a network topology structure by utilizing network information, wherein the Sink node also calculates the shortest Routing path between any two nodes. In other words, the Sink node performs central management by means of a central control algorithm. In ad hoc wireless networks, each node in a CRP needs to discover its single-hop neighbors through periodic message exchanges. And then, the Sink node sends a broadcast packet to the network, and the global information of the network is obtained through a feedback packet sent by the sensor node. Next, the protocol calculates a routing path and sets up the routing path between the sensor node and the receiver node to transmit the data packet. Since the aforementioned paths are already established, each sensor node sends a request to the Sink node to acquire the shortest paths of other sensor nodes in the network. A feedback packet with routing information is then sent back to the requester and a routing path between any two nodes is established. And finally, the Sink node maintains the network topology by processing the updated values of the link states. The method comprises the following specific steps:
step A Add data Structure
To exchange messages in a network, protocols require various types of data packets in different roles. Similar to other routing protocols, each node requires a routing table and a neighbor table to record neighbor information and path information. In addition, the invention designs a new scheme, a Sink table and a Sink network diagram are added for each sensor, the Sink table and the Sink network diagram are used for calculating the shortest routing path and maintaining the network topology, and the data structure can be divided into three types: packet type, data table, and network map.
(1) The type of the data packet: there are six types of data packets for data transmission in a network:Hello、Probe B、Probe U、Info、RequestandRoute. Table 1 shows the members of the data packets, and "√" in table 1 means "a given packet contains this member". They areBroadcast、SourceAddr、DestAddr、SinkAddr、NeighborInfo、PathInfoAndRouteInfo. Wherein the content of the first and second substances,Broadcastis a boolean variable used to determine whether a packet is a broadcast packet,SourceAddr、DestAddr、SinkAddris an IP address.NeighborInfoContaining information consisting of neighbor node addresses and link states.PathInfoRouting path information from the Sink node to the sensor node is included to confirm receipt of the information and prepare the extended network. When a node is added to the network map of the Sink node, it sends a request message to the Sink node. The receiving node will contain the path of the requester to any other node in the networkRouteInfoThe packet is sent back. Each packet type in table 1 is illustrated below.
TABLE 1
1）Hello：HelloThe key function of (1) is to exchange information between neighbors and build a neighbor table with neighbor node addresses and link states.
2）Probe B: the packet starts from the Sink node and is forwarded by the intermediate nodes to discover new nodes and collect their information.
3）Probe U: unlike the two packets described above, the packet is,Probe Uis a unicast packet with a determined destination.PathInfoContaining the entire path message from source to target, which helps intermediate nodes find the way to forwardProbe UThe next node of (2).
4）Info: the receiving node sends a packet to the receiving node.NeighborInfoContaining neighbor information in the local neighbor table.
5）Request: after the route is found, the sensor node sends a request packet to acquire the route information from any other node in the network.
6）Route: the packet is associated with a request and the routing information includes the path of the requester to any other node in the network.
(2) Data table: there are three types of tables, respectivelyNeighborWatch (A),RouteWatch and watchSinkTable, as shown in table 2, "√" in table 2 means "a given table contains the member". Neighbor table composed ofNeighborAddrAndLinkStateand (4) neighbor information.NeighborAddrIndicating the address of the neighboring node(s),LinkStaterepresenting the state of the wireless link between the local node and the neighboring node.DestAddrAndNexthopAddrform aRouteA routing record in the table, the routing record specifying a destination node address and a next node address from the source to the destination.SinkWatch onlySinkAddrIt represents the Sink address.
TABLE 2
(3) Network diagram: the network graph adopts an adjacency list form to establish a structure as a special data structure of Sink. As shown in fig. 1, an array element represents a node in a network, and a list element is a path between any two nodes.
And B: route setting phase
The main purpose of this phase is to establish a routing path between any two nodes prior to data transmission. Meanwhile, a network graph is established in the Sink node. In addition, routing information is distributed from the Sink node, so that the protocol is more centralized than other nodes. As shown in fig. 2-5, the route establishment phase can be divided into four processes:
(1) the first step is as follows: when a node starts to run, it periodically broadcasts with its local informationHelloAnd (5) packaging. In addition, it listens for data packets in the monitoring port. If the received packet isHelloThen extracts neighbor node information and updates the local neighbor table. As shown in figure 2 of the drawings, in which,Speriodically to its neighborsAAndCsendingHello. When nodeAAndCupon receiving packets, each of them will be a nodeSAdded to its neighbor table.
(2) The second step is that: broadcasting a plurality ofHelloAfter the packet, the Sink node sendsProbe BAnd (5) packaging. Then, the neighbor of the Sink node receivesProbe BAnd (5) packaging. If the receiver address in the packet is not in the receiver table, the packet is processed in three steps. First, the node obtains the receiver address in the packet and updates the local receiver table. Second, the next parent address of the path from the source node to the sink node is set as the router address. And thirdly, packaging the data of the source node and the neighbor table into an information packet and sending the information packet to the receiving node. As shown in figure 3 of the drawings,Sto its neighboursAAndCbroadcastingProbe BAnd (4) grouping. If it is notAAndChas never received beforeProbe BThey process the packet through the above three operations. Finally, they move toSA packet is sent containing information about the own and neighbor tables.
(3) The third step: after the second step, the Sink node uses the source in the packetAddress and neighbor table data to augment vertices and edges in the network graph. Then, the shortest path of the transmitting end is calculated by using routing calculation algorithms such as Dijkstra algorithm and the like, and then the shortest path containing complete path informationProbe UThe packet is sent back to the source node. The Sink node selects the first entry in the path array as the address of the next forwarding packet. Finally, the received nodeProbe UA judgment must be made. If the destination is its own, it broadcasts with the receiving addressProbe BAnd (5) packaging. If not, it is only forward. In the context of figure 4 of the drawings,Sby using the information in the information packet to calculateAAndCthe shortest path of (2). Then, two are put intoProbe UPackets are sent to respectivelyAAndC. When they receiveProbe UWhen the data is grouped, the data is divided into groups,Awill be provided withProbe BPacket forwardingBTo do soCWill be provided withProbe BPacket forwardingD. For nodeBAndDthey go to the second step to notifySAnd (5) expanding the network. In this way it is possible to obtain,Sall nodes in the network can be discovered.
(4) And 4, step 4: the goal here is to set the shortest routing path from the source node to all other nodes. After the previous step is completed, the source node needs to send a request packet to the receiving node. The Sink node then sends the routing packet back from the source node to any other node in the network using the shortest path. Thus, a route between any two nodes has been established. In FIG. 5, the sensor nodesA、B、CAndDsending the request packet toSAnd is andSrouting information is computed for transmission back to the source node by routing packets.
And C: route maintenance phase
This phase using periodicityHelloThe packet switching process updates the link state of each path in the network. The modified information is sent to the Sink node while the link state between the two nodes changes. And then the Sink node recalculates the shortest path of all nodes in the network. Thus, the network topology is maintained in a centralized mode that reduces routing overhead.
The invention has the beneficial effects that: the invention provides a centralized routing protocol of a wireless sensor network, which is used for solving the problem that the existing wireless sensor network is not centralized in the prior artThe sink nodes with sufficient energy are utilized to establish forward and reverse routing paths, calculate the optimal routing path and maintain the network topology structure, thereby carrying out centralized management and reducing the routing overhead. Compared to OLSR, centralized routing protocols are simpler than OLSR due to the reduction of routing overhead in the network. There are two types of packets in OLSR:HELLOmessage and topology control: (Topology Control,TC) A message. Our protocol reduces in a centralized mannerTCThe number of messages, only the central node can know the whole information of the network. In OLSR, each node needs to broadcast to the entire networkTCMessages, which increases routing overhead for routing setup and maintenance. Meanwhile, the sensor node adopting the centralized routing protocol only stores the information of the neighbors, and the routing is set through a routing table sent by the central node. The nodes in the OLSR must receive a large number of messagesTCMessages and calculates routes to any other nodes. Thus, the calculation amount is smaller than that of the node in the OLSR.
Drawings
FIG. 1 is a network diagram with an adjacency list in step A of the present invention;
FIG. 2 is a schematic diagram of a first step of route establishment in step B of the present invention;
FIG. 3 is a diagram illustrating a second step of route establishment in step B of the present invention;
FIG. 4 is a diagram illustrating a third step of route establishment in step B of the present invention;
FIG. 5 is a diagram illustrating a fourth step of route establishment in step B of the present invention;
FIG. 6 is a test model of a centralized routing protocol according to an embodiment of the present invention;
FIG. 7 illustrates the transmit packet throughput of each node in accordance with an embodiment of the present invention;
FIG. 8 illustrates the received packet throughput for each node in an embodiment of the present invention;
fig. 9 is a timing diagram of the route establishment phase in an embodiment of the present invention.
Detailed Description
The invention will be described in further detail below with reference to the drawings and specific examples.
Examples
According to the foregoing steps, a platform comprising hardware and software is provided for the sensor and receiving nodes,
(1) hardware: the sensor device chosen for deploying the wireless sensor network system is the raspberry Pi, which has a USB port that supports wireless peripherals. The processing power of the raspberry Pi is very strong due to the built-in 700MHz processor. The TP-LINK TL-WN722N wireless device is selected as the hardware for the wireless communication unit. In order to simplify the experiment, the Sink node of the present embodiment selects the same hardware as the sensor node.
(2) Software: the software platform of the sensor and the receiving node is a lightweight operating system, not a simple embedded application. In this embodiment, Open Wrt is simulated by using Open Wrt, which is an embedded operating system based on a linux kernel and is mainly used for routing network traffic on an embedded device. The writable root file system and the large number of wireless functions make Open Wrt suitable for implementation of routing protocols. The routing protocol runs as an application on Open Wrt, and sets a routing path by modifying the kernel routing table.
The topology of the present embodiment is shown in fig. 6, where Sink is a central node for discovering and managing the whole networkA、BAndCis a sensor node, and packets transmitted through the network can be divided into six different types, respectivelyHello、Probe B、Probe U、Info、RequestAndRoute(ii) a Wherein the content of the first and second substances,Hellois defined asHELLOThe message is a message that is sent to the user,Probe B、Probe U、Info、RequestandRouteis defined asTCA message.
When the embodiment works, each node sends one message to its neighbor every five secondsHELLOMessages, after a period of neighbor discovery, route discovery toProbe BPacket start, sent from receiver toAAndB. As shown in figures 7 and 8 of the drawings,TCthe throughput of messages increases linearly with the number of nodes in the route setup phase.HELLOThe message is a periodic broadcast packet whose throughput is predictable; thus, the throughput of the network depends on the networkThe network scale and the network topology structure change, and only the central node needs to know the network topology structure, so the throughput of other nodes is reduced, and accordingly, the centralized routing protocol reduces the routing overhead of the network.
In addition, in the wireless sensor network system, the route establishment time is also a key factor of the routing protocol, and fig. 9 shows the time of different steps in the route setting stage. The time of the first step depends on the time interval of the periodic broadcast. The second and third steps represent the complete stages of node discovery, with the time of the two steps being incorporated into steps 2-3 of fig. 6. As the path increases, the time of steps 2-3 increases linearly, while the time of step 4 does not increase significantly. Accordingly, the time of the route setting stage is determined by the steps 2-3.
The invention provides a centralized routing protocol suitable for a wireless sensor network system, and completes the design and implementation work of the protocol. With the centralized management of the sink nodes, the sensor nodes do not need to perform calculation tasks such as route calculation and route path storage. And a small wireless sensor network of a Sink node and three sensor nodes, which consists of a raspberry Pi hardware platform and an Open Wrt software platform, is established. Simulation results show that the centralized routing protocol can meet the requirements of centralized management and reduction of routing overhead.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is intended to include such modifications and variations.
Claims (9)
1. A centralized routing protocol of a wireless sensor network comprises sensor nodes and Sink nodes, and is characterized in that: the method comprises the following steps:
step A: adding a data structure for the sensor node, and calculating the shortest routing path and maintaining the network topology;
and B: a route setting stage, namely establishing a routing path between any two nodes before data transmission;
and C: and in the route maintenance stage, the link state of each path in the network is updated.
2. The centralized routing protocol for a wireless sensor network of claim 1, wherein: the added data structure is divided into three categories: respectively, packet type, data table, and network map.
3. The centralized routing protocol for a wireless sensor network of claim 2, wherein: the data packet types are 6 types, respectivelyHello、Probe B、Probe U、Info、RequestAndRoute。
4. the centralized routing protocol for a wireless sensor network of claim 3, wherein: the data tables comprise 3 types, namely a Neighbor table, a Route table and a Sink table.
5. The centralized routing protocol for a wireless sensor network of claim 4, wherein: the network graph adopts an adjacency list form to establish a structure as a special data structure of Sink.
6. The centralized routing protocol for a wireless sensor network of claim 5, wherein: and in the step A, at least one Sink table and one Sink network diagram are added for each sensor.
7. A wireless sensor network centralized routing protocol according to any one of claims 2-6, wherein: and in the step B, simultaneously establishing a network graph in the Sink node.
8. The wireless sensor network centralized routing protocol of claim 6, wherein: in the step B, the routing information is distributed from the Sink node, and the route establishment phase can be divided into four processes:
step one, when a node starts to run, it periodically broadcasts Hello packet with its local information, besides, it also monitors the data packet in the monitor port, if the received packet is Hello, it extracts the neighbor node information and updates the local neighbor table;
secondly, after broadcasting a plurality of Hello packets in the first step, the Sink node sends a Probe B packet, then a neighbor of the Sink node receives the Probe B packet, if a receiver address in the data packet is not in a receiver table, the data packet is processed in three steps, firstly, the node acquires the receiver address in the data packet and updates a local receiver table, secondly, a next father address of a path from the source node to the receiver node is set as a router address, and thirdly, data of the source node and the neighbor table are packaged into an information packet and sent to the receiving node;
thirdly, after the second step, the Sink node uses the source address and the neighbor table data in the information packet to increase the top points and the edges in the network graph, then the routing calculation algorithm such as Dijkstra algorithm is used for calculating the shortest path of the sending end, then the Probe U packet containing complete path information is sent back to the source node, the Sink node selects the first item in the path array as the address of the next forwarding packet, finally, the received node Probe U must make judgment, if the destination is the node itself, the node uses the receiving address to broadcast the Probe B packet, if not, the node only forwards;
and fourthly, setting the shortest routing path from the source node to all other nodes, wherein after the last step is completed, the source node needs to send a request packet to the receiving node, and then the Sink node sends the routing packet from the source node to any other nodes in the network by using the shortest path.
9. The centralized routing protocol for a wireless sensor network of claim 8, wherein: in said step C, periodicHelloThe packet switching process updates the link state of each path in the network, the modified information being the link between two nodesAnd the state is changed and simultaneously sent to the Sink node, and then the Sink node recalculates the shortest path of all the nodes in the network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911343037.3A CN110971524B (en) | 2019-12-24 | 2019-12-24 | Centralized routing method for wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911343037.3A CN110971524B (en) | 2019-12-24 | 2019-12-24 | Centralized routing method for wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110971524A true CN110971524A (en) | 2020-04-07 |
| CN110971524B CN110971524B (en) | 2022-03-15 |
Family
ID=70036049
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911343037.3A Active CN110971524B (en) | 2019-12-24 | 2019-12-24 | Centralized routing method for wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110971524B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113572685A (en) * | 2020-04-29 | 2021-10-29 | 华为技术有限公司 | Information reporting method, information processing method, device and equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100085903A1 (en) * | 2008-10-03 | 2010-04-08 | Synapsense Corporation | Apparatus and method for managing packet routing through internally-powered network devices in wireless sensor networks |
| CN101938804A (en) * | 2010-08-27 | 2011-01-05 | 北京交通大学 | Multipath routing protocol suitable for wireless sensing network |
| CN101951655A (en) * | 2010-09-28 | 2011-01-19 | 北京航空航天大学 | Reactive routing protocol based on geographic information in wireless sensor network |
| CN103095572A (en) * | 2013-01-29 | 2013-05-08 | 山东省计算中心 | Route maintenance method of multiple mobile sink wireless sensor networks (MMS-WSNs) |
| CN103298054A (en) * | 2013-06-04 | 2013-09-11 | 四川大学 | Wireless sensor network cluster routing protocol based on node depth |
| CN105246120A (en) * | 2015-09-11 | 2016-01-13 | 浙江树人大学 | Data transmission delay and hop count-constrained Sink node movement path distributed selection method |
-
2019
- 2019-12-24 CN CN201911343037.3A patent/CN110971524B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100085903A1 (en) * | 2008-10-03 | 2010-04-08 | Synapsense Corporation | Apparatus and method for managing packet routing through internally-powered network devices in wireless sensor networks |
| CN101938804A (en) * | 2010-08-27 | 2011-01-05 | 北京交通大学 | Multipath routing protocol suitable for wireless sensing network |
| CN101951655A (en) * | 2010-09-28 | 2011-01-19 | 北京航空航天大学 | Reactive routing protocol based on geographic information in wireless sensor network |
| CN103095572A (en) * | 2013-01-29 | 2013-05-08 | 山东省计算中心 | Route maintenance method of multiple mobile sink wireless sensor networks (MMS-WSNs) |
| CN103298054A (en) * | 2013-06-04 | 2013-09-11 | 四川大学 | Wireless sensor network cluster routing protocol based on node depth |
| CN105246120A (en) * | 2015-09-11 | 2016-01-13 | 浙江树人大学 | Data transmission delay and hop count-constrained Sink node movement path distributed selection method |
Non-Patent Citations (1)
| Title |
|---|
| 李文锋: "无线传感器网络抗毁性", 《计算机学报》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113572685A (en) * | 2020-04-29 | 2021-10-29 | 华为技术有限公司 | Information reporting method, information processing method, device and equipment |
| CN113572685B (en) * | 2020-04-29 | 2023-03-10 | 华为技术有限公司 | Information reporting method, information processing method, device and equipment |
| US11916783B2 (en) | 2020-04-29 | 2024-02-27 | Huawei Technologies Co., Ltd. | Information reporting method, information processing method, apparatus, and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110971524B (en) | 2022-03-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Naghibi et al. | EGRPM: Energy efficient geographic routing protocol based on mobile sink in wireless sensor networks | |
| Gupta et al. | Performance metric comparison of AODV and DSDV routing protocols in MANETs using NS-2 | |
| Kumar et al. | Energy balanced position-based routing for lifetime maximization of wireless sensor networks | |
| Awad et al. | Exploiting virtual coordinates for improved routing performance in sensor networks | |
| Hussein et al. | Design and performance analysis of high reliability-optimal routing protocol for mobile wireless multimedia sensor networks | |
| Tseng | Multipath load balancing routing for Internet of things | |
| Mishra et al. | Study of cluster based routing protocols in wireless sensor networks | |
| Okazaki et al. | Ant-based dynamic hop optimization protocol: A routing algorithm for mobile wireless sensor networks | |
| Ahmadi et al. | A hybrid algorithm for preserving energy and delay routing in mobile ad-hoc networks | |
| WO2023045143A1 (en) | Time pulse source-based hybrid routing protocol implementation method | |
| Bendale et al. | Study of various routing protocols in mobile ad-hoc networks | |
| Bhangwar et al. | On routing protocols for high performance | |
| Hussein et al. | Smart geographical routing protocol achieving high QoS and energy efficiency based for wireless multimedia sensor networks | |
| CN110971524B (en) | Centralized routing method for wireless sensor network | |
| KR100915555B1 (en) | Query-based ZigBee Mesh Routing Protocol | |
| Aquino-Santos et al. | Performance analysis of routing strategies for wireless sensor networks | |
| Shah et al. | An Efficient Overlay for Unstructured P2P File Sharing over MANET using Underlying Cluster-based Routing. | |
| Cao et al. | Design and implementation of a centralized routing protocol for wireless sensor network | |
| Raja et al. | Modified GPSR based optimal routing Algorithm for reliable communication in WSNs | |
| Xiuli et al. | A novel multipath disjoint routing to support ad hoc wireless sensor networks | |
| Park et al. | A route maintaining algorithm using neighbor table for mobile sinks | |
| Pranitha et al. | A review on enhanced GPSR protocol for wireless sensor networks | |
| Bhat et al. | Effective cluster head selection based on EDM for WSN | |
| Venkatesakumar et al. | A study on routing problems and different routing protocols in wireless sensor networks | |
| Midha et al. | Performance Analysis of AODV & OLSR for MANET |
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 |