CN109361599A - A kind of cooperation packet transmission plan based on cluster - Google Patents
A kind of cooperation packet transmission plan based on cluster Download PDFInfo
- Publication number
- CN109361599A CN109361599A CN201811313230.8A CN201811313230A CN109361599A CN 109361599 A CN109361599 A CN 109361599A CN 201811313230 A CN201811313230 A CN 201811313230A CN 109361599 A CN109361599 A CN 109361599A
- Authority
- CN
- China
- Prior art keywords
- cluster
- node
- data packet
- cooperation
- transmission
- 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
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/46—Cluster building
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/04—TPC
- H04W52/30—TPC using constraints in the total amount of available transmission power
- H04W52/34—TPC management, i.e. sharing limited amount of power among users or channels or data types, e.g. cell loading
- H04W52/346—TPC management, i.e. sharing limited amount of power among users or channels or data types, e.g. cell loading distributing total power among users or channels
-
- 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
Abstract
The present invention relates to a kind of cooperation transmission scheme for wireless Ad Hoc multihop network, the program is the following steps are included: establish the initial routing between source node and destination node based on wireless self-organized network topology；Head-end site recruits its neighbor node cluster using itself as cluster head；Data forwarding is completed in the node cooperation that data packet is received in leader cluster node tissue cluster.This programme balances the energy consumption of nodes by reducing the total energy consumption in data transmission procedure with the cooperation transmission as unit of cluster using forward node sub-clustering.
Description
1. application field
The invention belongs to technical field of communication network, the data transmission schemes being related in Wireless Ad hoc network, for subtracting
Minority improves the life span of network according to the total energy consumption of transmission.
2. background technique
2.1 Wireless Ad Hoc networks
So-called Wireless Ad hoc network just refers to that the Nodes Self-organized in wireless network becomes a communication network.?
In the network, node can be in communication with each other, but due to the energy of individual node and send power limited, be saved apart from farther away two
Point needs to complete data multi-hop transmission by other nodes, to constitute a kind of acentric wireless Ad Hoc multihop network.Nothing
Each node in line Ad Hoc network has both router and two kinds of functions of host.
In traditional Wireless Ad hoc network, the routed path between source node and destination node is usually point-to-point
Chain type path, the energy for making data transmission consumption is concentrated node in the paths, causes energy consumption in network uneven by this, and one
The energy pre-mature exhaustion of a little nodes.
The discovery of 2.2 QoS routings is replied with singlecast router
Traditional routing plan such as AODV, DSR etc. generally use the form that QoS routing discovery is replied with singlecast router and build
Erect routing.Fig. 2-1 shows route establishment process.
In the case where determining source node and destination node, source node is first to its neighbor node broadcast route request
(RREQ) message generally comprises neighbor node in RREQ message and continues to broadcast RREQ message after receiving that message until purpose section
Point receives RREQ message.Destination node sends road according to the neighbor node that the RREQ message received selects a channel condition optimal
By replying (RREP) message, equally, the node for receiving RREP message continues the neighbor node for selecting channel optimal transmission RREP and disappears
Breath, until source node receives RREP message, the Route establishment between source to destination node.3. summary of the invention and feature
From above-mentioned visual angle, the invention proposes a kind of data transmission schemes based on cluster, to subtract small data transmission
Energy consumption, and balance the energy consumption of nodes.Fig. 3-1 shows the detailed process of proposed transmission plan, specific to flow
Journey is as follows:
(1) it is replied according to QoS routing discovery with singlecast router and establishes initial routing between a source node and a destination node,
Assuming that the data that source point issues arrive destination node by K jump set, the node in initial path is Pini={ VS,V2,...,VK,
VD}；
(2) according to initial path from node VKTo V2Cluster, Fig. 3-2 show the forming process of cluster one by one in direction, specific to flow
Journey is as follows:
(2-1) is with node Vk, for k ∈ { 2 ..., K }, VkUsing itself as cluster head, notified to neighbor node broadcast cluster,
It include all information about firms of next-hop cluster, upper hop cluster head information V in notification messagek-1And the basic parameter requirement of cluster is added；
(2-2) notified node according to requiring to calculate respective parameter, send out to cluster head by the node for meeting parameter request
It send addition to request, and encloses itself parameter and node ID；
(2-3) cluster head VkAccording to the neighbor node ID and parameter received, and haptophoric size limit parameter, select node
As cluster member.Cluster member list is broadcast to neighbor node.Node as cluster member prepares sending and receiving data；
(2-4) then, node Vk-1Start using itself as cluster head cluster, iterative step (2-1)~(2-4), until with V2
It is established for the cluster of cluster head, cluster process terminates.Note: in node VKIn the cluster notice of broadcast, next-hop cluster CK+1Only VDOne
A node；In V2In the cluster notice of broadcast, upper hop cluster head is VS。
(3) source node VSTo with V2For the cluster C of cluster head2Data packet X is sent, along based on initial path PiniThe cluster of foundation,
Data packet is successively forwarded and eventually arrives at destination node VD.Communication mechanism between cluster and cluster is the biography that cooperates based on cluster head
Defeated, i.e., cluster member's down hop cluster node cooperation that cluster head tissue receives data packet X sends data packet X, and Fig. 3-3 shows that cluster arrives
Cluster collaboration data transmission flow, detailed process are as follows:
(3-1) is with cluster head VkFor, the cluster member organization for receiving data packet X is set by cluster headIn
Node is to Ck+1Cooperation sends data packet X, and design cooperation Beamforming vector is directed at leader cluster node Vk+1Channel coefficients to
Amount；
(3-2) is with Vk+1For the cluster C of cluster headk+1In each node immediately will broadcast respective ACK after receiving data packet X
Information.If transmitting terminal does not receive after transmission from Vk+1ACK information, then cluster head VkIt will be sent out according to step (3-1)
Play the re-transmission of data packet X；Otherwise, cluster head Vk+1Tissue is received into the cluster member of data packet X to Ck+2Cooperation forwarding data packet X.
(3-3) repeats step (3-1)~(3-2) until destination node VDReceive data packet X.
The present invention is compared with traditional routing point-to-point transmission technology, there is following advantage:
1) since during transmission, all data transmit-receives consider node all as unit of cluster during cluster
Dump energy and locating channel condition, allow some energy and all good node of channel condition participate in data transmission in
Come, creates conditions for cooperation sending and receiving data packet；
2) in the cooperation packet transmission process as unit of cluster, cluster head can organize the node cooperation for receiving data packet to complete data
It sends, next-hop cluster head node can be directed at always by sending Beamforming vector, in this way, transmitting terminal cooperation bring diversity increases
Benefit, which can effectively improve, is bundled into function transmission probability；
3) packet transmits on the node that consumed energy is not concentrated in initial route every time, passes through transmitting terminal cluster internal segment
The cooperation of point, transmitting terminal energy can be such that network energy consumption more balances, be helped to improve network by multiple node shareds
Life span.
4. specific implementation method is illustrated
An implementation example is given below in implementation method in order to further illustrate the present invention.This example is only indicated to this
The schematic illustration of invention does not represent any restrictions of the invention.
Based on above-mentioned implementing procedure, the requirement of cluster is added in the node separately included in step (2) and step (3) and cluster head is selected
The requirement for selecting data packet sending node can specifically be designed according to position, the dump energy etc. of node, and one kind is provided below
Design scheme.
(1) the requirement design of cluster is added:
Cluster C is added with node ikFor, it is necessary to meet following condition for node i:
Node i and cluster head ViThe distance between be less than VkCluster range Rk,
WithRespectively indicate Vk-1With Vk、VkWith Vk+1The distance between；
Node i has enough energy to complete packet transmission, it may be assumed thatEiIndicate section
The dump energy of point i, ErWith EtThe energy that single receives with sends consumption is then respectively indicated,WithTable respectively
Show from leader cluster node Vk-1To node i and from node i to cluster Ck+1It is successfully transmitted the expectation transmission times of data packet X.For from leader cluster node Vk-1Data to node i transmit packet loss；For from node i to cluster Ck+1Data transmit packet loss, as from node i to cluster Ck+1In it is every
The packet loss product of a node.
The node i for meeting above-mentioned two condition will calculate cost index τi, and upload it to cluster head Vk；Cluster head VkIt will receive
The τ sequence arrived selects the node with smaller τ that C is added according to presetting cluster sizek。
Wherein, n is enabledk+1Indicate Ck+1In number of nodes,
(2) cooperation transmission conceptual design between cluster:
Between cluster during cooperation transmission, leader cluster node VkBy tissue cluster CkReceive the node of data packet inside as set It enablesWith node i ∈ Ck+1Between channel coefficient vector beIt is fixed assuming that sending end data and sending general power
For Pt, then transmitting terminal Beamforming vector w is designed are as follows:
Wherein,Indicate the operation of complex conjugate transposition.If Vk+1Data packet is received, then CkDo not retransmit data；Otherwise, CkIt will
Constant retransmission.As it can be seen that the cooperation scheme for sending cluster emphatically wants that receiving end cluster head is allowed to have successfully received data packet, can be regarded as pair
The reinforcement that data are transmitted on initial path.Meanwhile transmitting terminal Beamforming design makes the energy consumption of transmitting terminal be dispersed in cluster
In interior nodes rather than transmitting terminal cluster head is concentrated on, the otherness of nodes energy can be effectively reduced；On the other hand, it sends
The gain of diversity bring can significantly improve the successful reception probability of receiving end cluster head.
5. Detailed description of the invention
(1) Fig. 2-1 is route establishment process schematic diagram in Ad hoc network.
(2) Fig. 3-1 is the cooperation packet Basic Design flow diagram based on cluster.
(3) Fig. 3-2 is the forming process schematic diagram of cluster.
(4) Fig. 3-3 is cluster to cluster collaboration data packet transmission flow schematic diagram.
Claims (6)
1. a kind of data transmission scheme based on cluster, it is by establishing initial routing, and each node is using itself as cluster in initial routing
Head successively cluster, member completes three processes of cooperation packet transmission in cluster head tissue cluster, and data packet is transferred to destination node, is reached
To the purpose for reducing simultaneously equilibrium data packet transmission process interior joint energy consumption.
2. foundation described in claim 1 initially routes, refer to establishing an initial path from source node to destination node,
As for according to routing plan, the present invention do not do special limitation.
3. cluster process described in claim 1, the finger of specific implementation, cluster head selection neighbor node dependence that cluster is established
Calculation method is marked, the present invention does not do special limitation.
4. member completes cooperation packet and sends in cluster head tissue cluster described in claim 1, refer to organizing every time multiple nodes into
Row cooperation is completed data packet by the cooperation scheme such as beam forming and is sent, the cooperation scheme specifically relied on, the communication process present invention
Special limitation is not done.
5. three processes described in claim 1 refer to that initial route setup, cluster carry out the packet that cooperates with cluster head organization node
Transmission.Cluster can occur among initial route setup, and i.e. data packet can also occur after data packet initial route setup
In transmission process, specific order does not do special limitation in the present invention.
6. the node energy consumption in data packet transmission process described in claim 1 mainly includes the energy that node sends data packet consumption
The energy of the processes such as information exchange consumption, this hair are listened to as medium and controlled to the energy that amount is sent with node received data packet
Special limitation is not done in bright.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811313230.8A CN109361599B (en) | 2018-11-06 | 2018-11-06 | Cluster-based cooperative packet transmission method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811313230.8A CN109361599B (en) | 2018-11-06 | 2018-11-06 | Cluster-based cooperative packet transmission method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109361599A true CN109361599A (en) | 2019-02-19 |
| CN109361599B CN109361599B (en) | 2021-05-18 |
Family
ID=65344175
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811313230.8A Active CN109361599B (en) | 2018-11-06 | 2018-11-06 | Cluster-based cooperative packet transmission method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109361599B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110856231A (en) * | 2019-11-20 | 2020-02-28 | 北京邮电大学 | Multi-data stream transmission method based on multi-hop network |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101286934A (en) * | 2008-03-05 | 2008-10-15 | 中科院嘉兴中心微系统所分中心 | Cross-layer routing method based on multi-node collaborative beam forming in wireless sensor network |
| CN101355496A (en) * | 2008-08-12 | 2009-01-28 | 武汉大学 | Multi-hop clustering route protocol initiated by base station |
| CN102149160A (en) * | 2011-04-20 | 2011-08-10 | 宁波职业技术学院 | Energy perception routing algorithm used for wireless sensing network |
| EP2477343A1 (en) * | 2011-01-13 | 2012-07-18 | Alcatel Lucent | Cooperating cluster for wireless transmissions |
| CN102802230A (en) * | 2012-07-05 | 2012-11-28 | 江南大学 | Energy-efficient wireless sensor network routing algorithm |
| CN103354654A (en) * | 2013-07-24 | 2013-10-16 | 桂林电子科技大学 | Ant colony algorithm-based high-energy efficiency wireless sensor network routing method |
| US20160255618A1 (en) * | 2004-04-02 | 2016-09-01 | Rearden, Llc | System and methods to compensate for doppler effects in multi-user (mu) multiple antenna systems (mas) |
| CN106712824A (en) * | 2016-12-29 | 2017-05-24 | 陕西尚品信息科技有限公司 | Interference processing method based on MIMO self-organizing network |
-
2018
- 2018-11-06 CN CN201811313230.8A patent/CN109361599B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160255618A1 (en) * | 2004-04-02 | 2016-09-01 | Rearden, Llc | System and methods to compensate for doppler effects in multi-user (mu) multiple antenna systems (mas) |
| CN101286934A (en) * | 2008-03-05 | 2008-10-15 | 中科院嘉兴中心微系统所分中心 | Cross-layer routing method based on multi-node collaborative beam forming in wireless sensor network |
| CN101355496A (en) * | 2008-08-12 | 2009-01-28 | 武汉大学 | Multi-hop clustering route protocol initiated by base station |
| EP2477343A1 (en) * | 2011-01-13 | 2012-07-18 | Alcatel Lucent | Cooperating cluster for wireless transmissions |
| CN102149160A (en) * | 2011-04-20 | 2011-08-10 | 宁波职业技术学院 | Energy perception routing algorithm used for wireless sensing network |
| CN102802230A (en) * | 2012-07-05 | 2012-11-28 | 江南大学 | Energy-efficient wireless sensor network routing algorithm |
| CN103354654A (en) * | 2013-07-24 | 2013-10-16 | 桂林电子科技大学 | Ant colony algorithm-based high-energy efficiency wireless sensor network routing method |
| CN106712824A (en) * | 2016-12-29 | 2017-05-24 | 陕西尚品信息科技有限公司 | Interference processing method based on MIMO self-organizing network |
Non-Patent Citations (2)
| Title |
|---|
| GENG SUN，等: ""Node selection optimization for collaborative beamforming in wireless sensor networks"", 《AD HOC NETWORKS VOLUME 37, PART 2》 * |
| 赵方圆: ""无线网络中协作路由的研究"", 《中国优秀硕士学位论文全文数据库 信息科技辑 2014年第07期》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110856231A (en) * | 2019-11-20 | 2020-02-28 | 北京邮电大学 | Multi-data stream transmission method based on multi-hop network |
| CN110856231B (en) * | 2019-11-20 | 2021-11-09 | 北京邮电大学 | Multi-data stream transmission method based on multi-hop network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109361599B (en) | 2021-05-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Niu et al. | R3E: Reliable reactive routing enhancement for wireless sensor networks | |
| Guo et al. | Analysis of general network coding conditions and design of a free-ride-oriented routing metric | |
| US7561024B2 (en) | Ad-hoc network routing protocol including the use of forward and reverse multi-point relay (MPR) spanning tree routes | |
| Yadav et al. | Performance comparison and analysis of table-driven and on-demand routing protocols for mobile ad-hoc networks | |
| US8213352B2 (en) | Wireless communication system, wireless communication device, wireless communication method, and program | |
| EP2106073B1 (en) | Method and apparatus for increasing throughput in a communication network | |
| WO2019169874A1 (en) | Wireless mesh network opportunistic routing algorithm based on quality of service assurance | |
| JPWO2003061220A1 (en) | Routing method in mobile ad hoc network | |
| US8462806B2 (en) | Path selection procedure in mesh network and format of path request frame therefor | |
| CN108449271A (en) | A kind of method for routing of monitoring path node energy and queue length | |
| CN106850436A (en) | Mine hybrid wireless mesh network routing protocols based on virtual potential energy field | |
| JP4993185B2 (en) | Wireless communication system | |
| KR102212291B1 (en) | Route discovery in wireless networks with directional transmissions | |
| CN109361599A (en) | A kind of cooperation packet transmission plan based on cluster | |
| CN109982403B (en) | Multi-node cooperative packet transmission method based on multi-hop network | |
| KR101452613B1 (en) | P2P routing method in mobile Ad-hoc network | |
| JP2007243328A (en) | Relay wireless station selection method for transmission origin wireless station in adhoc network, wireless station, and program | |
| CN104320825A (en) | Ad hoc network route selection method based on repeated game | |
| Cordero et al. | Enabling multihop communication in spontaneous wireless networks | |
| Abolhasan et al. | LPAR: an adaptive routing strategy for MANETs | |
| Sharma et al. | Study of Routing Protocols in MANET-A Review | |
| JP4033301B2 (en) | Multihop wireless network routing method and wireless terminal | |
| CN113660710A (en) | Routing method of mobile ad hoc network based on reinforcement learning | |
| JP2005252856A (en) | Path establishing method for multi-hop wireless network and wireless terminal | |
| Guan et al. | CSR: Cooperative source routing using virtual MISO in wireless ad hoc networks |
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 |