Cooperative relay assignment for static energy-constrained networks Online publication date: Wed, 04-Apr-2012
by Hongli Xu; Liusheng Huang; Zhiji Zhang; Gang Liu; Yindong Zhang
International Journal of Sensor Networks (IJSNET), Vol. 11, No. 3, 2012
Abstract: Cooperative communication has become an efficient technology to improve the spatial diversity. Among this, relay assignment significantly affects power consumption of the entire network. This paper first analyses the relationship between power consumption and the number of relay nodes. Then, we define the relay assignment k-RA problem where k is the maximum number of relay nodes participating into each cooperative transmission pair, and k = 1 or 2. We design an optimal algorithm ESRA to solve the 1-RA problem. The proposed algorithm transforms this problem into bipartite matching, and assigns relay nodes to transmission pairs based on the matching result. Next, a heuristic algorithm ETRA is presented for the 2-RA problem. The theoretical analyses show that ETRA can provide a good approximation of the optimal one. The simulation results show that ESRA and ETRA will decrease the power consumptions about 45.8% and 51.7% compared with direct transmission scheme under many situations.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook