Data-transmitting method for wireless sensor network
First Claim
Patent Images
1. A data-transmitting method for a wireless sensor network comprising:
- constructing a wireless sensor network having a plurality of nodes and a sink, with the nodes sensing environmental information and transmitting data to each other and the sink raising quests to and collecting the sensed environmental information from the nodes;
clustering the plurality of nodes to form a plurality of groups, with one of the plurality of nodes in each group identified as a kernel and the nodes in the same group around the kernel being most clustered;
identifying one of all the plurality of nodes as a summit dissemination node and the kernels in all the plurality of groups as first level dissemination nodes, with the summit dissemination node being a nearest node to a geometric center of all the kernels;
transmitting data between the quest-raising sink and one of the first level dissemination nodes or between said sink and the summit dissemination node through one of the first level dissemination nodes to collect information sensed by a source that is one of the plurality of nodes; and
executing when the nodes are clustered;
clustering the plurality of nodes to form said plurality of groups by a K-means algorithm;
locating the kernel of each group;
selecting a plurality of the nodes in various radial directions from the kernel for each group, wherein those selected plurality of nodes is an adjacent node and a remote node in each direction, with the adjacent node being a nearest node to the kernel and the remote node being a farthest node to the kernel;
obtaining a plurality of circles for each group, with the adjacent nodes as centers and distances between the kernel and the adjacent nodes as radiuses; and
identifying the nodes in the circles in an original group while the nodes out of the circles being re-clustered to be in the original group or another of the groups.
1 Assignment
0 Petitions
Accused Products
Abstract
A data-transmitting method for wireless sensor network includes: constructing a wireless sensor network having a plurality of nodes for information sensing and a sink for quest raising and data collecting; clustering the nodes to form a plurality of groups, with one of the nodes in each group being identified as a kernel; identifying one of all the nodes as a summit dissemination node and the kernels in all the groups as first level dissemination nodes; and transmitting data between the quest-raising sink and one of the first level dissemination nodes or summit dissemination node to collect information sensed by a source that is one of the nodes.
-
Citations
7 Claims
-
1. A data-transmitting method for a wireless sensor network comprising:
-
constructing a wireless sensor network having a plurality of nodes and a sink, with the nodes sensing environmental information and transmitting data to each other and the sink raising quests to and collecting the sensed environmental information from the nodes; clustering the plurality of nodes to form a plurality of groups, with one of the plurality of nodes in each group identified as a kernel and the nodes in the same group around the kernel being most clustered; identifying one of all the plurality of nodes as a summit dissemination node and the kernels in all the plurality of groups as first level dissemination nodes, with the summit dissemination node being a nearest node to a geometric center of all the kernels; transmitting data between the quest-raising sink and one of the first level dissemination nodes or between said sink and the summit dissemination node through one of the first level dissemination nodes to collect information sensed by a source that is one of the plurality of nodes; and executing when the nodes are clustered; clustering the plurality of nodes to form said plurality of groups by a K-means algorithm; locating the kernel of each group; selecting a plurality of the nodes in various radial directions from the kernel for each group, wherein those selected plurality of nodes is an adjacent node and a remote node in each direction, with the adjacent node being a nearest node to the kernel and the remote node being a farthest node to the kernel; obtaining a plurality of circles for each group, with the adjacent nodes as centers and distances between the kernel and the adjacent nodes as radiuses; and identifying the nodes in the circles in an original group while the nodes out of the circles being re-clustered to be in the original group or another of the groups. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
Specification