Cooperative routing is one of the most widely used technologies for improving the energy efficiency and energy balance of wireless multi-hop networks. However, the end-to-end energy cost and network lifetime are greatly restricted if the cooperative transmission model is not designed properly. The main aim of this paper is to explore a two-stage cooperative routing scheme to further improve the energy efficiency and prolong the network lifetime. A two-stage cooperative (TSC) transmission model is firstly designed in which the core helper is introduced to determine the helper set for cooperation. Then, the two-stage link cost is formulated where x, the weight of residual energy, is introduced to be adjusted for different design goals. By selecting the optimal helper set, the two-stage link cost of each link can be optimized. Finally, based on the designed TSC transmission model and the optimized two-stage link cost, a distributed two-stage cooperative routing (TSCR) scheme is further proposed to minimize the end-to-end cooperative routing cost. Simulation results evaluate the effect of x on the different performance metrics. When x equals 0, TSCR can achieve the shortest end-to-end transmission delay and highest energy efficiency, while a larger x can achieve a longer network lifetime. Furthermore, simulation results also show that the proposed TSCR scheme can effectively improve both the energy efficiency and network lifetime compared with the existing schemes.
Cooperative routing, combining cooperative communication in the physical layer and routing technology in the network layer, is one of the most widely used technologies for improving end-to-end transmission reliability and delay in the wireless multi-hop networks. However, the existing cooperative routing schemes are designed based on an optimal fixed-path routing so that the end-to-end performance is greatly restricted by the low spatial efficiency. To address this problem, in this paper an opportunistic cooperative packet transmission (OCPT) scheme is explored by combining cooperative communication and opportunistic routing. The proposed scheme divides the multi-hop route into multiple virtual multiple-input-multiple-output (MIMO) transmissions. Before each transmission, based on the idea of opportunistic routing, a cluster head (CH) is introduced to determine the multiple transmitters and multiple receivers to form a cluster. Then, the single-hop transmission distance is defined as the metric of forward progress to the destination. Each intra-cluster cooperative packet transmission is formulated as a transmit beamforming optimization problem, and an iterative optimal beamforming policy is proposed to solve the problem and maximize the single-hop transmission distance. CH organizes multiple transmitters to cooperatively transmit packets to multiple receivers with the optimized transmit beamforming vector. Finally, according to the transmission results, the cluster is updated and the new cooperative transmission is started. Iteratively, the transmission lasts until the destination has successfully received the packet. We comprehensively evaluate the OCPT scheme by comparing it with conventional routing schemes. The simulation results demonstrate that the proposed OCPT scheme is effective on shortening the end-to-end transmission delay, increasing the number of successful packet transmissions and improving the packet arrival ratio and transmission efficiency.
Cooperative routing, combining cooperative communication in the physical layer and routing technology in the network layer, is one of the most widely used technologies for improving end-to-end transmission reliability and delay in the wireless multi-hop networks. However, the existing cooperative routing schemes are designed based on an optimal fixed-path routing so that the end-to-end performance is greatly restricted by the low spatial efficiency. To address this problem, in this paper an opportunistic cooperative packet transmission (OCPT) scheme is explored by combining cooperative communication and opportunistic routing. The proposed scheme divides the multi-hop route into multiple virtual multiple-input-multiple-output (MIMO) transmissions. Before each transmission, based on the idea of opportunistic routing, a cluster head (CH) is introduced to determine the multiple transmitters and multiple receivers to form a cluster. Then, the single-hop transmission distance is defined as the metric of forward progress to the destination. Each intra-cluster cooperative packet transmission is formulated as a transmit beamforming optimization problem, and an iterative optimal beamforming policy is proposed to solve the problem and maximize the single-hop transmission distance. CH organizes multiple transmitters to cooperatively transmit packets to multiple receivers with the optimized transmit beamforming vector. Finally, according to the transmission results, the cluster is updated and the new cooperative transmission is started. Iteratively, the transmission lasts until the destination has successfully received the packet. We comprehensively evaluate the OCPT scheme by comparing it with conventional routing schemes. The simulation results demonstrate that the proposed OCPT scheme is effective on shortening the end-to-end transmission delay, increasing the number of successful packet transmissions and improving the packet arrival ratio and transmission efficiency.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.