CN105828404A - Clustering routing method based on channel access heterogeneous wireless sensor network - Google Patents
Clustering routing method based on channel access heterogeneous wireless sensor network Download PDFInfo
- Publication number
- CN105828404A CN105828404A CN201610144386.2A CN201610144386A CN105828404A CN 105828404 A CN105828404 A CN 105828404A CN 201610144386 A CN201610144386 A CN 201610144386A CN 105828404 A CN105828404 A CN 105828404A
- Authority
- CN
- China
- Prior art keywords
- node
- bunch
- network
- channel access
- cluster
- 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.)
- Pending
Links
Classifications
-
- 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/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- 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/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a clustering routing method based on a channel access heterogeneous wireless sensor network. Definition of the channel access heterogeneous wireless sensor network is given, nodes in a cluster use a CRT-UI protocol sequence communication manner, and different from a time division multiplexing communication method, the CRT-UI protocol sequence communication manner can be used to ensure all node data are sent successfully in fixed time delay on the premises that node time is not synchronized strictly. Under the condition that the nodes in the cluster use the CRT-UI protocol sequence communication manner, the number of optimal cluster heads and the optimal probability that a node serves as the cluster head are calculated according energy consumption in each round of the network. According to the invention, the energy consumption in each round of the network is minimal, the stable period of the network is prolonged, and the network throughput is improved.
Description
Technical field
The present invention relates to wireless sensor network technology field, particularly to one based on channel access heterogeneous wireless sensor net
The cluster routing method of network.
Background technology
Along with the rise day by day of Internet of Things, wireless sensor network be widely used in military affairs, environmental monitoring, Smart Home,
The fields such as urban transportation, space exploration and storehouse management.Wireless sensor network as the study hotspot of current message area,
Relating to multiple subject, have many key technologies remain to be discovered and study, wherein network topology control has special meaning, logical
Cross the good network topology structure that topology controls to automatically form, it is possible to the effect of Routing Protocol and MAC protocol is greatly improved
Rate.
LEACH algorithm is the level Clustering Routing of a kind of classics in isomorphism wireless sensor network, its execution
Journey is periodic, establishment stage that often wheel circulation is divided into bunch and stable data communication phase.Bunch establishment stage,
Adjacent node is formed dynamically bunch, randomly generates a bunch head；In data communication phase, a bunch interior nodes sends data to a bunch head,
Bunch head carries out data fusion and sends the result to aggregation node.Owing to a bunch head has needed data fusion and aggregation node
The work such as communication, so energy expenditure is big.LEACH algorithm ensure that each node serves as a bunch head equiprobably so that net
Node relative equilibrium ground consumed energy in network.
Massey and Mathys proposed a kind of feedback-less collision channels model in 1985, devises simultaneously and can reach this
The believable Channel Access Mechanism of kind channel capacity: protocol sequence.Protocol sequence is a kind of deterministic periodic binary
Sequence, under this mechanism, each user is successively read sequential value according to the protocol sequence of distribution, if this value is " 1 ",
Node sends data, does not the most send data.Compared with TDMA, when protocol sequence does not require strict between the network user
Between synchronize；Compared with the radio access technology such as ALOHA, protocol sequence is provided that performance under short-term load stability and fairness,
And can guarantee that data are successfully sent in fixed delay in 100% ground；Additionally connect with competitive type channel based on CSMA
Entering agreement to compare, protocol sequence mechanism need not channel sense and keeps out of the way, thus greatly reduces energy expenditure.Based on
Upper advantage, protocol sequence is becoming the study hotspot of Chinese scholars in recent years, and is being widely used in wireless sensor network
Network, mobile ad-hoc network and vehicular ad hoc network.
In the past Clustering Routing based on homogeneous network and various heterogeneous network research all assume bunch in communication and bunch head and base station it
Between communication do not exist conflict and retransmit, and assume arbitrary network node only need to each take turns transmission one secondary data can success be connect
Receive.Owing to wireless sensor network node is numerous and there is channel propagation delay, tight required by communication in carrying out bunch with TDMA
Lattice time synchronized is difficult to be implemented；Also due to CDMA requires that to node hardware higher and FDMA needs consuming bigger
Internet resources, the most improper be applied to bunch in communicate.It is the most unpractical for there is not conflict it is therefore assumed that communicate in bunch.
Simultaneously, it is contemplated that Stochastic accessing and contention access cannot meet the system requirements of time critical data service, therefore use CRT-UI sequence
Row carry out bunch in communicate.
Use the communication mode of CRT-UI protocol sequence in view of in channel access heterogeneous network bunch of interior nodes, bunch interior nodes is each
Wheel needs to send n time, the most each take turns network energy consumption and changes, and needs to recalculate.So, LEACH algorithm
Election mechanism is not particularly suited for power heterogeneous network.Accordingly, it would be desirable to a kind of new cluster routing method tackles channel access isomery
The change that wireless sensor network brings.
Summary of the invention
It is desirable to provide a kind of cluster routing method based on channel access heterogeneous wireless sensor network, to extend net
Network stable phase and improve network throughput.
The invention provides a kind of cluster routing method based on channel access heterogeneous wireless sensor network, including sensor
Node, base-station node and described sensor node, the network area at base-station node place, described sensor node and base
Communication process between tiny node is carried out the most successively by round, process of setting up that described communication process is divided into bunch and steady
Determining the operation phase, the process of setting up of described bunch is divided into election of cluster head and determines sub-clustering table, according to each in described network area
The energy expenditure of wheel calculates optimal bunch of head number and optimal bunch of head is elected to probability, described election of cluster head determine each take turns bunch
Head node and with bunch in other node, also include described leader cluster node and bunch in use CRT-UI agreement sequence between other node
Row control communication.
Further, the calculating process of described optimal bunch of head number includes: S11. is calculated by bunch head number k and each takes turns interior joint
Serve as leader cluster node or the energy expenditure of non-leader cluster node, the addition of described energy expenditure is obtained each network energy of taking turns and always disappears
Consumption；S12. take turns network energy wastage in bulk or weight derivation to each, calculate optimal bunch of head number kopt。
Further, in bunch, member needs to take turns transmission n secondary data each, and wherein n is a bunch interior nodes number.
Further, described leader cluster node remains in a sequence period and intercepts.
Further, described optimal bunch of head number koptIt is set in advance, keeps constant at algorithm run duration.
Further, described bunch of interior nodes is successively read sequential value according to the protocol sequence of distribution, if this value is " 1 ",
Node sends data, does not the most send data.
Further, FDMA or CDMA is used to carry out channel access between described leader cluster node and base-station node.
Further, the building method of described CRT-UI protocol sequence is as follows, and: S21. supposes f:Represent
ArriveOn mapping, wherein f (a) :=(a mod r, a mod q), mod is modulo operator；S22. i=2 is worked as ..., K,
OrderAs i=1, orderTo I 'iInvert, can obtain the feature set of CRT-UI sequence:
Ii=f-1(I′i), i=1,2 ..., K.
By the method for the present invention, extend the network stabilization phase and improve network throughput.
Aspect and advantage that the present invention adds will part be given in the following description, and these will become from the following description
Substantially, or by the practice of the present invention recognize.
Accompanying drawing explanation
Fig. 1 shows design flow diagram of the present invention.
Fig. 2 shows that the network stabilization phase of LEACH algorithm and the inventive method is with network operation round change curve.
Fig. 3 shows that the network throughput of LEACH algorithm and the inventive method is with network operation round change curve.
Detailed description of the invention
Below in conjunction with the accompanying drawings and specific embodiment, it is further elucidated with the present invention, it should be understood that these embodiments are merely to illustrate this
Invention rather than limit the scope of the present invention, after having read the present invention, each to the present invention of those skilled in the art
The amendment planting the equivalent form of value all falls within the application claims limited range.
A kind of cluster routing method based on channel access heterogeneous wireless sensor network, including sensor node, base station joint
Point and described sensor node, the network area at base-station node place, between described sensor node and base-station node
Communication process is carried out the most successively by round, process of setting up that described communication process is divided into bunch and stable operation stage,
The process of setting up of described bunch is divided into election of cluster head and determines sub-clustering table, according to energy expenditure taken turns each in described network area
Calculate optimal bunch of head number and optimal bunch of head be elected to probability, described election of cluster head determine each leader cluster node taken turns and with bunch
In other node, also include described leader cluster node with bunch in use between other node CRT-UI protocol sequence to control to communicate.
Preferably, the calculating process of described optimal bunch of head number includes: S11. is calculated in each wheel by bunch head number k
Node serves as leader cluster node or the energy expenditure of non-leader cluster node, described energy expenditure is added and obtains each taking turns network energy
Wastage in bulk or weight；S12. take turns network energy wastage in bulk or weight derivation to each, calculate optimal bunch of head number kopt。
Preferably, in bunch, member needs to take turns transmission n secondary data each, and wherein n is a bunch interior nodes number.
Preferably, described leader cluster node remains in a sequence period and intercepts.
Preferably, described optimal bunch of head number koptIt is set in advance, keeps constant at algorithm run duration.
Preferably, described bunch of interior nodes is successively read sequential value according to the protocol sequence of distribution, if this value is " 1 ",
Node sends data, does not the most send data.
Preferably, FDMA or CDMA is used to carry out channel access between described leader cluster node and base-station node.
Preferably, the building method of described CRT-UI protocol sequence is as follows, and: S21. supposes f:Table
ShowArriveOn mapping, wherein f (a) :=(a mod r, a mod q), mod is modulo operator；S22. when
I=2 ..., K, orderAs i=1, orderTo I 'iInvert, can obtain the feature set of CRT-UI sequence:
Ii=f-1(I′i), i=1,2 ..., K.
Fig. 1 illustrates design flow diagram of the present invention.Compared with former LEACH algorithm, the present invention uses CRT-UI protocol sequence
Bunch in communication mode node need not strict time synchronization, and bunch interior nodes data can guarantee in fixed delay on 100% ground
Inside it is successfully sent.Because bunch interior nodes each take turns need send n secondary data, the most each take turns network energy consumption occur
Change, needs to recalculate.And then obtain optimal bunch of head number and the elected bunch head probability of optimal node.
The present invention uses matlab to implement LEACH algorithm and the inventive method.Network is deployed with 100 joints
Point, node is randomly dispersed in the rectangular area of 100 × 100, has unique base station in network, is positioned at outside network area, and position is
50×300.Each node has unique identifier.Node random placement, but one is deployed in place putting and determines, and irremovable.
The sole cause of node death is depleted of energy, there is not other reason.The hardware that node configuration is identical, stores, calculates, leads to
Letter ability is identical.Node is owned by data fusion ability, and can be with base-station node communication.Infinitely great (the phase of base-station node energy
For region interior nodes).Need not after node deployment safeguard.The primary power that node has is identical.Radio signal is each in space
On individual direction, consumed energy is identical, and channel symmetry.
Fig. 2 reflects the network stabilization phase change curve with network operation round of LEACH algorithm and the inventive method.
As can be seen from the figure the network stabilization phase of the inventive method improves about 476% than the network stabilization phase of LEACH algorithm,
Performance boost is obvious.
Fig. 3 reflects the network throughput change curve with network operation round of LEACH algorithm and the inventive method.
As can be seen from the figure the network throughput of the inventive method in whole network lifecycle all than the net of LEACH algorithm
Network throughput is high.
Claims (8)
1. a cluster routing method based on channel access heterogeneous wireless sensor network, including sensor node, base station
Node and described sensor node, the network area at base-station node place, between described sensor node and base-station node
Communication process carry out the most successively by round, process of setting up that described communication process is divided into bunch and stable operation stage,
The process of setting up of described bunch is divided into election of cluster head and determines sub-clustering table, according to energy expenditure taken turns each in described network area
Calculate optimal bunch of head number and optimal bunch of head be elected to probability, described election of cluster head determine each leader cluster node taken turns and bunch in
Other node, it is characterised in that: described leader cluster node with bunch in use between other node CRT-UI protocol sequence to control to communicate.
A kind of cluster routing method based on channel access heterogeneous wireless sensor network the most according to claim 1,
It is characterized in that: the calculating process of described optimal bunch of head number includes:
S11. calculated each interior joint of taking turns by bunch head number k and serve as leader cluster node or the energy expenditure of non-leader cluster node, by described
Energy expenditure is added and obtains each taking turns network energy wastage in bulk or weight；
S12. take turns network energy wastage in bulk or weight derivation to each, calculate optimal bunch of head number kopt。
A kind of cluster routing method based on channel access heterogeneous wireless sensor network the most according to claim 1,
It is characterized in that: in bunch, member needs to take turns transmission n secondary data each, and wherein n is a bunch interior nodes number.
A kind of cluster routing method based on channel access heterogeneous wireless sensor network the most according to claim 1,
It is characterized in that: described leader cluster node remains in a sequence period and intercepts.
A kind of cluster routing method based on channel access heterogeneous wireless sensor network the most according to claim 1,
It is characterized in that: described optimal bunch of head number koptIt is set in advance, keeps constant at algorithm run duration.
A kind of cluster routing method based on channel access heterogeneous wireless sensor network the most according to claim 1,
It is characterized in that: described bunch of interior nodes is successively read sequential value according to the protocol sequence of distribution, if this value is " 1 ", node is sent out
Send data, the most do not send data.
A kind of cluster routing method based on channel access heterogeneous wireless sensor network the most according to claim 1,
It is characterized in that: between described leader cluster node and base-station node, use FDMA or CDMA to carry out channel access.
A kind of cluster routing method based on channel access heterogeneous wireless sensor network the most according to claim 1, its
It is characterised by: the building method of described CRT-UI protocol sequence is as follows:
S21. supposeRepresentArriveOn mapping, wherein
F (a) :=(a mod r, a mod q), mod is modulo operator；
S22. i=2 is worked as ..., K, orderAs i=1, orderTo I'iInvert, can obtain the feature set of CRT-UI sequence:
Ii=f-1(I'i), i=1,2 ..., K.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610144386.2A CN105828404A (en) | 2016-03-14 | 2016-03-14 | Clustering routing method based on channel access heterogeneous wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610144386.2A CN105828404A (en) | 2016-03-14 | 2016-03-14 | Clustering routing method based on channel access heterogeneous wireless sensor network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105828404A true CN105828404A (en) | 2016-08-03 |
Family
ID=56987280
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610144386.2A Pending CN105828404A (en) | 2016-03-14 | 2016-03-14 | Clustering routing method based on channel access heterogeneous wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105828404A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106131970A (en) * | 2016-09-18 | 2016-11-16 | 南京理工大学 | A kind of protocol sequence channel access algorithm based on feedback |
| CN106604408A (en) * | 2016-11-25 | 2017-04-26 | 南京理工大学 | Method for determining delay performance of protocol sequence under multi-packet receiving mechanism |
| CN106658749A (en) * | 2016-11-25 | 2017-05-10 | 南京理工大学 | Protocol sequence channel access algorithm based on carrier interception |
| CN106792770A (en) * | 2016-12-05 | 2017-05-31 | 南京理工大学 | A kind of method of determination g UI protocol sequence delay performances |
| CN107148030A (en) * | 2016-09-14 | 2017-09-08 | 南京理工大学 | A kind of method for determining unsynchronized network protocol sequence delay performance |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20090073639A (en) * | 2007-12-31 | 2009-07-03 | 원광대학교산학협력단 | Mobility agent module in sensor network for various mobility application services |
| KR20130022793A (en) * | 2011-08-26 | 2013-03-07 | 목포대학교산학협력단 | A hierarchical routing method to support mobile sink-node in wireless sensor networks |
| CN103024849A (en) * | 2012-09-27 | 2013-04-03 | 西安电子科技大学 | LEACH (Low-energy Adaptive Clustering Hierarchy)-based wireless sensor network clustering method |
-
2016
- 2016-03-14 CN CN201610144386.2A patent/CN105828404A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20090073639A (en) * | 2007-12-31 | 2009-07-03 | 원광대학교산학협력단 | Mobility agent module in sensor network for various mobility application services |
| KR20130022793A (en) * | 2011-08-26 | 2013-03-07 | 목포대학교산학협력단 | A hierarchical routing method to support mobile sink-node in wireless sensor networks |
| CN103024849A (en) * | 2012-09-27 | 2013-04-03 | 西安电子科技大学 | LEACH (Low-energy Adaptive Clustering Hierarchy)-based wireless sensor network clustering method |
Non-Patent Citations (2)
| Title |
|---|
| 严乐: "基于分组检测的无线传感网信道接入技术研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 尹哲: "基于无线传感器网的能量均衡分簇算法的研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107148030A (en) * | 2016-09-14 | 2017-09-08 | 南京理工大学 | A kind of method for determining unsynchronized network protocol sequence delay performance |
| CN106131970A (en) * | 2016-09-18 | 2016-11-16 | 南京理工大学 | A kind of protocol sequence channel access algorithm based on feedback |
| CN106131970B (en) * | 2016-09-18 | 2020-05-22 | 南京理工大学 | Protocol sequence channel access algorithm based on feedback |
| CN106604408A (en) * | 2016-11-25 | 2017-04-26 | 南京理工大学 | Method for determining delay performance of protocol sequence under multi-packet receiving mechanism |
| CN106658749A (en) * | 2016-11-25 | 2017-05-10 | 南京理工大学 | Protocol sequence channel access algorithm based on carrier interception |
| CN106658749B (en) * | 2016-11-25 | 2020-05-22 | 南京理工大学 | Protocol sequence channel access algorithm based on carrier sensing |
| CN106792770A (en) * | 2016-12-05 | 2017-05-31 | 南京理工大学 | A kind of method of determination g UI protocol sequence delay performances |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ruiz et al. | Survey on broadcast algorithms for mobile ad hoc networks | |
| Imon et al. | Energy-efficient randomized switching for maximizing lifetime in tree-based wireless sensor networks | |
| US6829222B2 (en) | Clusterhead selection in wireless ad hoc networks | |
| CN102291448B (en) | Automatic IP (Internet protocol) address allocation method based on geographical position in mobile ad hoc network | |
| CN105828404A (en) | Clustering routing method based on channel access heterogeneous wireless sensor network | |
| Pavkovic et al. | Efficient topology construction for RPL over IEEE 802.15. 4 in wireless sensor networks | |
| JP6403411B2 (en) | Wireless communication method | |
| CN105263143B (en) | The slot allocation method of adaptive session dot density and load in self-organizing network | |
| Mishra et al. | Study of cluster based routing protocols in wireless sensor networks | |
| Bhatia et al. | RD-TDMA: A randomized distributed TDMA scheduling for correlated contention in WSNs | |
| Barceló et al. | Joint routing, channel allocation and power control for real‐life wireless sensor networks | |
| CN105050149A (en) | Routing method for overcoming congestion of tree type Zigbee network | |
| Mu et al. | Performance analysis of the ZigBee networks in 5G environment and the nearest access routing for improvement | |
| Alnawafa et al. | EDMHT-LEACH: Enhancing the performance of the DMHT-LEACH protocol for wireless sensor networks | |
| Chen et al. | Multicast capacity in mobile wireless ad hoc network with infrastructure support | |
| Liu et al. | Research on MAC Protocols in Cluster‐Based Ad Hoc Networks | |
| Bakhsh | Energy-efficient distributed relay selection in wireless sensor network for Internet of Things | |
| Hamzaoui et al. | Enhancing OLSR routing protocol using k-medoids clustering method in manets | |
| Pavkovic et al. | Cluster-directed acyclic graph formation for ieee 802.15. 4 in multihop topologies | |
| Hahm et al. | A case for time slotted channel hopping for ICN in the IoT | |
| Qin et al. | Mobility weakens the distinction between multicast and unicast | |
| Huang et al. | Load-balanced trees for data collection in wireless sensor networks | |
| Chen et al. | Degree of link dependence-based LTE-V2V clustering and alarm information forwarding | |
| Dharmawardena et al. | Cluster head selection based routing protocol for VANET using bully algorithm and Lamport timestamp | |
| Udaykumar et al. | Analysis of various clustering algorithms in wireless sensor 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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20160803 |