Mobile sensor network routing optimization method based on contention window ant colony clustering

A technology of competition window and optimization method, applied in the field of mobile sensor network routing optimization, can solve the problems of low forwarding success rate of routing data packets, inability to cope with special conditions, short node lifetime, etc., to reduce the amount of flooded data, The effect of optimizing the transition probability calculation mechanism and prolonging the survival period

Pending Publication Date: 2022-01-14
ZHONGYUAN ENGINEERING COLLEGE
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] At present, the main clustering routing strategy may have the following disadvantages: 1. It cannot deal with the special situation that the selected cluster capital is in the same area
2. Only select cluster heads based on the amount of remaining energy and use flood routing, which may cause network congestion
3. Considering

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Mobile sensor network routing optimization method based on contention window ant colony clustering
  • Mobile sensor network routing optimization method based on contention window ant colony clustering
  • Mobile sensor network routing optimization method based on contention window ant colony clustering

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0047] Example 1

[0048]Method of mobile sensing network based on competitive window ant colony cluster, such as figure 2 As shown, including the following steps:

[0049] Step 1: Divide a non-uniform load node into a cluster head node and a cluster node, and calculate the competitive window value based on the network depth of the node in the cluster.

[0050] Depending on the network topology, the network is distributed, and the network depth is h i Node I and network depth of H j Node J, if h j i hour, The calculation method of the initial value of the first value of the first value of the first node of the present invention is as shown in the formula:

[0051]

[0052] Hie-level node i in the cluster, the initial value of its competition window The calculation formula is shown in the formula:

[0053]

[0054] Step 2: After constructing the first set of candidate clusters, the N ants are placed in the cluster, where each ants are the same, each ants should carry the clus...

Example Embodiment

[0065] Example 2

[0066] The present invention adopts the OMNET 4.0 simulation platform, mainly to investigate the performance of the agreement under different network scale. Experiment 1: Packet Transmission Succession; Experiment 2: Node Survival Time. Experimental size: 48 sensors. The node is divided into 14 groups, and 20 start nodes, then each group experiment increases 2 nodes. Single node cache is 600M (the total amount of packets during the simulation is less than the cache, no overflows), the node communication radii is 100m, and the unicast communication method is used, the transmission speed is 200 kb / s. The node uses the RandomwayPoint motion model, the speed range is In addition, the OMNET simulates the data generator One size is generated by a package interval. Packet. Take weighting factor K 1 = 0.45, K 2 = 0.22, k 3 = 0.33. Detailed simulation experimental parameter settings are shown in Table 1:

[0067] Table 1 Network configuration parameter table

[0068...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a mobile sensor network routing optimization method based on contention window ant colony clustering, which comprises the following steps: dividing non-uniform load nodes into cluster head nodes and intra-cluster nodes, and calculating a contention window value according to the network depth of the nodes in a cluster; constructing a candidate cluster head set by adopting an ant colony algorithm according to the competition window value of the node; constructing a cluster head selection function according to three parameters of a competition window value, node residual energy and an interference factor of a candidate node in the candidate cluster head set, and selecting an optimal node of the candidate node as a cluster head node according to an election mechanism; traversing all nodes in the network through an ant colony algorithm, so that the nodes in the cluster form a tree containing leaf nodes of different depths; improving the transition probability mechanism of all available next-hop nodes by using various parameters, and according to the transition probability of different paths, solving the affiliation problem of nodes at the crossed and overlapped positions of leaf nodes with different depths in a cluster, and further optimizing a cluster type network topology structure, so that the data transmission success rate of a wireless network is increased, and the node network survival time is prolonged.

Description

technical field [0001] The invention belongs to the field of network communication and wireless sensors, and in particular relates to an optimization method for mobile sensor network routing based on competition window ant colony clustering. Background technique [0002] As an important branch of the Internet of Things, the wireless sensor network is used to perceive and collect data in the monitored environment. Adjacent nodes perceive the same object information in real time, and the data is sent back to the base station through one or more hops. In order to better achieve the purpose of network communication between nodes and improve transmission efficiency, the current network topology usually adopts a cluster structure. Cluster routing in wireless sensor networks has the advantages of clear hierarchy, strong scalability, and easy fusion of adjacent data. [0003] The core idea of ​​cluster routing is to aggregate a number of wireless nodes with certain topological char...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04W40/10H04W40/12H04W40/16H04W40/22H04W40/24H04W84/18H04W40/02
CPCH04W40/10H04W40/125H04W40/16H04W40/22H04W40/248H04W84/18H04W40/023Y02D30/70
Inventor 杨辉瞿博阳柴旭朝路向阳李召温鹏伟靳方
Owner ZHONGYUAN ENGINEERING COLLEGE
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap