CN103124421B - The cluster-dividing method of mobile node in a kind of wireless sensor network - Google Patents
The cluster-dividing method of mobile node in a kind of wireless sensor network Download PDFInfo
- Publication number
- CN103124421B CN103124421B CN201210533768.6A CN201210533768A CN103124421B CN 103124421 B CN103124421 B CN 103124421B CN 201210533768 A CN201210533768 A CN 201210533768A CN 103124421 B CN103124421 B CN 103124421B
- Authority
- CN
- China
- Prior art keywords
- node
- leader cluster
- bunch
- neighbor
- message
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- 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
The present invention is the cluster-dividing method of mobile node in a kind of wireless sensor network, development along with wireless mobile node sensor network, existing wireless sensor network great majority assume that all of node is all fixing, so most of sub-clustering broadcasting schemes are both for stationary nodes design, but can continuous moving at some special scene interior joint, route and network topology now are dynamically changes, namely clustering process is also dynamically change, obviously the network of node motion it is not well positioned to meet for the sub-clustering broadcasting scheme of stationary nodes, this programme can well solve the sub-clustering in node motion process after considering factors, be additionally contemplates that simultaneously when exist die for the sake of honour some time network reachability problem.
Description
Technical field
The present invention is the sub-clustering scheme of mobile node in a kind of wireless sensor network, and the program is mainly used to realize the sub-clustering broadcast communication between node when wireless sensor network interior joint moves, and this programme belongs to wireless sensor network technology field.
Background technology
The wireless sensor network comprising mobile node in recent years is widely used gradually, and wireless mobile sensor network is the network of a kind of foundation-free facility, multi-hop, self-organizing. this network adopts the mode of non-stop layer distributed AC servo system to carry out networking, and node is main frame, serves as again the role of router, is communicated by wireless channel. when network size is bigger, in order to reduce route and control overhead, improve the utilization rate of the expandability of network and resource, wireless mobile sensor network usually adopt based on bunch hierarchy, and the formation and maintenance of this sub-clustering hierarchy depends on certain cluster algorithm. traditional wireless sensor network great majority assume that all of node is all fixing, so most of sub-clustering broadcasting schemes are both for stationary nodes design, but can continuous moving at some special scene interior joint, route and network topology now are dynamically changes, namely clustering process is also dynamically change, obviously the network of node motion it is not well positioned to meet for the sub-clustering broadcasting scheme of stationary nodes, the comprehensive factors of this programme can well solve the node clustering problem in node motion process, it has been additionally contemplates that the reachability problem of network when there is death nodes or node dormancy simultaneously.
Summary of the invention
Technical problem: wireless mobile sensor network is the network of a kind of foundation-free facility, multi-hop, self-organizing. When network is bigger, in order to reduce control and routing cost, improve the expandability of network and the service efficiency of resource, wireless mobile sensor network usually adopt based on bunch hierarchy, and the formation and maintenance of this sub-clustering hierarchy depends on certain cluster algorithm, the present invention is directed to wireless mobile sensor network and propose a kind of cluster algorithm, and consider the mobility of node, node degree, the series of factors such as dump energy and the repeatability between bunch head.
Technical scheme: first provide several definition:
Magnetic node: use the node that magnetic material is made, when certain node is elected as bunch head in network, then opens magnetic function;If namely two magnetic nodes together time; can mutual exclusion, and magnetic can be turned off and on.
Connected degree: the i.e. number of all neighbours of node.
The comprehensive weights of node: set in network certain node i synthetic weights value expression as Ei=aNi+bVi+cDi, wherein a, b, c are the weighted value of three aspect factors, and a+b+c=1; Ni, Vi, DiThe respectively Connected degree of corresponding node i, the speed of movement and and all neighbours of surrounding distance and. Node IDi, the comprehensive weights E of nodei��
Leader cluster node: by seeking max (Ei) node i determined is a bunch head.
Bunch head number: node i neighbor node number is n, then leader cluster node number num (n) of this bunch meets below equation:
Hello packet: the form of Hello packet is Hello (IDi,ClusterIDi,RClusterIDi, Ei), wherein IDiFor certain node i No. ID; ClusterIDiFor No. ID of node i place bunch, if not adding any bunch, then it is Null; RClusterIDiStandby bunch head ID for node i place bunch; EiComprehensive weights for node. Hello packet is divided three classes: 1. neighbor discovery messages: IDi�� Null and ClusterIDi=Null; 2. bunch head message: IDi=ClusterIDi�� Null; 3. sub-clustering message: ID is addedi�� Null, ClusterIDi�� Null and IDi��ClusterIDi. Wherein ClusterIDiAnd RClusterIDiIt is the array of dynamically definition, its size respectively num.
Election of cluster head scheme: node i sends Hello packet traversal neighbor list, by the comprehensive weights descending of node, and choose position of ranking the first for leader cluster node, position of being number two for standby leader cluster node. If bunch head is more than one, then before choosing ranking, num is leader cluster node, and num afterwards is standby leader cluster node.
Standby leader cluster node: be gateway node, is responsible for the communication between two adjacent cluster and a corresponding backup node of leader cluster node.
Anchor node: be deployed in some nodes of fixed area in advance, and the geographical position of these nodes is it is known that be used for the location of death nodes.
Method flow
The flow process of this cluster-dividing method is as it is shown in figure 1, complete procedure will be specifically described below:
Step 1) fixing anchor node is disposed in the form of a grid in target area, and record respective geographic coordinate information;
Step 2) initialize time each node ClusterID and RClusterID be sky, from base-station node, the Hello packet of each neighbor node also broadcast transmission of base station oneself, namely finds neighbor node by the neighbor discovery messages in Hello packet;
Step 3) after T after a while, after the neighbor node table that each node acquisition of base station and base station neighbors is complete, leader cluster node and standby leader cluster node is selected according to election of cluster head scheme, and open the magnetic function of bunch head, then a broadcast bunch head sets up information to neighbor node, and its geographical location information is sent to anchor node by leader cluster node and standby leader cluster node simultaneously;
Step 4) if receiving node is general type node, neighbor node table is first updated when receiving Hello packet, then the type of message content is judged, when this message is for bunch head message and when this node does not add any bunch or ClusterID element number less than num, then write into ClusterID leader cluster node No. ID immediately, representing and add this bunch, then broadcast one adds the information of this bunch. When this message is standby leader cluster node and the RClusterID of this node for empty or element number less than num time, standby leader cluster node ID is write into RClusterID;
Step 5) standby leader cluster node becomes gateway and the neighbor discovery messages that continues to send in Hello packet sets up neighbor node table to find neighbor node, then proceed to choose leader cluster node and standby leader cluster node, continue successively until all of mobile sensor network node all has been added to bunch
Step 6) when the leader cluster nodes of two bunches meet at certain time point, owing to magnetic is repelled each other, so the leader cluster node of two bunches will not move together;
Step 7) when the leader cluster node of certain bunch suddenly becomes death nodes, standby leader cluster node replaces the position of bunch head immediately becomes leader cluster node, and bunch head of all members of this bunch of broadcast announcement and its upper level, then again selects a leader cluster node leader cluster node in support by election of cluster head scheme (see definition);
Step 8) leader cluster node and the standby leader cluster node estimation position using the geometry barycenter of all anchor nodes in its communication range as oneself. Detailed process is as follows: anchor node broadcasts a beacon signal to neighbor node at set intervals, includes ID and the positional information of anchor node self in signal. When unknown node receives after the beacon signal quantity from anchor node exceedes some thresholding preset in one section of time of intercept, this node is thought and is connected with this anchor node, and self-position is defined as the polygonal barycenter that all anchor nodes in communication form. When producing dead leader cluster node, can the checkmate geographical location information of leader cluster node of anchor node is sent to base station, and base station can be died for the sake of honour a little according to the replacing that geographical position is in good time;
Step 9) base station re-elects leader cluster node and standby leader cluster node every set time t with regard to transmission neighbor discovery messages until the complete individual network of covering is to adapt to the mobility of node. When the energy of certain bunch of head i is less than certain value, this bunch of hair send a message to base station, and a message is then broadcasted to the whole network in base station, inspires clustering into of next cycle;
Step 10) when a node receives the message of sub-clustering again, then ClusterID and the RClusterID of this node and all of neighbor node is all set to Null;
Step 11) when the node i in network enters resting state owing to not working for a long time, node i sends a message before going to sleep to the leader cluster node at its place bunch, bunch head messaging again to higher level bunch head until passing to base station to preserve and recorded the relation that forerunner is follow-up, when the resting state of this node has influence on network connectivty, base station sends activate message by original path and activates it to this dormancy node, removes the content of these preservations as elapsed time k;
Step 12) new node adds this network through legitimate authentication, and it will actively send neighbor uni-cast information to find its neighborhood:
�� without neighbor node, then this node failure;
�� if having leader cluster node in neighbor node, then add this bunch, send request message to a bunch hair, bunch head updates the neighbor list of this node while being added into oneself neighbor list;
If �� neighborhood non-NULL and without leader cluster node, then judge whether oneself can become a bunch head according to election of cluster head scheme;
Step 13) when having node to exit, if this node is non-leader cluster node, then sub-clustering be there is no any impact, as long as it being deleted from neighbor node table. When exit be leader cluster node time, then the neighbor node of this bunch will not receive a bunch head message again, there is time-out during overtime s, then ClusterID or RClusterID of all neighbor nodes using this point as bunch head is set to Null, again carries out election of cluster head according to election of cluster head scheme.
Beneficial effect: the present invention proposes the cluster-dividing method of mobile node in a kind of wireless sensor network, and the method has the advantage that
(1) gusset material in this method have employed the magnetic material of tool, owing to node is constantly mobile, bunch head of different bunches likely can move together, so can cause bunch and bunch between communication confusion, utilize and mutually exclusive between magnetic material bunch head and a bunch head can be avoided to move together;
(2) when occurring dying for the sake of honour a little with node dormancy, it is possible to quickly found the node dying for the sake of honour a little or arousing dormancy by the communication between the location of anchor node and bunch head;
(3) by set time t just again sub-clustering to adapt to the characteristic that node constantly moves;
(4) Connected degree of node has been considered during election bunch head, the speed of movement and the distance sum with neighbours so that the election of bunch head is more reasonable;
(5) multiple leader cluster node can be chosen when the member of bunch is too much, it is possible to increase the high efficiency of network, and choose multiple standby leader cluster node simultaneously, leader cluster node can be rapidly gone to when leader cluster node catastrophic failure and improve the stability of network;
Accompanying drawing explanation
Fig. 1 is the flow process of sub-clustering,
What Fig. 2 was bunch sets up process.
Detailed description of the invention
Below for Fig. 2, further describe technical scheme and method flow by a specific example.
Step 1) fixing anchor node, i.e. triangular nodes in figure is disposed in the form of a grid in target area, and record respective geographic coordinate information;
Step 2) neighbor discovery messages in base-station node and surroundings nodes broadcast transmission Hello packet, finds neighbor node and adds respective neighbor node table;
Step 3) after elapsed time T, all nodes in the circle of base station in the neighbours of base station and figure, leader cluster node 1,2 and backup node 3,4 is selected according to election of cluster head scheme, and open the magnetic function of bunch head, then a broadcast bunch head sets up information to all of node in this region, and the geographical location information of leader cluster node and standby leader cluster node is sent to anchor node A simultaneously;
Step 4) if recipient node is general type node, it is assumed to be when node 5 receives the Hello packet of node 1 and first updates its neighbor node table, then the type of message content is judged, this message does not add any bunch for bunch head message and this node, then write into ClusterID No. ID of node 1 immediately, represent and add this bunch and broadcast the information adding this bunch. Neighbor node table is again updated when node 5 receives the Hello packet of node 4, then type of message is judged, the standby leader cluster node that this message is standby leader cluster node and the Hello message of self is sky, and now node writes into RClusterID standby leader cluster node ID;
Step 5) standby leader cluster node 3 and 4 becomes gateway and the neighbor discovery messages that continues to send in Hello packet sets up neighbor node table to find neighbor node, then proceed to choose leader cluster node and standby leader cluster node, continue until all of mobile sensor network node all has been added to bunch successively, as shown in Figure 2;
Step 6) when leader cluster node 1 and 2 moves together at certain time point, owing to magnetic is repelled each other, so the leader cluster node of two bunches will not move together;
Step 7) when leader cluster node 2 suddenly becomes and dies for the sake of honour, standby leader cluster node 4 replaces the position of bunch head immediately becomes leader cluster node, and bunch head of all members of this bunch of broadcast announcement and its upper level and base station, then again select a leader cluster node leader cluster node in support by election of cluster head scheme (see definition);
Step 8) standby leader cluster node 3,4 continues the neighbor discovery messages sent in Hello packet and finds neighbor node and set up neighbor node table, node 3 chooses leader cluster node 5,6 and standby bunch 7,8, node 4 chooses leader cluster node 9 and standby leader cluster node 10, continue until all of mobile sensor network node all has been added to bunch successively, as shown in Figure 2;
Step 8) leader cluster node 9 and the standby leader cluster node 10 estimation position using the geometry barycenter of all anchor node B, C, D, F in its communication range as oneself. Detailed process is as follows: anchor node B, C, D, F broadcast a beacon signal to neighbor node at set intervals, include ID and the positional information of anchor node self in signal. When node 11 receives after the beacon signal quantity from anchor node exceedes some thresholding preset in one section of time of intercept, this node is thought and is connected with this anchor node, and self-position is defined as the polygonal barycenter that all anchor nodes in communication form. When node 11 becomes dying for the sake of honour, the geographical location information of node 11 can be sent to base station by anchor node, and base station can be died for the sake of honour a little according to the replacing that geographical position is in good time;
Step 9) base station re-elects leader cluster node and standby leader cluster node every set time t with regard to transmission neighbor discovery messages until the complete individual network of covering is to adapt to the mobility of node. When energy when bunch 1 is less than certain value, this bunch of hair send a message to base station, and a message is then broadcasted to the whole network in base station, inspires clustering into of next cycle;
Step 10) when node 2 receives the message of sub-clustering again, then ClusterID and the RClusterID of this node and all of neighbor node is all set to Null;
Step 11) when entering resting state when the node 5 in network is not owing to working for a long time, node 5 sends a message before going to sleep to the leader cluster node 2 at its place bunch, bunch head messaging again preserves to higher level bunch head base station and has recorded the relation of forerunner's rear-guard, when the resting state of this node has influence on network connectivty, base station sends activate message by original path and activates it to this dormancy node, removes the content of these preservations as elapsed time k;
Step 12) new node 12 adds this network through legitimate authentication, and it will actively send neighbor uni-cast information to find its neighborhood:
�� without neighbor node, then this node failure;
�� if having leader cluster node 9 in neighbor node, then add this bunch, send request message to a bunch hair, bunch head updates the neighbor list of this node while being added into oneself neighbor list;
If �� neighborhood non-NULL and without leader cluster node, then judge whether oneself can become a bunch head according to election of cluster head scheme;
Step 13) when node 12 exits, owing to this node is non-leader cluster node, so sub-clustering be there is no any impact, as long as it is deleted from neighbor node table. When exit be leader cluster node 9 time, then the neighbor node of this bunch will not receive a bunch head message again, time-out is there is during overtime s, then ClusterID or RClusterID of all neighbor nodes using this point as bunch head is set to Null, again carries out election of cluster head according to election of cluster head scheme (see definition).
Claims (1)
1. the cluster-dividing method of mobile node in a wireless sensor network, it is characterised in that the sub-clustering of mobile node in the applicable special screne of this cluster-dividing method, it is contemplated that all many-sided factors, detailed process is as follows:
Step 1) fixing anchor node, i.e. triangular nodes is disposed in the form of a grid in target area, and record respective geographic coordinate information;
Step 2) neighbor discovery messages in base-station node and surroundings nodes broadcast transmission Hello packet, finds neighbor node and adds respective neighbor node table;
Step 3) after elapsed time T, all nodes in the neighbours of base station and base station circle, leader cluster node 1,2 and backup node 3,4 is selected according to election of cluster head scheme, and open the magnetic function of bunch head, then a broadcast bunch head sets up information to all of node in this region, the geographical location information of leader cluster node and standby leader cluster node is sent to anchor node A simultaneously;
Step 4) if recipient node is general type node, it is assumed to be when node 5 receives the Hello packet of node 1 and first updates its neighbor node table, then the type of message content is judged, this message does not add any bunch for bunch head message and this node, then write into ClusterID No. ID of node 1 immediately, represent and add this bunch and broadcast the information adding this bunch; Neighbor node table is again updated when node 5 receives the Hello packet of node 4, then type of message is judged, when this message is standby leader cluster node message, and standby leader cluster node is when being empty, now node writes into RClusterID standby leader cluster node ID, and then broadcast one adds the information of this bunch;
Step 5) standby leader cluster node 3 and 4 becomes gateway and the neighbor discovery messages that continues to send in Hello packet sets up neighbor node table to find neighbor node, then proceed to choose leader cluster node and standby leader cluster node, continue until all of mobile sensor network node all has been added to bunch successively;
Step 6) when leader cluster node 1 and 2 moves together at certain time point, owing to magnetic is repelled each other, so the leader cluster node of two bunches will not move together;
Step 7) when leader cluster node 2 suddenly becomes and dies for the sake of honour, standby leader cluster node 4 replaces the position of bunch head immediately becomes leader cluster node, and bunch head of all members of this bunch of broadcast announcement and its upper level and base station, then select a leader cluster node leader cluster node in support again by election of cluster head scheme;
Step 8) standby leader cluster node 3,4 continues the neighbor discovery messages sent in Hello packet and finds neighbor node and set up neighbor node table, node 3 chooses leader cluster node 5,6 and standby bunch 7,8, node 4 chooses leader cluster node 9 and standby leader cluster node 10, continues until all of mobile sensor network node all has been added to bunch successively;
Step 8) leader cluster node 9 and the standby leader cluster node 10 estimation position using the geometry barycenter of all anchor node B, C, D, F in its communication range as oneself, detailed process is as follows: anchor node B, C, D, F broadcasts a beacon signal to neighbor node at set intervals, signal includes ID and the positional information of anchor node self, when node 11 receives after the beacon signal quantity from anchor node exceedes some thresholding preset in one section of time of intercept, this node is thought and is connected with this anchor node, and self-position is defined as the polygonal barycenter that all anchor nodes in communication form, when node 11 becomes dying for the sake of honour, the geographical location information of node 11 can be sent to base station by anchor node, base station is died for the sake of honour a little according to the replacing that geographical position is in good time,
Step 9) base station re-elects leader cluster node and standby leader cluster node every set time t with regard to transmission neighbor discovery messages until the complete individual network of covering is to adapt to the mobility of node, when energy when bunch 1 is less than certain value, this bunch of hair send a message to base station, a message is then broadcasted to the whole network in base station, inspires clustering into of next cycle;
Step 10) when node 2 receives the message of sub-clustering again, then ClusterID and the RClusterID of this node and all of neighbor node is all set to Null;
Step 11) when the node 5 in network enters resting state owing to not working for a long time, node 5 sends a message before going to sleep to the leader cluster node 2 at its place bunch, bunch head messaging again preserves to higher level bunch head base station and has recorded the relation of forerunner's rear-guard, when the resting state of this node has influence on network connectivty, base station sends activate message by original path and activates it to this dormancy node, removes the content of these preservations as elapsed time t;
Step 12) new node 12 adds this network through legitimate authentication, and it will actively send neighbor uni-cast information to find its neighborhood:
�� without neighbor node, then this node failure;
�� if having leader cluster node 9 in neighbor node, then add this bunch, send request message to a bunch hair, bunch head updates the neighbor list of this node while being added into oneself neighbor list;
If �� neighborhood non-NULL and without leader cluster node, then judge whether oneself can become a bunch head according to election of cluster head scheme;
Step 13) when node 12 exits, owing to this node is non-leader cluster node, so sub-clustering be there is no any impact, as long as it is deleted from neighbor node table; When exit be leader cluster node 9 time, then the neighbor node of this bunch will not receive a bunch head message again, there is time-out during overtime s, then ClusterID or RClusterID of all neighbor nodes using this point as bunch head is set to Null, again carries out election of cluster head according to election of cluster head scheme.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210533768.6A CN103124421B (en) | 2012-12-12 | 2012-12-12 | The cluster-dividing method of mobile node in a kind of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210533768.6A CN103124421B (en) | 2012-12-12 | 2012-12-12 | The cluster-dividing method of mobile node in a kind of wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103124421A CN103124421A (en) | 2013-05-29 |
| CN103124421B true CN103124421B (en) | 2016-06-08 |
Family
ID=48455237
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210533768.6A Active CN103124421B (en) | 2012-12-12 | 2012-12-12 | The cluster-dividing method of mobile node in a kind of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103124421B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022043806A1 (en) * | 2020-08-31 | 2022-03-03 | Amdocs Development Limited | System, method, and computer program for edge management of geographically dispersed sensors |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104284388B (en) * | 2014-10-20 | 2018-08-14 | 上海电机学院 | A kind of autonomous sub-clustering of mobile Ad Hoc networks and method for routing |
| CN104363628A (en) * | 2014-11-05 | 2015-02-18 | 安徽农业大学 | Wireless sensor network trans-layer routing method based on information high-speed channels |
| CN105451182B (en) * | 2016-01-04 | 2018-11-27 | 北京科技大学 | A kind of target identification tracking system and method |
| CN105744566B (en) * | 2016-01-28 | 2019-05-03 | 北京邮电大学 | A kind of adaptive demand Weighted Clustering method based on perceptron |
| CN105898821B (en) * | 2016-05-17 | 2019-04-12 | 北京邮电大学 | A kind of adaptive cluster-dividing method based on the setting of active thresholding |
| CN108521633A (en) * | 2018-02-27 | 2018-09-11 | 南京邮电大学 | Minepit environment wireless sense network cluster routing method based on K mean values |
| CN108171956A (en) * | 2018-03-03 | 2018-06-15 | 深圳凯达通光电科技有限公司 | A kind of power transformer environmental monitoring system based on big data and WSN technology |
| CN108901054B (en) * | 2018-07-03 | 2020-06-26 | 中国人民解放军国防科技大学 | Recovery method after disconnection of virtual backbone nodes in hierarchical wireless network |
| CN109005567B (en) * | 2018-09-14 | 2020-04-17 | 常熟理工学院 | Mobile network implementation method based on cluster |
| CN111510982B (en) * | 2019-01-30 | 2022-03-11 | 大唐移动通信设备有限公司 | Data transmission method and device |
| US11405127B2 (en) * | 2019-04-25 | 2022-08-02 | Microchip Technology Incorporated | Changing a master node in a wired local area network and related systems, methods, and devices |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267404A (en) * | 2008-05-13 | 2008-09-17 | 北京科技大学 | An assister-based clustering method in Ad Hoc network |
| CN101715243A (en) * | 2009-10-21 | 2010-05-26 | 南京邮电大学 | Wireless sensor network hierarchical cluster-based routing method |
| CN102595412A (en) * | 2012-01-10 | 2012-07-18 | 南京邮电大学 | Wireless sensor network clustering topology control method based on mobile nodes |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101129562B1 (en) * | 2010-02-02 | 2012-03-29 | 동명대학교산학협력단 | Clustering method for an wireless sensor network |
-
2012
- 2012-12-12 CN CN201210533768.6A patent/CN103124421B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267404A (en) * | 2008-05-13 | 2008-09-17 | 北京科技大学 | An assister-based clustering method in Ad Hoc network |
| CN101715243A (en) * | 2009-10-21 | 2010-05-26 | 南京邮电大学 | Wireless sensor network hierarchical cluster-based routing method |
| CN102595412A (en) * | 2012-01-10 | 2012-07-18 | 南京邮电大学 | Wireless sensor network clustering topology control method based on mobile nodes |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022043806A1 (en) * | 2020-08-31 | 2022-03-03 | Amdocs Development Limited | System, method, and computer program for edge management of geographically dispersed sensors |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103124421A (en) | 2013-05-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103124421B (en) | The cluster-dividing method of mobile node in a kind of wireless sensor network | |
| Yu et al. | Routing protocols for wireless sensor networks with mobile sinks: A survey | |
| Boyinbode et al. | A survey on clustering algorithms for wireless sensor networks | |
| Anupama et al. | Survey of cluster based routing protocols in mobile adhoc networks | |
| CN104486715B (en) | A kind of mobile sensor network cluster-dividing method based on geographical location information | |
| Ahmad et al. | Data transmission scheme using mobile sink in static wireless sensor network | |
| CN101119372B (en) | Cooperation energy-saving routing chart constructing method for mobile wireless sensor network | |
| Liu et al. | Clustering routing algorithms in wireless sensor networks: an overview | |
| Gavalas et al. | Mobility prediction in mobile ad-hoc networks | |
| TW200408232A (en) | Intelligent communication node object beacon framework(ICBF) with temporal transition network protocol (TTNP) in a mobile AD hoc network | |
| CN101198167B (en) | Hybrid network system combining cell network and self-organizing network, and constructing method thereof | |
| Aldabbas et al. | Unmanned ground vehicle for data collection in wireless sensor networks: mobility-aware sink selection | |
| CN109041127A (en) | The adaptive stabilizing cluster-dividing method and system of load balancing suitable for highly dynamic radio network | |
| Kumar et al. | A review study of hierarchical clustering algorithms for wireless sensor networks | |
| Liu et al. | Energy-efficient guiding-network-based routing for underwater wireless sensor networks | |
| CN110167097A (en) | Mobile robot transistroute scheme based on weighted metric forwarding and path planning | |
| CN105376824A (en) | Mobile sensor network low-power route method used for filed monitoring | |
| Liu et al. | A virtual uneven grid-based routing protocol for mobile sink-based WSNs in a smart home system | |
| Mohan et al. | A hybrid approach for data collection using multiple mobile nodes in WSN (HADMMN) | |
| KR20200028645A (en) | A Mobile-Sink Based Energy-efficient Clustering Scheme in Mobile Wirless Sensor Networks | |
| CN105430693A (en) | Multi-user switching method based on business characteristics in 5G network | |
| CN102811461A (en) | Load balancing method based on convergence of sensor network and cellular network | |
| Jayalekshmi et al. | GSA-RPI: GSA based Rendezvous Point Identification in a two-level cluster based LR-WPAN for uncovering the optimal trajectory of Mobile Data Collection Agent | |
| Al Sawafi et al. | Toward hybrid RPL based IoT sensing for smart city | |
| Kumar et al. | Review of mobility aware clustering scheme in mobile adhoc network |
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 | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20130529 Assignee: Jiangsu Nanyou IOT Technology Park Ltd. Assignor: Nanjing Post & Telecommunication Univ. Contract record no.: 2016320000220 Denomination of invention: Clustering method for movable nodes in wireless sensor network Granted publication date: 20160608 License type: Common License Record date: 20161121 |
|
| LICC | Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model | ||
| EC01 | Cancellation of recordation of patent licensing contract | ||
| EC01 | Cancellation of recordation of patent licensing contract |
Assignee: Jiangsu Nanyou IOT Technology Park Ltd. Assignor: Nanjing Post & Telecommunication Univ. Contract record no.: 2016320000220 Date of cancellation: 20180116 |