Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

On the Throughput Capacity of Cooperative Multi-hop Wireless Ad hoc Networks with Multi-flow

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Cooperative relaying techniques are known to provide spatial diversity for wireless fading channels. In contrast to non-cooperative transmission (direct transmission), they increase link reliability, provide higher capacity, reduce transmit power, and extend transmission range. Mostly the gains of cooperative relaying are shown for single flow scenarios in the absence of inter-flow interference. In this paper we study the effect of inter-flow interference on the capacity of cooperative networks in multi-hop multi-flow settings. We used the conflict graph to model the interference and find the additional constraints introduced due to cooperative transmission by using the concept of cliques on the conflict graph, which can be used to capture the interference relation among links. We formulated the multi-commodity flow problem for network capacity using linear programming, and employed a clique based analysis of the conflict graph to compute interference constraints. It is observed that the throughput drops significantly when cooperative transmissions are used in the network. We also found that the hop counts increase when cooperative links are used that is due to avoiding interfering links, which results in losing the benefits of shortest-path routing.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

Notes

  1. In this work we are interested on the total capacity, considering the fairness issue presented in some literature that seeks to maximize the total throughput of the network and at least some amount of throughput can be ensured for each commodity.

  2. We mean by cooperative zone here is a group of three nodes such that creating a cooperative link between any pair by using the third node as a relay.

References

  1. Jain, K., Padhye, J., Padmanabhan, V., & Qiu, L. (2003). Impact of interference on multi-hop wireless network performance. Proceedings of ACM Mobile Computing and Networking.

  2. Zhu, Y., & Zheng, H. (2008). Understanding the impact of interference on collaborative relays. IEEE Transactions on Mobile Computing., 7, 724–736.

    Article  Google Scholar 

  3. Sepko, B.J., & Lee, W. (2008). A study on effect of interference in cooperative communication. In Proceedings of IEEE Symposium on Radio and Wireless (pp. 651–654).

  4. Zanella, A., & Masini, B. M. (2011). The impact of relay selection strategies on the amount of interference in ad hoc wireless networks. In IEEE 73rd Vehicular Technology Conference (VTC Spring)(pp. 1–6).

  5. Shila, D. M., Cheng, Y., & Anjali, T. (2010). Capacity of cooperative wireless networks using multiple channels. IEEE International Conference on Communications (ICC) (pp. 1–5).

  6. Zhou, Y., & Zhuang, W. (2013). Beneficial cooperation radio in multi-hop wireless ad hoc networks. In Proceedings on IEEE International Conference on computer Communications.

  7. Laneman, J., Wornell, G., & Tse, D. (2004). Cooperative diversity in wireless networks: Efficient protocols and outage behavior. IEEE Transactions on Information Theory, 50, 3062–3080.

    Article  MathSciNet  Google Scholar 

  8. IMB. Ilog cplex. http://www.ilog.com/products/cplex/.

  9. Skiena, S. S. (1997). Agorithm design manual. Berlin: Springer.

    Google Scholar 

  10. Coen, B., & Joep, K. (1973). Finding all cliques of an undirected graph. Communications of the ACM, 16, 575–577.

    Article  MATH  Google Scholar 

  11. Cazals, F., & Karande, C. (2008). A note on the problem of reporting maximal cliques. Theoretical Computer Science (Elsevier), 407, 564–568.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Engineering Academy, Tajura, Libya

    Salah Abdulhadi

  2. Department of Electrical and Computer Engineering, Ryerson University, Toronto, Canada

    Muhammad Jaseemuddin & Alagan Anpalagan

Authors
  1. Salah Abdulhadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Muhammad Jaseemuddin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alagan Anpalagan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alagan Anpalagan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Abdulhadi, S., Jaseemuddin, M. & Anpalagan, A. On the Throughput Capacity of Cooperative Multi-hop Wireless Ad hoc Networks with Multi-flow. Wireless Pers Commun 79, 629–646 (2014). https://doi.org/10.1007/s11277-014-1877-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-014-1877-x

Keywords

Search

Navigation