CN109361599B - Cluster-based cooperative packet transmission method - Google Patents

Cluster-based cooperative packet transmission method Download PDF

Info

Publication number
CN109361599B
CN109361599B CN201811313230.8A CN201811313230A CN109361599B CN 109361599 B CN109361599 B CN 109361599B CN 201811313230 A CN201811313230 A CN 201811313230A CN 109361599 B CN109361599 B CN 109361599B
Authority
CN
China
Prior art keywords
cluster
node
nodes
cluster head
data
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
Application number
CN201811313230.8A
Other languages
Chinese (zh)
Other versions
CN109361599A (en
Inventor
程建明
杨培
金立强
杨鸿文
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN201811313230.8A priority Critical patent/CN109361599B/en
Publication of CN109361599A publication Critical patent/CN109361599A/en
Application granted granted Critical
Publication of CN109361599B publication Critical patent/CN109361599B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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 invention relates to a cooperative transmission method for a wireless self-organizing multi-hop network, which comprises the following steps: establishing an initial route between a source node and a destination node based on a wireless self-organizing network topology; the data forwarding node recruits neighbor nodes of the data forwarding node to form a cluster by taking the data forwarding node as a cluster head; and the cluster head node organizes the nodes receiving the data packet in the cluster to cooperate to complete data forwarding. The method reduces the total energy consumption in the data transmission process by utilizing the cluster of the forwarding nodes and the cooperative transmission taking the cluster as a unit, and balances the energy consumption of the nodes in the network.

Description

Cluster-based cooperative packet transmission method
1. Field of application
The invention belongs to the technical field of communication networks, and relates to a data transmission method in a wireless Ad hoc network, which is used for reducing the total energy consumption of data transmission and improving the survival time of the network.
2. Background of the invention
2.1 Wireless Ad Hoc network
The wireless Ad hoc network refers to the self-organization of nodes in a wireless network into a communication network. In the network, nodes can communicate with each other, but because the energy and the transmission power of a single node are limited, two nodes with longer distances need to complete data multi-hop forwarding by virtue of other nodes, so that a wireless self-organizing multi-hop network without a center is formed. Each node in the wireless Ad Hoc network has two functions of a router and a host.
In a conventional wireless Ad hoc network, a routing path between a source node and a destination node is usually a point-to-point chain path, which concentrates energy consumed by data transmission on nodes in the path, resulting in uneven energy consumption in the network and premature exhaustion of energy of some nodes.
2.2 multicast route discovery and unicast route reply
Conventional routing methods such as AODV, DSR, etc. typically establish routes in the form of multicast route discovery and unicast route reply. Fig. 2-1 shows a route establishment procedure.
Under the condition of determining a source node and a destination node, the source node firstly broadcasts a Route Request (RREQ) message to a neighbor node, and the RREQ message usually comprises the information that the neighbor node continues to broadcast the RREQ message after receiving the message until the destination node receives the RREQ message. The destination node selects a neighbor node with the optimal channel condition to send a Route Reply (RREP) message according to the received RREQ message, and similarly, the node receiving the RREP message continuously selects the neighbor node with the optimal channel to send the RREP message until the source node receives the RREP message, and the route between the source and the destination node is established.
3. Summary and features of the invention
From the above perspective, the present invention provides a cluster-based data transmission method to reduce energy consumption of data transmission and balance energy consumption of nodes in a network. Fig. 3-1 shows a specific flow of the proposed transmission method, which is as follows:
(1) establishing an initial route between a source node and a destination node according to multicast route discovery and unicast route reply, and assuming that data sent by the source node is transmitted to the destination node through K hops, and the node in the initial route is Pini＝{VS,V2,...,VK,VD}；
(2) From node V according to the initial pathKTo V2The directions are clustered one by one, and fig. 3-2 shows the cluster formation process, which comprises the following specific steps:
(2-1) with node VkK is e {2, …, K } as an example, VkTaking the self as a cluster head, broadcasting a clustering notification to the neighbor nodes, wherein the notification message comprises all member information of a next hop cluster and previous hop cluster head information Vk-1And the basic parameter requirements for adding clusters;
(2-2) the nodes receiving the notification calculate respective parameters according to the requirements, the nodes meeting the parameter requirements send a joining request to the cluster head, and attach the parameters and the node ID of the nodes;
(2-3) Cluster head VkAnd selecting the nodes as cluster members according to the received neighbor node IDs and parameters and by combining the cluster scale limiting parameters. Broadcasting the cluster member list to the neighbor nodes. The nodes which become cluster members prepare to receive and send data;
(2-4) Next, node Vk-1Starting to cluster by using the self as a cluster head, and iterating the steps (2-1) to (2-4) until V is used2And finishing the clustering process for the cluster establishment of the cluster head. Note that: at node VKIn the broadcasted cluster notification, the next hop cluster CK+1Only VDA node; at V2In the broadcast clustering notification, the cluster head of the last hop is VS。
(3) Source node VSTo direction V2Cluster C being a cluster head2Sending data packet X along initial path PiniThe established cluster and the data packet are sequentially forwarded and finally reach a destination node VD. The communication mechanism between clusters is cooperative transmission based on cluster heads, that is, cluster members receiving a data packet X by a cluster head organization cooperatively send the data packet X to a next cluster-jumping node, and fig. 3-3 shows a cluster-to-cluster cooperative data transmission process, which specifically includes the following steps:
(3-1) with a cluster head VkFor example, the cluster head organizes the cluster members receiving packet X into a set
Figure GDA0002748561110000021
Figure GDA0002748561110000022
Node in to Ck+1Cooperatively sending a data packet X, designing a cooperative Beamforming vector to align to a cluster head node Vk+1The channel coefficient vector of (2);
(3-2) with Vk+1Cluster C being a cluster headk+1After each node in the group receives the data packet X, each node broadcasts respective ACK information. If the transmitting end does not receive the information from V after the transmission is finishedk+1ACK information of (1), then cluster head VkA retransmission of the data packet X will be initiated according to step (3-1); otherwise, cluster head Vk+1Cluster member of data packet X received by organization to Ck+2Cooperatively forwarding the data packet X.
(3-3) repeating the steps (3-1) to (3-2) until the destination node VDA data packet X is received.
Compared with the traditional route point-to-point transmission technology, the invention has the following advantages:
1) in the transmission process, all data receiving and transmitting are carried out by taking a cluster as a unit, the residual energy of the nodes and the channel conditions of the nodes are considered in the clustering process, and some nodes with good energy and channel conditions are participated in data transmission to create conditions for cooperatively receiving and transmitting data packets;
2) in the transmission process of the cooperative packet taking the cluster as a unit, the cluster head organizes the nodes receiving the data packet to cooperate to complete data transmission, and the transmitted Beamforming vector always aims at the next hop of cluster head nodes, so that the diversity gain brought by the cooperation of the transmitting end can effectively improve the successful transmission probability of the packet;
3) the energy consumed by each packet transmission can not be concentrated on the nodes in the initial route, and through the cooperation of the nodes in the sending end cluster, the energy of the sending end can be jointly borne by a plurality of nodes, so that the energy consumption of the network is more balanced, and the survival time of the network is favorably prolonged.
4. Examples of specific embodiments
To further illustrate the method of practicing the present invention, an exemplary embodiment is given below. This example is merely representative of the principles of the present invention and does not represent any limitation of the present invention.
Based on the above implementation flows, the requirements of the node joining the cluster and the requirement of the cluster head selecting the data packet sending node, which are respectively included in the step (2) and the step (3), may be specifically designed according to the position, the remaining energy, and the like of the node, and a design method is provided below.
(1) Designing requirements for adding clusters:
joining a cluster C with a node ikFor example, node i needs to satisfy the following condition:
node i and cluster head ViIs less than VkCluster formation range of
Figure GDA0002748561110000031
Figure GDA0002748561110000032
And
Figure GDA0002748561110000033
respectively represent Vk-1And Vk、VkAnd Vk+1The distance between them;
node i has enough energy to complete the packet transmission, i.e.:
Figure GDA0002748561110000041
Eirepresenting the remaining energy of node i，ErAnd EtIt represents the energy consumed by a single reception and transmission respectively,
Figure GDA0002748561110000042
and
Figure GDA0002748561110000043
respectively representing slave cluster head nodes Vk-1To node i and from node i to cluster Ck+1The expected number of transmissions of packet X that successfully transmitted.
Figure GDA0002748561110000044
Figure GDA0002748561110000045
For the slave cluster head node Vk-1The packet loss rate of data transmission to the node i;
Figure GDA0002748561110000046
Figure GDA0002748561110000047
from node i to cluster Ck+1The packet loss rate of data transmission is from node i to cluster Ck+1The product of the packet loss rates of each node in the set.
The node i satisfying the above two conditions will calculate the cost index τiAnd upload it to cluster head Vk(ii) a Cluster head VkSorting the received tau, and according to the preset cluster size, selecting the node with smaller tau to be added into Ck。
Figure GDA0002748561110000048
Wherein, let nk+1Is represented by Ck+1The number of nodes in the node(s),
Figure GDA0002748561110000049
(2) designing a cluster cooperation transmission method:
in the inter-cluster cooperative transmission process, a cluster head node VkCluster C of tissueskThe nodes which receive the data packet are set
Figure GDA00027485611100000410
Figure GDA00027485611100000411
Order to
Figure GDA00027485611100000412
And node i ∈ Ck+1The channel coefficient vector in between is
Figure GDA00027485611100000413
Assuming that the total data transmission power of the transmitting end is fixed as PtThen, the Beamforming vector w at the transmitting end is designed as:
Figure GDA00027485611100000414
wherein the content of the first and second substances,
Figure GDA00027485611100000415
representing a complex conjugate transpose operation. If Vk+1Receiving the data packet, then CkNo more data is sent; otherwise, CkRetransmissions will continue. Therefore, the cooperative method of the sending cluster emphasizes that the cluster head at the receiving end is required to successfully receive the data packet, which can be regarded as the enhancement of data transmission on the initial path. Meanwhile, the Beamformming design of the transmitting end enables the energy consumption of the transmitting end to be dispersed on nodes in a cluster instead of being concentrated on a cluster head of the transmitting end, and the difference of node energy in a network can be effectively reduced; on the other hand, the gain brought by the transmission diversity can obviously improve the successful receiving probability of the cluster head at the receiving end.
5. Description of the drawings
(1) Fig. 2-1 is a schematic diagram of a route establishment process in an Ad hoc network.
(2) FIG. 3-1 is a schematic diagram of a basic design flow of a cluster-based collaboration package.
(3) Fig. 3-2 is a schematic view of a cluster formation process.
(4) Fig. 3-3 is a schematic diagram of a cluster-to-cluster cooperative data packet transmission flow.

Claims (6)

1. A cluster-based data transmission method is applied to a wireless multi-hop network, and comprises the following steps:
establishing a slave source node V in a wireless multi-hop networkSTo destination node VDThe multi-hop initial path of (1), wherein the routing method is established by adopting a classical routing method such as multicast routing discovery and unicast routing reply;
assume that the node in the initial path is Pini＝{VS,V2,...,VK,VDV, according to the initial path from node VKTo V2Clustering the directions one by one; by node VkK is e {2, …, K } as an example, VkTaking the self as a cluster head, broadcasting a clustering notification to a neighbor node, wherein the notification information comprises all member information of a next-hop cluster and cluster head information V of a previous-hop clusterk-1And the basic parameter requirement and the calculation method for any neighbor node to join the cluster; the nodes receiving the notification calculate respective parameters according to the requirements and send the parameters to Vk；VkSelecting a certain number of nodes from the neighbor nodes as cluster members according to the received parameters, and broadcasting a cluster member list to the neighbor nodes; the nodes which become cluster members prepare to receive and send data;
source node VSAlong the initial path at V2Cluster C being a cluster head2Transmitting data packets, cluster C2In cluster head V of cluster member nodes successfully receiving data packet2The tissue jumps down to its next cluster C3Forwarding the data packet along the initial path PiniIn the established cluster, the data packet is forwarded hop by hop and is finally successfully received by the destination node; the forwarding mechanism of the data packet is cooperative transmission based on a cluster head, namely, cluster members receiving the data packet by a cluster head organization cooperatively send the data packet to a next hop of cluster nodes;
by establishing the initial route, each node in the initial route sequentially clusters by taking the node as a cluster head, the cluster head organizes the three processes of completing the transmission of the cooperative packet by members in the cluster, the source node transmits the data packet to the destination node, the space resources near the initial route are fully utilized, and the purpose of reducing and balancing the energy consumption of the nodes in the data packet transmitting process is achieved.
2. The method of claim 1, wherein:
the clustering process is the initial path Pini＝{VS,V2,...,VK,VDSequentially clustering the nodes from back to front, wherein the clustering is initiated by the node on the initial path by taking the node as a cluster head, and the source node and the destination node do not need to be clustered; thus, once the initial route setup is complete, node VkK e {2, …, K } is then determined to be a cluster head and clustered sequentially along the initial path;
cluster head node VkK is equal to {2, …, K } and broadcasts a clustering notice to the neighbor nodes to initiate a clustering process, and the notice information contains a next hop cluster Ck+1All member information of (2), last hop cluster head information Vk-1And the basic parameter requirement and the calculation method for any neighbor node to join the cluster; the nodes receiving the notification calculate respective parameters according to the requirements and send the parameters to the cluster head node Vk(ii) a Then VkSelecting a certain number of nodes from the neighbor nodes as cluster members according to the received parameters, and broadcasting a cluster member list to the neighbor nodes; the nodes that become members of the cluster are ready to transmit and receive data.
3. The method of claim 2, wherein: the basic parameter requirements and the calculation method included in the cluster head broadcast notification message determine the basic standard of the cluster head node on the initial path to recruit the cluster in the range of the neighbor node, and the design needs to be performed by considering the residual energy of the neighbor node and the relative position of the cluster head node.
4. The method of claim 1, wherein: the cluster head organizes members in the cluster to complete the transmission of the cooperation packet, which means that the cluster head organizes a plurality of nodes to cooperate each time, the data packet transmission is completed through a cooperation method of beam forming, and all nodes in a next hop cluster participate in data reception; the inter-cluster cooperative transmission method which is specifically relied on is characterized in that:
the sender cooperative node is a node which sends all successfully received data in the cluster, and the receiving nodes are all nodes in the receiving cluster; in clusters CkTo cluster Ck+1For example, in the last-hop data transmission, CkAs a receiving cluster, the nodes in the cluster which successfully receive the data packet are a set
Figure FDA0003015239030000021
In the next cooperative transmission, the cluster head VkWill organize
Figure FDA0003015239030000022
All nodes in the cluster C in the form of beam formingk+1Cooperative transmission of data packets, Ck+1All member nodes in (2) will attempt to receive data;
order to
Figure FDA0003015239030000023
And node i ∈ Ck+1The channel coefficient vector in between is
Figure FDA0003015239030000024
Assuming that the total data transmission power of the transmitting end is fixed as PtThen, the transmit-end beamforming design is:
Figure FDA0003015239030000025
wherein the content of the first and second substances,
Figure FDA0003015239030000026
represents a complex conjugate transpose operation; if cluster head Vk+1Failure to successfully receive the packet, CkWill continue to retransmit; otherwise, CkNo more data is sent.
5. The method of claim 1, wherein: the three processes refer to initial route establishment and cluster head organization node cooperative packet transmission.
6. The method of claim 1, wherein: the node energy consumption in the data packet sending process mainly comprises energy consumed by the node for sending the data packet, energy consumed by the node for receiving the data packet, and energy consumed in the medium interception and control information interaction process.
CN201811313230.8A 2018-11-06 2018-11-06 Cluster-based cooperative packet transmission method Active CN109361599B (en)

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 CN109361599A (en) 2019-02-19
CN109361599B true 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)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110856231B (en) * 2019-11-20 2021-11-09 北京邮电大学 Multi-data stream transmission method based on multi-hop network

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106712824A (en) * 2016-12-29 2017-05-24 陕西尚品信息科技有限公司 Interference processing method based on MIMO self-organizing network

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9312929B2 (en) * 2004-04-02 2016-04-12 Rearden, Llc System and methods to compensate for Doppler effects in multi-user (MU) multiple antenna systems (MAS)
CN101286934B (en) * 2008-03-05 2010-12-29 中国科学院嘉兴无线传感网工程中心 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
CN102149160B (en) * 2011-04-20 2013-10-30 宁波职业技术学院 Energy perception routing algorithm used for wireless sensing network
CN102802230A (en) * 2012-07-05 2012-11-28 江南大学 Energy-efficient wireless sensor network routing algorithm
CN103354654B (en) * 2013-07-24 2016-09-28 桂林电子科技大学 High energy efficiency wireless sensor network routing method based on ant group algorithm

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106712824A (en) * 2016-12-29 2017-05-24 陕西尚品信息科技有限公司 Interference processing method based on MIMO self-organizing network

Also Published As

Publication number Publication date
CN109361599A (en) 2019-02-19

Similar Documents

Publication Publication Date Title
US10892979B2 (en) Routing multiple data streams simultaneously in wireless networks
KR101214532B1 (en) Multi-casting data transmitting system and method using situation information in wireless ad-hoc network
WO2015078068A1 (en) Relay-based in-cluster d2d multicast method
CN109361599B (en) Cluster-based cooperative packet transmission method
CN109982403B (en) Multi-node cooperative packet transmission method based on multi-hop network
EP3566496B1 (en) Routes discovery in wireless networks with directional transmissions
Tan et al. Queue management for network coding in ad hoc networks
Guan et al. CSR: Cooperative source routing using virtual MISO in wireless ad hoc networks
CN110856231B (en) Multi-data stream transmission method based on multi-hop network
Vijayalakshmi et al. Quality of Service Optimization of Multicast Routing Protocols in Mobile Ad-Hoc Networks: AM Route, PUMA and ODMRP
US11646962B1 (en) Zero overhead efficient flooding (ZOEF) oriented hybrid any-cast routing for mobile ad hoc networks (MANET)
Xu et al. An opportunistic routing with improved node forwarding mechanism
Tope et al. Routing performance of cooperative diversity in ad-hoc networks
Aithal et al. A survey on various multicast routing protocols with and without cross layer techniques in MANET
Cheng et al. A novel energy-efficient packet transmission protocol for cluster-based cooperative network
Sharmila Multicast Routing in Mobile Adhoc Network-An Overview
Krishna et al. Mesh based and Hybrid Multicast routing protocols for MANETs: Current State of the art
Ruban Chakravarthy Adaptive Link Aware on-demand Multicast Routing Scheme in MANET
Nguyen et al. CDMR: Cooperative diversity-based multi-copy relaying in mesh networks
Vijayakumar et al. Cooperative Packet Deliveryusing Enhanced Cooperative Opportunistic Routing Scheme (Ecors) In MANET
Sankareswary et al. Impact of selfish nodes in multicast Ad hoc on demand Distance Vector Protocol
Nagaratna et al. Node Disjoint Split Multipath Multicast Ad-hoc On-demand Distance Vector Routing Protocol (NDSM-MAODV)
Reddy et al. Effective Video Broadcasting using Wireless Network through EOLSR
Sheu et al. Energy Conservation for Broadcast and Multicast Routings in Wireless Ad Hoc Networks.
Sreedhar et al. Mesh based and Hybrid Multicast Routing Protocols for Mobile Ad hoc Networks: Current state of the art.

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