Patents by Inventor Anwar Saif

Anwar Saif has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 9503221
    Abstract: The present invention relates to a method for adjusting aggregation size based on Acknowledgement (ACK) bitmap, characterized by the steps of: receiving kth Compressed Block Acknowledgement (CBA); calculating granularity factor (g) by applying Equation (1); determining bit error density (BEDk) for kth CBA by applying Equation (2); receiving (k+1)th CBA; determining bit error density (BED(k+1)) for (k+1)th CBA by applying Equation (2); adjusting the aggregation size based on the value of granularity factor (g), kth bit error density BEDk+1 values and (k+1)th bit error density BEDk+1; wherein if the kth bit error density BEDk is greater than the (k+1)th bit error density BEDk+1, then increasing the aggregation size based on the value of granularity factor (g); wherein if the kth bit error density BEOk is lower than the (k+1)th bit error density BEDk+1 then decreasing the aggregation size based on the value of granularity factor (g); wherein if the kth bit error density BEDk is equal to the (k+1)th bit error den
    Type: Grant
    Filed: September 23, 2013
    Date of Patent: November 22, 2016
    Assignee: Universiti Putra Malaysia
    Inventors: Mohamed Othman, Anwar Saif
  • Publication number: 20150295680
    Abstract: The present invention relates to a method for adjusting aggregation size based on Acknowledgement (ACK) bitmap, characterized by the steps of: receiving kth Compressed Block Acknowledgement (CBA); calculating granularity factor (g) by applying Equation (1); determining bit error density (BEDk) for kth CBA by applying Equation (2); receiving (k+1)th CBA; determining bit error density (BED(k+1)) for (k+1)th CBA by applying Equation (2); adjusting the aggregation size based on the value of granularity factor (g), kth bit error density BEDk+1 values and (k+1)th bit error density BEDk+1; wherein if the kth bit error density BEDk is greater than the (k+1)th bit error density BEDk+1, then increasing the aggregation size based on the value of granularity factor (g); wherein if the kth bit error density BEOk is lower than the (k+1)th bit error density BEDk+1 then decreasing the aggregation size based on the value of granularity factor (g); wherein if the kth bit error density BEDk is equal to the (k+1)th bit error den
    Type: Application
    Filed: September 23, 2013
    Publication date: October 15, 2015
    Inventors: Mohamed Othman, Anwar Saif